LLVMFuzzerTestOneInput: 24| 10.1k|{ 25| 10.1k| constexpr auto var_count = 8; 26| 10.1k| constexpr auto bits = 3; 27| | 28| 10.1k| using vector_t = immer::flex_vector; 29| 10.1k| using size_t = std::uint8_t; 30| | 31| 10.1k| auto vars = std::array{}; 32| | 33| 10.1k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 34| 10.1k| auto is_valid_var_neq = [](auto other) { 35| 10.1k| return [=](auto idx) { 36| 10.1k| return idx >= 0 && idx < var_count && idx != other; 37| 10.1k| }; 38| 10.1k| }; 39| 10.1k| auto is_valid_index = [](auto& v) { 40| 10.1k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 10.1k| }; 42| 10.1k| auto is_valid_size = [](auto& v) { 43| 10.1k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 10.1k| }; 45| 10.1k| auto can_concat = [](const auto& v1, const auto& v2) { 46| | // First, check max_size 47| 10.1k| if (v1.size() + v2.size() > vector_t::max_size()) { 48| 10.1k| return false; 49| 10.1k| } 50| | 51| | // But just checking max_size is not sufficient, because there are other 52| | // conditions for the validity of the tree, like shift constraints, for 53| | // example. 54| 10.1k| try { 55| | // Try to concat and catch an exception if it fails 56| 10.1k| const auto v3 = v1 + v2; 57| 10.1k| if (v3.size()) { 58| 10.1k| return true; 59| 10.1k| } 60| 10.1k| } catch (const immer::detail::rbts::invalid_tree&) { 61| 10.1k| return false; 62| 10.1k| } 63| 10.1k| return true; 64| 10.1k| }; 65| 10.1k| auto can_compare = [](auto&& v) { 66| | // avoid comparing vectors that are too big, and hence, slow to compare 67| 10.1k| return v.size() < (1 << 15); 68| 10.1k| }; 69| 10.1k| return fuzzer_input{data, size}.run([&](auto& in) { 70| 10.1k| enum ops 71| 10.1k| { 72| 10.1k| op_push_back, 73| 10.1k| op_update, 74| 10.1k| op_take, 75| 10.1k| op_drop, 76| 10.1k| op_concat, 77| 10.1k| op_push_back_move, 78| 10.1k| op_update_move, 79| 10.1k| op_take_move, 80| 10.1k| op_drop_move, 81| 10.1k| op_concat_move_l, 82| 10.1k| op_concat_move_r, 83| 10.1k| op_concat_move_lr, 84| 10.1k| op_insert, 85| 10.1k| op_erase, 86| 10.1k| op_compare, 87| 10.1k| }; 88| 10.1k| auto src = read(in, is_valid_var); 89| 10.1k| auto dst = read(in, is_valid_var); 90| 10.1k| switch (read(in)) { 91| 10.1k| case op_push_back: { 92| 10.1k| vars[dst] = vars[src].push_back(42); 93| 10.1k| break; 94| 10.1k| } 95| 10.1k| case op_update: { 96| 10.1k| auto idx = read(in, is_valid_index(vars[src])); 97| 10.1k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 98| 10.1k| break; 99| 10.1k| } 100| 10.1k| case op_take: { 101| 10.1k| auto idx = read(in, is_valid_size(vars[src])); 102| 10.1k| vars[dst] = vars[src].take(idx); 103| 10.1k| break; 104| 10.1k| } 105| 10.1k| case op_drop: { 106| 10.1k| auto idx = read(in, is_valid_size(vars[src])); 107| 10.1k| vars[dst] = vars[src].drop(idx); 108| 10.1k| break; 109| 10.1k| } 110| 10.1k| case op_concat: { 111| 10.1k| auto src2 = read(in, is_valid_var); 112| 10.1k| if (can_concat(vars[src], vars[src2])) 113| 10.1k| vars[dst] = vars[src] + vars[src2]; 114| 10.1k| break; 115| 10.1k| } 116| 10.1k| case op_push_back_move: { 117| 10.1k| vars[dst] = std::move(vars[src]).push_back(21); 118| 10.1k| break; 119| 10.1k| } 120| 10.1k| case op_update_move: { 121| 10.1k| auto idx = read(in, is_valid_index(vars[src])); 122| 10.1k| vars[dst] = 123| 10.1k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 124| 10.1k| break; 125| 10.1k| } 126| 10.1k| case op_take_move: { 127| 10.1k| auto idx = read(in, is_valid_size(vars[src])); 128| 10.1k| vars[dst] = std::move(vars[src]).take(idx); 129| 10.1k| break; 130| 10.1k| } 131| 10.1k| case op_drop_move: { 132| 10.1k| auto idx = read(in, is_valid_size(vars[src])); 133| 10.1k| vars[dst] = std::move(vars[src]).drop(idx); 134| 10.1k| break; 135| 10.1k| } 136| 10.1k| case op_concat_move_l: { 137| 10.1k| auto src2 = read(in, is_valid_var_neq(src)); 138| 10.1k| if (can_concat(vars[src], vars[src2])) 139| 10.1k| vars[dst] = std::move(vars[src]) + vars[src2]; 140| 10.1k| break; 141| 10.1k| } 142| 10.1k| case op_concat_move_r: { 143| 10.1k| auto src2 = read(in, is_valid_var_neq(src)); 144| 10.1k| if (can_concat(vars[src], vars[src2])) 145| 10.1k| vars[dst] = vars[src] + std::move(vars[src2]); 146| 10.1k| break; 147| 10.1k| } 148| 10.1k| case op_concat_move_lr: { 149| 10.1k| auto src2 = read(in, is_valid_var_neq(src)); 150| 10.1k| if (can_concat(vars[src], vars[src2])) 151| 10.1k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 152| 10.1k| break; 153| 10.1k| } 154| 10.1k| case op_compare: { 155| 10.1k| using std::swap; 156| 10.1k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 157| 10.1k| swap(vars[src], vars[dst]); 158| 10.1k| break; 159| 10.1k| } 160| 10.1k| case op_erase: { 161| 10.1k| auto idx = read(in, is_valid_index(vars[src])); 162| 10.1k| vars[dst] = vars[src].erase(idx); 163| 10.1k| break; 164| 10.1k| } 165| 10.1k| case op_insert: { 166| 10.1k| auto idx = read(in, is_valid_size(vars[src])); 167| 10.1k| vars[dst] = vars[src].insert(idx, immer::box{42}); 168| 10.1k| break; 169| 10.1k| } 170| 10.1k| default: 171| 10.1k| break; 172| 10.1k| }; 173| 10.1k| return true; 174| 10.1k| }); 175| 10.1k|} flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 69| 2.20M| return fuzzer_input{data, size}.run([&](auto& in) { 70| 2.20M| enum ops 71| 2.20M| { 72| 2.20M| op_push_back, 73| 2.20M| op_update, 74| 2.20M| op_take, 75| 2.20M| op_drop, 76| 2.20M| op_concat, 77| 2.20M| op_push_back_move, 78| 2.20M| op_update_move, 79| 2.20M| op_take_move, 80| 2.20M| op_drop_move, 81| 2.20M| op_concat_move_l, 82| 2.20M| op_concat_move_r, 83| 2.20M| op_concat_move_lr, 84| 2.20M| op_insert, 85| 2.20M| op_erase, 86| 2.20M| op_compare, 87| 2.20M| }; 88| 2.20M| auto src = read(in, is_valid_var); 89| 2.20M| auto dst = read(in, is_valid_var); 90| 2.20M| switch (read(in)) { 91| 279k| case op_push_back: { ------------------ | Branch (91:9): [True: 279k, False: 1.92M] ------------------ 92| 279k| vars[dst] = vars[src].push_back(42); 93| 279k| break; 94| 0| } 95| 204k| case op_update: { ------------------ | Branch (95:9): [True: 204k, False: 1.99M] ------------------ 96| 204k| auto idx = read(in, is_valid_index(vars[src])); 97| 204k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 98| 204k| break; 99| 0| } 100| 1.82k| case op_take: { ------------------ | Branch (100:9): [True: 1.82k, False: 2.19M] ------------------ 101| 1.82k| auto idx = read(in, is_valid_size(vars[src])); 102| 1.82k| vars[dst] = vars[src].take(idx); 103| 1.82k| break; 104| 0| } 105| 9.10k| case op_drop: { ------------------ | Branch (105:9): [True: 9.10k, False: 2.19M] ------------------ 106| 9.10k| auto idx = read(in, is_valid_size(vars[src])); 107| 9.10k| vars[dst] = vars[src].drop(idx); 108| 9.10k| break; 109| 0| } 110| 782k| case op_concat: { ------------------ | Branch (110:9): [True: 782k, False: 1.41M] ------------------ 111| 782k| auto src2 = read(in, is_valid_var); 112| 782k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (112:17): [True: 742k, False: 40.1k] ------------------ 113| 742k| vars[dst] = vars[src] + vars[src2]; 114| 782k| break; 115| 0| } 116| 10.3k| case op_push_back_move: { ------------------ | Branch (116:9): [True: 10.3k, False: 2.19M] ------------------ 117| 10.3k| vars[dst] = std::move(vars[src]).push_back(21); 118| 10.3k| break; 119| 0| } 120| 16.4k| case op_update_move: { ------------------ | Branch (120:9): [True: 16.4k, False: 2.18M] ------------------ 121| 16.4k| auto idx = read(in, is_valid_index(vars[src])); 122| 16.4k| vars[dst] = 123| 16.4k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 124| 16.4k| break; 125| 0| } 126| 33.9k| case op_take_move: { ------------------ | Branch (126:9): [True: 33.9k, False: 2.16M] ------------------ 127| 33.9k| auto idx = read(in, is_valid_size(vars[src])); 128| 33.9k| vars[dst] = std::move(vars[src]).take(idx); 129| 33.9k| break; 130| 0| } 131| 75.4k| case op_drop_move: { ------------------ | Branch (131:9): [True: 75.4k, False: 2.12M] ------------------ 132| 75.4k| auto idx = read(in, is_valid_size(vars[src])); 133| 75.4k| vars[dst] = std::move(vars[src]).drop(idx); 134| 75.4k| break; 135| 0| } 136| 330k| case op_concat_move_l: { ------------------ | Branch (136:9): [True: 330k, False: 1.87M] ------------------ 137| 330k| auto src2 = read(in, is_valid_var_neq(src)); 138| 330k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (138:17): [True: 327k, False: 2.54k] ------------------ 139| 327k| vars[dst] = std::move(vars[src]) + vars[src2]; 140| 330k| break; 141| 0| } 142| 3.56k| case op_concat_move_r: { ------------------ | Branch (142:9): [True: 3.56k, False: 2.19M] ------------------ 143| 3.56k| auto src2 = read(in, is_valid_var_neq(src)); 144| 3.56k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (144:17): [True: 3.28k, False: 284] ------------------ 145| 3.28k| vars[dst] = vars[src] + std::move(vars[src2]); 146| 3.56k| break; 147| 0| } 148| 353k| case op_concat_move_lr: { ------------------ | Branch (148:9): [True: 353k, False: 1.84M] ------------------ 149| 353k| auto src2 = read(in, is_valid_var_neq(src)); 150| 353k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (150:17): [True: 345k, False: 7.74k] ------------------ 151| 345k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 152| 353k| break; 153| 0| } 154| 35.9k| case op_compare: { ------------------ | Branch (154:9): [True: 35.9k, False: 2.16M] ------------------ 155| 35.9k| using std::swap; 156| 35.9k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (156:17): [True: 28.7k, False: 7.14k] | Branch (156:43): [True: 6.24k, False: 22.5k] ------------------ 157| 6.24k| swap(vars[src], vars[dst]); 158| 35.9k| break; 159| 0| } 160| 3.55k| case op_erase: { ------------------ | Branch (160:9): [True: 3.55k, False: 2.19M] ------------------ 161| 3.55k| auto idx = read(in, is_valid_index(vars[src])); 162| 3.55k| vars[dst] = vars[src].erase(idx); 163| 3.55k| break; 164| 0| } 165| 16.6k| case op_insert: { ------------------ | Branch (165:9): [True: 16.6k, False: 2.18M] ------------------ 166| 16.6k| auto idx = read(in, is_valid_size(vars[src])); 167| 16.6k| vars[dst] = vars[src].insert(idx, immer::box{42}); 168| 16.6k| break; 169| 0| } 170| 34.9k| default: ------------------ | Branch (170:9): [True: 34.9k, False: 2.16M] ------------------ 171| 34.9k| break; 172| 2.20M| }; 173| 2.19M| return true; 174| 2.20M| }); flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 33| 5.79M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (33:48): [True: 5.50M, False: 286k] | Branch (33:60): [True: 5.16M, False: 340k] ------------------ flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaRT_ENKUlSC_E_clIhEEDaSC_: 40| 291k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (40:39): [True: 291k, False: 0] | Branch (40:51): [True: 224k, False: 67.8k] ------------------ flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaRT_: 39| 224k| auto is_valid_index = [](auto& v) { 40| 224k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 224k| }; flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 97| 204k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaRT_ENKUlSC_E_clIhEEDaSC_: 43| 148k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (43:39): [True: 148k, False: 0] | Branch (43:51): [True: 136k, False: 11.3k] ------------------ flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaRT_: 42| 136k| auto is_valid_size = [](auto& v) { 43| 136k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 136k| }; flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_4clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEESB_EEDaRKT_RKT0_: 45| 1.46M| auto can_concat = [](const auto& v1, const auto& v2) { 46| | // First, check max_size 47| 1.46M| if (v1.size() + v2.size() > vector_t::max_size()) { ------------------ | Branch (47:13): [True: 48.9k, False: 1.42M] ------------------ 48| 48.9k| return false; 49| 48.9k| } 50| | 51| | // But just checking max_size is not sufficient, because there are other 52| | // conditions for the validity of the tree, like shift constraints, for 53| | // example. 54| 1.42M| try { 55| | // Try to concat and catch an exception if it fails 56| 1.42M| const auto v3 = v1 + v2; 57| 1.42M| if (v3.size()) { ------------------ | Branch (57:17): [True: 1.41M, False: 2.86k] ------------------ 58| 1.41M| return true; 59| 1.41M| } 60| 1.42M| } catch (const immer::detail::rbts::invalid_tree&) { 61| 1.56k| return false; 62| 1.56k| } 63| 1.29k| return true; 64| 1.42M| }; flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 123| 16.4k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 35| 765k| return [=](auto idx) { 36| 765k| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (36:20): [True: 745k, False: 19.4k] | Branch (36:32): [True: 715k, False: 30.1k] | Branch (36:51): [True: 686k, False: 28.8k] ------------------ 37| 765k| }; flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 34| 686k| auto is_valid_var_neq = [](auto other) { 35| 686k| return [=](auto idx) { 36| 686k| return idx >= 0 && idx < var_count && idx != other; 37| 686k| }; 38| 686k| }; flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaOT_: 65| 35.9k| auto can_compare = [](auto&& v) { 66| | // avoid comparing vectors that are too big, and hence, slow to compare 67| 35.9k| return v.size() < (1 << 15); 68| 35.9k| }; flex-vector-st.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 10.1k| { 51| 10.1k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 3, False: 10.1k] ------------------ 52| 3| return 0; 53| 10.1k| try { 54| 2.20M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.19M, False: 10.1k] ------------------ 55| 2.19M| continue; 56| 10.1k| } catch (const no_more_input&) { 57| 10.1k| }; 58| 10.1k| return 0; 59| 10.1k| } flex-vector-st.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 5.17M|{ 71| 5.17M| auto x = read(fz); 72| 5.80M| while (!cond(x)) ------------------ | Branch (72:12): [True: 626k, False: 5.17M] ------------------ 73| 626k| x = read(fz); 74| 5.17M| return x; 75| 5.17M|} _Z4readIcERKT_R12fuzzer_input: 64| 8.76M|{ 65| 8.76M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 8.76M|} _ZN12fuzzer_input4nextEmm: 40| 9.20M| { 41| 9.20M| auto& p = const_cast(reinterpret_cast(data_)); 42| 9.20M| auto r = std::align(align, size, p, size_); 43| 9.20M| if (r == nullptr) ------------------ | Branch (43:13): [True: 10.1k, False: 9.19M] ------------------ 44| 10.1k| throw no_more_input{}; 45| 9.19M| return next(size); 46| 9.20M| } _ZN12fuzzer_input4nextEm: 30| 9.19M| { 31| 9.19M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 9.19M] ------------------ 32| 0| throw no_more_input{}; 33| 9.19M| auto r = data_; 34| 9.19M| data_ += size; 35| 9.19M| size_ -= size; 36| 9.19M| return r; 37| 9.19M| } flex-vector-st.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS2_13memory_policyINS2_11heap_policyINS2_8cpp_heapEEENS2_22unsafe_refcount_policyENS2_14no_lock_policyENS2_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_: 70| 224k|{ 71| 224k| auto x = read(fz); 72| 292k| while (!cond(x)) ------------------ | Branch (72:12): [True: 67.8k, False: 224k] ------------------ 73| 67.8k| x = read(fz); 74| 224k| return x; 75| 224k|} _Z4readIhERKT_R12fuzzer_input: 64| 440k|{ 65| 440k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 440k|} flex-vector-st.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS2_13memory_policyINS2_11heap_policyINS2_8cpp_heapEEENS2_22unsafe_refcount_policyENS2_14no_lock_policyENS2_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_: 70| 136k|{ 71| 136k| auto x = read(fz); 72| 148k| while (!cond(x)) ------------------ | Branch (72:12): [True: 11.3k, False: 136k] ------------------ 73| 11.3k| x = read(fz); 74| 136k| return x; 75| 136k|} flex-vector-st.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 686k|{ 71| 686k| auto x = read(fz); 72| 765k| while (!cond(x)) ------------------ | Branch (72:12): [True: 78.3k, False: 686k] ------------------ 73| 78.3k| x = read(fz); 74| 686k| return x; 75| 686k|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 16.6k| : impl_{detail::make(std::forward(arg))} 86| 16.6k| { 87| 16.6k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 16.6k| : value(std::forward(args)...) 48| 16.6k| { 49| 16.6k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 16.6k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 16.6k| IMMER_NODISCARD const T& get() const { return impl_->value; } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEED2Ev: 131| 16.6k| { 132| 16.6k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 16.6k, False: 0] | Branch (132:22): [True: 16.6k, False: 0] ------------------ 133| 16.6k| impl_->~holder(); 134| 16.6k| heap::deallocate(sizeof(holder), impl_); 135| 16.6k| } 136| 16.6k| } _ZN5immer6detail3csl3getINS_22unsafe_refcount_policyEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEES3_NS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11impl_data_tENS1_6memberIS3_NS1_7inheritINSC_5applyISA_E4type5owneeEvE4typeEE4typeEE4typeE: 170| 672M| { 171| 672M| return x.get_(type_t{}); 172| 672M| } _ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11impl_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_IS9_EEDcNS1_6type_tIT_EE: 184| 672M| { 185| 672M| return n.get_(t); 186| 672M| } _ZNK5immer6detail3csl6memberINS_22unsafe_refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 719M| const T& get_(type_t) const { return d; } _ZN5immer6detail3csl3getINS_22unsafe_refcount_policyEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEES3_NS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14relaxed_data_tENS1_6memberIS3_NS1_7inheritINSC_5applyISA_E4type5owneeEvE4typeEE4typeEE4typeE: 170| 47.4M| { 171| 47.4M| return x.get_(type_t{}); 172| 47.4M| } _ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14relaxed_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_IS9_EEDcNS1_6type_tIT_EE: 184| 47.4M| { 185| 47.4M| return n.get_(t); 186| 47.4M| } _ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEEEDcRNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_22unsafe_refcount_policyENS_14no_lock_policyES3_Lb0ELb1EEELj3ELj3EE14relaxed_data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE: 165| 46.4M| { 166| 46.4M| return x.get_(type_t{}); 167| 46.4M| } _ZN5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14relaxed_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE: 179| 46.4M| { 180| 46.4M| return n.get_(t); 181| 46.4M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 102M| T& get_(type_t) { return *this; } _ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEEEDcRNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_22unsafe_refcount_policyENS_14no_lock_policyES3_Lb0ELb1EEELj3ELj3EE11impl_data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE: 165| 55.6M| { 166| 55.6M| return x.get_(type_t{}); 167| 55.6M| } _ZN5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11impl_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE: 179| 55.6M| { 180| 55.6M| return n.get_(t); 181| 55.6M| } _ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_22unsafe_refcount_policyENS_14no_lock_policyES3_Lb0ELb1EEELj3ELj3EE11impl_data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE: 170| 177k| { 171| 177k| return x.get_(type_t{}); 172| 177k| } _ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11impl_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE: 184| 177k| { 185| 177k| return n.get_(t); 186| 177k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 177k| const T& get_(type_t) const { return *this; } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EdeEv: 99| 8.15M| ReferenceT operator*() const { return access_t::dereference(derived()); } _ZN5immer6detail20iterator_core_access11dereferenceIRKNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDcOT_: 22| 8.15M| { 23| 8.15M| return x.dereference(); 24| 8.15M| } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_E7derivedEv: 86| 8.21M| { 87| 8.21M| static_assert(std::is_base_of::value, 88| 8.21M| "must pass a derived thing"); 89| 8.21M| return *static_cast(this); 90| 8.21M| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EpLEl: 151| 137k| { 152| 137k| access_t::advance(derived(), n); 153| 137k| return derived(); 154| 137k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEElEEDcOT_T0_: 46| 137k| { 47| 137k| return x.advance(d); 48| 137k| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_E7derivedEv: 92| 14.5M| { 93| 14.5M| static_assert(std::is_base_of::value, 94| 14.5M| "must pass a derived thing"); 95| 14.5M| return *static_cast(this); 96| 14.5M| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EppEv: 119| 7.13M| { 120| 7.13M| access_t::increment(derived()); 121| 7.13M| return derived(); 122| 7.13M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDcOT_: 28| 7.13M| { 29| 7.13M| return x.increment(); 30| 7.13M| } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EplISI_TnNSD_9enable_ifIXsrT_16is_random_accessEbE4typeELb1EEESC_l: 164| 63.3k| { 165| 63.3k| auto tmp = derived(); 166| 63.3k| return tmp += n; 167| 63.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE17make_inner_n_intoEPvmj: 213| 5.31M| { 214| 5.31M| assert(n <= branches); ------------------ | Branch (214:9): [True: 5.31M, False: 0] ------------------ 215| 5.31M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 5.31M, False: 0] ------------------ 216| 5.31M| auto p = new (buffer) node_t; 217| 5.31M| p->impl.d.data.inner.relaxed = nullptr; 218| 5.31M|#if IMMER_TAGGED_NODE 219| 5.31M| p->impl.d.kind = node_t::kind_t::inner; 220| 5.31M|#endif 221| 5.31M| return p; 222| 5.31M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14sizeof_inner_nEj: 145| 21.3M| { 146| 21.3M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 21.3M, Folded] ------------------ 147| 21.3M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE3incEv: 956| 169M| { 957| 169M| refs(this).inc(); 958| 169M| return this; 959| 169M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4refsEPKSB_: 203| 672M| { 204| 672M| return auto_const_cast(get(x->impl)); 205| 672M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE16make_leaf_n_intoEPvmj: 330| 2.59M| { 331| 2.59M| assert(n <= branches); ------------------ | Branch (331:9): [True: 2.59M, False: 0] ------------------ 332| 2.59M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 2.59M, False: 0] ------------------ 333| 2.59M| auto p = new (buffer) node_t; 334| 2.59M|#if IMMER_TAGGED_NODE 335| 2.59M| p->impl.d.kind = node_t::kind_t::leaf; 336| 2.59M|#endif 337| 2.59M| return p; 338| 2.59M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13sizeof_leaf_nEj: 160| 10.7M| { 161| 10.7M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 10.7M, Folded] ------------------ 162| 10.7M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7relaxedEv: 172| 931M| { 173| 931M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 931M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 931M, False: 0] ------------------ 174| 931M| return impl.d.data.inner.relaxed; 175| 931M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4kindEv: 168| 1.45G| kind_t kind() const { return impl.d.kind; } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE3decEv: 967| 362M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5innerEv: 184| 420M| { 185| 420M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 420M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 420M, False: 0] ------------------ 186| 420M| return impl.d.data.inner.get_storage_ptr(); 187| 420M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14delete_inner_rEPSB_j: 832| 46.6M| { 833| 46.6M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 46.6M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 46.6M, False: 0] ------------------ 834| 46.6M| auto r = p->relaxed(); 835| 46.6M| assert(r); ------------------ | Branch (835:9): [True: 46.6M, False: 0] ------------------ 836| 46.6M| static_if([&](auto) { 837| 46.6M| if (node_t::refs(r).dec()) 838| 46.6M| heap::deallocate(node_t::ownee(r).owned() 839| 46.6M| ? node_t::max_sizeof_relaxed 840| 46.6M| : node_t::sizeof_relaxed_n(n), 841| 46.6M| r); 842| 46.6M| }); 843| 46.6M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 46.6M] ------------------ 844| 46.6M| : node_t::sizeof_inner_r_n(n), 845| 46.6M| p); 846| 46.6M| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14delete_inner_rEPSB_jENKUlT_E_clINS0_7empty_tEEEDaSD_: 836| 46.6M| static_if([&](auto) { 837| 46.6M| if (node_t::refs(r).dec()) ------------------ | Branch (837:17): [True: 46.2M, False: 359k] ------------------ 838| 46.2M| heap::deallocate(node_t::ownee(r).owned() ------------------ | Branch (838:34): [True: 0, False: 46.2M] ------------------ 839| 46.2M| ? node_t::max_sizeof_relaxed 840| 46.2M| : node_t::sizeof_relaxed_n(n), 841| 46.2M| r); 842| 46.6M| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4refsEPKNS0_3csl10member_twoINSB_14relaxed_data_tENSC_6memberIS7_NSC_7inheritINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeE: 196| 47.4M| { 197| 47.4M| return auto_const_cast(get(*x)); 198| 47.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5owneeEPNS0_3csl10member_twoINSB_14relaxed_data_tENSC_6memberIS7_NSC_7inheritINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeE: 200| 46.4M| static ownee_t& ownee(relaxed_t* x) { return get(*x); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE16sizeof_relaxed_nEj: 155| 92.3M| { 156| 92.3M| return keep_headroom ? max_sizeof_relaxed : sizeof_packed_relaxed_n(n); ------------------ | Branch (156:16): [True: 92.3M, Folded] ------------------ 157| 92.3M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5owneeEPSB_: 210| 55.6M| static ownee_t& ownee(node_t* x) { return get(x->impl); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE16sizeof_inner_r_nEj: 150| 93.0M| { 151| 93.0M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 93.0M, Folded] ------------------ 152| 93.0M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11delete_leafEPSB_j: 861| 2.99M| { 862| 2.99M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 68| 2.99M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (862:9): [True: 2.99M, False: 0] ------------------ 863| 2.99M| detail::destroy_n(p->leaf(), n); 864| 2.99M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (864:26): [True: 0, False: 2.99M] ------------------ 865| 2.99M| : node_t::sizeof_leaf_n(n), 866| 2.99M| p); 867| 2.99M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4leafEv: 190| 18.6M| { 191| 18.6M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 18.6M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 18.6M, False: 0] ------------------ 192| 18.6M| return impl.d.data.leaf.get_storage_ptr(); 193| 18.6M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12delete_innerEPSB_j: 808| 5.39M| { 809| 5.39M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 5.39M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 5.39M, False: 0] ------------------ 810| 5.39M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 5.39M, False: 0] ------------------ 811| 5.39M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 5.39M] ------------------ 812| 5.39M| : node_t::sizeof_inner_n(n), 813| 5.39M| p); 814| 5.39M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 236k| { 795| 236k| auto dst = copy_leaf_n(n + 1, src, n); 796| 236k| IMMER_TRY { ------------------ | | 49| 236k|#define IMMER_TRY try ------------------ 797| 236k| new (dst->leaf() + n) T(std::forward(x)); 798| 236k| } 799| 236k| IMMER_CATCH (...) { 800| 0| detail::destroy_n(dst->leaf(), n); 801| 0| heap::deallocate(node_t::sizeof_leaf_n(n + 1), dst); 802| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 803| 0| } 804| 236k| return dst; 805| 236k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_nEjPSB_j: 696| 236k| { 697| 236k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 236k, False: 0] ------------------ 698| 236k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 236k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 236k, False: 0] ------------------ 699| 236k| auto dst = make_leaf_n(allocn); 700| 236k| IMMER_TRY { ------------------ | | 49| 236k|#define IMMER_TRY try ------------------ 701| 236k| detail::uninitialized_copy( 702| 236k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 236k| } 704| 236k| IMMER_CATCH (...) { 705| 0| heap::deallocate(node_t::sizeof_leaf_n(allocn), dst); 706| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 707| 0| } 708| 236k| return dst; 709| 236k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_nEj: 341| 2.59M| { 342| 2.59M| assert(n <= branches); ------------------ | Branch (342:9): [True: 2.59M, False: 0] ------------------ 343| 2.59M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 2.59M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 2.59M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_nIiEEPSB_jOT_: 470| 43.4k| { 471| 43.4k| assert(n >= 1); ------------------ | Branch (471:9): [True: 43.4k, False: 0] ------------------ 472| 43.4k| auto p = make_leaf_n(n); 473| 43.4k| IMMER_TRY { ------------------ | | 49| 43.4k|#define IMMER_TRY try ------------------ 474| 43.4k| new (p->leaf()) T(std::forward(x)); 475| 43.4k| } 476| 43.4k| IMMER_CATCH (...) { 477| 0| heap::deallocate(node_t::sizeof_leaf_n(n), p); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 43.4k| return p; 481| 43.4k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13do_copy_innerEPSB_SC_j: 558| 5.10M| { 559| 5.10M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 5.10M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 5.10M, False: 0] ------------------ 560| 5.10M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 5.10M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 5.10M, False: 0] ------------------ 561| 5.10M| auto p = src->inner(); 562| 5.10M| inc_nodes(p, n); 563| 5.10M| std::copy(p, p + n, dst->inner()); 564| 5.10M| return dst; 565| 5.10M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9inc_nodesEPPSB_j: 970| 39.8M| { 971| 177M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 138M, False: 39.8M] ------------------ 972| 138M| refs(*i).inc(); 973| 39.8M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14copy_inner_r_nEjPSB_j: 588| 495k| { 589| 495k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 495k, False: 0] ------------------ 590| 495k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 495k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 495k, False: 0] ------------------ 591| 495k| auto dst = make_inner_r_n(allocn); 592| 495k| return do_copy_inner_r(dst, src, n); 593| 495k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE15do_copy_inner_rEPSB_SC_j: 610| 515k| { 611| 515k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 515k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 515k, False: 0] ------------------ 612| 515k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 515k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 515k, False: 0] ------------------ 613| 515k| auto src_r = src->relaxed(); 614| 515k| auto dst_r = dst->relaxed(); 615| 515k| inc_nodes(src->inner(), n); 616| 515k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 515k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 515k| dst_r->d.count = n; 619| 515k| return dst; 620| 515k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14make_inner_r_nEj: 243| 46.0M| { 244| 46.0M| assert(n <= branches); ------------------ | Branch (244:9): [True: 46.0M, False: 0] ------------------ 245| 46.0M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 46.0M| auto mr = static_cast(nullptr); 247| 46.0M| if (embed_relaxed) { ------------------ | Branch (247:13): [Folded, False: 46.0M] ------------------ 248| 0| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 46.0M| } else { 250| 46.0M| IMMER_TRY { ------------------ | | 49| 46.0M|#define IMMER_TRY try ------------------ 251| 46.0M| mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{}); 252| 46.0M| } 253| 46.0M| IMMER_CATCH (...) { 254| 0| heap::deallocate(sizeof_inner_r_n(n), mp); 255| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 256| 0| } 257| 46.0M| } 258| 46.0M| auto p = new (mp) node_t; 259| 46.0M| auto r = new (mr) relaxed_t; 260| 46.0M| r->d.count = 0; 261| 46.0M| p->impl.d.data.inner.relaxed = r; 262| 46.0M|#if IMMER_TAGGED_NODE 263| 46.0M| p->impl.d.kind = node_t::kind_t::inner; 264| 46.0M|#endif 265| 46.0M| return p; 266| 46.0M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9make_pathEjPSB_: 498| 1.31M| { 499| 1.31M| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 1.31M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 1.31M, False: 0] ------------------ 500| 1.31M| if (shift == endshift) ------------------ | Branch (500:13): [True: 1.12M, False: 190k] ------------------ 501| 1.12M| return node; 502| 190k| else { 503| 190k| auto n = node_t::make_inner_n(1); 504| 190k| IMMER_TRY { ------------------ | | 49| 190k|#define IMMER_TRY try ------------------ 505| 190k| n->inner()[0] = make_path(shift - B, node); 506| 190k| } 507| 190k| IMMER_CATCH (...) { 508| 0| heap::deallocate(node_t::sizeof_inner_n(1), n); 509| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 510| 0| } 511| 190k| return n; 512| 190k| } 513| 1.31M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12make_inner_nEj: 224| 5.31M| { 225| 5.31M| assert(n <= branches); ------------------ | Branch (225:9): [True: 5.31M, False: 0] ------------------ 226| 5.31M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 5.31M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 5.31M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9copy_leafEPSB_j: 666| 216k| { 667| 216k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 216k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 216k, False: 0] ------------------ 668| 216k| auto dst = make_leaf_n(n); 669| 216k| IMMER_TRY { ------------------ | | 49| 216k|#define IMMER_TRY try ------------------ 670| 216k| detail::uninitialized_copy( 671| 216k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 216k| } 673| 216k| IMMER_CATCH (...) { 674| 0| heap::deallocate(node_t::sizeof_leaf_n(n), dst); 675| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 676| 0| } 677| 216k| return dst; 678| 216k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE15make_inner_sr_nEjPNS0_3csl10member_twoINSB_14relaxed_data_tENSC_6memberIS7_NSC_7inheritINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeE: 269| 364k| { 270| 364k| return static_if( 271| 364k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 364k| [&](auto) { 273| 364k| auto p = 274| 364k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 364k| assert(r->d.count >= n); 276| 364k| node_t::refs(r).inc(); 277| 364k| p->impl.d.data.inner.relaxed = r; 278| 364k|#if IMMER_TAGGED_NODE 279| 364k| p->impl.d.kind = node_t::kind_t::inner; 280| 364k|#endif 281| 364k| return p; 282| 364k| }); 283| 364k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE15make_inner_sr_nEjPNS0_3csl10member_twoINSB_14relaxed_data_tENSC_6memberIS7_NSC_7inheritINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeEENKUlT_E0_clINS0_7empty_tEEEDaSS_: 272| 364k| [&](auto) { 273| 364k| auto p = 274| 364k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 364k| assert(r->d.count >= n); ------------------ | Branch (275:17): [True: 364k, False: 0] ------------------ 276| 364k| node_t::refs(r).inc(); 277| 364k| p->impl.d.data.inner.relaxed = r; 278| 364k|#if IMMER_TAGGED_NODE 279| 364k| p->impl.d.kind = node_t::kind_t::inner; 280| 364k|#endif 281| 364k| return p; 282| 364k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE24do_copy_inner_replace_srEPSB_SC_jjSC_: 652| 364k| { 653| 364k| if (embed_relaxed) ------------------ | Branch (653:13): [Folded, False: 364k] ------------------ 654| 0| return do_copy_inner_replace_r(dst, src, n, offset, child); 655| 364k| else { 656| 364k| auto p = src->inner(); 657| 364k| inc_nodes(p, offset); 658| 364k| inc_nodes(p + offset + 1, n - offset - 1); 659| 364k| std::copy(p, p + n, dst->inner()); 660| 364k| dst->inner()[offset] = child; 661| 364k| return dst; 662| 364k| } 663| 364k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 42.0k| { 570| 42.0k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 42.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 42.0k, False: 0] ------------------ 571| 42.0k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 42.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 42.0k, False: 0] ------------------ 572| 42.0k| auto p = src->inner(); 573| 42.0k| inc_nodes(p, offset); 574| 42.0k| inc_nodes(p + offset + 1, n - offset - 1); 575| 42.0k| std::copy(p, p + n, dst->inner()); 576| 42.0k| dst->inner()[offset] = child; 577| 42.0k| return dst; 578| 42.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12copy_inner_nEjPSB_j: 543| 8.44k| { 544| 8.44k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 8.44k, False: 0] ------------------ 545| 8.44k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 8.44k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 8.44k, False: 0] ------------------ 546| 8.44k| auto dst = make_inner_n(allocn); 547| 8.44k| return do_copy_inner(dst, src, n); 548| 8.44k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12copy_inner_rEPSB_j: 581| 4.08k| { 582| 4.08k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 4.08k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 4.08k, False: 0] ------------------ 583| 4.08k| auto dst = make_inner_r_n(n); 584| 4.08k| return do_copy_inner_r(dst, src, n); 585| 4.08k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13compute_shiftEv: 977| 13.8M| { 978| 13.8M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 1.04M, False: 12.8M] ------------------ 979| 1.04M| return endshift; 980| 12.8M| else 981| 12.8M| return B + inner()[0]->compute_shift(); 982| 13.8M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5checkEjm: 986| 1.04M| { 987| |#if IMMER_DEBUG_DEEP_CHECK 988| | assert(size > 0); 989| | if (shift == endshift) { 990| | IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); 991| | assert(size <= branches); 992| | } else if (auto r = relaxed()) { 993| | auto count = r->d.count; 994| | assert(count > 0); 995| | assert(count <= branches); 996| | if (r->d.sizes[count - 1] != size) { 997| | IMMER_TRACE_F("check"); 998| | IMMER_TRACE_E(r->d.sizes[count - 1]); 999| | IMMER_TRACE_E(size); 1000| | } 1001| | assert(r->d.sizes[count - 1] == size); 1002| | for (auto i = 1u; i < count; ++i) 1003| | assert(r->d.sizes[i - 1] < r->d.sizes[i]); 1004| | auto last_size = size_t{}; 1005| | for (auto i = 0u; i < count; ++i) { 1006| | assert(inner()[i]->check(shift - B, r->d.sizes[i] - last_size)); 1007| | last_size = r->d.sizes[i]; 1008| | } 1009| | } else { 1010| | assert(size <= branches << shift); 1011| | auto count = 1012| | (size >> shift) + (size - ((size >> shift) << shift) > 0); 1013| | assert(count <= branches); 1014| | if (count) { 1015| | for (auto i = 1u; i < count - 1; ++i) 1016| | assert(inner()[i]->check(shift - B, 1 << shift)); 1017| | assert(inner()[count - 1]->check( 1018| | shift - B, size - ((count - 1) << shift))); 1019| | } 1020| | } 1021| |#endif // IMMER_DEBUG_DEEP_CHECK 1022| 1.04M| return true; 1023| 1.04M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9copy_leafEPSB_jj: 778| 942k| { 779| 942k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 942k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 942k, False: 0] ------------------ 780| 942k| auto dst = make_leaf_n(last - idx); 781| 942k| IMMER_TRY { ------------------ | | 49| 942k|#define IMMER_TRY try ------------------ 782| 942k| detail::uninitialized_copy( 783| 942k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 942k| } 785| 942k| IMMER_CATCH (...) { 786| 0| heap::deallocate(node_t::sizeof_leaf_n(last - idx), dst); 787| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 788| 0| } 789| 942k| return dst; 790| 942k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9copy_leafEPSB_jSC_j: 712| 957k| { 713| 957k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 957k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 957k, False: 0] ------------------ 714| 957k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 957k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 957k, False: 0] ------------------ 715| 957k| auto dst = make_leaf_n(n1 + n2); 716| 957k| IMMER_TRY { ------------------ | | 49| 957k|#define IMMER_TRY try ------------------ 717| 957k| detail::uninitialized_copy( 718| 957k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 957k| } 720| 957k| IMMER_CATCH (...) { 721| 0| heap::deallocate(node_t::sizeof_leaf_n(n1 + n2), dst); 722| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 723| 0| } 724| 957k| IMMER_TRY { ------------------ | | 49| 957k|#define IMMER_TRY try ------------------ 725| 957k| detail::uninitialized_copy( 726| 957k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 957k| } 728| 957k| IMMER_CATCH (...) { 729| 0| detail::destroy_n(dst->leaf(), n1); 730| 0| heap::deallocate(node_t::sizeof_leaf_n(n1 + n2), dst); 731| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 732| 0| } 733| 957k| return dst; 734| 957k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 2.81M| { 871| 2.81M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 2.63M, False: 177k] | Branch (871:39): [True: 0, False: 177k] ------------------ 872| 2.81M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5owneeEPKSB_: 207| 177k| { 208| 177k| return get(x->impl); 209| 177k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 42.4k| { 682| 42.4k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 42.4k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 42.4k, False: 0] ------------------ 683| 42.4k| auto dst = make_leaf_e(e); 684| 42.4k| IMMER_TRY { ------------------ | | 49| 42.4k|#define IMMER_TRY try ------------------ 685| 42.4k| detail::uninitialized_copy( 686| 42.4k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 42.4k| } 688| 42.4k| IMMER_CATCH (...) { 689| 0| heap::deallocate(node_t::max_sizeof_leaf, dst); 690| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 691| 0| } 692| 42.4k| return dst; 693| 42.4k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 400k| { 349| 400k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 400k| ownee(p) = e; 351| 400k|#if IMMER_TAGGED_NODE 352| 400k| p->impl.d.kind = node_t::kind_t::leaf; 353| 400k|#endif 354| 400k| return p; 355| 400k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 6.82k| { 486| 6.82k| auto p = make_leaf_e(e); 487| 6.82k| IMMER_TRY { ------------------ | | 49| 6.82k|#define IMMER_TRY try ------------------ 488| 6.82k| new (p->leaf()) T(std::forward(x)); 489| 6.82k| } 490| 6.82k| IMMER_CATCH (...) { 491| 0| heap::deallocate(node_t::max_sizeof_leaf, p); 492| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 493| 0| } 494| 6.82k| return p; 495| 6.82k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 202k| { 931| 202k| auto src_r = relaxed(); 932| 202k| return static_if( 933| 202k| [&](auto) { return src_r; }, 934| 202k| [&](auto) { 935| 202k| if (node_t::refs(src_r).unique() || 936| 202k| node_t::ownee(src_r).can_mutate(e)) 937| 202k| return src_r; 938| 202k| else { 939| 202k| auto dst_r = 940| 202k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 202k| if (src_r) { 942| 202k| std::copy( 943| 202k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 202k| if (node_t::refs(src_r).dec()) 945| 202k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 202k| src_r); 947| 202k| } 948| 202k| dst_r->d.count = n; 949| 202k| node_t::ownee(dst_r) = e; 950| 202k| return impl.d.data.inner.relaxed = dst_r; 951| 202k| } 952| 202k| }); 953| 202k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEjENKUlT_E0_clINS0_7empty_tEEEDaSG_: 934| 202k| [&](auto) { 935| 202k| if (node_t::refs(src_r).unique() || ------------------ | Branch (935:21): [True: 196k, False: 5.55k] ------------------ 936| 5.55k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (936:21): [True: 0, False: 5.55k] ------------------ 937| 196k| return src_r; 938| 5.55k| else { 939| 5.55k| auto dst_r = 940| 5.55k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 5.55k| if (src_r) { ------------------ | Branch (941:25): [True: 5.55k, False: 0] ------------------ 942| 5.55k| std::copy( 943| 5.55k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 5.55k| if (node_t::refs(src_r).dec()) ------------------ | Branch (944:29): [True: 0, False: 5.55k] ------------------ 945| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 0| src_r); 947| 5.55k| } 948| 5.55k| dst_r->d.count = n; 949| 5.55k| node_t::ownee(dst_r) = e; 950| 5.55k| return impl.d.data.inner.relaxed = dst_r; 951| 5.55k| } 952| 202k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14copy_inner_r_eENS9_5applyIS6_E4type4editEPSB_j: 596| 15.4k| { 597| 15.4k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 15.4k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (597:9): [True: 15.4k, False: 0] ------------------ 598| 15.4k| auto dst = make_inner_r_e(e); 599| 15.4k| return do_copy_inner_r(dst, src, n); 600| 15.4k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 286| 161k| { 287| 161k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 161k| auto mr = static_cast(nullptr); 289| 161k| if (embed_relaxed) { ------------------ | Branch (289:13): [Folded, False: 161k] ------------------ 290| 0| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 161k| } else { 292| 161k| IMMER_TRY { ------------------ | | 49| 161k|#define IMMER_TRY try ------------------ 293| 161k| mr = heap::allocate(max_sizeof_relaxed, norefs_tag{}); 294| 161k| } 295| 161k| IMMER_CATCH (...) { 296| 0| heap::deallocate(max_sizeof_inner_r, mp); 297| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 298| 0| } 299| 161k| } 300| 161k| auto p = new (mp) node_t; 301| 161k| auto r = new (mr) relaxed_t; 302| 161k| ownee(p) = e; 303| 161k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 161k| r->d.count = 0; 305| 161k| p->impl.d.data.inner.relaxed = r; 306| 161k|#if IMMER_TAGGED_NODE 307| 161k| p->impl.d.kind = node_t::kind_t::inner; 308| 161k|#endif 309| 161k| return p; 310| 161k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14make_inner_r_eENS9_5applyIS6_E4type4editEENKUlT_E_clINS0_7empty_tEEEDaSG_: 303| 161k| static_if([&](auto) { node_t::ownee(r) = e; }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_path_eENS9_5applyIS6_E4type4editEjPSB_: 516| 391k| { 517| 391k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 391k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 391k, False: 0] ------------------ 518| 391k| if (shift == endshift) ------------------ | Branch (518:13): [True: 338k, False: 52.7k] ------------------ 519| 338k| return node; 520| 52.7k| else { 521| 52.7k| auto n = node_t::make_inner_e(e); 522| 52.7k| IMMER_TRY { ------------------ | | 49| 52.7k|#define IMMER_TRY try ------------------ 523| 52.7k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 52.7k| } 525| 52.7k| IMMER_CATCH (...) { 526| 0| heap::deallocate(node_t::max_sizeof_inner, n); 527| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 528| 0| } 529| 52.7k| return n; 530| 52.7k| } 531| 391k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 83.0k| { 232| 83.0k| auto m = heap::allocate(max_sizeof_inner); 233| 83.0k| auto p = new (m) node_t; 234| 83.0k| ownee(p) = e; 235| 83.0k| p->impl.d.data.inner.relaxed = nullptr; 236| 83.0k|#if IMMER_TAGGED_NODE 237| 83.0k| p->impl.d.kind = node_t::kind_t::inner; 238| 83.0k|#endif 239| 83.0k| return p; 240| 83.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 21.2k| { 552| 21.2k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 21.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 21.2k, False: 0] ------------------ 553| 21.2k| auto dst = make_inner_e(e); 554| 21.2k| return do_copy_inner(dst, src, n); 555| 21.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 21.9k| { 604| 21.9k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 21.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 21.9k, False: 0] ------------------ 605| 21.9k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 21.9k| return do_copy_inner_sr(dst, src, n); 607| 21.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl10member_twoINSB_14relaxed_data_tENSG_6memberIS7_NSG_7inheritINSE_5owneeEvE4typeEE4typeEE4typeE: 313| 21.9k| { 314| 21.9k| return static_if( 315| 21.9k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 21.9k| [&](auto) { 317| 21.9k| auto p = 318| 21.9k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 21.9k| node_t::refs(r).inc(); 320| 21.9k| p->impl.d.data.inner.relaxed = r; 321| 21.9k| node_t::ownee(p) = e; 322| 21.9k|#if IMMER_TAGGED_NODE 323| 21.9k| p->impl.d.kind = node_t::kind_t::inner; 324| 21.9k|#endif 325| 21.9k| return p; 326| 21.9k| }); 327| 21.9k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl10member_twoINSB_14relaxed_data_tENSG_6memberIS7_NSG_7inheritINSE_5owneeEvE4typeEE4typeEE4typeEENKUlT_E0_clINS0_7empty_tEEEDaST_: 316| 21.9k| [&](auto) { 317| 21.9k| auto p = 318| 21.9k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 21.9k| node_t::refs(r).inc(); 320| 21.9k| p->impl.d.data.inner.relaxed = r; 321| 21.9k| node_t::ownee(p) = e; 322| 21.9k|#if IMMER_TAGGED_NODE 323| 21.9k| p->impl.d.kind = node_t::kind_t::inner; 324| 21.9k|#endif 325| 21.9k| return p; 326| 21.9k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE16do_copy_inner_srEPSB_SC_j: 640| 21.9k| { 641| 21.9k| if (embed_relaxed) ------------------ | Branch (641:13): [Folded, False: 21.9k] ------------------ 642| 0| return do_copy_inner_r(dst, src, n); 643| 21.9k| else { 644| 21.9k| inc_nodes(src->inner(), n); 645| 21.9k| std::copy(src->inner(), src->inner() + n, dst->inner()); 646| 21.9k| return dst; 647| 21.9k| } 648| 21.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 351k| { 764| 351k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 351k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 351k, False: 0] ------------------ 765| 351k| auto dst = make_leaf_e(e); 766| 351k| IMMER_TRY { ------------------ | | 49| 351k|#define IMMER_TRY try ------------------ 767| 351k| detail::uninitialized_copy( 768| 351k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 351k| } 770| 351k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 351k| return dst; 775| 351k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 232k| { 878| 232k| auto src_r = relaxed(); 879| 232k| return static_if( 880| 232k| [&](auto) { return src_r; }, 881| 232k| [&](auto) { 882| 232k| if (node_t::refs(src_r).unique() || 883| 232k| node_t::ownee(src_r).can_mutate(e)) 884| 232k| return src_r; 885| 232k| else { 886| 232k| auto dst_r = impl.d.data.inner.relaxed = 887| 232k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 232k| if (src_r) { 889| 232k| auto n = dst_r->d.count = src_r->d.count; 890| 232k| std::copy( 891| 232k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 232k| if (node_t::refs(src_r).dec()) 893| 232k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 232k| src_r); 895| 232k| } 896| 232k| node_t::ownee(dst_r) = e; 897| 232k| return dst_r; 898| 232k| } 899| 232k| }); 900| 232k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editEENKUlT_E0_clINS0_7empty_tEEEDaSG_: 881| 232k| [&](auto) { 882| 232k| if (node_t::refs(src_r).unique() || ------------------ | Branch (882:21): [True: 211k, False: 20.9k] ------------------ 883| 20.9k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (883:21): [True: 0, False: 20.9k] ------------------ 884| 211k| return src_r; 885| 20.9k| else { 886| 20.9k| auto dst_r = impl.d.data.inner.relaxed = 887| 20.9k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 20.9k| if (src_r) { ------------------ | Branch (888:25): [True: 20.9k, False: 0] ------------------ 889| 20.9k| auto n = dst_r->d.count = src_r->d.count; 890| 20.9k| std::copy( 891| 20.9k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 20.9k| if (node_t::refs(src_r).dec()) ------------------ | Branch (892:29): [True: 0, False: 20.9k] ------------------ 893| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 0| src_r); 895| 20.9k| } 896| 20.9k| node_t::ownee(dst_r) = e; 897| 20.9k| return dst_r; 898| 20.9k| } 899| 232k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j: 738| 235| { 739| 235| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 235|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 235, False: 0] ------------------ 740| 235| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 235|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 235, False: 0] ------------------ 741| 235| auto dst = make_leaf_e(e); 742| 235| IMMER_TRY { ------------------ | | 49| 235|#define IMMER_TRY try ------------------ 743| 235| detail::uninitialized_copy( 744| 235| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 235| } 746| 235| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 235| IMMER_TRY { ------------------ | | 49| 235|#define IMMER_TRY try ------------------ 751| 235| detail::uninitialized_copy( 752| 235| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 235| } 754| 235| IMMER_CATCH (...) { 755| 0| detail::destroy_n(dst->leaf(), n1); 756| 0| heap::deallocate(max_sizeof_leaf, dst); 757| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 758| 0| } 759| 235| return dst; 760| 235| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 523| 239M| { 524| 239M| using node_t = node_type; 525| 239M| auto node = p.node(); 526| 239M| if (node->dec()) { ------------------ | Branch (526:13): [True: 46.6M, False: 193M] ------------------ 527| 46.6M| p.each(this_t{}); 528| 46.6M| node_t::delete_inner_r(node, p.count()); 529| 46.6M| } 530| 239M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 16.6M| { 535| 16.6M| using node_t = node_type; 536| 16.6M| auto node = p.node(); 537| 16.6M| if (node->dec()) { ------------------ | Branch (537:13): [True: 1.15M, False: 15.5M] ------------------ 538| 1.15M| p.each(this_t{}); 539| 1.15M| node_t::delete_inner(node, p.count()); 540| 1.15M| } 541| 16.6M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 4.32M| { 546| 4.32M| using node_t = node_type; 547| 4.32M| auto node = p.node(); 548| 4.32M| if (node->dec()) { ------------------ | Branch (548:13): [True: 615k, False: 3.70M] ------------------ 549| 615k| node_t::delete_leaf(node, p.count()); 550| 615k| } 551| 4.32M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.11M| { 546| 1.11M| using node_t = node_type; 547| 1.11M| auto node = p.node(); 548| 1.11M| if (node->dec()) { ------------------ | Branch (548:13): [True: 621k, False: 494k] ------------------ 549| 621k| node_t::delete_leaf(node, p.count()); 550| 621k| } 551| 1.11M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 9.57M| { 535| 9.57M| using node_t = node_type; 536| 9.57M| auto node = p.node(); 537| 9.57M| if (node->dec()) { ------------------ | Branch (537:13): [True: 103k, False: 9.47M] ------------------ 538| 103k| p.each(this_t{}); 539| 103k| node_t::delete_inner(node, p.count()); 540| 103k| } 541| 9.57M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 4.17M| { 535| 4.17M| using node_t = node_type; 536| 4.17M| auto node = p.node(); 537| 4.17M| if (node->dec()) { ------------------ | Branch (537:13): [True: 4.12M, False: 56.5k] ------------------ 538| 4.12M| p.each(this_t{}); 539| 4.12M| node_t::delete_inner(node, p.count()); 540| 4.12M| } 541| 4.17M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 3.00M| { 535| 3.00M| using node_t = node_type; 536| 3.00M| auto node = p.node(); 537| 3.00M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 3.00M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 3.00M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 80.4M| { 546| 80.4M| using node_t = node_type; 547| 80.4M| auto node = p.node(); 548| 80.4M| if (node->dec()) { ------------------ | Branch (548:13): [True: 1.76M, False: 78.7M] ------------------ 549| 1.76M| node_t::delete_leaf(node, p.count()); 550| 1.76M| } 551| 80.4M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 2.81M| { 546| 2.81M| using node_t = node_type; 547| 2.81M| auto node = p.node(); 548| 2.81M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 2.81M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 2.81M| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_SI_j: 791| 497k| { 792| 497k| auto level = pos.shift(); 793| 497k| auto idx = pos.count() - 1; 794| 497k| auto children = pos.size(idx); 795| 497k| auto new_idx = 796| 497k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 15.4k, False: 481k] | Branch (796:47): [True: 803, False: 480k] ------------------ 797| 497k| auto new_child = static_cast(nullptr); 798| 497k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 4.13k, False: 493k] ------------------ 799| 4.13k| return nullptr; 800| 493k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 480k, False: 12.1k] ------------------ 801| 480k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 480k| if (!new_child) { ------------------ | Branch (802:17): [True: 4.86k, False: 476k] ------------------ 803| 4.86k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 1.77k, False: 3.09k] ------------------ 804| 1.77k| new_child = node_t::make_path(level - B, tail); 805| 3.09k| else 806| 3.09k| return nullptr; 807| 4.86k| } 808| 480k| } else 809| 12.1k| new_child = node_t::make_path(level - B, tail); 810| 490k| IMMER_TRY { ------------------ | | 49| 490k|#define IMMER_TRY try ------------------ 811| 490k| auto count = new_idx + 1; 812| 490k| auto new_parent = 813| 490k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 490k| auto new_relaxed = new_parent->relaxed(); 815| 490k| new_parent->inner()[new_idx] = new_child; 816| 490k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 490k| new_relaxed->d.count = count; 818| 490k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 490k, False: 0] ------------------ 819| 490k| return new_parent; 820| 490k| } 821| 490k| IMMER_CATCH (...) { 822| 0| auto shift = pos.shift(); 823| 0| auto size = new_idx == idx ? children + ts : ts; ------------------ | Branch (823:26): [True: 0, False: 0] ------------------ 824| 0| if (shift > BL) { ------------------ | Branch (824:17): [True: 0, False: 0] ------------------ 825| 0| tail->inc(); 826| 0| dec_inner(new_child, shift - B, size); 827| 0| } 828| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 829| 0| } 830| 490k| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_SJ_DpOT0_: 834| 320k| { 835| 320k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 320k, False: 0] ------------------ 836| 320k| auto idx = pos.index(pos.size() - 1); 837| 320k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 320k| auto count = new_idx + 1; 839| 320k| auto new_parent = node_t::make_inner_n(count); 840| 320k| IMMER_TRY { ------------------ | | 49| 320k|#define IMMER_TRY try ------------------ 841| 320k| new_parent->inner()[new_idx] = 842| 320k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 309k, False: 11.0k] ------------------ 843| | /* otherwise */ 844| 320k| : node_t::make_path(pos.shift() - B, tail); 845| 320k| } 846| 320k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 320k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 320k| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_SI_DpOT0_: 834| 3.98M| { 835| 3.98M| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 3.98M, False: 0] ------------------ 836| 3.98M| auto idx = pos.index(pos.size() - 1); 837| 3.98M| auto new_idx = pos.index(pos.size() + branches - 1); 838| 3.98M| auto count = new_idx + 1; 839| 3.98M| auto new_parent = node_t::make_inner_n(count); 840| 3.98M| IMMER_TRY { ------------------ | | 49| 3.98M|#define IMMER_TRY try ------------------ 841| 3.98M| new_parent->inner()[new_idx] = 842| 3.98M| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 2.95M, False: 1.02M] ------------------ 843| | /* otherwise */ 844| 3.98M| : node_t::make_path(pos.shift() - B, tail); 845| 3.98M| } 846| 3.98M| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 3.98M| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 3.98M| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEvPT_jm: 562| 559|{ 563| 559| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 559|} _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_SI_DpOT0_: 834| 763k| { 835| 763k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 763k, False: 0] ------------------ 836| 763k| auto idx = pos.index(pos.size() - 1); 837| 763k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 763k| auto count = new_idx + 1; 839| 763k| auto new_parent = node_t::make_inner_n(count); 840| 763k| IMMER_TRY { ------------------ | | 49| 763k|#define IMMER_TRY try ------------------ 841| 763k| new_parent->inner()[new_idx] = 842| 763k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 719k, False: 44.3k] ------------------ 843| | /* otherwise */ 844| 763k| : node_t::make_path(pos.shift() - B, tail); 845| 763k| } 846| 763k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 763k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 763k| } flex-vector-st.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 179k| { 503| 179k| auto offset = pos.index(idx); 504| 179k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 179k| IMMER_TRY { ------------------ | | 49| 179k|#define IMMER_TRY try ------------------ 506| 179k| node->leaf()[offset] = 507| 179k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 179k| return node; 509| 179k| } 510| 179k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 179k| } flex-vector-st.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_relaxedIRNS1_11relaxed_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 466| 364k| { 467| 364k| auto offset = pos.index(idx); 468| 364k| auto count = pos.count(); 469| 364k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 364k| IMMER_TRY { ------------------ | | 49| 364k|#define IMMER_TRY try ------------------ 471| 364k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 364k| node_t::do_copy_inner_replace_sr( 473| 364k| node, pos.node(), count, offset, child); 474| 364k| return node; 475| 364k| } 476| 364k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 364k| } flex-vector-st.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 24.4k| { 485| 24.4k| auto offset = pos.index(idx); 486| 24.4k| auto count = pos.count(); 487| 24.4k| auto node = node_t::make_inner_n(count); 488| 24.4k| IMMER_TRY { ------------------ | | 49| 24.4k|#define IMMER_TRY try ------------------ 489| 24.4k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 24.4k| node_t::do_copy_inner_replace( 491| 24.4k| node, pos.node(), count, offset, child); 492| 24.4k| return node; 493| 24.4k| } 494| 24.4k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 24.4k| } flex-vector-st.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 16.3k| { 503| 16.3k| auto offset = pos.index(idx); 504| 16.3k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 16.3k| IMMER_TRY { ------------------ | | 49| 16.3k|#define IMMER_TRY try ------------------ 506| 16.3k| node->leaf()[offset] = 507| 16.3k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 16.3k| return node; 509| 16.3k| } 510| 16.3k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 16.3k| } flex-vector-st.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_regularIRNS1_8full_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 14.9k| { 485| 14.9k| auto offset = pos.index(idx); 486| 14.9k| auto count = pos.count(); 487| 14.9k| auto node = node_t::make_inner_n(count); 488| 14.9k| IMMER_TRY { ------------------ | | 49| 14.9k|#define IMMER_TRY try ------------------ 489| 14.9k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 14.9k| node_t::do_copy_inner_replace( 491| 14.9k| node, pos.node(), count, offset, child); 492| 14.9k| return node; 493| 14.9k| } 494| 14.9k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 14.9k| } flex-vector-st.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_8leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 8.04k| { 503| 8.04k| auto offset = pos.index(idx); 504| 8.04k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 8.04k| IMMER_TRY { ------------------ | | 49| 8.04k|#define IMMER_TRY try ------------------ 506| 8.04k| node->leaf()[offset] = 507| 8.04k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 8.04k| return node; 509| 8.04k| } 510| 8.04k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 8.04k| } flex-vector-st.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_regularIRNS1_11regular_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 2.60k| { 485| 2.60k| auto offset = pos.index(idx); 486| 2.60k| auto count = pos.count(); 487| 2.60k| auto node = node_t::make_inner_n(count); 488| 2.60k| IMMER_TRY { ------------------ | | 49| 2.60k|#define IMMER_TRY try ------------------ 489| 2.60k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 2.60k| node_t::do_copy_inner_replace( 491| 2.60k| node, pos.node(), count, offset, child); 492| 2.60k| return node; 493| 2.60k| } 494| 2.60k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 2.60k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1096| 30.5k| { 1097| 30.5k| auto idx = pos.index(last); 1098| 30.5k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 30.5k, Folded] | Branch (1098:25): [True: 23.3k, False: 7.21k] ------------------ 1099| 23.3k| return pos.towards_oh(this_t{}, last, idx); 1100| 23.3k| } else { 1101| 7.21k| using std::get; 1102| 7.21k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 7.21k| auto next = get<1>(subs); 1104| 7.21k| auto ts = get<2>(subs); 1105| 7.21k| auto tail = get<3>(subs); 1106| 7.21k| IMMER_TRY { ------------------ | | 49| 7.21k|#define IMMER_TRY try ------------------ 1107| 7.21k| if (next) { ------------------ | Branch (1107:21): [True: 4.53k, False: 2.68k] ------------------ 1108| 4.53k| auto count = idx + 1; 1109| 4.53k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 4.53k| auto newr = newn->relaxed(); 1111| 4.53k| newn->inner()[idx] = next; 1112| 4.53k| newr->d.sizes[idx] = last + 1 - ts; 1113| 4.53k| newr->d.count = count; 1114| 4.53k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 4.53k, False: 0] ------------------ 1115| 4.53k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 4.53k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 2.68k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 2.68k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 2.68k, Folded] | Branch (1118:40): [True: 1.80k, False: 887] | Branch (1118:52): [True: 1.23k, False: 563] ------------------ 1119| 1.23k| auto newn = pos.node()->inner()[0]; 1120| 1.23k| return std::make_tuple( 1121| 1.23k| pos.shift() - B, newn->inc(), ts, tail); 1122| 1.45k| } else { 1123| 1.45k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.45k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.45k| } 1126| 7.21k| } 1127| 7.21k| IMMER_CATCH (...) { 1128| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] ------------------ 1129| 0| if (next) ------------------ | Branch (1129:21): [True: 0, False: 0] ------------------ 1130| 0| dec_inner(next, 1131| 0| pos.shift() - B, 1132| 0| last + 1 - ts - pos.size_before(idx)); 1133| 0| if (tail) ------------------ | Branch (1133:21): [True: 0, False: 0] ------------------ 1134| 0| dec_leaf(tail, ts); 1135| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1136| 0| } 1137| 7.21k| } 1138| 30.5k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 1.63k| { 1182| 1.63k| auto old_tail_size = pos.count(); 1183| 1.63k| auto new_tail_size = pos.index(last) + 1; 1184| 1.63k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 348, False: 1.28k] ------------------ 1185| 1.63k| ? pos.node()->inc() 1186| 1.63k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.63k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.63k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 4.66k| { 1182| 4.66k| auto old_tail_size = pos.count(); 1183| 4.66k| auto new_tail_size = pos.index(last) + 1; 1184| 4.66k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.21k, False: 3.45k] ------------------ 1185| 4.66k| ? pos.node()->inc() 1186| 4.66k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 4.66k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 4.66k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1096| 4.90k| { 1097| 4.90k| auto idx = pos.index(last); 1098| 4.90k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 4.90k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 4.90k| } else { 1101| 4.90k| using std::get; 1102| 4.90k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 4.90k| auto next = get<1>(subs); 1104| 4.90k| auto ts = get<2>(subs); 1105| 4.90k| auto tail = get<3>(subs); 1106| 4.90k| IMMER_TRY { ------------------ | | 49| 4.90k|#define IMMER_TRY try ------------------ 1107| 4.90k| if (next) { ------------------ | Branch (1107:21): [True: 1.15k, False: 3.75k] ------------------ 1108| 1.15k| auto count = idx + 1; 1109| 1.15k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 1.15k| auto newr = newn->relaxed(); 1111| 1.15k| newn->inner()[idx] = next; 1112| 1.15k| newr->d.sizes[idx] = last + 1 - ts; 1113| 1.15k| newr->d.count = count; 1114| 1.15k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 1.15k, False: 0] ------------------ 1115| 1.15k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 3.75k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 1.11k, False: 2.63k] ------------------ 1117| 1.11k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 2.63k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 2.63k] | Branch (1118:40): [True: 0, False: 0] | Branch (1118:52): [True: 0, False: 0] ------------------ 1119| 0| auto newn = pos.node()->inner()[0]; 1120| 0| return std::make_tuple( 1121| 0| pos.shift() - B, newn->inc(), ts, tail); 1122| 2.63k| } else { 1123| 2.63k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 2.63k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 2.63k| } 1126| 4.90k| } 1127| 4.90k| IMMER_CATCH (...) { 1128| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] ------------------ 1129| 0| if (next) ------------------ | Branch (1129:21): [True: 0, False: 0] ------------------ 1130| 0| dec_inner(next, 1131| 0| pos.shift() - B, 1132| 0| last + 1 - ts - pos.size_before(idx)); 1133| 0| if (tail) ------------------ | Branch (1133:21): [True: 0, False: 0] ------------------ 1134| 0| dec_leaf(tail, ts); 1135| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1136| 0| } 1137| 4.90k| } 1138| 4.90k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.55k| { 1143| 2.55k| auto idx = pos.index(last); 1144| 2.55k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.55k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.55k| } else { 1147| 2.55k| using std::get; 1148| 2.55k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.55k| auto next = get<1>(subs); 1150| 2.55k| auto ts = get<2>(subs); 1151| 2.55k| auto tail = get<3>(subs); 1152| 2.55k| IMMER_TRY { ------------------ | | 49| 2.55k|#define IMMER_TRY try ------------------ 1153| 2.55k| if (next) { ------------------ | Branch (1153:21): [True: 1.36k, False: 1.18k] ------------------ 1154| 1.36k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.36k| newn->inner()[idx] = next; 1156| 1.36k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.36k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 658, False: 530] ------------------ 1158| 658| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 658| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 530] | Branch (1159:40): [True: 0, False: 0] | Branch (1159:52): [True: 0, False: 0] ------------------ 1160| 0| auto newn = pos.node()->inner()[0]; 1161| 0| return std::make_tuple( 1162| 0| pos.shift() - B, newn->inc(), ts, tail); 1163| 530| } else { 1164| 530| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 530| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 530| } 1167| 2.55k| } 1168| 2.55k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 2.55k| } 1177| 2.55k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 3.87k| { 1182| 3.87k| auto old_tail_size = pos.count(); 1183| 3.87k| auto new_tail_size = pos.index(last) + 1; 1184| 3.87k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.51k, False: 2.36k] ------------------ 1185| 3.87k| ? pos.node()->inc() 1186| 3.87k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 3.87k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 3.87k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.01k| { 1143| 2.01k| auto idx = pos.index(last); 1144| 2.01k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.01k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.01k| } else { 1147| 2.01k| using std::get; 1148| 2.01k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.01k| auto next = get<1>(subs); 1150| 2.01k| auto ts = get<2>(subs); 1151| 2.01k| auto tail = get<3>(subs); 1152| 2.01k| IMMER_TRY { ------------------ | | 49| 2.01k|#define IMMER_TRY try ------------------ 1153| 2.01k| if (next) { ------------------ | Branch (1153:21): [True: 213, False: 1.80k] ------------------ 1154| 213| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 213| newn->inner()[idx] = next; 1156| 213| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.80k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 429, False: 1.37k] ------------------ 1158| 429| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.37k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.37k] | Branch (1159:40): [True: 0, False: 0] | Branch (1159:52): [True: 0, False: 0] ------------------ 1160| 0| auto newn = pos.node()->inner()[0]; 1161| 0| return std::make_tuple( 1162| 0| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.37k| } else { 1164| 1.37k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.37k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.37k| } 1167| 2.01k| } 1168| 2.01k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 2.01k| } 1177| 2.01k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 2.80k| { 1182| 2.80k| auto old_tail_size = pos.count(); 1183| 2.80k| auto new_tail_size = pos.index(last) + 1; 1184| 2.80k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.25k, False: 1.55k] ------------------ 1185| 2.80k| ? pos.node()->inc() 1186| 2.80k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.80k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.80k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.89k| { 1143| 2.89k| auto idx = pos.index(last); 1144| 2.89k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.89k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.89k| } else { 1147| 2.89k| using std::get; 1148| 2.89k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.89k| auto next = get<1>(subs); 1150| 2.89k| auto ts = get<2>(subs); 1151| 2.89k| auto tail = get<3>(subs); 1152| 2.89k| IMMER_TRY { ------------------ | | 49| 2.89k|#define IMMER_TRY try ------------------ 1153| 2.89k| if (next) { ------------------ | Branch (1153:21): [True: 908, False: 1.98k] ------------------ 1154| 908| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 908| newn->inner()[idx] = next; 1156| 908| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.98k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.01k, False: 976] ------------------ 1158| 1.01k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.01k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 976] | Branch (1159:40): [True: 0, False: 0] | Branch (1159:52): [True: 0, False: 0] ------------------ 1160| 0| auto newn = pos.node()->inner()[0]; 1161| 0| return std::make_tuple( 1162| 0| pos.shift() - B, newn->inc(), ts, tail); 1163| 976| } else { 1164| 976| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 976| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 976| } 1167| 2.89k| } 1168| 2.89k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 2.89k| } 1177| 2.89k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEvPT_j: 556| 38.7k|{ 557| 38.7k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 38.7k|} _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 6.36k| { 1143| 6.36k| auto idx = pos.index(last); 1144| 6.36k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 6.36k, Folded] | Branch (1144:25): [True: 3.33k, False: 3.03k] ------------------ 1145| 3.33k| return pos.towards_oh(this_t{}, last, idx); 1146| 3.33k| } else { 1147| 3.03k| using std::get; 1148| 3.03k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.03k| auto next = get<1>(subs); 1150| 3.03k| auto ts = get<2>(subs); 1151| 3.03k| auto tail = get<3>(subs); 1152| 3.03k| IMMER_TRY { ------------------ | | 49| 3.03k|#define IMMER_TRY try ------------------ 1153| 3.03k| if (next) { ------------------ | Branch (1153:21): [True: 676, False: 2.35k] ------------------ 1154| 676| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 676| newn->inner()[idx] = next; 1156| 676| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.35k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.35k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.35k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.35k, Folded] | Branch (1159:40): [True: 1.97k, False: 386] | Branch (1159:52): [True: 848, False: 1.12k] ------------------ 1160| 848| auto newn = pos.node()->inner()[0]; 1161| 848| return std::make_tuple( 1162| 848| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.50k| } else { 1164| 1.50k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.50k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.50k| } 1167| 3.03k| } 1168| 3.03k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 3.03k| } 1177| 6.36k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 1.41k| { 1182| 1.41k| auto old_tail_size = pos.count(); 1183| 1.41k| auto new_tail_size = pos.index(last) + 1; 1184| 1.41k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 614, False: 804] ------------------ 1185| 1.41k| ? pos.node()->inc() 1186| 1.41k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.41k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.41k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.01k| { 1143| 2.01k| auto idx = pos.index(last); 1144| 2.01k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 2.01k, Folded] | Branch (1144:25): [True: 925, False: 1.09k] ------------------ 1145| 925| return pos.towards_oh(this_t{}, last, idx); 1146| 1.09k| } else { 1147| 1.09k| using std::get; 1148| 1.09k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 1.09k| auto next = get<1>(subs); 1150| 1.09k| auto ts = get<2>(subs); 1151| 1.09k| auto tail = get<3>(subs); 1152| 1.09k| IMMER_TRY { ------------------ | | 49| 1.09k|#define IMMER_TRY try ------------------ 1153| 1.09k| if (next) { ------------------ | Branch (1153:21): [True: 312, False: 781] ------------------ 1154| 312| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 312| newn->inner()[idx] = next; 1156| 312| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 781| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 781] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 781| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 781, Folded] | Branch (1159:40): [True: 435, False: 346] | Branch (1159:52): [True: 201, False: 234] ------------------ 1160| 201| auto newn = pos.node()->inner()[0]; 1161| 201| return std::make_tuple( 1162| 201| pos.shift() - B, newn->inc(), ts, tail); 1163| 580| } else { 1164| 580| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 580| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 580| } 1167| 1.09k| } 1168| 1.09k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 1.09k| } 1177| 2.01k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 824| { 1182| 824| auto old_tail_size = pos.count(); 1183| 824| auto new_tail_size = pos.index(last) + 1; 1184| 824| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 407, False: 417] ------------------ 1185| 824| ? pos.node()->inc() 1186| 824| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 824| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 824| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 18.3k| { 1415| 18.3k| auto idx = pos.subindex(first); 1416| 18.3k| auto count = pos.count(); 1417| 18.3k| auto left_size = pos.size_before(idx); 1418| 18.3k| auto child_size = pos.size_sbh(idx, left_size); 1419| 18.3k| auto dropped_size = first; 1420| 18.3k| auto child_dropped_size = dropped_size - left_size; 1421| 18.3k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 18.3k, Folded] | Branch (1421:25): [True: 16.4k, False: 1.90k] | Branch (1421:45): [True: 3.27k, False: 13.1k] ------------------ 1422| 3.27k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 15.0k| } else { 1424| 15.0k| using std::get; 1425| 15.0k| auto n = pos.node(); 1426| 15.0k| auto newc = count - idx; 1427| 15.0k| auto newn = node_t::make_inner_r_n(newc); 1428| 15.0k| IMMER_TRY { ------------------ | | 49| 15.0k|#define IMMER_TRY try ------------------ 1429| 15.0k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 15.0k| auto newr = newn->relaxed(); 1431| 15.0k| newr->d.count = count - idx; 1432| 15.0k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 15.0k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 15.0k, False: 0] ------------------ 1434| 15.0k| pos.copy_sizes(idx + 1, 1435| 15.0k| newr->d.count - 1, 1436| 15.0k| newr->d.sizes[0], 1437| 15.0k| newr->d.sizes + 1); 1438| 15.0k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 15.0k, False: 0] ------------------ 1439| 15.0k| pos.size() - dropped_size); 1440| 15.0k| newn->inner()[0] = get<1>(subs); 1441| 15.0k| std::copy(n->inner() + idx + 1, 1442| 15.0k| n->inner() + count, 1443| 15.0k| newn->inner() + 1); 1444| 15.0k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 15.0k| return std::make_tuple(pos.shift(), newn); 1446| 15.0k| } 1447| 15.0k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 15.0k| } 1452| 18.3k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 14.0k| { 1457| 14.0k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 14.0k| return std::make_tuple(0, n); 1459| 14.0k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 68.9k| { 1415| 68.9k| auto idx = pos.subindex(first); 1416| 68.9k| auto count = pos.count(); 1417| 68.9k| auto left_size = pos.size_before(idx); 1418| 68.9k| auto child_size = pos.size_sbh(idx, left_size); 1419| 68.9k| auto dropped_size = first; 1420| 68.9k| auto child_dropped_size = dropped_size - left_size; 1421| 68.9k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 68.9k] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 68.9k| } else { 1424| 68.9k| using std::get; 1425| 68.9k| auto n = pos.node(); 1426| 68.9k| auto newc = count - idx; 1427| 68.9k| auto newn = node_t::make_inner_r_n(newc); 1428| 68.9k| IMMER_TRY { ------------------ | | 49| 68.9k|#define IMMER_TRY try ------------------ 1429| 68.9k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 68.9k| auto newr = newn->relaxed(); 1431| 68.9k| newr->d.count = count - idx; 1432| 68.9k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 68.9k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 68.9k, False: 0] ------------------ 1434| 68.9k| pos.copy_sizes(idx + 1, 1435| 68.9k| newr->d.count - 1, 1436| 68.9k| newr->d.sizes[0], 1437| 68.9k| newr->d.sizes + 1); 1438| 68.9k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 68.9k, False: 0] ------------------ 1439| 68.9k| pos.size() - dropped_size); 1440| 68.9k| newn->inner()[0] = get<1>(subs); 1441| 68.9k| std::copy(n->inner() + idx + 1, 1442| 68.9k| n->inner() + count, 1443| 68.9k| newn->inner() + 1); 1444| 68.9k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 68.9k| return std::make_tuple(pos.shift(), newn); 1446| 68.9k| } 1447| 68.9k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 68.9k| } 1452| 68.9k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 984| { 1415| 984| auto idx = pos.subindex(first); 1416| 984| auto count = pos.count(); 1417| 984| auto left_size = pos.size_before(idx); 1418| 984| auto child_size = pos.size_sbh(idx, left_size); 1419| 984| auto dropped_size = first; 1420| 984| auto child_dropped_size = dropped_size - left_size; 1421| 984| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 984] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 984| } else { 1424| 984| using std::get; 1425| 984| auto n = pos.node(); 1426| 984| auto newc = count - idx; 1427| 984| auto newn = node_t::make_inner_r_n(newc); 1428| 984| IMMER_TRY { ------------------ | | 49| 984|#define IMMER_TRY try ------------------ 1429| 984| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 984| auto newr = newn->relaxed(); 1431| 984| newr->d.count = count - idx; 1432| 984| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 984| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 984, False: 0] ------------------ 1434| 984| pos.copy_sizes(idx + 1, 1435| 984| newr->d.count - 1, 1436| 984| newr->d.sizes[0], 1437| 984| newr->d.sizes + 1); 1438| 984| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 984, False: 0] ------------------ 1439| 984| pos.size() - dropped_size); 1440| 984| newn->inner()[0] = get<1>(subs); 1441| 984| std::copy(n->inner() + idx + 1, 1442| 984| n->inner() + count, 1443| 984| newn->inner() + 1); 1444| 984| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 984| return std::make_tuple(pos.shift(), newn); 1446| 984| } 1447| 984| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 984| } 1452| 984| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 7.46k| { 1457| 7.46k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 7.46k| return std::make_tuple(0, n); 1459| 7.46k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE11visit_innerIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 4.07k| { 1415| 4.07k| auto idx = pos.subindex(first); 1416| 4.07k| auto count = pos.count(); 1417| 4.07k| auto left_size = pos.size_before(idx); 1418| 4.07k| auto child_size = pos.size_sbh(idx, left_size); 1419| 4.07k| auto dropped_size = first; 1420| 4.07k| auto child_dropped_size = dropped_size - left_size; 1421| 4.07k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 4.07k] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 4.07k| } else { 1424| 4.07k| using std::get; 1425| 4.07k| auto n = pos.node(); 1426| 4.07k| auto newc = count - idx; 1427| 4.07k| auto newn = node_t::make_inner_r_n(newc); 1428| 4.07k| IMMER_TRY { ------------------ | | 49| 4.07k|#define IMMER_TRY try ------------------ 1429| 4.07k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 4.07k| auto newr = newn->relaxed(); 1431| 4.07k| newr->d.count = count - idx; 1432| 4.07k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 4.07k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 4.07k, False: 0] ------------------ 1434| 4.07k| pos.copy_sizes(idx + 1, 1435| 4.07k| newr->d.count - 1, 1436| 4.07k| newr->d.sizes[0], 1437| 4.07k| newr->d.sizes + 1); 1438| 4.07k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 4.07k, False: 0] ------------------ 1439| 4.07k| pos.size() - dropped_size); 1440| 4.07k| newn->inner()[0] = get<1>(subs); 1441| 4.07k| std::copy(n->inner() + idx + 1, 1442| 4.07k| n->inner() + count, 1443| 4.07k| newn->inner() + 1); 1444| 4.07k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 4.07k| return std::make_tuple(pos.shift(), newn); 1446| 4.07k| } 1447| 4.07k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 4.07k| } 1452| 4.07k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 8.18k| { 1415| 8.18k| auto idx = pos.subindex(first); 1416| 8.18k| auto count = pos.count(); 1417| 8.18k| auto left_size = pos.size_before(idx); 1418| 8.18k| auto child_size = pos.size_sbh(idx, left_size); 1419| 8.18k| auto dropped_size = first; 1420| 8.18k| auto child_dropped_size = dropped_size - left_size; 1421| 8.18k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 8.18k, Folded] | Branch (1421:25): [True: 5.10k, False: 3.08k] | Branch (1421:45): [True: 2.48k, False: 2.61k] ------------------ 1422| 2.48k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 5.70k| } else { 1424| 5.70k| using std::get; 1425| 5.70k| auto n = pos.node(); 1426| 5.70k| auto newc = count - idx; 1427| 5.70k| auto newn = node_t::make_inner_r_n(newc); 1428| 5.70k| IMMER_TRY { ------------------ | | 49| 5.70k|#define IMMER_TRY try ------------------ 1429| 5.70k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 5.70k| auto newr = newn->relaxed(); 1431| 5.70k| newr->d.count = count - idx; 1432| 5.70k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 5.70k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 5.70k, False: 0] ------------------ 1434| 5.70k| pos.copy_sizes(idx + 1, 1435| 5.70k| newr->d.count - 1, 1436| 5.70k| newr->d.sizes[0], 1437| 5.70k| newr->d.sizes + 1); 1438| 5.70k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 5.70k, False: 0] ------------------ 1439| 5.70k| pos.size() - dropped_size); 1440| 5.70k| newn->inner()[0] = get<1>(subs); 1441| 5.70k| std::copy(n->inner() + idx + 1, 1442| 5.70k| n->inner() + count, 1443| 5.70k| newn->inner() + 1); 1444| 5.70k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 5.70k| return std::make_tuple(pos.shift(), newn); 1446| 5.70k| } 1447| 5.70k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 5.70k| } 1452| 8.18k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE11visit_innerIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 778| { 1415| 778| auto idx = pos.subindex(first); 1416| 778| auto count = pos.count(); 1417| 778| auto left_size = pos.size_before(idx); 1418| 778| auto child_size = pos.size_sbh(idx, left_size); 1419| 778| auto dropped_size = first; 1420| 778| auto child_dropped_size = dropped_size - left_size; 1421| 778| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 778, Folded] | Branch (1421:25): [True: 323, False: 455] | Branch (1421:45): [True: 0, False: 323] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 778| } else { 1424| 778| using std::get; 1425| 778| auto n = pos.node(); 1426| 778| auto newc = count - idx; 1427| 778| auto newn = node_t::make_inner_r_n(newc); 1428| 778| IMMER_TRY { ------------------ | | 49| 778|#define IMMER_TRY try ------------------ 1429| 778| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 778| auto newr = newn->relaxed(); 1431| 778| newr->d.count = count - idx; 1432| 778| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 778| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 778, False: 0] ------------------ 1434| 778| pos.copy_sizes(idx + 1, 1435| 778| newr->d.count - 1, 1436| 778| newr->d.sizes[0], 1437| 778| newr->d.sizes + 1); 1438| 778| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 778, False: 0] ------------------ 1439| 778| pos.size() - dropped_size); 1440| 778| newn->inner()[0] = get<1>(subs); 1441| 778| std::copy(n->inner() + idx + 1, 1442| 778| n->inner() + count, 1443| 778| newn->inner() + 1); 1444| 778| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 778| return std::make_tuple(pos.shift(), newn); 1446| 778| } 1447| 778| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 778| } 1452| 778| } _ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_11relaxed_posIT_EEPSE_jSG_jm: 2001| 10.0k|{ 2002| 10.0k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 10.0k| .visit(concat_trees_left_visitor{}, 2004| 10.0k| empty_leaf_pos{}, 2005| 10.0k| rroot, 2006| 10.0k| rshift, 2007| 10.0k| rsize) 2008| 10.0k| .realize(); 2009| 10.0k|} _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_25singleton_regular_sub_posISC_EENS1_14empty_leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 10.0k| { 1972| 10.0k| return visit_maybe_relaxed_sub( 1973| 10.0k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 10.0k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 7.28k| { 1959| 7.28k| return concat_inners(lpos, tpos, rpos); 1960| 7.28k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 28.5k|{ 1873| 28.5k| auto lshift = lpos.shift(); 1874| 28.5k| auto rshift = rpos.shift(); 1875| 28.5k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 28.5k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 28.5k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 21.5k, False: 6.97k] ------------------ 1879| 21.5k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 21.5k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 21.5k| } else { 1882| 6.97k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 6.97k, False: 0] ------------------ 1883| 6.97k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 6.97k] | Branch (1883:9): [True: 6.97k, False: 0] | Branch (1883:9): [True: 6.97k, False: 0] ------------------ 1884| 6.97k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 6.97k| return concat_rebalance(lpos, cpos, rpos); 1886| 6.97k| } 1887| 28.5k|} _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8each_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1512| 17.2M| { 1513| 17.2M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.38M, False: 15.8M] ------------------ 1514| 1.38M| auto s = size_t{}; 1515| 5.53M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 4.15M, False: 1.38M] ------------------ 1516| 4.15M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 4.15M| s = sizes_[i]; 1518| 4.15M| } 1519| 15.8M| } else { 1520| 43.6M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 27.8M, False: 15.8M] ------------------ 1521| 27.8M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 27.8M| .visit(v, args...); 1523| 15.8M| } 1524| 17.2M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 13.3M| { 1734| 13.3M| auto count = p.count(); 1735| 13.3M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 13.3M, False: 0] ------------------ 1736| 13.3M| plan.counts[plan.n++] = count; 1737| 13.3M| plan.total += count; 1738| 13.3M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 155M| { 1734| 155M| auto count = p.count(); 1735| 155M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 155M, False: 0] ------------------ 1736| 155M| plan.counts[plan.n++] = count; 1737| 155M| plan.total += count; 1738| 155M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE7shuffleEj: 1762| 17.2M| { 1763| | // gcc seems to not really understand this code... :( 1764| 17.2M|#if !defined(_MSC_VER) 1765| 17.2M|#pragma GCC diagnostic push 1766| 17.2M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 17.2M|#endif 1768| 17.2M| constexpr count_t rrb_extras = 2; 1769| 17.2M| constexpr count_t rrb_invariant = 1; 1770| 17.2M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 1.38M, False: 15.8M] ------------------ 1771| 17.2M| const auto branches = count_t{1} << bits; 1772| 17.2M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 17.2M| count_t i = 0; 1774| 21.8M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 4.59M, False: 17.2M] ------------------ 1775| | // skip ok nodes 1776| 10.4M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 5.83M, False: 4.59M] ------------------ 1777| 5.83M| i++; 1778| 4.59M| assert(i < n); ------------------ | Branch (1778:13): [True: 4.59M, False: 0] ------------------ 1779| | // short node, redistribute 1780| 4.59M| auto remaining = counts[i]; 1781| 17.2M| do { 1782| 17.2M| auto next = counts[i + 1]; 1783| 17.2M| auto count = std::min(remaining + next, branches); 1784| 17.2M| counts[i] = count; 1785| 17.2M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 17.2M, False: 0] ------------------ 1786| 17.2M| remaining += next - count; 1787| 17.2M| ++i; 1788| 17.2M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 12.6M, False: 4.59M] ------------------ 1789| | // remove node 1790| 4.59M| std::move(counts + i + 1, counts + n, counts + i); 1791| 4.59M| --n; 1792| 4.59M| --i; 1793| 4.59M| } 1794| 17.2M|#if !defined(_MSC_VER) 1795| 17.2M|#pragma GCC diagnostic pop 1796| 17.2M|#endif 1797| 17.2M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 1478| 34.5M| auto shift() const { return shift_; } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEC2EjPjj: 1577| 17.2M| : curr_{counts} 1578| 17.2M| , n_{n} 1579| 17.2M| , result_{ 1580| 17.2M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 17.2M| { 1582| 17.2M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEC2EjPSC_m: 1481| 17.2M| : shift_{s} 1482| 17.2M| , count_{1} 1483| 17.2M| , nodes_{n0} 1484| 17.2M| , sizes_{s0} 1485| 17.2M| { 1486| 17.2M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8each_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1512| 17.2M| { 1513| 17.2M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.38M, False: 15.8M] ------------------ 1514| 1.38M| auto s = size_t{}; 1515| 5.53M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 4.15M, False: 1.38M] ------------------ 1516| 4.15M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 4.15M| s = sizes_[i]; 1518| 4.15M| } 1519| 15.8M| } else { 1520| 43.6M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 27.8M, False: 15.8M] ------------------ 1521| 27.8M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 27.8M| .visit(v, args...); 1523| 15.8M| } 1524| 17.2M| } _ZN5immer6detail4rbts21concat_merger_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1721| 13.3M| { 1722| 13.3M| merger.merge_leaf(p); 1723| 13.3M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_: 1614| 13.3M| { 1615| 13.3M| auto from = p.node(); 1616| 13.3M| auto from_size = p.size(); 1617| 13.3M| auto from_count = p.count(); 1618| 13.3M| assert(from_size); ------------------ | Branch (1618:9): [True: 13.3M, False: 0] ------------------ 1619| 13.3M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 13.0M, False: 204k] | Branch (1619:21): [True: 12.9M, False: 98.1k] ------------------ 1620| 12.9M| add_child(from, from_size); 1621| 12.9M| from->inc(); 1622| 12.9M| } else { 1623| 302k| auto from_offset = count_t{}; 1624| 302k| auto from_data = from->leaf(); 1625| 405k| do { 1626| 405k| if (!to_) { ------------------ | Branch (1626:21): [True: 200k, False: 204k] ------------------ 1627| 200k| to_ = node_t::make_leaf_n(*curr_); 1628| 200k| to_offset_ = 0; 1629| 200k| } 1630| 405k| auto data = to_->leaf(); 1631| 405k| auto to_copy = 1632| 405k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 405k| detail::uninitialized_copy(from_data + from_offset, 1634| 405k| from_data + from_offset + to_copy, 1635| 405k| data + to_offset_); 1636| 405k| to_offset_ += to_copy; 1637| 405k| from_offset += to_copy; 1638| 405k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 200k, False: 204k] ------------------ 1639| 200k| add_child(to_, to_offset_); 1640| 200k| to_ = nullptr; 1641| 200k| } 1642| 405k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 102k, False: 302k] ------------------ 1643| 302k| } 1644| 13.3M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9add_childEPSC_m: 1589| 173M| { 1590| 173M| assert(size); ------------------ | Branch (1590:9): [True: 173M, False: 0] ------------------ 1591| 173M| ++curr_; 1592| 173M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 173M| auto relaxed = parent->relaxed(); 1594| 173M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 12.0M, False: 161M] ------------------ 1595| 12.0M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 12.0M, False: 0] ------------------ 1596| 12.0M| n_ -= branches; 1597| 12.0M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 12.0M| relaxed = parent->relaxed(); 1599| 12.0M| result_.nodes_[result_.count_] = parent; 1600| 12.0M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 12.0M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 12.0M, False: 0] ------------------ 1602| 12.0M| ++result_.count_; 1603| 12.0M| } 1604| 173M| auto idx = relaxed->d.count++; 1605| 173M| result_.sizes_[result_.count_ - 1] += size; 1606| 173M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 173M, False: 0] ------------------ 1607| 173M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 143M, False: 29.2M] ------------------ 1608| 173M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 173M, False: 0] ------------------ 1609| 173M| parent->inner()[idx] = p; 1610| 173M| }; _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 155M| { 1716| 155M| merger.merge_inner(p); 1717| 155M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 155M| { 1649| 155M| auto from = p.node(); 1650| 155M| auto from_size = p.size(); 1651| 155M| auto from_count = p.count(); 1652| 155M| assert(from_size); ------------------ | Branch (1652:9): [True: 155M, False: 0] ------------------ 1653| 155M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 140M, False: 15.5M] | Branch (1653:21): [True: 136M, False: 3.56M] ------------------ 1654| 136M| add_child(from, from_size); 1655| 136M| from->inc(); 1656| 136M| } else { 1657| 19.0M| auto from_offset = count_t{}; 1658| 19.0M| auto from_data = from->inner(); 1659| 30.1M| do { 1660| 30.1M| if (!to_) { ------------------ | Branch (1660:21): [True: 14.5M, False: 15.5M] ------------------ 1661| 14.5M| to_ = node_t::make_inner_r_n(*curr_); 1662| 14.5M| to_offset_ = 0; 1663| 14.5M| to_size_ = 0; 1664| 14.5M| } 1665| 30.1M| auto data = to_->inner(); 1666| 30.1M| auto to_copy = 1667| 30.1M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 30.1M| std::copy(from_data + from_offset, 1669| 30.1M| from_data + from_offset + to_copy, 1670| 30.1M| data + to_offset_); 1671| 30.1M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 30.1M| auto sizes = to_->relaxed()->d.sizes; 1673| 30.1M| p.copy_sizes( 1674| 30.1M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 30.1M| to_offset_ += to_copy; 1676| 30.1M| from_offset += to_copy; 1677| 30.1M| to_size_ = sizes[to_offset_ - 1]; 1678| 30.1M| assert(to_size_); ------------------ | Branch (1678:17): [True: 30.1M, False: 0] ------------------ 1679| 30.1M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 14.5M, False: 15.5M] ------------------ 1680| 14.5M| to_->relaxed()->d.count = to_offset_; 1681| 14.5M| add_child(to_, to_size_); 1682| 14.5M| to_ = nullptr; 1683| 14.5M| } 1684| 30.1M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 11.0M, False: 19.0M] ------------------ 1685| 19.0M| } 1686| 155M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE6finishEv: 1689| 17.2M| { 1690| 17.2M| assert(!to_); ------------------ | Branch (1690:9): [True: 17.2M, False: 0] ------------------ 1691| 17.2M| return result_; 1692| 17.2M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8each_subINS1_11dec_visitorEJEEEvT_DpOT0_: 1512| 17.2M| { 1513| 17.2M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.38M, False: 15.8M] ------------------ 1514| 1.38M| auto s = size_t{}; 1515| 5.53M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 4.15M, False: 1.38M] ------------------ 1516| 4.15M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 4.15M| s = sizes_[i]; 1518| 4.15M| } 1519| 15.8M| } else { 1520| 43.6M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 27.8M, False: 15.8M] ------------------ 1521| 27.8M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 27.8M| .visit(v, args...); 1523| 15.8M| } 1524| 17.2M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEC2EjPSC_mSE_mSE_m: 1503| 1.37M| : shift_{s} 1504| 1.37M| , count_{3} 1505| 1.37M| , nodes_{n0, n1, n2} 1506| 1.37M| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 1.37M| { 1508| 1.37M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEC2EjPSC_mSE_m: 1489| 10.0k| : shift_{s} 1490| 10.0k| , count_{2} 1491| 10.0k| , nodes_{n0, n1} 1492| 10.0k| , sizes_{s0, s0 + s1} 1493| 10.0k| { 1494| 10.0k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 21.2k| { 1918| 21.2k| return concat_inners(lpos, tpos, rpos); 1919| 21.2k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 310| { 1918| 310| return concat_inners(lpos, tpos, rpos); 1919| 310| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 3.06k|{ 1873| 3.06k| auto lshift = lpos.shift(); 1874| 3.06k| auto rshift = rpos.shift(); 1875| 3.06k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 3.06k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 3.06k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 619, False: 2.44k] ------------------ 1879| 619| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 619| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.44k| } else { 1882| 2.44k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.44k, False: 0] ------------------ 1883| 2.44k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.44k] | Branch (1883:9): [True: 2.44k, False: 0] | Branch (1883:9): [True: 2.44k, False: 0] ------------------ 1884| 2.44k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.44k| return concat_rebalance(lpos, cpos, rpos); 1886| 2.44k| } 1887| 3.06k|} _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_8full_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 945| { 1918| 945| return concat_inners(lpos, tpos, rpos); 1919| 945| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 945|{ 1873| 945| auto lshift = lpos.shift(); 1874| 945| auto rshift = rpos.shift(); 1875| 945| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 945] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 945| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 326, False: 619] ------------------ 1879| 326| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 326| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 619| } else { 1882| 619| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 619, False: 0] ------------------ 1883| 619| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 619] | Branch (1883:9): [True: 619, False: 0] | Branch (1883:9): [True: 619, False: 0] ------------------ 1884| 619| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 619| return concat_rebalance(lpos, cpos, rpos); 1886| 619| } 1887| 945|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 770|{ 1824| 770| auto plan = concat_rebalance_plan{}; 1825| 770| plan.fill(lpos, cpos, rpos); 1826| 770| plan.shuffle(cpos.shift()); 1827| 770| IMMER_TRY { ------------------ | | 49| 770|#define IMMER_TRY try ------------------ 1828| 770| return plan.merge(lpos, cpos, rpos); 1829| 770| } 1830| 770| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 770|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_8full_posISH_EEEEvOT_OT0_OT1_: 1752| 770| { 1753| 770| assert(n == 0u); ------------------ | Branch (1753:9): [True: 770, False: 0] ------------------ 1754| 770| assert(total == 0u); ------------------ | Branch (1754:9): [True: 770, False: 0] ------------------ 1755| 770| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 770| lpos.each_left_sub(visitor_t{}, *this); 1757| 770| cpos.each_sub(visitor_t{}, *this); 1758| 770| rpos.each_right_sub(visitor_t{}, *this); 1759| 770| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 4.77M| { 1734| 4.77M| auto count = p.count(); 1735| 4.77M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 4.77M, False: 0] ------------------ 1736| 4.77M| plan.counts[plan.n++] = count; 1737| 4.77M| plan.total += count; 1738| 4.77M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 574k| { 1734| 574k| auto count = p.count(); 1735| 574k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 574k, False: 0] ------------------ 1736| 574k| plan.counts[plan.n++] = count; 1737| 574k| plan.total += count; 1738| 574k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_8full_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 770| { 1803| 770| using node_t = node_type; 1804| 770| using merger_t = concat_merger; 1805| 770| using visitor_t = concat_merger_visitor; 1806| 770| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 770| IMMER_TRY { ------------------ | | 49| 770|#define IMMER_TRY try ------------------ 1808| 770| lpos.each_left_sub(visitor_t{}, merger); 1809| 770| cpos.each_sub(visitor_t{}, merger); 1810| 770| rpos.each_right_sub(visitor_t{}, merger); 1811| 770| cpos.each_sub(dec_visitor{}); 1812| 770| return merger.finish(); 1813| 770| } 1814| 770| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 770| } _ZN5immer6detail4rbts21concat_merger_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1721| 4.77M| { 1722| 4.77M| merger.merge_leaf(p); 1723| 4.77M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10merge_leafIRNS1_13full_leaf_posISC_EEEEvOT_: 1614| 4.77M| { 1615| 4.77M| auto from = p.node(); 1616| 4.77M| auto from_size = p.size(); 1617| 4.77M| auto from_count = p.count(); 1618| 4.77M| assert(from_size); ------------------ | Branch (1618:9): [True: 4.77M, False: 0] ------------------ 1619| 4.77M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 4.77M, False: 0] | Branch (1619:21): [True: 4.77M, False: 0] ------------------ 1620| 4.77M| add_child(from, from_size); 1621| 4.77M| from->inc(); 1622| 4.77M| } else { 1623| 0| auto from_offset = count_t{}; 1624| 0| auto from_data = from->leaf(); 1625| 0| do { 1626| 0| if (!to_) { ------------------ | Branch (1626:21): [True: 0, False: 0] ------------------ 1627| 0| to_ = node_t::make_leaf_n(*curr_); 1628| 0| to_offset_ = 0; 1629| 0| } 1630| 0| auto data = to_->leaf(); 1631| 0| auto to_copy = 1632| 0| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 0| detail::uninitialized_copy(from_data + from_offset, 1634| 0| from_data + from_offset + to_copy, 1635| 0| data + to_offset_); 1636| 0| to_offset_ += to_copy; 1637| 0| from_offset += to_copy; 1638| 0| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 0, False: 0] ------------------ 1639| 0| add_child(to_, to_offset_); 1640| 0| to_ = nullptr; 1641| 0| } 1642| 0| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 0, False: 0] ------------------ 1643| 0| } 1644| 4.77M| } _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 574k| { 1716| 574k| merger.merge_inner(p); 1717| 574k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 574k| { 1649| 574k| auto from = p.node(); 1650| 574k| auto from_size = p.size(); 1651| 574k| auto from_count = p.count(); 1652| 574k| assert(from_size); ------------------ | Branch (1652:9): [True: 574k, False: 0] ------------------ 1653| 574k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 574k, False: 0] | Branch (1653:21): [True: 574k, False: 0] ------------------ 1654| 574k| add_child(from, from_size); 1655| 574k| from->inc(); 1656| 574k| } else { 1657| 0| auto from_offset = count_t{}; 1658| 0| auto from_data = from->inner(); 1659| 0| do { 1660| 0| if (!to_) { ------------------ | Branch (1660:21): [True: 0, False: 0] ------------------ 1661| 0| to_ = node_t::make_inner_r_n(*curr_); 1662| 0| to_offset_ = 0; 1663| 0| to_size_ = 0; 1664| 0| } 1665| 0| auto data = to_->inner(); 1666| 0| auto to_copy = 1667| 0| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 0| std::copy(from_data + from_offset, 1669| 0| from_data + from_offset + to_copy, 1670| 0| data + to_offset_); 1671| 0| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 0| auto sizes = to_->relaxed()->d.sizes; 1673| 0| p.copy_sizes( 1674| 0| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 0| to_offset_ += to_copy; 1676| 0| from_offset += to_copy; 1677| 0| to_size_ = sizes[to_offset_ - 1]; 1678| 0| assert(to_size_); ------------------ | Branch (1678:17): [True: 0, False: 0] ------------------ 1679| 0| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 0, False: 0] ------------------ 1680| 0| to_->relaxed()->d.count = to_offset_; 1681| 0| add_child(to_, to_size_); 1682| 0| to_ = nullptr; 1683| 0| } 1684| 0| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 0, False: 0] ------------------ 1685| 0| } 1686| 574k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 619| { 1945| 619| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 619| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 3.06k| { 1925| 3.06k| return concat_leafs(lpos, tpos, rpos); 1926| 3.06k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_13full_leaf_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 3.06k|{ 1839| 3.06k| static_assert(Node::bits >= 2, ""); 1840| 3.06k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 3.06k, False: 0] ------------------ 1841| 3.06k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 3.06k, False: 0] ------------------ 1842| 3.06k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 3.06k, False: 0] ------------------ 1843| 3.06k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 3.06k] ------------------ 1844| 0| return { 1845| 0| Node::bits_leaf, 1846| 0| lpos.node()->inc(), 1847| 0| lpos.count(), 1848| 0| tpos.node()->inc(), 1849| 0| tpos.count(), 1850| 0| rpos.node()->inc(), 1851| 0| rpos.count(), 1852| 0| }; 1853| 3.06k| else 1854| 3.06k| return { 1855| 3.06k| Node::bits_leaf, 1856| 3.06k| lpos.node()->inc(), 1857| 3.06k| lpos.count(), 1858| 3.06k| rpos.node()->inc(), 1859| 3.06k| rpos.count(), 1860| 3.06k| }; 1861| 3.06k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 619|{ 1824| 619| auto plan = concat_rebalance_plan{}; 1825| 619| plan.fill(lpos, cpos, rpos); 1826| 619| plan.shuffle(cpos.shift()); 1827| 619| IMMER_TRY { ------------------ | | 49| 619|#define IMMER_TRY try ------------------ 1828| 619| return plan.merge(lpos, cpos, rpos); 1829| 619| } 1830| 619| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 619|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 619| { 1753| 619| assert(n == 0u); ------------------ | Branch (1753:9): [True: 619, False: 0] ------------------ 1754| 619| assert(total == 0u); ------------------ | Branch (1754:9): [True: 619, False: 0] ------------------ 1755| 619| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 619| lpos.each_left_sub(visitor_t{}, *this); 1757| 619| cpos.each_sub(visitor_t{}, *this); 1758| 619| rpos.each_right_sub(visitor_t{}, *this); 1759| 619| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 619| { 1803| 619| using node_t = node_type; 1804| 619| using merger_t = concat_merger; 1805| 619| using visitor_t = concat_merger_visitor; 1806| 619| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 619| IMMER_TRY { ------------------ | | 49| 619|#define IMMER_TRY try ------------------ 1808| 619| lpos.each_left_sub(visitor_t{}, merger); 1809| 619| cpos.each_sub(visitor_t{}, merger); 1810| 619| rpos.each_right_sub(visitor_t{}, merger); 1811| 619| cpos.each_sub(dec_visitor{}); 1812| 619| return merger.finish(); 1813| 619| } 1814| 619| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 619| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 1.81k|{ 1824| 1.81k| auto plan = concat_rebalance_plan{}; 1825| 1.81k| plan.fill(lpos, cpos, rpos); 1826| 1.81k| plan.shuffle(cpos.shift()); 1827| 1.81k| IMMER_TRY { ------------------ | | 49| 1.81k|#define IMMER_TRY try ------------------ 1828| 1.81k| return plan.merge(lpos, cpos, rpos); 1829| 1.81k| } 1830| 1.81k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.81k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISH_EEEEvOT_OT0_OT1_: 1752| 1.81k| { 1753| 1.81k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.81k, False: 0] ------------------ 1754| 1.81k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.81k, False: 0] ------------------ 1755| 1.81k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.81k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.81k| cpos.each_sub(visitor_t{}, *this); 1758| 1.81k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.81k| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 3.48M| { 1734| 3.48M| auto count = p.count(); 1735| 3.48M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 3.48M, False: 0] ------------------ 1736| 3.48M| plan.counts[plan.n++] = count; 1737| 3.48M| plan.total += count; 1738| 3.48M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 1.81k| { 1803| 1.81k| using node_t = node_type; 1804| 1.81k| using merger_t = concat_merger; 1805| 1.81k| using visitor_t = concat_merger_visitor; 1806| 1.81k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.81k| IMMER_TRY { ------------------ | | 49| 1.81k|#define IMMER_TRY try ------------------ 1808| 1.81k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.81k| cpos.each_sub(visitor_t{}, merger); 1810| 1.81k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.81k| cpos.each_sub(dec_visitor{}); 1812| 1.81k| return merger.finish(); 1813| 1.81k| } 1814| 1.81k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.81k| } _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 3.48M| { 1716| 3.48M| merger.merge_inner(p); 1717| 3.48M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_: 1648| 3.48M| { 1649| 3.48M| auto from = p.node(); 1650| 3.48M| auto from_size = p.size(); 1651| 3.48M| auto from_count = p.count(); 1652| 3.48M| assert(from_size); ------------------ | Branch (1652:9): [True: 3.48M, False: 0] ------------------ 1653| 3.48M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 1.94M, False: 1.53M] | Branch (1653:21): [True: 1.94M, False: 0] ------------------ 1654| 1.94M| add_child(from, from_size); 1655| 1.94M| from->inc(); 1656| 1.94M| } else { 1657| 1.53M| auto from_offset = count_t{}; 1658| 1.53M| auto from_data = from->inner(); 1659| 3.06M| do { 1660| 3.06M| if (!to_) { ------------------ | Branch (1660:21): [True: 1.53M, False: 1.53M] ------------------ 1661| 1.53M| to_ = node_t::make_inner_r_n(*curr_); 1662| 1.53M| to_offset_ = 0; 1663| 1.53M| to_size_ = 0; 1664| 1.53M| } 1665| 3.06M| auto data = to_->inner(); 1666| 3.06M| auto to_copy = 1667| 3.06M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 3.06M| std::copy(from_data + from_offset, 1669| 3.06M| from_data + from_offset + to_copy, 1670| 3.06M| data + to_offset_); 1671| 3.06M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 3.06M| auto sizes = to_->relaxed()->d.sizes; 1673| 3.06M| p.copy_sizes( 1674| 3.06M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 3.06M| to_offset_ += to_copy; 1676| 3.06M| from_offset += to_copy; 1677| 3.06M| to_size_ = sizes[to_offset_ - 1]; 1678| 3.06M| assert(to_size_); ------------------ | Branch (1678:17): [True: 3.06M, False: 0] ------------------ 1679| 3.06M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 1.53M, False: 1.53M] ------------------ 1680| 1.53M| to_->relaxed()->d.count = to_offset_; 1681| 1.53M| add_child(to_, to_size_); 1682| 1.53M| to_ = nullptr; 1683| 1.53M| } 1684| 3.06M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.53M, False: 1.53M] ------------------ 1685| 1.53M| } 1686| 3.48M| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 2.44k| { 1945| 2.44k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 2.44k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 6.97k| { 1925| 6.97k| return concat_leafs(lpos, tpos, rpos); 1926| 6.97k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 6.97k|{ 1839| 6.97k| static_assert(Node::bits >= 2, ""); 1840| 6.97k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 6.97k, False: 0] ------------------ 1841| 6.97k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 6.97k, False: 0] ------------------ 1842| 6.97k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 6.97k, False: 0] ------------------ 1843| 6.97k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 6.97k] ------------------ 1844| 0| return { 1845| 0| Node::bits_leaf, 1846| 0| lpos.node()->inc(), 1847| 0| lpos.count(), 1848| 0| tpos.node()->inc(), 1849| 0| tpos.count(), 1850| 0| rpos.node()->inc(), 1851| 0| rpos.count(), 1852| 0| }; 1853| 6.97k| else 1854| 6.97k| return { 1855| 6.97k| Node::bits_leaf, 1856| 6.97k| lpos.node()->inc(), 1857| 6.97k| lpos.count(), 1858| 6.97k| rpos.node()->inc(), 1859| 6.97k| rpos.count(), 1860| 6.97k| }; 1861| 6.97k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 2.44k|{ 1824| 2.44k| auto plan = concat_rebalance_plan{}; 1825| 2.44k| plan.fill(lpos, cpos, rpos); 1826| 2.44k| plan.shuffle(cpos.shift()); 1827| 2.44k| IMMER_TRY { ------------------ | | 49| 2.44k|#define IMMER_TRY try ------------------ 1828| 2.44k| return plan.merge(lpos, cpos, rpos); 1829| 2.44k| } 1830| 2.44k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.44k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_: 1752| 2.44k| { 1753| 2.44k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.44k, False: 0] ------------------ 1754| 2.44k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.44k, False: 0] ------------------ 1755| 2.44k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.44k| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.44k| cpos.each_sub(visitor_t{}, *this); 1758| 2.44k| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.44k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 2.44k| { 1803| 2.44k| using node_t = node_type; 1804| 2.44k| using merger_t = concat_merger; 1805| 2.44k| using visitor_t = concat_merger_visitor; 1806| 2.44k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.44k| IMMER_TRY { ------------------ | | 49| 2.44k|#define IMMER_TRY try ------------------ 1808| 2.44k| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.44k| cpos.each_sub(visitor_t{}, merger); 1810| 2.44k| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.44k| cpos.each_sub(dec_visitor{}); 1812| 2.44k| return merger.finish(); 1813| 2.44k| } 1814| 2.44k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.44k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 202k|{ 1824| 202k| auto plan = concat_rebalance_plan{}; 1825| 202k| plan.fill(lpos, cpos, rpos); 1826| 202k| plan.shuffle(cpos.shift()); 1827| 202k| IMMER_TRY { ------------------ | | 49| 202k|#define IMMER_TRY try ------------------ 1828| 202k| return plan.merge(lpos, cpos, rpos); 1829| 202k| } 1830| 202k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 202k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISH_EEEEvOT_OT0_OT1_: 1752| 202k| { 1753| 202k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 202k, False: 0] ------------------ 1754| 202k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 202k, False: 0] ------------------ 1755| 202k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 202k| lpos.each_left_sub(visitor_t{}, *this); 1757| 202k| cpos.each_sub(visitor_t{}, *this); 1758| 202k| rpos.each_right_sub(visitor_t{}, *this); 1759| 202k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 202k| { 1803| 202k| using node_t = node_type; 1804| 202k| using merger_t = concat_merger; 1805| 202k| using visitor_t = concat_merger_visitor; 1806| 202k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 202k| IMMER_TRY { ------------------ | | 49| 202k|#define IMMER_TRY try ------------------ 1808| 202k| lpos.each_left_sub(visitor_t{}, merger); 1809| 202k| cpos.each_sub(visitor_t{}, merger); 1810| 202k| rpos.each_right_sub(visitor_t{}, merger); 1811| 202k| cpos.each_sub(dec_visitor{}); 1812| 202k| return merger.finish(); 1813| 202k| } 1814| 202k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 202k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 6.97k| { 1945| 6.97k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 6.97k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 6.97k|{ 1824| 6.97k| auto plan = concat_rebalance_plan{}; 1825| 6.97k| plan.fill(lpos, cpos, rpos); 1826| 6.97k| plan.shuffle(cpos.shift()); 1827| 6.97k| IMMER_TRY { ------------------ | | 49| 6.97k|#define IMMER_TRY try ------------------ 1828| 6.97k| return plan.merge(lpos, cpos, rpos); 1829| 6.97k| } 1830| 6.97k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 6.97k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEEvOT_OT0_OT1_: 1752| 6.97k| { 1753| 6.97k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 6.97k, False: 0] ------------------ 1754| 6.97k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 6.97k, False: 0] ------------------ 1755| 6.97k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 6.97k| lpos.each_left_sub(visitor_t{}, *this); 1757| 6.97k| cpos.each_sub(visitor_t{}, *this); 1758| 6.97k| rpos.each_right_sub(visitor_t{}, *this); 1759| 6.97k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 6.97k| { 1803| 6.97k| using node_t = node_type; 1804| 6.97k| using merger_t = concat_merger; 1805| 6.97k| using visitor_t = concat_merger_visitor; 1806| 6.97k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 6.97k| IMMER_TRY { ------------------ | | 49| 6.97k|#define IMMER_TRY try ------------------ 1808| 6.97k| lpos.each_left_sub(visitor_t{}, merger); 1809| 6.97k| cpos.each_sub(visitor_t{}, merger); 1810| 6.97k| rpos.each_right_sub(visitor_t{}, merger); 1811| 6.97k| cpos.each_sub(dec_visitor{}); 1812| 6.97k| return merger.finish(); 1813| 6.97k| } 1814| 6.97k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 6.97k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 2.75k| { 1959| 2.75k| return concat_inners(lpos, tpos, rpos); 1960| 2.75k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7realizeEv: 1527| 1.38M| { 1528| 1.38M| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 82.6k, False: 1.30M] ------------------ 1529| 82.6k| IMMER_TRY { ------------------ | | 49| 82.6k|#define IMMER_TRY try ------------------ 1530| 82.6k| auto result = node_t::make_inner_r_n(count_); 1531| 82.6k| auto r = result->relaxed(); 1532| 82.6k| r->d.count = count_; 1533| 82.6k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 82.6k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 82.6k| return {result, shift_, r}; 1536| 82.6k| } 1537| 82.6k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 1.30M| } else { 1542| 1.30M| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 1.30M, False: 0] ------------------ 1543| 1.30M| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 1.30M| } 1545| 1.38M| } _ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_11relaxed_posIT_EEPSE_jmSG_jSG_jm: 1986| 1.37M|{ 1987| 1.37M| return visit_maybe_relaxed_sub(lroot, 1988| 1.37M| lshift, 1989| 1.37M| lsize, 1990| 1.37M| concat_trees_left_visitor{}, 1991| 1.37M| make_leaf_pos(ltail, ltcount), 1992| 1.37M| rroot, 1993| 1.37M| rshift, 1994| 1.37M| rsize) 1995| 1.37M| .realize(); 1996| 1.37M|} _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_11relaxed_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 1.35M| { 1972| 1.35M| return visit_maybe_relaxed_sub( 1973| 1.35M| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 1.35M| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_11relaxed_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 1.34M| { 1959| 1.34M| return concat_inners(lpos, tpos, rpos); 1960| 1.34M| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 15.6M|{ 1873| 15.6M| auto lshift = lpos.shift(); 1874| 15.6M| auto rshift = rpos.shift(); 1875| 15.6M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 3.59M, False: 12.0M] ------------------ 1876| 3.59M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 3.59M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 12.0M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 173k, False: 11.8M] ------------------ 1879| 173k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 173k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 11.8M| } else { 1882| 11.8M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 11.8M, False: 0] ------------------ 1883| 11.8M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 11.8M] | Branch (1883:9): [True: 11.8M, False: 0] | Branch (1883:9): [True: 11.8M, False: 0] ------------------ 1884| 11.8M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 11.8M| return concat_rebalance(lpos, cpos, rpos); 1886| 11.8M| } 1887| 15.6M|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 3.59M| { 1898| 3.59M| return concat_inners(lpos, tpos, rpos); 1899| 3.59M| } _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 4.70k| { 1898| 4.70k| return concat_inners(lpos, tpos, rpos); 1899| 4.70k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 1.17M|{ 1873| 1.17M| auto lshift = lpos.shift(); 1874| 1.17M| auto rshift = rpos.shift(); 1875| 1.17M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.56k, False: 1.17M] ------------------ 1876| 2.56k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.56k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.17M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 7.10k, False: 1.16M] ------------------ 1879| 7.10k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 7.10k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.16M| } else { 1882| 1.16M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.16M, False: 0] ------------------ 1883| 1.16M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.16M] | Branch (1883:9): [True: 1.16M, False: 0] | Branch (1883:9): [True: 1.16M, False: 0] ------------------ 1884| 1.16M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.16M| return concat_rebalance(lpos, cpos, rpos); 1886| 1.16M| } 1887| 1.17M|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_: 1823| 3.83k|{ 1824| 3.83k| auto plan = concat_rebalance_plan{}; 1825| 3.83k| plan.fill(lpos, cpos, rpos); 1826| 3.83k| plan.shuffle(cpos.shift()); 1827| 3.83k| IMMER_TRY { ------------------ | | 49| 3.83k|#define IMMER_TRY try ------------------ 1828| 3.83k| return plan.merge(lpos, cpos, rpos); 1829| 3.83k| } 1830| 3.83k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.83k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_: 1752| 3.83k| { 1753| 3.83k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.83k, False: 0] ------------------ 1754| 3.83k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.83k, False: 0] ------------------ 1755| 3.83k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.83k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.83k| cpos.each_sub(visitor_t{}, *this); 1758| 3.83k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.83k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 3.83k| { 1803| 3.83k| using node_t = node_type; 1804| 3.83k| using merger_t = concat_merger; 1805| 3.83k| using visitor_t = concat_merger_visitor; 1806| 3.83k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.83k| IMMER_TRY { ------------------ | | 49| 3.83k|#define IMMER_TRY try ------------------ 1808| 3.83k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.83k| cpos.each_sub(visitor_t{}, merger); 1810| 3.83k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.83k| cpos.each_sub(dec_visitor{}); 1812| 3.83k| return merger.finish(); 1813| 3.83k| } 1814| 3.83k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.83k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 1.16M| { 1918| 1.16M| return concat_inners(lpos, tpos, rpos); 1919| 1.16M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 314k| { 1918| 314k| return concat_inners(lpos, tpos, rpos); 1919| 314k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 333k|{ 1873| 333k| auto lshift = lpos.shift(); 1874| 333k| auto rshift = rpos.shift(); 1875| 333k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 1.26k, False: 332k] ------------------ 1876| 1.26k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 1.26k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 332k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 713, False: 331k] ------------------ 1879| 713| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 713| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 331k| } else { 1882| 331k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 331k, False: 0] ------------------ 1883| 331k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 331k] | Branch (1883:9): [True: 331k, False: 0] | Branch (1883:9): [True: 331k, False: 0] ------------------ 1884| 331k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 331k| return concat_rebalance(lpos, cpos, rpos); 1886| 331k| } 1887| 333k|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 1.81k| { 1898| 1.81k| return concat_inners(lpos, tpos, rpos); 1899| 1.81k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_8full_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 17.2k| { 1918| 17.2k| return concat_inners(lpos, tpos, rpos); 1919| 17.2k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 17.2k|{ 1873| 17.2k| auto lshift = lpos.shift(); 1874| 17.2k| auto rshift = rpos.shift(); 1875| 17.2k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 17.2k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 17.2k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 236, False: 17.0k] ------------------ 1879| 236| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 236| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 17.0k| } else { 1882| 17.0k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 17.0k, False: 0] ------------------ 1883| 17.0k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 17.0k] | Branch (1883:9): [True: 17.0k, False: 0] | Branch (1883:9): [True: 17.0k, False: 0] ------------------ 1884| 17.0k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 17.0k| return concat_rebalance(lpos, cpos, rpos); 1886| 17.0k| } 1887| 17.2k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 11.1k| { 1945| 11.1k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 11.1k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 344k| { 1925| 344k| return concat_leafs(lpos, tpos, rpos); 1926| 344k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_13full_leaf_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 344k|{ 1839| 344k| static_assert(Node::bits >= 2, ""); 1840| 344k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 344k, False: 0] ------------------ 1841| 344k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 344k, False: 0] ------------------ 1842| 344k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 344k, False: 0] ------------------ 1843| 344k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 344k, False: 0] ------------------ 1844| 344k| return { 1845| 344k| Node::bits_leaf, 1846| 344k| lpos.node()->inc(), 1847| 344k| lpos.count(), 1848| 344k| tpos.node()->inc(), 1849| 344k| tpos.count(), 1850| 344k| rpos.node()->inc(), 1851| 344k| rpos.count(), 1852| 344k| }; 1853| 0| else 1854| 0| return { 1855| 0| Node::bits_leaf, 1856| 0| lpos.node()->inc(), 1857| 0| lpos.count(), 1858| 0| rpos.node()->inc(), 1859| 0| rpos.count(), 1860| 0| }; 1861| 344k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 7.46k| { 1938| 7.46k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 7.46k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 17.0k|{ 1824| 17.0k| auto plan = concat_rebalance_plan{}; 1825| 17.0k| plan.fill(lpos, cpos, rpos); 1826| 17.0k| plan.shuffle(cpos.shift()); 1827| 17.0k| IMMER_TRY { ------------------ | | 49| 17.0k|#define IMMER_TRY try ------------------ 1828| 17.0k| return plan.merge(lpos, cpos, rpos); 1829| 17.0k| } 1830| 17.0k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 17.0k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 17.0k| { 1753| 17.0k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 17.0k, False: 0] ------------------ 1754| 17.0k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 17.0k, False: 0] ------------------ 1755| 17.0k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 17.0k| lpos.each_left_sub(visitor_t{}, *this); 1757| 17.0k| cpos.each_sub(visitor_t{}, *this); 1758| 17.0k| rpos.each_right_sub(visitor_t{}, *this); 1759| 17.0k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 17.0k| { 1803| 17.0k| using node_t = node_type; 1804| 17.0k| using merger_t = concat_merger; 1805| 17.0k| using visitor_t = concat_merger_visitor; 1806| 17.0k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 17.0k| IMMER_TRY { ------------------ | | 49| 17.0k|#define IMMER_TRY try ------------------ 1808| 17.0k| lpos.each_left_sub(visitor_t{}, merger); 1809| 17.0k| cpos.each_sub(visitor_t{}, merger); 1810| 17.0k| rpos.each_right_sub(visitor_t{}, merger); 1811| 17.0k| cpos.each_sub(dec_visitor{}); 1812| 17.0k| return merger.finish(); 1813| 17.0k| } 1814| 17.0k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 17.0k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 333k| { 1945| 333k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 333k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 1.03M| { 1925| 1.03M| return concat_leafs(lpos, tpos, rpos); 1926| 1.03M| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 1.03M|{ 1839| 1.03M| static_assert(Node::bits >= 2, ""); 1840| 1.03M| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 1.03M, False: 0] ------------------ 1841| 1.03M| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 1.03M, False: 0] ------------------ 1842| 1.03M| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 1.03M, False: 0] ------------------ 1843| 1.03M| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 1.03M, False: 0] ------------------ 1844| 1.03M| return { 1845| 1.03M| Node::bits_leaf, 1846| 1.03M| lpos.node()->inc(), 1847| 1.03M| lpos.count(), 1848| 1.03M| tpos.node()->inc(), 1849| 1.03M| tpos.count(), 1850| 1.03M| rpos.node()->inc(), 1851| 1.03M| rpos.count(), 1852| 1.03M| }; 1853| 0| else 1854| 0| return { 1855| 0| Node::bits_leaf, 1856| 0| lpos.node()->inc(), 1857| 0| lpos.count(), 1858| 0| rpos.node()->inc(), 1859| 0| rpos.count(), 1860| 0| }; 1861| 1.03M|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 8.87k| { 1938| 8.87k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 8.87k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EEOT0_OT1_OT2_: 1823| 331k|{ 1824| 331k| auto plan = concat_rebalance_plan{}; 1825| 331k| plan.fill(lpos, cpos, rpos); 1826| 331k| plan.shuffle(cpos.shift()); 1827| 331k| IMMER_TRY { ------------------ | | 49| 331k|#define IMMER_TRY try ------------------ 1828| 331k| return plan.merge(lpos, cpos, rpos); 1829| 331k| } 1830| 331k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 331k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EEvOT_OT0_OT1_: 1752| 331k| { 1753| 331k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 331k, False: 0] ------------------ 1754| 331k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 331k, False: 0] ------------------ 1755| 331k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 331k| lpos.each_left_sub(visitor_t{}, *this); 1757| 331k| cpos.each_sub(visitor_t{}, *this); 1758| 331k| rpos.each_right_sub(visitor_t{}, *this); 1759| 331k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSN_OT1_: 1802| 331k| { 1803| 331k| using node_t = node_type; 1804| 331k| using merger_t = concat_merger; 1805| 331k| using visitor_t = concat_merger_visitor; 1806| 331k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 331k| IMMER_TRY { ------------------ | | 49| 331k|#define IMMER_TRY try ------------------ 1808| 331k| lpos.each_left_sub(visitor_t{}, merger); 1809| 331k| cpos.each_sub(visitor_t{}, merger); 1810| 331k| rpos.each_right_sub(visitor_t{}, merger); 1811| 331k| cpos.each_sub(dec_visitor{}); 1812| 331k| return merger.finish(); 1813| 331k| } 1814| 331k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 331k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 1.03M| { 1945| 1.03M| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 1.03M| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 1.47M| { 1938| 1.47M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.47M| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 1.16M|{ 1824| 1.16M| auto plan = concat_rebalance_plan{}; 1825| 1.16M| plan.fill(lpos, cpos, rpos); 1826| 1.16M| plan.shuffle(cpos.shift()); 1827| 1.16M| IMMER_TRY { ------------------ | | 49| 1.16M|#define IMMER_TRY try ------------------ 1828| 1.16M| return plan.merge(lpos, cpos, rpos); 1829| 1.16M| } 1830| 1.16M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.16M|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEEvOT_OT0_OT1_: 1752| 1.16M| { 1753| 1.16M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.16M, False: 0] ------------------ 1754| 1.16M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.16M, False: 0] ------------------ 1755| 1.16M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.16M| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.16M| cpos.each_sub(visitor_t{}, *this); 1758| 1.16M| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.16M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 1.16M| { 1803| 1.16M| using node_t = node_type; 1804| 1.16M| using merger_t = concat_merger; 1805| 1.16M| using visitor_t = concat_merger_visitor; 1806| 1.16M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.16M| IMMER_TRY { ------------------ | | 49| 1.16M|#define IMMER_TRY try ------------------ 1808| 1.16M| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.16M| cpos.each_sub(visitor_t{}, merger); 1810| 1.16M| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.16M| cpos.each_sub(dec_visitor{}); 1812| 1.16M| return merger.finish(); 1813| 1.16M| } 1814| 1.16M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.16M| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_: 1823| 3.61M|{ 1824| 3.61M| auto plan = concat_rebalance_plan{}; 1825| 3.61M| plan.fill(lpos, cpos, rpos); 1826| 3.61M| plan.shuffle(cpos.shift()); 1827| 3.61M| IMMER_TRY { ------------------ | | 49| 3.61M|#define IMMER_TRY try ------------------ 1828| 3.61M| return plan.merge(lpos, cpos, rpos); 1829| 3.61M| } 1830| 3.61M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.61M|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_: 1752| 3.61M| { 1753| 3.61M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.61M, False: 0] ------------------ 1754| 3.61M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.61M, False: 0] ------------------ 1755| 3.61M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.61M| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.61M| cpos.each_sub(visitor_t{}, *this); 1758| 3.61M| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.61M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 3.61M| { 1803| 3.61M| using node_t = node_type; 1804| 3.61M| using merger_t = concat_merger; 1805| 3.61M| using visitor_t = concat_merger_visitor; 1806| 3.61M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.61M| IMMER_TRY { ------------------ | | 49| 3.61M|#define IMMER_TRY try ------------------ 1808| 3.61M| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.61M| cpos.each_sub(visitor_t{}, merger); 1810| 3.61M| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.61M| cpos.each_sub(dec_visitor{}); 1812| 3.61M| return merger.finish(); 1813| 3.61M| } 1814| 3.61M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.61M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 10.7M| { 1918| 10.7M| return concat_inners(lpos, tpos, rpos); 1919| 10.7M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 1.26k| { 1918| 1.26k| return concat_inners(lpos, tpos, rpos); 1919| 1.26k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 34.0k|{ 1873| 34.0k| auto lshift = lpos.shift(); 1874| 34.0k| auto rshift = rpos.shift(); 1875| 34.0k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 22.2k, False: 11.8k] ------------------ 1876| 22.2k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 22.2k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 22.2k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 480, False: 11.3k] ------------------ 1879| 480| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 480| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 11.3k| } else { 1882| 11.3k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 11.3k, False: 0] ------------------ 1883| 11.3k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 11.3k] | Branch (1883:9): [True: 11.3k, False: 0] | Branch (1883:9): [True: 11.3k, False: 0] ------------------ 1884| 11.3k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 11.3k| return concat_rebalance(lpos, cpos, rpos); 1886| 11.3k| } 1887| 34.0k|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 21.7k| { 1898| 21.7k| return concat_inners(lpos, tpos, rpos); 1899| 21.7k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_8full_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 2.34k| { 1918| 2.34k| return concat_inners(lpos, tpos, rpos); 1919| 2.34k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 2.34k|{ 1873| 2.34k| auto lshift = lpos.shift(); 1874| 2.34k| auto rshift = rpos.shift(); 1875| 2.34k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.34k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.34k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 208, False: 2.13k] ------------------ 1879| 208| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 208| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.13k| } else { 1882| 2.13k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.13k, False: 0] ------------------ 1883| 2.13k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.13k] | Branch (1883:9): [True: 2.13k, False: 0] | Branch (1883:9): [True: 2.13k, False: 0] ------------------ 1884| 2.13k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.13k| return concat_rebalance(lpos, cpos, rpos); 1886| 2.13k| } 1887| 2.34k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 544| { 1938| 544| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 544| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 2.13k|{ 1824| 2.13k| auto plan = concat_rebalance_plan{}; 1825| 2.13k| plan.fill(lpos, cpos, rpos); 1826| 2.13k| plan.shuffle(cpos.shift()); 1827| 2.13k| IMMER_TRY { ------------------ | | 49| 2.13k|#define IMMER_TRY try ------------------ 1828| 2.13k| return plan.merge(lpos, cpos, rpos); 1829| 2.13k| } 1830| 2.13k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.13k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 2.13k| { 1753| 2.13k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.13k, False: 0] ------------------ 1754| 2.13k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.13k, False: 0] ------------------ 1755| 2.13k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.13k| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.13k| cpos.each_sub(visitor_t{}, *this); 1758| 2.13k| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.13k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 2.13k| { 1803| 2.13k| using node_t = node_type; 1804| 2.13k| using merger_t = concat_merger; 1805| 2.13k| using visitor_t = concat_merger_visitor; 1806| 2.13k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.13k| IMMER_TRY { ------------------ | | 49| 2.13k|#define IMMER_TRY try ------------------ 1808| 2.13k| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.13k| cpos.each_sub(visitor_t{}, merger); 1810| 2.13k| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.13k| cpos.each_sub(dec_visitor{}); 1812| 2.13k| return merger.finish(); 1813| 2.13k| } 1814| 2.13k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.13k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 1.11k| { 1938| 1.11k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.11k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 11.3k|{ 1824| 11.3k| auto plan = concat_rebalance_plan{}; 1825| 11.3k| plan.fill(lpos, cpos, rpos); 1826| 11.3k| plan.shuffle(cpos.shift()); 1827| 11.3k| IMMER_TRY { ------------------ | | 49| 11.3k|#define IMMER_TRY try ------------------ 1828| 11.3k| return plan.merge(lpos, cpos, rpos); 1829| 11.3k| } 1830| 11.3k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 11.3k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_: 1752| 11.3k| { 1753| 11.3k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 11.3k, False: 0] ------------------ 1754| 11.3k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 11.3k, False: 0] ------------------ 1755| 11.3k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 11.3k| lpos.each_left_sub(visitor_t{}, *this); 1757| 11.3k| cpos.each_sub(visitor_t{}, *this); 1758| 11.3k| rpos.each_right_sub(visitor_t{}, *this); 1759| 11.3k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 11.3k| { 1803| 11.3k| using node_t = node_type; 1804| 11.3k| using merger_t = concat_merger; 1805| 11.3k| using visitor_t = concat_merger_visitor; 1806| 11.3k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 11.3k| IMMER_TRY { ------------------ | | 49| 11.3k|#define IMMER_TRY try ------------------ 1808| 11.3k| lpos.each_left_sub(visitor_t{}, merger); 1809| 11.3k| cpos.each_sub(visitor_t{}, merger); 1810| 11.3k| rpos.each_right_sub(visitor_t{}, merger); 1811| 11.3k| cpos.each_sub(dec_visitor{}); 1812| 11.3k| return merger.finish(); 1813| 11.3k| } 1814| 11.3k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 11.3k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 10.5M| { 1938| 10.5M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 10.5M| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EEOT0_OT1_OT2_: 1823| 11.8M|{ 1824| 11.8M| auto plan = concat_rebalance_plan{}; 1825| 11.8M| plan.fill(lpos, cpos, rpos); 1826| 11.8M| plan.shuffle(cpos.shift()); 1827| 11.8M| IMMER_TRY { ------------------ | | 49| 11.8M|#define IMMER_TRY try ------------------ 1828| 11.8M| return plan.merge(lpos, cpos, rpos); 1829| 11.8M| } 1830| 11.8M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 11.8M|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EEvOT_OT0_OT1_: 1752| 11.8M| { 1753| 11.8M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 11.8M, False: 0] ------------------ 1754| 11.8M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 11.8M, False: 0] ------------------ 1755| 11.8M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 11.8M| lpos.each_left_sub(visitor_t{}, *this); 1757| 11.8M| cpos.each_sub(visitor_t{}, *this); 1758| 11.8M| rpos.each_right_sub(visitor_t{}, *this); 1759| 11.8M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSN_OT1_: 1802| 11.8M| { 1803| 11.8M| using node_t = node_type; 1804| 11.8M| using merger_t = concat_merger; 1805| 11.8M| using visitor_t = concat_merger_visitor; 1806| 11.8M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 11.8M| IMMER_TRY { ------------------ | | 49| 11.8M|#define IMMER_TRY try ------------------ 1808| 11.8M| lpos.each_left_sub(visitor_t{}, merger); 1809| 11.8M| cpos.each_sub(visitor_t{}, merger); 1810| 11.8M| rpos.each_right_sub(visitor_t{}, merger); 1811| 11.8M| cpos.each_sub(dec_visitor{}); 1812| 11.8M| return merger.finish(); 1813| 11.8M| } 1814| 11.8M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 11.8M| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 11.0k| { 1959| 11.0k| return concat_inners(lpos, tpos, rpos); 1960| 11.0k| } _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 23.2k| { 1972| 23.2k| return visit_maybe_relaxed_sub( 1973| 23.2k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 23.2k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 6.19k| { 1959| 6.19k| return concat_inners(lpos, tpos, rpos); 1960| 6.19k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 17.0k| { 1959| 17.0k| return concat_inners(lpos, tpos, rpos); 1960| 17.0k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j: 680| 197k| { 681| 197k| auto node = pos.node(); 682| 197k| auto level = pos.shift(); 683| 197k| auto idx = pos.count() - 1; 684| 197k| auto children = pos.size(idx); 685| 197k| auto new_idx = 686| 197k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 4.25k, False: 193k] | Branch (686:47): [True: 292, False: 193k] ------------------ 687| 197k| auto new_child = static_cast(nullptr); 688| 197k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 197k, Folded] | Branch (688:38): [True: 194k, False: 2.73k] ------------------ 689| | 690| 197k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 1.87k, False: 195k] ------------------ 691| 1.87k| return nullptr; 692| 195k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 193k, False: 2.67k] ------------------ 693| 193k| new_child = 694| 193k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 191k, False: 1.86k] ------------------ 695| 193k| : pos.last_oh_csh( 696| 1.86k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 193k| if (!new_child) { ------------------ | Branch (697:17): [True: 2.03k, False: 191k] ------------------ 698| 2.03k| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 594, False: 1.44k] ------------------ 699| 594| new_child = node_t::make_path_e(e, level - B, tail); 700| 1.44k| else 701| 1.44k| return nullptr; 702| 2.03k| } 703| 193k| } else 704| 2.67k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 194k| if (mutate) { ------------------ | Branch (706:13): [True: 192k, False: 1.96k] ------------------ 707| 192k| auto count = new_idx + 1; 708| 192k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 192k| node->inner()[new_idx] = new_child; 710| 192k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 192k| relaxed->d.count = count; 712| 192k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 192k, False: 0] ------------------ 713| 192k| return node; 714| 192k| } else { 715| 1.96k| IMMER_TRY { ------------------ | | 49| 1.96k|#define IMMER_TRY try ------------------ 716| 1.96k| auto count = new_idx + 1; 717| 1.96k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 1.96k| auto relaxed = new_node->relaxed(); 719| 1.96k| new_node->inner()[new_idx] = new_child; 720| 1.96k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 1.96k| relaxed->d.count = count; 722| 1.96k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 1.96k, False: 0] ------------------ 723| 1.96k| if (Mutating) ------------------ | Branch (723:21): [True: 1.96k, Folded] ------------------ 724| 1.96k| pos.visit(dec_visitor{}); 725| 1.96k| return new_node; 726| 1.96k| } 727| 1.96k| IMMER_CATCH (...) { 728| 0| auto shift = pos.shift(); 729| 0| auto size = new_idx == idx ? children + ts : ts; ------------------ | Branch (729:30): [True: 0, False: 0] ------------------ 730| 0| if (shift > BL) { ------------------ | Branch (730:21): [True: 0, False: 0] ------------------ 731| 0| tail->inc(); 732| 0| dec_inner(new_child, shift - B, size); 733| 0| } 734| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 735| 0| } 736| 1.96k| } 737| 194k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_: 741| 166k| { 742| 166k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 166k, False: 0] ------------------ 743| 166k| auto node = pos.node(); 744| 166k| auto idx = pos.index(pos.size() - 1); 745| 166k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 166k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 166k, Folded] | Branch (746:36): [True: 165k, False: 597] ------------------ 747| 166k| if (mutate) { ------------------ | Branch (747:13): [True: 165k, False: 597] ------------------ 748| 165k| node->inner()[new_idx] = 749| 165k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 162k, False: 2.85k] ------------------ 750| | /* otherwise */ 751| 165k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 165k| return node; 753| 165k| } else { 754| 597| auto new_parent = node_t::make_inner_e(e); 755| 597| IMMER_TRY { ------------------ | | 49| 597|#define IMMER_TRY try ------------------ 756| 597| new_parent->inner()[new_idx] = 757| 597| idx == new_idx ------------------ | Branch (757:21): [True: 304, False: 293] ------------------ 758| 597| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 597| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 597| node_t::do_copy_inner(new_parent, node, new_idx); 762| 597| if (Mutating) ------------------ | Branch (762:21): [True: 597, Folded] ------------------ 763| 597| pos.visit(dec_visitor{}); 764| 597| return new_parent; 765| 597| } 766| 597| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 597| } 771| 166k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 1.45M| { 742| 1.45M| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.45M, False: 0] ------------------ 743| 1.45M| auto node = pos.node(); 744| 1.45M| auto idx = pos.index(pos.size() - 1); 745| 1.45M| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.45M| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 1.45M, Folded] | Branch (746:36): [True: 1.45M, False: 1.90k] ------------------ 747| 1.45M| if (mutate) { ------------------ | Branch (747:13): [True: 1.45M, False: 1.90k] ------------------ 748| 1.45M| node->inner()[new_idx] = 749| 1.45M| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 1.13M, False: 314k] ------------------ 750| | /* otherwise */ 751| 1.45M| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 1.45M| return node; 753| 1.45M| } else { 754| 1.90k| auto new_parent = node_t::make_inner_e(e); 755| 1.90k| IMMER_TRY { ------------------ | | 49| 1.90k|#define IMMER_TRY try ------------------ 756| 1.90k| new_parent->inner()[new_idx] = 757| 1.90k| idx == new_idx ------------------ | Branch (757:21): [True: 1.13k, False: 765] ------------------ 758| 1.90k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.90k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.90k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.90k| if (Mutating) ------------------ | Branch (762:21): [True: 1.90k, Folded] ------------------ 763| 1.90k| pos.visit(dec_visitor{}); 764| 1.90k| return new_parent; 765| 1.90k| } 766| 1.90k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 1.90k| } 771| 1.45M| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 3.44k| { 742| 3.44k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 3.44k, False: 0] ------------------ 743| 3.44k| auto node = pos.node(); 744| 3.44k| auto idx = pos.index(pos.size() - 1); 745| 3.44k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 3.44k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 3.44k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 3.44k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 3.44k] ------------------ 748| 0| node->inner()[new_idx] = 749| 0| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 0, False: 0] ------------------ 750| | /* otherwise */ 751| 0| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 0| return node; 753| 3.44k| } else { 754| 3.44k| auto new_parent = node_t::make_inner_e(e); 755| 3.44k| IMMER_TRY { ------------------ | | 49| 3.44k|#define IMMER_TRY try ------------------ 756| 3.44k| new_parent->inner()[new_idx] = 757| 3.44k| idx == new_idx ------------------ | Branch (757:21): [True: 1.18k, False: 2.25k] ------------------ 758| 3.44k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 3.44k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 3.44k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 3.44k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 3.44k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 3.44k| return new_parent; 765| 3.44k| } 766| 3.44k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 3.44k| } 771| 3.44k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j: 680| 4.44k| { 681| 4.44k| auto node = pos.node(); 682| 4.44k| auto level = pos.shift(); 683| 4.44k| auto idx = pos.count() - 1; 684| 4.44k| auto children = pos.size(idx); 685| 4.44k| auto new_idx = 686| 4.44k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 939, False: 3.50k] | Branch (686:47): [True: 199, False: 3.31k] ------------------ 687| 4.44k| auto new_child = static_cast(nullptr); 688| 4.44k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 4.44k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 4.44k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 354, False: 4.09k] ------------------ 691| 354| return nullptr; 692| 4.09k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 3.31k, False: 784] ------------------ 693| 3.31k| new_child = 694| 3.31k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 3.31k] ------------------ 695| 3.31k| : pos.last_oh_csh( 696| 3.31k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 3.31k| if (!new_child) { ------------------ | Branch (697:17): [True: 584, False: 2.72k] ------------------ 698| 584| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 220, False: 364] ------------------ 699| 220| new_child = node_t::make_path_e(e, level - B, tail); 700| 364| else 701| 364| return nullptr; 702| 584| } 703| 3.31k| } else 704| 784| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 3.73k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 3.73k] ------------------ 707| 0| auto count = new_idx + 1; 708| 0| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 0| node->inner()[new_idx] = new_child; 710| 0| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 0| relaxed->d.count = count; 712| 0| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 0, False: 0] ------------------ 713| 0| return node; 714| 3.73k| } else { 715| 3.73k| IMMER_TRY { ------------------ | | 49| 3.73k|#define IMMER_TRY try ------------------ 716| 3.73k| auto count = new_idx + 1; 717| 3.73k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 3.73k| auto relaxed = new_node->relaxed(); 719| 3.73k| new_node->inner()[new_idx] = new_child; 720| 3.73k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 3.73k| relaxed->d.count = count; 722| 3.73k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 3.73k, False: 0] ------------------ 723| 3.73k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 3.73k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 3.73k| return new_node; 726| 3.73k| } 727| 3.73k| IMMER_CATCH (...) { 728| 0| auto shift = pos.shift(); 729| 0| auto size = new_idx == idx ? children + ts : ts; ------------------ | Branch (729:30): [True: 0, False: 0] ------------------ 730| 0| if (shift > BL) { ------------------ | Branch (730:21): [True: 0, False: 0] ------------------ 731| 0| tail->inc(); 732| 0| dec_inner(new_child, shift - B, size); 733| 0| } 734| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 735| 0| } 736| 3.73k| } 737| 3.73k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_: 741| 726| { 742| 726| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 726, False: 0] ------------------ 743| 726| auto node = pos.node(); 744| 726| auto idx = pos.index(pos.size() - 1); 745| 726| auto new_idx = pos.index(pos.size() + branches - 1); 746| 726| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 726] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 726| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 726] ------------------ 748| 0| node->inner()[new_idx] = 749| 0| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 0, False: 0] ------------------ 750| | /* otherwise */ 751| 0| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 0| return node; 753| 726| } else { 754| 726| auto new_parent = node_t::make_inner_e(e); 755| 726| IMMER_TRY { ------------------ | | 49| 726|#define IMMER_TRY try ------------------ 756| 726| new_parent->inner()[new_idx] = 757| 726| idx == new_idx ------------------ | Branch (757:21): [True: 450, False: 276] ------------------ 758| 726| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 726| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 726| node_t::do_copy_inner(new_parent, node, new_idx); 762| 726| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 726] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 726| return new_parent; 765| 726| } 766| 726| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 726| } 771| 726| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 162k| { 742| 162k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 162k, False: 0] ------------------ 743| 162k| auto node = pos.node(); 744| 162k| auto idx = pos.index(pos.size() - 1); 745| 162k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 162k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 162k, Folded] | Branch (746:36): [True: 161k, False: 664] ------------------ 747| 162k| if (mutate) { ------------------ | Branch (747:13): [True: 161k, False: 664] ------------------ 748| 161k| node->inner()[new_idx] = 749| 161k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 153k, False: 7.59k] ------------------ 750| | /* otherwise */ 751| 161k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 161k| return node; 753| 161k| } else { 754| 664| auto new_parent = node_t::make_inner_e(e); 755| 664| IMMER_TRY { ------------------ | | 49| 664|#define IMMER_TRY try ------------------ 756| 664| new_parent->inner()[new_idx] = 757| 664| idx == new_idx ------------------ | Branch (757:21): [True: 365, False: 299] ------------------ 758| 664| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 664| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 664| node_t::do_copy_inner(new_parent, node, new_idx); 762| 664| if (Mutating) ------------------ | Branch (762:21): [True: 664, Folded] ------------------ 763| 664| pos.visit(dec_visitor{}); 764| 664| return new_parent; 765| 664| } 766| 664| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 664| } 771| 162k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEvPT_: 580| 1.80k|{ 581| 1.80k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 1.80k|} _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_relaxedIRNS1_11relaxed_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 595| 70.5k| { 596| 70.5k| auto offset = pos.index(idx); 597| 70.5k| auto count = pos.count(); 598| 70.5k| auto node = pos.node(); 599| 70.5k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 48.5k, False: 21.9k] ------------------ 600| 48.5k| return pos.towards_oh( 601| 48.5k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 48.5k| } else { 603| 21.9k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 21.9k| IMMER_TRY { ------------------ | | 49| 21.9k|#define IMMER_TRY try ------------------ 605| 21.9k| auto& res = pos.towards_oh( 606| 21.9k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 21.9k| pos.visit(dec_visitor{}); 608| 21.9k| *location = new_node; 609| 21.9k| return res; 610| 21.9k| } 611| 21.9k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 21.9k| } 616| 70.5k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 11.3k| { 653| 11.3k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 11.3k, False: 0] ------------------ 654| 11.3k| auto node = pos.node(); 655| 11.3k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 768, False: 10.5k] ------------------ 656| 768| return node->leaf()[pos.index(idx)]; 657| 10.5k| } else { 658| 10.5k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 10.5k| pos.visit(dec_visitor{}); 660| 10.5k| *location = new_node; 661| 10.5k| return new_node->leaf()[pos.index(idx)]; 662| 10.5k| } 663| 11.3k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 4.31k| { 622| 4.31k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 4.31k, False: 0] ------------------ 623| 4.31k| auto offset = pos.index(idx); 624| 4.31k| auto count = pos.count(); 625| 4.31k| auto node = pos.node(); 626| 4.31k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 2.41k, False: 1.89k] ------------------ 627| 2.41k| return pos.towards_oh_ch( 628| 2.41k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 2.41k| } else { 630| 1.89k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.89k| IMMER_TRY { ------------------ | | 49| 1.89k|#define IMMER_TRY try ------------------ 632| 1.89k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.89k| idx, 634| 1.89k| offset, 635| 1.89k| count, 636| 1.89k| e, 637| 1.89k| &new_node->inner()[offset]); 638| 1.89k| pos.visit(dec_visitor{}); 639| 1.89k| *location = new_node; 640| 1.89k| return res; 641| 1.89k| } 642| 1.89k| IMMER_CATCH (...) { 643| 0| dec_regular(new_node, pos.shift(), pos.size()); 644| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 645| 0| } 646| 1.89k| } 647| 4.31k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 3.40k| { 653| 3.40k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 3.40k, False: 0] ------------------ 654| 3.40k| auto node = pos.node(); 655| 3.40k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.44k, False: 1.96k] ------------------ 656| 1.44k| return node->leaf()[pos.index(idx)]; 657| 1.96k| } else { 658| 1.96k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 1.96k| pos.visit(dec_visitor{}); 660| 1.96k| *location = new_node; 661| 1.96k| return new_node->leaf()[pos.index(idx)]; 662| 1.96k| } 663| 3.40k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_regularIRNS1_8full_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 2.84k| { 622| 2.84k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.84k, False: 0] ------------------ 623| 2.84k| auto offset = pos.index(idx); 624| 2.84k| auto count = pos.count(); 625| 2.84k| auto node = pos.node(); 626| 2.84k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.09k, False: 1.74k] ------------------ 627| 1.09k| return pos.towards_oh_ch( 628| 1.09k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.74k| } else { 630| 1.74k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.74k| IMMER_TRY { ------------------ | | 49| 1.74k|#define IMMER_TRY try ------------------ 632| 1.74k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.74k| idx, 634| 1.74k| offset, 635| 1.74k| count, 636| 1.74k| e, 637| 1.74k| &new_node->inner()[offset]); 638| 1.74k| pos.visit(dec_visitor{}); 639| 1.74k| *location = new_node; 640| 1.74k| return res; 641| 1.74k| } 642| 1.74k| IMMER_CATCH (...) { 643| 0| dec_regular(new_node, pos.shift(), pos.size()); 644| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 645| 0| } 646| 1.74k| } 647| 2.84k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_8leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 907| { 653| 907| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 907, False: 0] ------------------ 654| 907| auto node = pos.node(); 655| 907| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 566, False: 341] ------------------ 656| 566| return node->leaf()[pos.index(idx)]; 657| 566| } else { 658| 341| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 341| pos.visit(dec_visitor{}); 660| 341| *location = new_node; 661| 341| return new_node->leaf()[pos.index(idx)]; 662| 341| } 663| 907| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_regularIRNS1_11regular_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 2.30k| { 622| 2.30k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.30k, False: 0] ------------------ 623| 2.30k| auto offset = pos.index(idx); 624| 2.30k| auto count = pos.count(); 625| 2.30k| auto node = pos.node(); 626| 2.30k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.39k, False: 911] ------------------ 627| 1.39k| return pos.towards_oh_ch( 628| 1.39k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.39k| } else { 630| 911| auto new_node = node_t::copy_inner_e(e, node, count); 631| 911| IMMER_TRY { ------------------ | | 49| 911|#define IMMER_TRY try ------------------ 632| 911| auto& res = pos.towards_oh_ch(this_t{}, 633| 911| idx, 634| 911| offset, 635| 911| count, 636| 911| e, 637| 911| &new_node->inner()[offset]); 638| 911| pos.visit(dec_visitor{}); 639| 911| *location = new_node; 640| 911| return res; 641| 911| } 642| 911| IMMER_CATCH (...) { 643| 0| dec_regular(new_node, pos.shift(), pos.size()); 644| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 645| 0| } 646| 911| } 647| 2.30k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 28.7k| { 914| 28.7k| auto idx = pos.index(last); 915| 28.7k| auto node = pos.node(); 916| 28.7k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 28.7k, Folded] | Branch (916:35): [True: 19.7k, False: 8.92k] ------------------ 917| 28.7k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 28.7k, Folded] | Branch (917:25): [True: 15.0k, False: 13.7k] ------------------ 918| 15.0k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 10.0k, False: 4.96k] ------------------ 919| 15.0k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 15.0k| if (Mutating) ------------------ | Branch (920:17): [True: 15.0k, Folded] ------------------ 921| 15.0k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 15.0k| return res; 923| 15.0k| } else { 924| 13.7k| using std::get; 925| 13.7k| auto subs = 926| 13.7k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 9.75k, False: 3.95k] ------------------ 927| 13.7k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 13.7k| auto next = get<1>(subs); 929| 13.7k| auto ts = get<2>(subs); 930| 13.7k| auto tail = get<3>(subs); 931| 13.7k| IMMER_TRY { ------------------ | | 49| 13.7k|#define IMMER_TRY try ------------------ 932| 13.7k| if (next) { ------------------ | Branch (932:21): [True: 9.28k, False: 4.43k] ------------------ 933| 9.28k| if (mutate) { ------------------ | Branch (933:25): [True: 6.48k, False: 2.79k] ------------------ 934| 6.48k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 6.48k| pos.each_right(dec_visitor{}, idx + 1); 936| 6.48k| node->inner()[idx] = next; 937| 6.48k| nodr->d.sizes[idx] = last + 1 - ts; 938| 6.48k| nodr->d.count = idx + 1; 939| 6.48k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 6.48k, False: 0] ------------------ 940| 6.48k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 6.48k| } else { 942| 2.79k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 2.79k| auto newr = newn->relaxed(); 944| 2.79k| newn->inner()[idx] = next; 945| 2.79k| newr->d.sizes[idx] = last + 1 - ts; 946| 2.79k| newr->d.count = idx + 1; 947| 2.79k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 2.79k, False: 0] ------------------ 948| 2.79k| if (Mutating) ------------------ | Branch (948:29): [True: 2.79k, Folded] ------------------ 949| 2.79k| pos.visit(dec_visitor{}); 950| 2.79k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 2.79k| } 952| 9.28k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 4.43k] ------------------ 953| 0| if (Mutating) ------------------ | Branch (953:25): [True: 0, Folded] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 4.43k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 4.43k, Folded] | Branch (956:40): [True: 3.82k, False: 608] | Branch (956:52): [True: 2.84k, False: 987] ------------------ 957| 2.84k| auto newn = pos.node()->inner()[0]; 958| 2.84k| if (!mutate) ------------------ | Branch (958:25): [True: 811, False: 2.03k] ------------------ 959| 811| newn->inc(); 960| 2.84k| if (Mutating) ------------------ | Branch (960:25): [True: 2.84k, Folded] ------------------ 961| 2.84k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 2.84k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.84k| } else { 964| 1.59k| if (mutate) { ------------------ | Branch (964:25): [True: 1.24k, False: 354] ------------------ 965| 1.24k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.24k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.24k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.24k| } else { 969| 354| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 354| if (Mutating) ------------------ | Branch (970:29): [True: 354, Folded] ------------------ 971| 354| pos.visit(dec_visitor{}); 972| 354| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 354| } 974| 1.59k| } 975| 13.7k| } 976| 13.7k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 13.7k| } 987| 28.7k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 974| { 1060| 974| auto old_tail_size = pos.count(); 1061| 974| auto new_tail_size = pos.index(last) + 1; 1062| 974| auto node = pos.node(); 1063| 974| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 974, Folded] | Branch (1063:42): [True: 277, False: 697] ------------------ 1064| 974| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 234, False: 740] ------------------ 1065| 234| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 234] ------------------ 1066| 0| node->inc(); 1067| 234| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 740| } else if (mutate) { ------------------ | Branch (1068:20): [True: 270, False: 470] ------------------ 1069| 270| detail::destroy_n(node->leaf() + new_tail_size, 1070| 270| old_tail_size - new_tail_size); 1071| 270| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 470| } else { 1073| 470| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 470| if (Mutating) ------------------ | Branch (1074:17): [True: 470, Folded] ------------------ 1075| 470| pos.visit(dec_visitor{}); 1076| 470| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 470| } 1078| 974| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 955| { 1060| 955| auto old_tail_size = pos.count(); 1061| 955| auto new_tail_size = pos.index(last) + 1; 1062| 955| auto node = pos.node(); 1063| 955| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 955] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 955| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 547, False: 408] ------------------ 1065| 547| if (!Mutating) ------------------ | Branch (1065:17): [True: 547, Folded] ------------------ 1066| 547| node->inc(); 1067| 547| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 547| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 408] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 408| } else { 1073| 408| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 408| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 408] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 408| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 408| } 1078| 955| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 17.5k| { 914| 17.5k| auto idx = pos.index(last); 915| 17.5k| auto node = pos.node(); 916| 17.5k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 17.5k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 17.5k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 17.5k, Folded] | Branch (917:25): [True: 14.8k, False: 2.75k] ------------------ 918| 14.8k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 14.8k] ------------------ 919| 14.8k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 14.8k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 14.8k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 14.8k| return res; 923| 14.8k| } else { 924| 2.75k| using std::get; 925| 2.75k| auto subs = 926| 2.75k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 2.75k] ------------------ 927| 2.75k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 2.75k| auto next = get<1>(subs); 929| 2.75k| auto ts = get<2>(subs); 930| 2.75k| auto tail = get<3>(subs); 931| 2.75k| IMMER_TRY { ------------------ | | 49| 2.75k|#define IMMER_TRY try ------------------ 932| 2.75k| if (next) { ------------------ | Branch (932:21): [True: 1.62k, False: 1.12k] ------------------ 933| 1.62k| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 1.62k] ------------------ 934| 0| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 0| pos.each_right(dec_visitor{}, idx + 1); 936| 0| node->inner()[idx] = next; 937| 0| nodr->d.sizes[idx] = last + 1 - ts; 938| 0| nodr->d.count = idx + 1; 939| 0| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 0, False: 0] ------------------ 940| 0| return std::make_tuple(pos.shift(), node, ts, tail); 941| 1.62k| } else { 942| 1.62k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.62k| auto newr = newn->relaxed(); 944| 1.62k| newn->inner()[idx] = next; 945| 1.62k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.62k| newr->d.count = idx + 1; 947| 1.62k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.62k, False: 0] ------------------ 948| 1.62k| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 1.62k] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 1.62k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.62k| } 952| 1.62k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 1.12k] ------------------ 953| 0| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 0] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.12k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 1.12k, Folded] | Branch (956:40): [True: 591, False: 536] | Branch (956:52): [True: 251, False: 340] ------------------ 957| 251| auto newn = pos.node()->inner()[0]; 958| 251| if (!mutate) ------------------ | Branch (958:25): [True: 251, False: 0] ------------------ 959| 251| newn->inc(); 960| 251| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 251] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 251| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 876| } else { 964| 876| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 876] ------------------ 965| 0| pos.each_right(dec_visitor{}, idx + 1); 966| 0| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 0| return std::make_tuple(pos.shift(), node, ts, tail); 968| 876| } else { 969| 876| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 876| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 876] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 876| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 876| } 974| 876| } 975| 2.75k| } 976| 2.75k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 2.75k| } 987| 17.5k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 1.26k| { 992| 1.26k| auto idx = pos.index(last); 993| 1.26k| auto node = pos.node(); 994| 1.26k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.26k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.26k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.26k, Folded] | Branch (995:25): [True: 353, False: 909] ------------------ 996| 353| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 353] ------------------ 997| 353| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 353| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 353] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 353| return res; 1001| 909| } else { 1002| 909| using std::get; 1003| 909| auto subs = 1004| 909| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 909] ------------------ 1005| 909| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 909| auto next = get<1>(subs); 1007| 909| auto ts = get<2>(subs); 1008| 909| auto tail = get<3>(subs); 1009| 909| IMMER_TRY { ------------------ | | 49| 909|#define IMMER_TRY try ------------------ 1010| 909| if (next) { ------------------ | Branch (1010:21): [True: 263, False: 646] ------------------ 1011| 263| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 263] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 263| } else { 1016| 263| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 263| newn->inner()[idx] = next; 1018| 263| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 263] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 263| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 263| } 1022| 646| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 646] ------------------ 1023| 0| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 0] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 646| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 646, Folded] | Branch (1026:40): [True: 395, False: 251] | Branch (1026:52): [True: 199, False: 196] ------------------ 1027| 199| auto newn = pos.node()->inner()[0]; 1028| 199| if (!mutate) ------------------ | Branch (1028:25): [True: 199, False: 0] ------------------ 1029| 199| newn->inc(); 1030| 199| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 199] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 199| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 447| } else { 1034| 447| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 447] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 447| } else { 1038| 447| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 447| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 447] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 447| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 447| } 1043| 447| } 1044| 909| } 1045| 909| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 909| } 1055| 1.26k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.44k| { 1060| 1.44k| auto old_tail_size = pos.count(); 1061| 1.44k| auto new_tail_size = pos.index(last) + 1; 1062| 1.44k| auto node = pos.node(); 1063| 1.44k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.44k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.44k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 400, False: 1.04k] ------------------ 1065| 400| if (!Mutating) ------------------ | Branch (1065:17): [True: 400, Folded] ------------------ 1066| 400| node->inc(); 1067| 400| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.04k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 1.04k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.04k| } else { 1073| 1.04k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.04k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 1.04k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 1.04k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.04k| } 1078| 1.44k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 1.78k| { 992| 1.78k| auto idx = pos.index(last); 993| 1.78k| auto node = pos.node(); 994| 1.78k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.78k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.78k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.78k, Folded] | Branch (995:25): [True: 802, False: 982] ------------------ 996| 802| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 802] ------------------ 997| 802| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 802| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 802] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 802| return res; 1001| 982| } else { 1002| 982| using std::get; 1003| 982| auto subs = 1004| 982| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 982] ------------------ 1005| 982| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 982| auto next = get<1>(subs); 1007| 982| auto ts = get<2>(subs); 1008| 982| auto tail = get<3>(subs); 1009| 982| IMMER_TRY { ------------------ | | 49| 982|#define IMMER_TRY try ------------------ 1010| 982| if (next) { ------------------ | Branch (1010:21): [True: 281, False: 701] ------------------ 1011| 281| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 281] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 281| } else { 1016| 281| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 281| newn->inner()[idx] = next; 1018| 281| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 281] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 281| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 281| } 1022| 701| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 701] ------------------ 1023| 0| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 0] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 701| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 701, Folded] | Branch (1026:40): [True: 435, False: 266] | Branch (1026:52): [True: 204, False: 231] ------------------ 1027| 204| auto newn = pos.node()->inner()[0]; 1028| 204| if (!mutate) ------------------ | Branch (1028:25): [True: 204, False: 0] ------------------ 1029| 204| newn->inc(); 1030| 204| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 204] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 204| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 497| } else { 1034| 497| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 497] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 497| } else { 1038| 497| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 497| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 497] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 497| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 497| } 1043| 497| } 1044| 982| } 1045| 982| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 982| } 1055| 1.78k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 3.30k| { 1060| 3.30k| auto old_tail_size = pos.count(); 1061| 3.30k| auto new_tail_size = pos.index(last) + 1; 1062| 3.30k| auto node = pos.node(); 1063| 3.30k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 3.30k, Folded] | Branch (1063:42): [True: 657, False: 2.65k] ------------------ 1064| 3.30k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.16k, False: 2.14k] ------------------ 1065| 1.16k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.16k] ------------------ 1066| 0| node->inc(); 1067| 1.16k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.14k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 565, False: 1.58k] ------------------ 1069| 565| detail::destroy_n(node->leaf() + new_tail_size, 1070| 565| old_tail_size - new_tail_size); 1071| 565| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.58k| } else { 1073| 1.58k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.58k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.58k, Folded] ------------------ 1075| 1.58k| pos.visit(dec_visitor{}); 1076| 1.58k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.58k| } 1078| 3.30k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 4.00k| { 992| 4.00k| auto idx = pos.index(last); 993| 4.00k| auto node = pos.node(); 994| 4.00k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.00k, Folded] | Branch (994:35): [True: 1.78k, False: 2.21k] ------------------ 995| 4.00k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.00k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 4.00k| } else { 1002| 4.00k| using std::get; 1003| 4.00k| auto subs = 1004| 4.00k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 1.78k, False: 2.21k] ------------------ 1005| 4.00k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.00k| auto next = get<1>(subs); 1007| 4.00k| auto ts = get<2>(subs); 1008| 4.00k| auto tail = get<3>(subs); 1009| 4.00k| IMMER_TRY { ------------------ | | 49| 4.00k|#define IMMER_TRY try ------------------ 1010| 4.00k| if (next) { ------------------ | Branch (1010:21): [True: 999, False: 3.00k] ------------------ 1011| 999| if (mutate) { ------------------ | Branch (1011:25): [True: 471, False: 528] ------------------ 1012| 471| node->inner()[idx] = next; 1013| 471| pos.each_right(dec_visitor{}, idx + 1); 1014| 471| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 528| } else { 1016| 528| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 528| newn->inner()[idx] = next; 1018| 528| if (Mutating) ------------------ | Branch (1018:29): [True: 528, Folded] ------------------ 1019| 528| pos.visit(dec_visitor{}); 1020| 528| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 528| } 1022| 3.00k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.00k, False: 1.99k] ------------------ 1023| 1.00k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.00k, Folded] ------------------ 1024| 1.00k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.00k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.99k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.99k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [True: 0, Folded] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.99k| } else { 1034| 1.99k| if (mutate) { ------------------ | Branch (1034:25): [True: 891, False: 1.10k] ------------------ 1035| 891| pos.each_right(dec_visitor{}, idx + 1); 1036| 891| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.10k| } else { 1038| 1.10k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.10k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.10k, Folded] ------------------ 1040| 1.10k| pos.visit(dec_visitor{}); 1041| 1.10k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.10k| } 1043| 1.99k| } 1044| 4.00k| } 1045| 4.00k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 4.00k| } 1055| 4.00k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 3.05k| { 879| 3.05k| using node_t = node_type; 880| 3.05k| auto node = p.node(); 881| 3.05k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.65k, False: 1.40k] ------------------ 882| 1.65k| p.each_right(dec_t{}, idx); 883| 1.65k| node_t::delete_inner(node, p.count()); 884| 1.65k| } 885| 3.05k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 10.1k| { 1060| 10.1k| auto old_tail_size = pos.count(); 1061| 10.1k| auto new_tail_size = pos.index(last) + 1; 1062| 10.1k| auto node = pos.node(); 1063| 10.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 10.1k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 10.1k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.36k, False: 8.83k] ------------------ 1065| 1.36k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.36k, Folded] ------------------ 1066| 1.36k| node->inc(); 1067| 1.36k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 8.83k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 8.83k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 8.83k| } else { 1073| 8.83k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 8.83k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 8.83k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 8.83k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 8.83k| } 1078| 10.1k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 6.06k| { 992| 6.06k| auto idx = pos.index(last); 993| 6.06k| auto node = pos.node(); 994| 6.06k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 6.06k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 6.06k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 6.06k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 6.06k| } else { 1002| 6.06k| using std::get; 1003| 6.06k| auto subs = 1004| 6.06k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 6.06k] ------------------ 1005| 6.06k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 6.06k| auto next = get<1>(subs); 1007| 6.06k| auto ts = get<2>(subs); 1008| 6.06k| auto tail = get<3>(subs); 1009| 6.06k| IMMER_TRY { ------------------ | | 49| 6.06k|#define IMMER_TRY try ------------------ 1010| 6.06k| if (next) { ------------------ | Branch (1010:21): [True: 814, False: 5.24k] ------------------ 1011| 814| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 814] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 814| } else { 1016| 814| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 814| newn->inner()[idx] = next; 1018| 814| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 814] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 814| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 814| } 1022| 5.24k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.24k, False: 4.00k] ------------------ 1023| 1.24k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.24k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.24k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 4.00k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 4.00k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 0] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 4.00k| } else { 1034| 4.00k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 4.00k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 4.00k| } else { 1038| 4.00k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 4.00k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 4.00k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 4.00k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 4.00k| } 1043| 4.00k| } 1044| 6.06k| } 1045| 6.06k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 6.06k| } 1055| 6.06k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 406| { 1060| 406| auto old_tail_size = pos.count(); 1061| 406| auto new_tail_size = pos.index(last) + 1; 1062| 406| auto node = pos.node(); 1063| 406| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 406] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 406| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 196, False: 210] ------------------ 1065| 196| if (!Mutating) ------------------ | Branch (1065:17): [True: 196, Folded] ------------------ 1066| 196| node->inc(); 1067| 196| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 210| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 210] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 210| } else { 1073| 210| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 210| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 210] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 210| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 210| } 1078| 406| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.54k| { 1060| 1.54k| auto old_tail_size = pos.count(); 1061| 1.54k| auto new_tail_size = pos.index(last) + 1; 1062| 1.54k| auto node = pos.node(); 1063| 1.54k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.54k, Folded] | Branch (1063:42): [True: 209, False: 1.34k] ------------------ 1064| 1.54k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 326, False: 1.22k] ------------------ 1065| 326| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 326] ------------------ 1066| 0| node->inc(); 1067| 326| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.22k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 207, False: 1.01k] ------------------ 1069| 207| detail::destroy_n(node->leaf() + new_tail_size, 1070| 207| old_tail_size - new_tail_size); 1071| 207| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.01k| } else { 1073| 1.01k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.01k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.01k, Folded] ------------------ 1075| 1.01k| pos.visit(dec_visitor{}); 1076| 1.01k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.01k| } 1078| 1.54k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 4.27k| { 992| 4.27k| auto idx = pos.index(last); 993| 4.27k| auto node = pos.node(); 994| 4.27k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.27k, Folded] | Branch (994:35): [True: 3.14k, False: 1.12k] ------------------ 995| 4.27k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.27k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 4.27k| } else { 1002| 4.27k| using std::get; 1003| 4.27k| auto subs = 1004| 4.27k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.14k, False: 1.12k] ------------------ 1005| 4.27k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.27k| auto next = get<1>(subs); 1007| 4.27k| auto ts = get<2>(subs); 1008| 4.27k| auto tail = get<3>(subs); 1009| 4.27k| IMMER_TRY { ------------------ | | 49| 4.27k|#define IMMER_TRY try ------------------ 1010| 4.27k| if (next) { ------------------ | Branch (1010:21): [True: 1.81k, False: 2.45k] ------------------ 1011| 1.81k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.30k, False: 519] ------------------ 1012| 1.30k| node->inner()[idx] = next; 1013| 1.30k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.30k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.30k| } else { 1016| 519| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 519| newn->inner()[idx] = next; 1018| 519| if (Mutating) ------------------ | Branch (1018:29): [True: 519, Folded] ------------------ 1019| 519| pos.visit(dec_visitor{}); 1020| 519| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 519| } 1022| 2.45k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.58k, False: 875] ------------------ 1023| 1.58k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.58k, Folded] ------------------ 1024| 1.58k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.58k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.58k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 875] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [True: 0, Folded] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 875| } else { 1034| 875| if (mutate) { ------------------ | Branch (1034:25): [True: 495, False: 380] ------------------ 1035| 495| pos.each_right(dec_visitor{}, idx + 1); 1036| 495| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 495| } else { 1038| 380| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 380| if (Mutating) ------------------ | Branch (1039:29): [True: 380, Folded] ------------------ 1040| 380| pos.visit(dec_visitor{}); 1041| 380| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 380| } 1043| 875| } 1044| 4.27k| } 1045| 4.27k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 4.27k| } 1055| 4.27k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 1.58k| { 879| 1.58k| using node_t = node_type; 880| 1.58k| auto node = p.node(); 881| 1.58k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.35k, False: 228] ------------------ 882| 1.35k| p.each_right(dec_t{}, idx); 883| 1.35k| node_t::delete_inner(node, p.count()); 884| 1.35k| } 885| 1.58k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 2.36k| { 1060| 2.36k| auto old_tail_size = pos.count(); 1061| 2.36k| auto new_tail_size = pos.index(last) + 1; 1062| 2.36k| auto node = pos.node(); 1063| 2.36k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.36k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.36k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 310, False: 2.05k] ------------------ 1065| 310| if (!Mutating) ------------------ | Branch (1065:17): [True: 310, Folded] ------------------ 1066| 310| node->inc(); 1067| 310| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.05k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 2.05k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 2.05k| } else { 1073| 2.05k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 2.05k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 2.05k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 2.05k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 2.05k| } 1078| 2.36k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.19k| { 992| 3.19k| auto idx = pos.index(last); 993| 3.19k| auto node = pos.node(); 994| 3.19k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.19k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.19k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.19k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.19k| } else { 1002| 3.19k| using std::get; 1003| 3.19k| auto subs = 1004| 3.19k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.19k] ------------------ 1005| 3.19k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.19k| auto next = get<1>(subs); 1007| 3.19k| auto ts = get<2>(subs); 1008| 3.19k| auto tail = get<3>(subs); 1009| 3.19k| IMMER_TRY { ------------------ | | 49| 3.19k|#define IMMER_TRY try ------------------ 1010| 3.19k| if (next) { ------------------ | Branch (1010:21): [True: 962, False: 2.23k] ------------------ 1011| 962| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 962] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 962| } else { 1016| 962| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 962| newn->inner()[idx] = next; 1018| 962| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 962] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 962| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 962| } 1022| 2.23k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 819, False: 1.41k] ------------------ 1023| 819| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 819] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 819| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.41k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.41k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 0] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.41k| } else { 1034| 1.41k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.41k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.41k| } else { 1038| 1.41k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.41k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.41k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.41k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.41k| } 1043| 1.41k| } 1044| 3.19k| } 1045| 3.19k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.19k| } 1055| 3.19k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_j: 867| 19.1k| { 868| 19.1k| using node_t = node_type; 869| 19.1k| auto node = p.node(); 870| 19.1k| if (node->dec()) { ------------------ | Branch (870:13): [True: 12.6k, False: 6.47k] ------------------ 871| 12.6k| p.each_right(dec_t{}, idx); 872| 12.6k| node_t::delete_inner_r(node, p.count()); 873| 12.6k| } 874| 19.1k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 2.60k| { 1060| 2.60k| auto old_tail_size = pos.count(); 1061| 2.60k| auto new_tail_size = pos.index(last) + 1; 1062| 2.60k| auto node = pos.node(); 1063| 2.60k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 2.60k, Folded] | Branch (1063:42): [True: 398, False: 2.20k] ------------------ 1064| 2.60k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 718, False: 1.88k] ------------------ 1065| 718| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 718] ------------------ 1066| 0| node->inc(); 1067| 718| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.88k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 352, False: 1.53k] ------------------ 1069| 352| detail::destroy_n(node->leaf() + new_tail_size, 1070| 352| old_tail_size - new_tail_size); 1071| 352| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.53k| } else { 1073| 1.53k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.53k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.53k, Folded] ------------------ 1075| 1.53k| pos.visit(dec_visitor{}); 1076| 1.53k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.53k| } 1078| 2.60k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 4.29k| { 914| 4.29k| auto idx = pos.index(last); 915| 4.29k| auto node = pos.node(); 916| 4.29k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 4.29k, Folded] | Branch (916:35): [True: 2.61k, False: 1.67k] ------------------ 917| 4.29k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 4.29k] | Branch (917:25): [True: 0, False: 0] ------------------ 918| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 0] ------------------ 919| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 0| if (Mutating) ------------------ | Branch (920:17): [True: 0, Folded] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 0| return res; 923| 4.29k| } else { 924| 4.29k| using std::get; 925| 4.29k| auto subs = 926| 4.29k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 2.61k, False: 1.67k] ------------------ 927| 4.29k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 4.29k| auto next = get<1>(subs); 929| 4.29k| auto ts = get<2>(subs); 930| 4.29k| auto tail = get<3>(subs); 931| 4.29k| IMMER_TRY { ------------------ | | 49| 4.29k|#define IMMER_TRY try ------------------ 932| 4.29k| if (next) { ------------------ | Branch (932:21): [True: 1.30k, False: 2.98k] ------------------ 933| 1.30k| if (mutate) { ------------------ | Branch (933:25): [True: 1.02k, False: 278] ------------------ 934| 1.02k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 1.02k| pos.each_right(dec_visitor{}, idx + 1); 936| 1.02k| node->inner()[idx] = next; 937| 1.02k| nodr->d.sizes[idx] = last + 1 - ts; 938| 1.02k| nodr->d.count = idx + 1; 939| 1.02k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 1.02k, False: 0] ------------------ 940| 1.02k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 1.02k| } else { 942| 278| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 278| auto newr = newn->relaxed(); 944| 278| newn->inner()[idx] = next; 945| 278| newr->d.sizes[idx] = last + 1 - ts; 946| 278| newr->d.count = idx + 1; 947| 278| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 278, False: 0] ------------------ 948| 278| if (Mutating) ------------------ | Branch (948:29): [True: 278, Folded] ------------------ 949| 278| pos.visit(dec_visitor{}); 950| 278| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 278| } 952| 2.98k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 1.29k, False: 1.69k] ------------------ 953| 1.29k| if (Mutating) ------------------ | Branch (953:25): [True: 1.29k, Folded] ------------------ 954| 1.29k| pos.visit(dec_right_visitor{}, count_t{1}); 955| 1.29k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.69k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.69k] | Branch (956:40): [True: 0, False: 0] | Branch (956:52): [True: 0, False: 0] ------------------ 957| 0| auto newn = pos.node()->inner()[0]; 958| 0| if (!mutate) ------------------ | Branch (958:25): [True: 0, False: 0] ------------------ 959| 0| newn->inc(); 960| 0| if (Mutating) ------------------ | Branch (960:25): [True: 0, Folded] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.69k| } else { 964| 1.69k| if (mutate) { ------------------ | Branch (964:25): [True: 989, False: 706] ------------------ 965| 989| pos.each_right(dec_visitor{}, idx + 1); 966| 989| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 989| return std::make_tuple(pos.shift(), node, ts, tail); 968| 989| } else { 969| 706| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 706| if (Mutating) ------------------ | Branch (970:29): [True: 706, Folded] ------------------ 971| 706| pos.visit(dec_visitor{}); 972| 706| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 706| } 974| 1.69k| } 975| 4.29k| } 976| 4.29k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 4.29k| } 987| 4.29k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 5.47k| { 992| 5.47k| auto idx = pos.index(last); 993| 5.47k| auto node = pos.node(); 994| 5.47k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 5.47k, Folded] | Branch (994:35): [True: 4.05k, False: 1.42k] ------------------ 995| 5.47k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 5.47k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 5.47k| } else { 1002| 5.47k| using std::get; 1003| 5.47k| auto subs = 1004| 5.47k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 4.05k, False: 1.42k] ------------------ 1005| 5.47k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.47k| auto next = get<1>(subs); 1007| 5.47k| auto ts = get<2>(subs); 1008| 5.47k| auto tail = get<3>(subs); 1009| 5.47k| IMMER_TRY { ------------------ | | 49| 5.47k|#define IMMER_TRY try ------------------ 1010| 5.47k| if (next) { ------------------ | Branch (1010:21): [True: 3.92k, False: 1.55k] ------------------ 1011| 3.92k| if (mutate) { ------------------ | Branch (1011:25): [True: 3.08k, False: 842] ------------------ 1012| 3.08k| node->inner()[idx] = next; 1013| 3.08k| pos.each_right(dec_visitor{}, idx + 1); 1014| 3.08k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 3.08k| } else { 1016| 842| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 842| newn->inner()[idx] = next; 1018| 842| if (Mutating) ------------------ | Branch (1018:29): [True: 842, Folded] ------------------ 1019| 842| pos.visit(dec_visitor{}); 1020| 842| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 842| } 1022| 3.92k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 961, False: 593] ------------------ 1023| 961| if (Mutating) ------------------ | Branch (1023:25): [True: 961, Folded] ------------------ 1024| 961| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 961| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 961| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 593] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [True: 0, Folded] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 593| } else { 1034| 593| if (mutate) { ------------------ | Branch (1034:25): [True: 261, False: 332] ------------------ 1035| 261| pos.each_right(dec_visitor{}, idx + 1); 1036| 261| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 332| } else { 1038| 332| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 332| if (Mutating) ------------------ | Branch (1039:29): [True: 332, Folded] ------------------ 1040| 332| pos.visit(dec_visitor{}); 1041| 332| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 332| } 1043| 593| } 1044| 5.47k| } 1045| 5.47k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 5.47k| } 1055| 5.47k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 9.85k| { 879| 9.85k| using node_t = node_type; 880| 9.85k| auto node = p.node(); 881| 9.85k| if (node->dec()) { ------------------ | Branch (881:13): [True: 6.80k, False: 3.05k] ------------------ 882| 6.80k| p.each_right(dec_t{}, idx); 883| 6.80k| node_t::delete_inner(node, p.count()); 884| 6.80k| } 885| 9.85k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 5.40k| { 1060| 5.40k| auto old_tail_size = pos.count(); 1061| 5.40k| auto new_tail_size = pos.index(last) + 1; 1062| 5.40k| auto node = pos.node(); 1063| 5.40k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 5.40k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 5.40k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.10k, False: 4.30k] ------------------ 1065| 1.10k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.10k, Folded] ------------------ 1066| 1.10k| node->inc(); 1067| 1.10k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 4.30k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 4.30k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 4.30k| } else { 1073| 4.30k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 4.30k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 4.30k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 4.30k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 4.30k| } 1078| 5.40k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 4.34k| { 914| 4.34k| auto idx = pos.index(last); 915| 4.34k| auto node = pos.node(); 916| 4.34k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 4.34k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 4.34k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 4.34k] | Branch (917:25): [True: 0, False: 0] ------------------ 918| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 0] ------------------ 919| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 0| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 0] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 0| return res; 923| 4.34k| } else { 924| 4.34k| using std::get; 925| 4.34k| auto subs = 926| 4.34k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 4.34k] ------------------ 927| 4.34k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 4.34k| auto next = get<1>(subs); 929| 4.34k| auto ts = get<2>(subs); 930| 4.34k| auto tail = get<3>(subs); 931| 4.34k| IMMER_TRY { ------------------ | | 49| 4.34k|#define IMMER_TRY try ------------------ 932| 4.34k| if (next) { ------------------ | Branch (932:21): [True: 967, False: 3.37k] ------------------ 933| 967| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 967] ------------------ 934| 0| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 0| pos.each_right(dec_visitor{}, idx + 1); 936| 0| node->inner()[idx] = next; 937| 0| nodr->d.sizes[idx] = last + 1 - ts; 938| 0| nodr->d.count = idx + 1; 939| 0| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 0, False: 0] ------------------ 940| 0| return std::make_tuple(pos.shift(), node, ts, tail); 941| 967| } else { 942| 967| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 967| auto newr = newn->relaxed(); 944| 967| newn->inner()[idx] = next; 945| 967| newr->d.sizes[idx] = last + 1 - ts; 946| 967| newr->d.count = idx + 1; 947| 967| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 967, False: 0] ------------------ 948| 967| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 967] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 967| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 967| } 952| 3.37k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 1.18k, False: 2.19k] ------------------ 953| 1.18k| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 1.18k] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 1.18k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 2.19k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 2.19k] | Branch (956:40): [True: 0, False: 0] | Branch (956:52): [True: 0, False: 0] ------------------ 957| 0| auto newn = pos.node()->inner()[0]; 958| 0| if (!mutate) ------------------ | Branch (958:25): [True: 0, False: 0] ------------------ 959| 0| newn->inc(); 960| 0| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 0] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.19k| } else { 964| 2.19k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 2.19k] ------------------ 965| 0| pos.each_right(dec_visitor{}, idx + 1); 966| 0| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 0| return std::make_tuple(pos.shift(), node, ts, tail); 968| 2.19k| } else { 969| 2.19k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 2.19k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 2.19k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 2.19k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 2.19k| } 974| 2.19k| } 975| 4.34k| } 976| 4.34k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 4.34k| } 987| 4.34k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 2.98k| { 992| 2.98k| auto idx = pos.index(last); 993| 2.98k| auto node = pos.node(); 994| 2.98k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 2.98k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 2.98k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 2.98k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 2.98k| } else { 1002| 2.98k| using std::get; 1003| 2.98k| auto subs = 1004| 2.98k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 2.98k] ------------------ 1005| 2.98k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 2.98k| auto next = get<1>(subs); 1007| 2.98k| auto ts = get<2>(subs); 1008| 2.98k| auto tail = get<3>(subs); 1009| 2.98k| IMMER_TRY { ------------------ | | 49| 2.98k|#define IMMER_TRY try ------------------ 1010| 2.98k| if (next) { ------------------ | Branch (1010:21): [True: 2.14k, False: 839] ------------------ 1011| 2.14k| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 2.14k] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.14k| } else { 1016| 2.14k| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 2.14k| newn->inner()[idx] = next; 1018| 2.14k| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 2.14k] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 2.14k| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 2.14k| } 1022| 2.14k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 481, False: 358] ------------------ 1023| 481| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 481] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 481| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 481| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 358] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 0] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 358| } else { 1034| 358| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 358] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 358| } else { 1038| 358| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 358| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 358] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 358| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 358| } 1043| 358| } 1044| 2.98k| } 1045| 2.98k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 2.98k| } 1055| 2.98k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 11.8k| { 992| 11.8k| auto idx = pos.index(last); 993| 11.8k| auto node = pos.node(); 994| 11.8k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 11.8k, Folded] | Branch (994:35): [True: 7.94k, False: 3.92k] ------------------ 995| 11.8k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 11.8k, Folded] | Branch (995:25): [True: 6.66k, False: 5.19k] ------------------ 996| 6.66k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 4.63k, False: 2.03k] ------------------ 997| 6.66k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 6.66k| if (Mutating) ------------------ | Branch (998:17): [True: 6.66k, Folded] ------------------ 999| 6.66k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 6.66k| return res; 1001| 6.66k| } else { 1002| 5.19k| using std::get; 1003| 5.19k| auto subs = 1004| 5.19k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.30k, False: 1.88k] ------------------ 1005| 5.19k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.19k| auto next = get<1>(subs); 1007| 5.19k| auto ts = get<2>(subs); 1008| 5.19k| auto tail = get<3>(subs); 1009| 5.19k| IMMER_TRY { ------------------ | | 49| 5.19k|#define IMMER_TRY try ------------------ 1010| 5.19k| if (next) { ------------------ | Branch (1010:21): [True: 1.16k, False: 4.02k] ------------------ 1011| 1.16k| if (mutate) { ------------------ | Branch (1011:25): [True: 627, False: 535] ------------------ 1012| 627| node->inner()[idx] = next; 1013| 627| pos.each_right(dec_visitor{}, idx + 1); 1014| 627| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 627| } else { 1016| 535| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 535| newn->inner()[idx] = next; 1018| 535| if (Mutating) ------------------ | Branch (1018:29): [True: 535, Folded] ------------------ 1019| 535| pos.visit(dec_visitor{}); 1020| 535| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 535| } 1022| 4.02k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 4.02k] ------------------ 1023| 0| if (Mutating) ------------------ | Branch (1023:25): [True: 0, Folded] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 4.02k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 4.02k, Folded] | Branch (1026:40): [True: 3.65k, False: 375] | Branch (1026:52): [True: 2.22k, False: 1.42k] ------------------ 1027| 2.22k| auto newn = pos.node()->inner()[0]; 1028| 2.22k| if (!mutate) ------------------ | Branch (1028:25): [True: 771, False: 1.45k] ------------------ 1029| 771| newn->inc(); 1030| 2.22k| if (Mutating) ------------------ | Branch (1030:25): [True: 2.22k, Folded] ------------------ 1031| 2.22k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 2.22k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 2.22k| } else { 1034| 1.80k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.22k, False: 581] ------------------ 1035| 1.22k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.22k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.22k| } else { 1038| 581| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 581| if (Mutating) ------------------ | Branch (1039:29): [True: 581, Folded] ------------------ 1040| 581| pos.visit(dec_visitor{}); 1041| 581| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 581| } 1043| 1.80k| } 1044| 5.19k| } 1045| 5.19k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 5.19k| } 1055| 11.8k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.61k| { 1060| 1.61k| auto old_tail_size = pos.count(); 1061| 1.61k| auto new_tail_size = pos.index(last) + 1; 1062| 1.61k| auto node = pos.node(); 1063| 1.61k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.61k, Folded] | Branch (1063:42): [True: 567, False: 1.05k] ------------------ 1064| 1.61k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 396, False: 1.22k] ------------------ 1065| 396| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 396] ------------------ 1066| 0| node->inc(); 1067| 396| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.22k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 566, False: 655] ------------------ 1069| 566| detail::destroy_n(node->leaf() + new_tail_size, 1070| 566| old_tail_size - new_tail_size); 1071| 566| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 655| } else { 1073| 655| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 655| if (Mutating) ------------------ | Branch (1074:17): [True: 655, Folded] ------------------ 1075| 655| pos.visit(dec_visitor{}); 1076| 655| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 655| } 1078| 1.61k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.27k| { 992| 3.27k| auto idx = pos.index(last); 993| 3.27k| auto node = pos.node(); 994| 3.27k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.27k, Folded] | Branch (994:35): [True: 1.80k, False: 1.47k] ------------------ 995| 3.27k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.27k, Folded] | Branch (995:25): [True: 1.40k, False: 1.87k] ------------------ 996| 1.40k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 956, False: 444] ------------------ 997| 1.40k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 1.40k| if (Mutating) ------------------ | Branch (998:17): [True: 1.40k, Folded] ------------------ 999| 1.40k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 1.40k| return res; 1001| 1.87k| } else { 1002| 1.87k| using std::get; 1003| 1.87k| auto subs = 1004| 1.87k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 844, False: 1.02k] ------------------ 1005| 1.87k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.87k| auto next = get<1>(subs); 1007| 1.87k| auto ts = get<2>(subs); 1008| 1.87k| auto tail = get<3>(subs); 1009| 1.87k| IMMER_TRY { ------------------ | | 49| 1.87k|#define IMMER_TRY try ------------------ 1010| 1.87k| if (next) { ------------------ | Branch (1010:21): [True: 507, False: 1.36k] ------------------ 1011| 507| if (mutate) { ------------------ | Branch (1011:25): [True: 212, False: 295] ------------------ 1012| 212| node->inner()[idx] = next; 1013| 212| pos.each_right(dec_visitor{}, idx + 1); 1014| 212| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 295| } else { 1016| 295| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 295| newn->inner()[idx] = next; 1018| 295| if (Mutating) ------------------ | Branch (1018:29): [True: 295, Folded] ------------------ 1019| 295| pos.visit(dec_visitor{}); 1020| 295| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 295| } 1022| 1.36k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.36k] ------------------ 1023| 0| if (Mutating) ------------------ | Branch (1023:25): [True: 0, Folded] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.36k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.36k, Folded] | Branch (1026:40): [True: 1.05k, False: 310] | Branch (1026:52): [True: 650, False: 403] ------------------ 1027| 650| auto newn = pos.node()->inner()[0]; 1028| 650| if (!mutate) ------------------ | Branch (1028:25): [True: 377, False: 273] ------------------ 1029| 377| newn->inc(); 1030| 650| if (Mutating) ------------------ | Branch (1030:25): [True: 650, Folded] ------------------ 1031| 650| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 650| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 713| } else { 1034| 713| if (mutate) { ------------------ | Branch (1034:25): [True: 359, False: 354] ------------------ 1035| 359| pos.each_right(dec_visitor{}, idx + 1); 1036| 359| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 359| } else { 1038| 354| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 354| if (Mutating) ------------------ | Branch (1039:29): [True: 354, Folded] ------------------ 1040| 354| pos.visit(dec_visitor{}); 1041| 354| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 354| } 1043| 713| } 1044| 1.87k| } 1045| 1.87k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 1.87k| } 1055| 3.27k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 705| { 1060| 705| auto old_tail_size = pos.count(); 1061| 705| auto new_tail_size = pos.index(last) + 1; 1062| 705| auto node = pos.node(); 1063| 705| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 705, Folded] | Branch (1063:42): [True: 266, False: 439] ------------------ 1064| 705| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 238, False: 467] ------------------ 1065| 238| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 238] ------------------ 1066| 0| node->inc(); 1067| 238| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 467| } else if (mutate) { ------------------ | Branch (1068:20): [True: 197, False: 270] ------------------ 1069| 197| detail::destroy_n(node->leaf() + new_tail_size, 1070| 197| old_tail_size - new_tail_size); 1071| 197| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 270| } else { 1073| 270| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 270| if (Mutating) ------------------ | Branch (1074:17): [True: 270, Folded] ------------------ 1075| 270| pos.visit(dec_visitor{}); 1076| 270| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 270| } 1078| 705| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 998| { 1378| 998| auto node = pos.node(); 1379| 998| auto idx = pos.index(first); 1380| 998| auto count = pos.count(); 1381| 998| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 998| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 734, False: 264] ------------------ 1384| 998| if (mutate) { ------------------ | Branch (1384:13): [True: 734, False: 264] ------------------ 1385| 734| auto data = node->leaf(); 1386| 734| auto newcount = count - idx; 1387| 734| std::move(data + idx, data + count, data); 1388| 734| detail::destroy_n(data + newcount, idx); 1389| 734| return std::make_tuple(0, node); 1390| 734| } else { 1391| 264| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 264| if (Mutating) ------------------ | Branch (1392:17): [True: 264, Folded] ------------------ 1393| 264| pos.visit(dec_visitor{}); 1394| 264| return std::make_tuple(0, newn); 1395| 264| } 1396| 998| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 65.4k| { 1247| 65.4k| auto idx = pos.subindex(first); 1248| 65.4k| auto count = pos.count(); 1249| 65.4k| auto node = pos.node(); 1250| 65.4k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 65.4k, Folded] | Branch (1250:47): [True: 51.2k, False: 14.2k] ------------------ 1251| 65.4k| auto left_size = pos.size_before(idx); 1252| 65.4k| auto child_size = pos.size_sbh(idx, left_size); 1253| 65.4k| auto dropped_size = first; 1254| 65.4k| auto child_dropped_size = dropped_size - left_size; 1255| 65.4k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 65.4k, Folded] | Branch (1255:25): [True: 63.6k, False: 1.79k] | Branch (1255:45): [True: 4.72k, False: 58.9k] ------------------ 1256| 4.72k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 1.87k, False: 2.85k] ------------------ 1257| 4.72k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 4.72k| if (mutate) ------------------ | Branch (1258:17): [True: 1.87k, False: 2.85k] ------------------ 1259| 1.87k| pos.visit(dec_left_visitor{}, idx); 1260| 2.85k| else if (Mutating) ------------------ | Branch (1260:22): [True: 2.85k, Folded] ------------------ 1261| 2.85k| pos.visit(dec_visitor{}); 1262| 4.72k| return r; 1263| 60.7k| } else { 1264| 60.7k| using std::get; 1265| 60.7k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 49.3k, False: 11.4k] ------------------ 1266| 60.7k| : node_t::make_inner_r_e(e); 1267| 60.7k| auto newr = newn->relaxed(); 1268| 60.7k| auto newcount = count - idx; 1269| 60.7k| auto new_child_size = child_size - child_dropped_size; 1270| 60.7k| IMMER_TRY { ------------------ | | 49| 60.7k|#define IMMER_TRY try ------------------ 1271| 60.7k| auto subs = 1272| 60.7k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 49.3k, False: 11.4k] ------------------ 1273| 60.7k| : pos.towards_sub_oh( 1274| 11.4k| no_collapse_no_mut_t{}, first, idx, e); 1275| 60.7k| if (mutate) ------------------ | Branch (1275:21): [True: 49.3k, False: 11.4k] ------------------ 1276| 49.3k| pos.each_left(dec_visitor{}, idx); 1277| 60.7k| pos.copy_sizes( 1278| 60.7k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 60.7k| std::copy(node->inner() + idx + 1, 1280| 60.7k| node->inner() + count, 1281| 60.7k| newn->inner() + 1); 1282| 60.7k| newn->inner()[0] = get<1>(subs); 1283| 60.7k| newr->d.sizes[0] = new_child_size; 1284| 60.7k| newr->d.count = newcount; 1285| 60.7k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 60.7k, False: 0] ------------------ 1286| 60.7k| if (!mutate) { ------------------ | Branch (1286:21): [True: 11.4k, False: 49.3k] ------------------ 1287| 11.4k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 11.4k| if (Mutating) ------------------ | Branch (1288:25): [True: 11.4k, Folded] ------------------ 1289| 11.4k| pos.visit(dec_visitor{}); 1290| 11.4k| } 1291| 60.7k| return std::make_tuple(pos.shift(), newn); 1292| 60.7k| } 1293| 60.7k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 60.7k| } 1299| 65.4k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 2.29k| { 1247| 2.29k| auto idx = pos.subindex(first); 1248| 2.29k| auto count = pos.count(); 1249| 2.29k| auto node = pos.node(); 1250| 2.29k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.29k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.29k| auto left_size = pos.size_before(idx); 1252| 2.29k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.29k| auto dropped_size = first; 1254| 2.29k| auto child_dropped_size = dropped_size - left_size; 1255| 2.29k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.29k, Folded] | Branch (1255:25): [True: 1.06k, False: 1.23k] | Branch (1255:45): [True: 646, False: 418] ------------------ 1256| 646| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 646] ------------------ 1257| 646| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 646| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 646] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 646| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 646] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 646| return r; 1263| 1.65k| } else { 1264| 1.65k| using std::get; 1265| 1.65k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.65k] ------------------ 1266| 1.65k| : node_t::make_inner_r_e(e); 1267| 1.65k| auto newr = newn->relaxed(); 1268| 1.65k| auto newcount = count - idx; 1269| 1.65k| auto new_child_size = child_size - child_dropped_size; 1270| 1.65k| IMMER_TRY { ------------------ | | 49| 1.65k|#define IMMER_TRY try ------------------ 1271| 1.65k| auto subs = 1272| 1.65k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.65k] ------------------ 1273| 1.65k| : pos.towards_sub_oh( 1274| 1.65k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.65k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.65k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.65k| pos.copy_sizes( 1278| 1.65k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.65k| std::copy(node->inner() + idx + 1, 1280| 1.65k| node->inner() + count, 1281| 1.65k| newn->inner() + 1); 1282| 1.65k| newn->inner()[0] = get<1>(subs); 1283| 1.65k| newr->d.sizes[0] = new_child_size; 1284| 1.65k| newr->d.count = newcount; 1285| 1.65k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.65k, False: 0] ------------------ 1286| 1.65k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.65k, False: 0] ------------------ 1287| 1.65k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.65k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.65k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.65k| } 1291| 1.65k| return std::make_tuple(pos.shift(), newn); 1292| 1.65k| } 1293| 1.65k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 1.65k| } 1299| 2.29k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.03k| { 1304| 2.03k| auto idx = pos.subindex(first); 1305| 2.03k| auto count = pos.count(); 1306| 2.03k| auto node = pos.node(); 1307| 2.03k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.03k] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.03k| auto left_size = pos.size_before(idx); 1313| 2.03k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.03k| auto dropped_size = first; 1315| 2.03k| auto child_dropped_size = dropped_size - left_size; 1316| 2.03k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.03k, Folded] | Branch (1316:25): [True: 995, False: 1.04k] | Branch (1316:45): [True: 753, False: 242] ------------------ 1317| 753| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 753] ------------------ 1318| 753| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 753| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 753] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 753| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 753] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 753| return r; 1324| 1.28k| } else { 1325| 1.28k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.28k| auto newcount = count - idx; 1330| 1.28k| auto newn = 1331| 1.28k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.28k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.28k| : node_t::make_inner_r_e(e); 1336| 1.28k| auto newr = newn->relaxed(); 1337| 1.28k| IMMER_TRY { ------------------ | | 49| 1.28k|#define IMMER_TRY try ------------------ 1338| 1.28k| auto subs = 1339| 1.28k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.28k] ------------------ 1340| 1.28k| : pos.towards_sub_oh( 1341| 1.28k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.28k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.28k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.28k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.28k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.28k, False: 0] ------------------ 1346| 1.28k| pos.copy_sizes( 1347| 1.28k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.28k| newr->d.count = newcount; 1349| 1.28k| newn->inner()[0] = get<1>(subs); 1350| 1.28k| std::copy(node->inner() + idx + 1, 1351| 1.28k| node->inner() + count, 1352| 1.28k| newn->inner() + 1); 1353| 1.28k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.28k, False: 0] ------------------ 1354| 1.28k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.28k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.28k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.28k| } 1358| 1.28k| return std::make_tuple(pos.shift(), newn); 1359| 1.28k| } 1360| 1.28k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.28k| } 1373| 2.03k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 621| { 1304| 621| auto idx = pos.subindex(first); 1305| 621| auto count = pos.count(); 1306| 621| auto node = pos.node(); 1307| 621| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 621] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 621| auto left_size = pos.size_before(idx); 1313| 621| auto child_size = pos.size_sbh(idx, left_size); 1314| 621| auto dropped_size = first; 1315| 621| auto child_dropped_size = dropped_size - left_size; 1316| 621| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 621, Folded] | Branch (1316:25): [True: 199, False: 422] | Branch (1316:45): [True: 0, False: 199] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 621| } else { 1325| 621| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 621| auto newcount = count - idx; 1330| 621| auto newn = 1331| 621| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 621] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 621| : node_t::make_inner_r_e(e); 1336| 621| auto newr = newn->relaxed(); 1337| 621| IMMER_TRY { ------------------ | | 49| 621|#define IMMER_TRY try ------------------ 1338| 621| auto subs = 1339| 621| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 621] ------------------ 1340| 621| : pos.towards_sub_oh( 1341| 621| no_collapse_no_mut_t{}, first, idx, e); 1342| 621| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 621] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 621| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 621| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 621, False: 0] ------------------ 1346| 621| pos.copy_sizes( 1347| 621| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 621| newr->d.count = newcount; 1349| 621| newn->inner()[0] = get<1>(subs); 1350| 621| std::copy(node->inner() + idx + 1, 1351| 621| node->inner() + count, 1352| 621| newn->inner() + 1); 1353| 621| if (!mutate) { ------------------ | Branch (1353:21): [True: 621, False: 0] ------------------ 1354| 621| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 621| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 621] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 621| } 1358| 621| return std::make_tuple(pos.shift(), newn); 1359| 621| } 1360| 621| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 621| } 1373| 621| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 2.88k| { 1378| 2.88k| auto node = pos.node(); 1379| 2.88k| auto idx = pos.index(first); 1380| 2.88k| auto count = pos.count(); 1381| 2.88k| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 2.88k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 768, False: 2.11k] ------------------ 1384| 2.88k| if (mutate) { ------------------ | Branch (1384:13): [True: 768, False: 2.11k] ------------------ 1385| 768| auto data = node->leaf(); 1386| 768| auto newcount = count - idx; 1387| 768| std::move(data + idx, data + count, data); 1388| 768| detail::destroy_n(data + newcount, idx); 1389| 768| return std::make_tuple(0, node); 1390| 2.11k| } else { 1391| 2.11k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.11k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.11k, Folded] ------------------ 1393| 2.11k| pos.visit(dec_visitor{}); 1394| 2.11k| return std::make_tuple(0, newn); 1395| 2.11k| } 1396| 2.88k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 1.68k| { 1304| 1.68k| auto idx = pos.subindex(first); 1305| 1.68k| auto count = pos.count(); 1306| 1.68k| auto node = pos.node(); 1307| 1.68k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 1.68k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 883, False: 801] ------------------ 1312| 1.68k| auto left_size = pos.size_before(idx); 1313| 1.68k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.68k| auto dropped_size = first; 1315| 1.68k| auto child_dropped_size = dropped_size - left_size; 1316| 1.68k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.68k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [True: 0, Folded] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 1.68k| } else { 1325| 1.68k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.68k| auto newcount = count - idx; 1330| 1.68k| auto newn = 1331| 1.68k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 883, False: 801] ------------------ 1332| 883| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 883| norefs_tag{})) relaxed_t, 1334| 883| node) 1335| 1.68k| : node_t::make_inner_r_e(e); 1336| 1.68k| auto newr = newn->relaxed(); 1337| 1.68k| IMMER_TRY { ------------------ | | 49| 1.68k|#define IMMER_TRY try ------------------ 1338| 1.68k| auto subs = 1339| 1.68k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 883, False: 801] ------------------ 1340| 1.68k| : pos.towards_sub_oh( 1341| 801| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.68k| if (mutate) ------------------ | Branch (1342:21): [True: 883, False: 801] ------------------ 1343| 883| pos.each_left(dec_visitor{}, idx); 1344| 1.68k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.68k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.68k, False: 0] ------------------ 1346| 1.68k| pos.copy_sizes( 1347| 1.68k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.68k| newr->d.count = newcount; 1349| 1.68k| newn->inner()[0] = get<1>(subs); 1350| 1.68k| std::copy(node->inner() + idx + 1, 1351| 1.68k| node->inner() + count, 1352| 1.68k| newn->inner() + 1); 1353| 1.68k| if (!mutate) { ------------------ | Branch (1353:21): [True: 801, False: 883] ------------------ 1354| 801| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 801| if (Mutating) ------------------ | Branch (1355:25): [True: 801, Folded] ------------------ 1356| 801| pos.visit(dec_visitor{}); 1357| 801| } 1358| 1.68k| return std::make_tuple(pos.shift(), newn); 1359| 1.68k| } 1360| 1.68k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.68k| } 1373| 1.68k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 6.98k| { 1378| 6.98k| auto node = pos.node(); 1379| 6.98k| auto idx = pos.index(first); 1380| 6.98k| auto count = pos.count(); 1381| 6.98k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 6.98k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 6.98k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 6.98k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 6.98k| } else { 1391| 6.98k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 6.98k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 6.98k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 6.98k| return std::make_tuple(0, newn); 1395| 6.98k| } 1396| 6.98k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.13k| { 1304| 2.13k| auto idx = pos.subindex(first); 1305| 2.13k| auto count = pos.count(); 1306| 2.13k| auto node = pos.node(); 1307| 2.13k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.13k] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.13k| auto left_size = pos.size_before(idx); 1313| 2.13k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.13k| auto dropped_size = first; 1315| 2.13k| auto child_dropped_size = dropped_size - left_size; 1316| 2.13k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.13k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 2.13k| } else { 1325| 2.13k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 2.13k| auto newcount = count - idx; 1330| 2.13k| auto newn = 1331| 2.13k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.13k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.13k| : node_t::make_inner_r_e(e); 1336| 2.13k| auto newr = newn->relaxed(); 1337| 2.13k| IMMER_TRY { ------------------ | | 49| 2.13k|#define IMMER_TRY try ------------------ 1338| 2.13k| auto subs = 1339| 2.13k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.13k] ------------------ 1340| 2.13k| : pos.towards_sub_oh( 1341| 2.13k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.13k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.13k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.13k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.13k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.13k, False: 0] ------------------ 1346| 2.13k| pos.copy_sizes( 1347| 2.13k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.13k| newr->d.count = newcount; 1349| 2.13k| newn->inner()[0] = get<1>(subs); 1350| 2.13k| std::copy(node->inner() + idx + 1, 1351| 2.13k| node->inner() + count, 1352| 2.13k| newn->inner() + 1); 1353| 2.13k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.13k, False: 0] ------------------ 1354| 2.13k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.13k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.13k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.13k| } 1358| 2.13k| return std::make_tuple(pos.shift(), newn); 1359| 2.13k| } 1360| 2.13k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 2.13k| } 1373| 2.13k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_j: 1209| 2.00k| { 1210| 2.00k| using node_t = node_type; 1211| 2.00k| auto node = p.node(); 1212| 2.00k| if (node->dec()) { ------------------ | Branch (1212:13): [True: 2.00k, False: 0] ------------------ 1213| 2.00k| p.each_left(dec_t{}, idx); 1214| 2.00k| node_t::delete_inner(node, p.count()); 1215| 2.00k| } 1216| 2.00k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 4.01k| { 1378| 4.01k| auto node = pos.node(); 1379| 4.01k| auto idx = pos.index(first); 1380| 4.01k| auto count = pos.count(); 1381| 4.01k| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 4.01k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 1.87k, False: 2.14k] ------------------ 1384| 4.01k| if (mutate) { ------------------ | Branch (1384:13): [True: 1.87k, False: 2.14k] ------------------ 1385| 1.87k| auto data = node->leaf(); 1386| 1.87k| auto newcount = count - idx; 1387| 1.87k| std::move(data + idx, data + count, data); 1388| 1.87k| detail::destroy_n(data + newcount, idx); 1389| 1.87k| return std::make_tuple(0, node); 1390| 2.14k| } else { 1391| 2.14k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.14k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.14k, Folded] ------------------ 1393| 2.14k| pos.visit(dec_visitor{}); 1394| 2.14k| return std::make_tuple(0, newn); 1395| 2.14k| } 1396| 4.01k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 1.69k| { 1304| 1.69k| auto idx = pos.subindex(first); 1305| 1.69k| auto count = pos.count(); 1306| 1.69k| auto node = pos.node(); 1307| 1.69k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 1.69k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 407, False: 1.28k] ------------------ 1312| 1.69k| auto left_size = pos.size_before(idx); 1313| 1.69k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.69k| auto dropped_size = first; 1315| 1.69k| auto child_dropped_size = dropped_size - left_size; 1316| 1.69k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.69k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [True: 0, Folded] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 1.69k| } else { 1325| 1.69k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.69k| auto newcount = count - idx; 1330| 1.69k| auto newn = 1331| 1.69k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 407, False: 1.28k] ------------------ 1332| 407| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 407| norefs_tag{})) relaxed_t, 1334| 407| node) 1335| 1.69k| : node_t::make_inner_r_e(e); 1336| 1.69k| auto newr = newn->relaxed(); 1337| 1.69k| IMMER_TRY { ------------------ | | 49| 1.69k|#define IMMER_TRY try ------------------ 1338| 1.69k| auto subs = 1339| 1.69k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 407, False: 1.28k] ------------------ 1340| 1.69k| : pos.towards_sub_oh( 1341| 1.28k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.69k| if (mutate) ------------------ | Branch (1342:21): [True: 407, False: 1.28k] ------------------ 1343| 407| pos.each_left(dec_visitor{}, idx); 1344| 1.69k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.69k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.69k, False: 0] ------------------ 1346| 1.69k| pos.copy_sizes( 1347| 1.69k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.69k| newr->d.count = newcount; 1349| 1.69k| newn->inner()[0] = get<1>(subs); 1350| 1.69k| std::copy(node->inner() + idx + 1, 1351| 1.69k| node->inner() + count, 1352| 1.69k| newn->inner() + 1); 1353| 1.69k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.28k, False: 407] ------------------ 1354| 1.28k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.28k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.28k, Folded] ------------------ 1356| 1.28k| pos.visit(dec_visitor{}); 1357| 1.28k| } 1358| 1.69k| return std::make_tuple(pos.shift(), newn); 1359| 1.69k| } 1360| 1.69k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.69k| } 1373| 1.69k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 55.4k| { 1378| 55.4k| auto node = pos.node(); 1379| 55.4k| auto idx = pos.index(first); 1380| 55.4k| auto count = pos.count(); 1381| 55.4k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 55.4k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 55.4k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 55.4k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 55.4k| } else { 1391| 55.4k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 55.4k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 55.4k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 55.4k| return std::make_tuple(0, newn); 1395| 55.4k| } 1396| 55.4k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 1.24k| { 1304| 1.24k| auto idx = pos.subindex(first); 1305| 1.24k| auto count = pos.count(); 1306| 1.24k| auto node = pos.node(); 1307| 1.24k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.24k] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 1.24k| auto left_size = pos.size_before(idx); 1313| 1.24k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.24k| auto dropped_size = first; 1315| 1.24k| auto child_dropped_size = dropped_size - left_size; 1316| 1.24k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.24k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 1.24k| } else { 1325| 1.24k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.24k| auto newcount = count - idx; 1330| 1.24k| auto newn = 1331| 1.24k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.24k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.24k| : node_t::make_inner_r_e(e); 1336| 1.24k| auto newr = newn->relaxed(); 1337| 1.24k| IMMER_TRY { ------------------ | | 49| 1.24k|#define IMMER_TRY try ------------------ 1338| 1.24k| auto subs = 1339| 1.24k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.24k] ------------------ 1340| 1.24k| : pos.towards_sub_oh( 1341| 1.24k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.24k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.24k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.24k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.24k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.24k, False: 0] ------------------ 1346| 1.24k| pos.copy_sizes( 1347| 1.24k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.24k| newr->d.count = newcount; 1349| 1.24k| newn->inner()[0] = get<1>(subs); 1350| 1.24k| std::copy(node->inner() + idx + 1, 1351| 1.24k| node->inner() + count, 1352| 1.24k| newn->inner() + 1); 1353| 1.24k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.24k, False: 0] ------------------ 1354| 1.24k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.24k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.24k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.24k| } 1358| 1.24k| return std::make_tuple(pos.shift(), newn); 1359| 1.24k| } 1360| 1.24k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.24k| } 1373| 1.24k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_j: 1198| 1.87k| { 1199| 1.87k| using node_t = node_type; 1200| 1.87k| auto node = p.node(); 1201| 1.87k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 1.87k, False: 0] ------------------ 1202| 1.87k| p.each_left(dec_t{}, idx); 1203| 1.87k| node_t::delete_inner_r(node, p.count()); 1204| 1.87k| } 1205| 1.87k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 226k| { 1247| 226k| auto idx = pos.subindex(first); 1248| 226k| auto count = pos.count(); 1249| 226k| auto node = pos.node(); 1250| 226k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 226k, Folded] | Branch (1250:47): [True: 183k, False: 43.6k] ------------------ 1251| 226k| auto left_size = pos.size_before(idx); 1252| 226k| auto child_size = pos.size_sbh(idx, left_size); 1253| 226k| auto dropped_size = first; 1254| 226k| auto child_dropped_size = dropped_size - left_size; 1255| 226k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 226k] | Branch (1255:25): [True: 0, False: 0] | Branch (1255:45): [True: 0, False: 0] ------------------ 1256| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 0] ------------------ 1257| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 0| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 0] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 0| else if (Mutating) ------------------ | Branch (1260:22): [True: 0, Folded] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 0| return r; 1263| 226k| } else { 1264| 226k| using std::get; 1265| 226k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 183k, False: 43.6k] ------------------ 1266| 226k| : node_t::make_inner_r_e(e); 1267| 226k| auto newr = newn->relaxed(); 1268| 226k| auto newcount = count - idx; 1269| 226k| auto new_child_size = child_size - child_dropped_size; 1270| 226k| IMMER_TRY { ------------------ | | 49| 226k|#define IMMER_TRY try ------------------ 1271| 226k| auto subs = 1272| 226k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 183k, False: 43.6k] ------------------ 1273| 226k| : pos.towards_sub_oh( 1274| 43.6k| no_collapse_no_mut_t{}, first, idx, e); 1275| 226k| if (mutate) ------------------ | Branch (1275:21): [True: 183k, False: 43.6k] ------------------ 1276| 183k| pos.each_left(dec_visitor{}, idx); 1277| 226k| pos.copy_sizes( 1278| 226k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 226k| std::copy(node->inner() + idx + 1, 1280| 226k| node->inner() + count, 1281| 226k| newn->inner() + 1); 1282| 226k| newn->inner()[0] = get<1>(subs); 1283| 226k| newr->d.sizes[0] = new_child_size; 1284| 226k| newr->d.count = newcount; 1285| 226k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 226k, False: 0] ------------------ 1286| 226k| if (!mutate) { ------------------ | Branch (1286:21): [True: 43.6k, False: 183k] ------------------ 1287| 43.6k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 43.6k| if (Mutating) ------------------ | Branch (1288:25): [True: 43.6k, Folded] ------------------ 1289| 43.6k| pos.visit(dec_visitor{}); 1290| 43.6k| } 1291| 226k| return std::make_tuple(pos.shift(), newn); 1292| 226k| } 1293| 226k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 226k| } 1299| 226k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 78.3k| { 1247| 78.3k| auto idx = pos.subindex(first); 1248| 78.3k| auto count = pos.count(); 1249| 78.3k| auto node = pos.node(); 1250| 78.3k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 78.3k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 78.3k| auto left_size = pos.size_before(idx); 1252| 78.3k| auto child_size = pos.size_sbh(idx, left_size); 1253| 78.3k| auto dropped_size = first; 1254| 78.3k| auto child_dropped_size = dropped_size - left_size; 1255| 78.3k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 78.3k] | Branch (1255:25): [True: 0, False: 0] | Branch (1255:45): [True: 0, False: 0] ------------------ 1256| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 0] ------------------ 1257| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 0| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 0] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 0| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 0] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 0| return r; 1263| 78.3k| } else { 1264| 78.3k| using std::get; 1265| 78.3k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 78.3k] ------------------ 1266| 78.3k| : node_t::make_inner_r_e(e); 1267| 78.3k| auto newr = newn->relaxed(); 1268| 78.3k| auto newcount = count - idx; 1269| 78.3k| auto new_child_size = child_size - child_dropped_size; 1270| 78.3k| IMMER_TRY { ------------------ | | 49| 78.3k|#define IMMER_TRY try ------------------ 1271| 78.3k| auto subs = 1272| 78.3k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 78.3k] ------------------ 1273| 78.3k| : pos.towards_sub_oh( 1274| 78.3k| no_collapse_no_mut_t{}, first, idx, e); 1275| 78.3k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 78.3k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 78.3k| pos.copy_sizes( 1278| 78.3k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 78.3k| std::copy(node->inner() + idx + 1, 1280| 78.3k| node->inner() + count, 1281| 78.3k| newn->inner() + 1); 1282| 78.3k| newn->inner()[0] = get<1>(subs); 1283| 78.3k| newr->d.sizes[0] = new_child_size; 1284| 78.3k| newr->d.count = newcount; 1285| 78.3k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 78.3k, False: 0] ------------------ 1286| 78.3k| if (!mutate) { ------------------ | Branch (1286:21): [True: 78.3k, False: 0] ------------------ 1287| 78.3k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 78.3k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 78.3k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 78.3k| } 1291| 78.3k| return std::make_tuple(pos.shift(), newn); 1292| 78.3k| } 1293| 78.3k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 78.3k| } 1299| 78.3k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 6.65k| { 1304| 6.65k| auto idx = pos.subindex(first); 1305| 6.65k| auto count = pos.count(); 1306| 6.65k| auto node = pos.node(); 1307| 6.65k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 6.65k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 4.64k, False: 2.00k] ------------------ 1312| 6.65k| auto left_size = pos.size_before(idx); 1313| 6.65k| auto child_size = pos.size_sbh(idx, left_size); 1314| 6.65k| auto dropped_size = first; 1315| 6.65k| auto child_dropped_size = dropped_size - left_size; 1316| 6.65k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 6.65k, Folded] | Branch (1316:25): [True: 4.53k, False: 2.11k] | Branch (1316:45): [True: 2.71k, False: 1.82k] ------------------ 1317| 2.71k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 2.00k, False: 705] ------------------ 1318| 2.71k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 2.71k| if (mutate) ------------------ | Branch (1319:17): [True: 2.00k, False: 705] ------------------ 1320| 2.00k| pos.visit(dec_left_visitor{}, idx); 1321| 705| else if (Mutating) ------------------ | Branch (1321:22): [True: 705, Folded] ------------------ 1322| 705| pos.visit(dec_visitor{}); 1323| 2.71k| return r; 1324| 3.94k| } else { 1325| 3.94k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 3.94k| auto newcount = count - idx; 1330| 3.94k| auto newn = 1331| 3.94k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 2.64k, False: 1.30k] ------------------ 1332| 2.64k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 2.64k| norefs_tag{})) relaxed_t, 1334| 2.64k| node) 1335| 3.94k| : node_t::make_inner_r_e(e); 1336| 3.94k| auto newr = newn->relaxed(); 1337| 3.94k| IMMER_TRY { ------------------ | | 49| 3.94k|#define IMMER_TRY try ------------------ 1338| 3.94k| auto subs = 1339| 3.94k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 2.64k, False: 1.30k] ------------------ 1340| 3.94k| : pos.towards_sub_oh( 1341| 1.30k| no_collapse_no_mut_t{}, first, idx, e); 1342| 3.94k| if (mutate) ------------------ | Branch (1342:21): [True: 2.64k, False: 1.30k] ------------------ 1343| 2.64k| pos.each_left(dec_visitor{}, idx); 1344| 3.94k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 3.94k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 3.94k, False: 0] ------------------ 1346| 3.94k| pos.copy_sizes( 1347| 3.94k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 3.94k| newr->d.count = newcount; 1349| 3.94k| newn->inner()[0] = get<1>(subs); 1350| 3.94k| std::copy(node->inner() + idx + 1, 1351| 3.94k| node->inner() + count, 1352| 3.94k| newn->inner() + 1); 1353| 3.94k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.30k, False: 2.64k] ------------------ 1354| 1.30k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.30k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.30k, Folded] ------------------ 1356| 1.30k| pos.visit(dec_visitor{}); 1357| 1.30k| } 1358| 3.94k| return std::make_tuple(pos.shift(), newn); 1359| 3.94k| } 1360| 3.94k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 3.94k| } 1373| 6.65k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 1.08k| { 1304| 1.08k| auto idx = pos.subindex(first); 1305| 1.08k| auto count = pos.count(); 1306| 1.08k| auto node = pos.node(); 1307| 1.08k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 1.08k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 633, False: 448] ------------------ 1312| 1.08k| auto left_size = pos.size_before(idx); 1313| 1.08k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.08k| auto dropped_size = first; 1315| 1.08k| auto child_dropped_size = dropped_size - left_size; 1316| 1.08k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 1.08k, Folded] | Branch (1316:25): [True: 70, False: 1.01k] | Branch (1316:45): [True: 0, False: 70] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [True: 0, Folded] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 1.08k| } else { 1325| 1.08k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.08k| auto newcount = count - idx; 1330| 1.08k| auto newn = 1331| 1.08k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 633, False: 448] ------------------ 1332| 633| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 633| norefs_tag{})) relaxed_t, 1334| 633| node) 1335| 1.08k| : node_t::make_inner_r_e(e); 1336| 1.08k| auto newr = newn->relaxed(); 1337| 1.08k| IMMER_TRY { ------------------ | | 49| 1.08k|#define IMMER_TRY try ------------------ 1338| 1.08k| auto subs = 1339| 1.08k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 633, False: 448] ------------------ 1340| 1.08k| : pos.towards_sub_oh( 1341| 448| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.08k| if (mutate) ------------------ | Branch (1342:21): [True: 633, False: 448] ------------------ 1343| 633| pos.each_left(dec_visitor{}, idx); 1344| 1.08k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.08k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.08k, False: 0] ------------------ 1346| 1.08k| pos.copy_sizes( 1347| 1.08k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.08k| newr->d.count = newcount; 1349| 1.08k| newn->inner()[0] = get<1>(subs); 1350| 1.08k| std::copy(node->inner() + idx + 1, 1351| 1.08k| node->inner() + count, 1352| 1.08k| newn->inner() + 1); 1353| 1.08k| if (!mutate) { ------------------ | Branch (1353:21): [True: 448, False: 633] ------------------ 1354| 448| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 448| if (Mutating) ------------------ | Branch (1355:25): [True: 448, Folded] ------------------ 1356| 448| pos.visit(dec_visitor{}); 1357| 448| } 1358| 1.08k| return std::make_tuple(pos.shift(), newn); 1359| 1.08k| } 1360| 1.08k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.08k| } 1373| 1.08k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 10.1k| { 350| 10.1k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 10.1k, False: 0] ------------------ 351| 10.1k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 9.43k, False: 711] ------------------ 352| 10.1k| ? visit_maybe_relaxed_sub(rootl, 353| 9.43k| shiftl, 354| 9.43k| sizel, 355| 9.43k| this_t{}, 356| 9.43k| posr, 357| 9.43k| first, 358| 9.43k| size_t{}) 359| 10.1k| : posr.first_sub_inner( 360| 711| rrb{}, first, rootl, shiftl, sizel); 361| 10.1k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 22.5k| { 383| 22.5k| auto nl = posl.node(); 384| 22.5k| auto nr = posr.node(); 385| 22.5k| if (nl == nr) ------------------ | Branch (385:13): [True: 7.83k, False: 14.6k] ------------------ 386| 7.83k| return true; 387| 14.6k| auto cl = posl.count(); 388| 14.6k| auto cr = posr.count(); 389| 14.6k| assert(cr > 0); ------------------ | Branch (389:9): [True: 14.6k, False: 0] ------------------ 390| 14.6k| auto sbr = size_t{}; 391| 14.6k| auto i = count_t{}; 392| 14.6k| auto j = count_t{}; 393| 81.4k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 71.3k, False: 10.0k] ------------------ 394| 71.3k| auto sbl = posl.size_before(i); 395| 127k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 111k, False: 15.6k] | Branch (395:34): [True: 56.2k, False: 55.6k] ------------------ 396| 56.2k| ; 397| 71.3k| auto res = 398| 71.3k| sbl == sbr ------------------ | Branch (398:17): [True: 34.1k, False: 37.1k] ------------------ 399| 71.3k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 71.3k| : posl.nth_sub(i, 401| 37.1k| for_each_chunk_p_visitor{}, 402| 37.1k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 71.3k| if (!res) ------------------ | Branch (403:17): [True: 4.57k, False: 66.7k] ------------------ 404| 4.57k| return false; 405| 71.3k| } 406| 10.0k| return true; 407| 14.6k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 16.4k| { 337| 16.4k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 16.4k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 17.2k| { 428| 17.2k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 10.7k, False: 6.46k] ------------------ 429| 10.7k| return true; 430| 6.46k| auto cl = posl.count(); 431| 6.46k| auto cr = posr.count(); 432| 6.46k| auto mp = std::min(cl, cr); 433| 6.46k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 5.49k, False: 969] ------------------ 434| 6.46k| posl.node()->leaf() + mp, 435| 6.46k| posr.node()->leaf()) && 436| 5.49k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 5.27k, False: 228] ------------------ 437| 5.49k| posl.node()->leaf() + posl.count(), 438| 5.49k| first + (idx + mp)); 439| 17.2k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 16.0k| { 330| 16.0k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 16.0k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIX12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 412| 4.17k| { 413| 4.17k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.17k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 4.17k| { 383| 4.17k| auto nl = posl.node(); 384| 4.17k| auto nr = posr.node(); 385| 4.17k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.17k] ------------------ 386| 0| return true; 387| 4.17k| auto cl = posl.count(); 388| 4.17k| auto cr = posr.count(); 389| 4.17k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.17k, False: 0] ------------------ 390| 4.17k| auto sbr = size_t{}; 391| 4.17k| auto i = count_t{}; 392| 4.17k| auto j = count_t{}; 393| 12.1k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 9.72k, False: 2.46k] ------------------ 394| 9.72k| auto sbl = posl.size_before(i); 395| 15.2k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 12.3k, False: 2.92k] | Branch (395:34): [True: 5.51k, False: 6.79k] ------------------ 396| 5.51k| ; 397| 9.72k| auto res = 398| 9.72k| sbl == sbr ------------------ | Branch (398:17): [True: 6.55k, False: 3.17k] ------------------ 399| 9.72k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 9.72k| : posl.nth_sub(i, 401| 3.17k| for_each_chunk_p_visitor{}, 402| 3.17k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 9.72k| if (!res) ------------------ | Branch (403:17): [True: 1.70k, False: 8.01k] ------------------ 404| 1.70k| return false; 405| 9.72k| } 406| 2.46k| return true; 407| 4.17k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 3.81k| { 337| 3.81k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 3.81k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_12leaf_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 10.6k| { 428| 10.6k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 8.20k, False: 2.42k] ------------------ 429| 8.20k| return true; 430| 2.42k| auto cl = posl.count(); 431| 2.42k| auto cr = posr.count(); 432| 2.42k| auto mp = std::min(cl, cr); 433| 2.42k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 1.96k, False: 464] ------------------ 434| 2.42k| posl.node()->leaf() + mp, 435| 2.42k| posr.node()->leaf()) && 436| 1.96k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 1.74k, False: 220] ------------------ 437| 1.96k| posl.node()->leaf() + posl.count(), 438| 1.96k| first + (idx + mp)); 439| 10.6k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 2.17k| { 330| 2.17k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.17k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIX12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 412| 2.17k| { 413| 2.17k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.17k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 2.17k| { 383| 2.17k| auto nl = posl.node(); 384| 2.17k| auto nr = posr.node(); 385| 2.17k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.17k] ------------------ 386| 0| return true; 387| 2.17k| auto cl = posl.count(); 388| 2.17k| auto cr = posr.count(); 389| 2.17k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.17k, False: 0] ------------------ 390| 2.17k| auto sbr = size_t{}; 391| 2.17k| auto i = count_t{}; 392| 2.17k| auto j = count_t{}; 393| 16.3k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 14.5k, False: 1.73k] ------------------ 394| 14.5k| auto sbl = posl.size_before(i); 395| 24.9k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 20.5k, False: 4.40k] | Branch (395:34): [True: 10.4k, False: 10.1k] ------------------ 396| 10.4k| ; 397| 14.5k| auto res = 398| 14.5k| sbl == sbr ------------------ | Branch (398:17): [True: 8.95k, False: 5.61k] ------------------ 399| 14.5k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 14.5k| : posl.nth_sub(i, 401| 5.61k| for_each_chunk_p_visitor{}, 402| 5.61k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 14.5k| if (!res) ------------------ | Branch (403:17): [True: 441, False: 14.1k] ------------------ 404| 441| return false; 405| 14.5k| } 406| 1.73k| return true; 407| 2.17k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 7.62k| { 337| 7.62k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 7.62k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 476| { 330| 476| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 476| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 851| { 330| 851| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 851| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 419| 1.41k| { 420| 1.41k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.41k, False: 0] ------------------ 421| 1.41k| ? this_t::visit_regular(posl, posr.node()) 422| 1.41k| : this_t::visit_regular(posr, posl.node()); 423| 1.41k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 20.4k| { 444| 20.4k| auto node = pos.node(); 445| 20.4k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 12.9k, False: 7.50k] | Branch (445:33): [True: 2.98k, False: 4.52k] ------------------ 446| 20.4k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 29.6k| { 451| 29.6k| auto node = pos.node(); 452| 29.6k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 20.0k, False: 9.53k] | Branch (452:33): [True: 5.66k, False: 3.86k] ------------------ 453| 9.53k| node->leaf() + pos.count(), 454| 9.53k| other->leaf()); 455| 29.6k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 10.3k| { 444| 10.3k| auto node = pos.node(); 445| 10.3k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 3.38k, False: 7.01k] | Branch (445:33): [True: 2.73k, False: 4.27k] ------------------ 446| 10.3k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 2.86k| { 451| 2.86k| auto node = pos.node(); 452| 2.86k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.48k, False: 1.37k] | Branch (452:33): [True: 571, False: 806] ------------------ 453| 1.37k| node->leaf() + pos.count(), 454| 1.37k| other->leaf()); 455| 2.86k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 4.17k| { 444| 4.17k| auto node = pos.node(); 445| 4.17k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 674, False: 3.50k] | Branch (445:33): [True: 2.40k, False: 1.10k] ------------------ 446| 4.17k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 195k| { 113| 195k| auto data = as_const(pos.node()->leaf()); 114| 195k| return fn(data, data + pos.count()); 115| 195k| } _ZZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaOT_ENUlSE_T0_E_clIPKiSK_EEDaSE_SG_: 367| 1.01M| return [iter](auto f, auto e) mutable { 368| 1.01M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 73.7k, False: 942k] ------------------ 369| 73.7k| iter += e - f; 370| 73.7k| return true; 371| 73.7k| } 372| 8.04M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 7.10M, False: 940k] ------------------ 373| 7.10M| if (*f != *iter) ------------------ | Branch (373:21): [True: 2.32k, False: 7.10M] ------------------ 374| 2.32k| return false; 375| 940k| return true; 376| 942k| }; _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 3.78M| { 54| 3.78M| return pos.towards(this_t{}, idx); 55| 3.78M| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 848k| { 60| 848k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 848k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 216k| { 54| 216k| return pos.towards(this_t{}, idx); 55| 216k| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 202k| { 60| 202k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 202k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 296k| { 54| 296k| return pos.towards(this_t{}, idx); 55| 296k| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 14.2k| { 60| 14.2k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 14.2k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 36.1k| { 54| 36.1k| return pos.towards(this_t{}, idx); 55| 36.1k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 21.1k| { 107| 21.1k| return pos.each_pred(this_t{}, fn); 108| 21.1k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 561| { 330| 561| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 561| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSM_OT1_m: 419| 9.51k| { 420| 9.51k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 9.51k, False: 0] ------------------ 421| 9.51k| ? this_t::visit_regular(posl, posr.node()) 422| 9.51k| : this_t::visit_regular(posr, posl.node()); 423| 9.51k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 812k| { 113| 812k| auto data = as_const(pos.node()->leaf()); 114| 812k| return fn(data, data + pos.count()); 115| 812k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 8.90k| { 107| 8.90k| return pos.each_pred(this_t{}, fn); 108| 8.90k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 7.81k| { 113| 7.81k| auto data = as_const(pos.node()->leaf()); 114| 7.81k| return fn(data, data + pos.count()); 115| 7.81k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 3.92k| { 107| 3.92k| return pos.each_pred(this_t{}, fn); 108| 3.92k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 2.18k| { 330| 2.18k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.18k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 2.35k| { 383| 2.35k| auto nl = posl.node(); 384| 2.35k| auto nr = posr.node(); 385| 2.35k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.35k] ------------------ 386| 0| return true; 387| 2.35k| auto cl = posl.count(); 388| 2.35k| auto cr = posr.count(); 389| 2.35k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.35k, False: 0] ------------------ 390| 2.35k| auto sbr = size_t{}; 391| 2.35k| auto i = count_t{}; 392| 2.35k| auto j = count_t{}; 393| 7.92k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 6.76k, False: 1.15k] ------------------ 394| 6.76k| auto sbl = posl.size_before(i); 395| 10.2k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 7.64k, False: 2.56k] | Branch (395:34): [True: 3.45k, False: 4.19k] ------------------ 396| 3.45k| ; 397| 6.76k| auto res = 398| 6.76k| sbl == sbr ------------------ | Branch (398:17): [True: 3.87k, False: 2.88k] ------------------ 399| 6.76k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 6.76k| : posl.nth_sub(i, 401| 2.88k| for_each_chunk_p_visitor{}, 402| 2.88k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 6.76k| if (!res) ------------------ | Branch (403:17): [True: 1.19k, False: 5.57k] ------------------ 404| 1.19k| return false; 405| 6.76k| } 406| 1.15k| return true; 407| 2.35k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 5.07k| { 337| 5.07k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 5.07k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_13full_leaf_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 5.07k| { 428| 5.07k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 3.64k, False: 1.42k] ------------------ 429| 3.64k| return true; 430| 1.42k| auto cl = posl.count(); 431| 1.42k| auto cr = posr.count(); 432| 1.42k| auto mp = std::min(cl, cr); 433| 1.42k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 977, False: 451] ------------------ 434| 1.42k| posl.node()->leaf() + mp, 435| 1.42k| posr.node()->leaf()) && 436| 977| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 977, False: 0] ------------------ 437| 977| posl.node()->leaf() + posl.count(), 438| 977| first + (idx + mp)); 439| 5.07k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 1.99k| { 330| 1.99k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 1.99k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_8full_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 1.12k| { 383| 1.12k| auto nl = posl.node(); 384| 1.12k| auto nr = posr.node(); 385| 1.12k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.12k] ------------------ 386| 0| return true; 387| 1.12k| auto cl = posl.count(); 388| 1.12k| auto cr = posr.count(); 389| 1.12k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.12k, False: 0] ------------------ 390| 1.12k| auto sbr = size_t{}; 391| 1.12k| auto i = count_t{}; 392| 1.12k| auto j = count_t{}; 393| 7.68k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 6.82k, False: 860] ------------------ 394| 6.82k| auto sbl = posl.size_before(i); 395| 12.4k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 11.7k, False: 746] | Branch (395:34): [True: 5.66k, False: 6.08k] ------------------ 396| 5.66k| ; 397| 6.82k| auto res = 398| 6.82k| sbl == sbr ------------------ | Branch (398:17): [True: 3.75k, False: 3.07k] ------------------ 399| 6.82k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 6.82k| : posl.nth_sub(i, 401| 3.07k| for_each_chunk_p_visitor{}, 402| 3.07k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 6.82k| if (!res) ------------------ | Branch (403:17): [True: 261, False: 6.56k] ------------------ 404| 261| return false; 405| 6.82k| } 406| 860| return true; 407| 1.12k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_8full_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 419| 876| { 420| 876| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 876, False: 0] ------------------ 421| 876| ? this_t::visit_regular(posl, posr.node()) 422| 876| : this_t::visit_regular(posr, posl.node()); 423| 876| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 120k| { 107| 120k| return pos.each_pred(this_t{}, fn); 108| 120k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaOT_: 366| 51.9k| { 367| 51.9k| return [iter](auto f, auto e) mutable { 368| 51.9k| if (f == &*iter) { 369| 51.9k| iter += e - f; 370| 51.9k| return true; 371| 51.9k| } 372| 51.9k| for (; f != e; ++f, ++iter) 373| 51.9k| if (*f != *iter) 374| 51.9k| return false; 375| 51.9k| return true; 376| 51.9k| }; 377| 51.9k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 973| { 350| 973| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 973, False: 0] ------------------ 351| 973| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 711, False: 262] ------------------ 352| 973| ? visit_maybe_relaxed_sub(rootl, 353| 711| shiftl, 354| 711| sizel, 355| 711| this_t{}, 356| 711| posr, 357| 711| first, 358| 711| size_t{}) 359| 973| : posr.first_sub_inner( 360| 262| rrb{}, first, rootl, shiftl, sizel); 361| 973| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 9.68k| { 350| 9.68k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 9.68k, False: 0] ------------------ 351| 9.68k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 9.68k, False: 0] ------------------ 352| 9.68k| ? visit_maybe_relaxed_sub(rootl, 353| 9.68k| shiftl, 354| 9.68k| sizel, 355| 9.68k| this_t{}, 356| 9.68k| posr, 357| 9.68k| first, 358| 9.68k| size_t{}) 359| 9.68k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 9.68k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 6.51k| { 451| 6.51k| auto node = pos.node(); 452| 6.51k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.42k, False: 5.08k] | Branch (452:33): [True: 1.85k, False: 3.23k] ------------------ 453| 5.08k| node->leaf() + pos.count(), 454| 5.08k| other->leaf()); 455| 6.51k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_11dec_visitorEJEEEDcPT_jmT0_DpOT1_: 1838| 228M|{ 1839| 228M| assert(node); ------------------ | Branch (1839:5): [True: 228M, False: 0] ------------------ 1840| 228M| auto relaxed = node->relaxed(); 1841| 228M| if (relaxed) { ------------------ | Branch (1841:9): [True: 212M, False: 16.6M] ------------------ 1842| 212M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 212M, False: 0] ------------------ 1843| 212M| return make_relaxed_pos(node, shift, relaxed) 1844| 212M| .visit(v, std::forward(args)...); 1845| 212M| } else { 1846| 16.6M| return make_regular_sub_pos(node, shift, size) 1847| 16.6M| .visit(v, std::forward(args)...); 1848| 16.6M| } 1849| 228M|} _ZN5immer6detail4rbts16make_relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_11relaxed_posIT_EEPSE_jPNSE_9relaxed_tE: 1828| 585M|{ 1829| 585M| assert(node); ------------------ | Branch (1829:5): [True: 585M, False: 0] ------------------ 1830| 585M| assert(relaxed); ------------------ | Branch (1830:5): [True: 585M, False: 0] ------------------ 1831| 585M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 585M, False: 0] ------------------ 1832| 585M| return {node, shift, relaxed}; 1833| 585M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 239M| { 1814| 239M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 239M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 1431| 398M| node_t* node() const { return node_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 1476| 46.6M| { 1477| 46.6M| each_left(v, relaxed_->d.count, args...); 1478| 46.6M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 46.8M| { 1624| 46.8M| auto p = node_->inner(); 1625| 46.8M| auto s = size_t{}; 1626| 46.8M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 10.2M, False: 36.5M] ------------------ 1627| 83.4M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 73.2M, False: 10.2M] ------------------ 1628| 73.2M| IMMER_PREFETCH(p + i + 1); 1629| 73.2M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 73.2M| .visit(v, args...); 1631| 73.2M| s = relaxed_->d.sizes[i]; 1632| 73.2M| assert(s); ------------------ | Branch (1632:17): [True: 73.2M, False: 0] ------------------ 1633| 73.2M| } 1634| 36.5M| } else { 1635| 36.5M| auto ss = shift_ - B; 1636| 262M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 225M, False: 36.5M] ------------------ 1637| 225M| visit_maybe_relaxed_sub( 1638| 225M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 225M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 225M, False: 0] ------------------ 1641| 225M| } 1642| 36.5M| } 1643| 46.8M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 1430| 360M| count_t count() const { return relaxed_->d.count; } _ZN5immer6detail4rbts20make_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_15regular_sub_posIT_EEPSE_jm: 1044| 27.2M|{ 1045| 27.2M| assert(node); ------------------ | Branch (1045:5): [True: 27.2M, False: 0] ------------------ 1046| 27.2M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 27.2M, False: 0] ------------------ 1047| 27.2M| assert(size > 0); ------------------ | Branch (1047:5): [True: 27.2M, False: 0] ------------------ 1048| 27.2M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 27.2M, False: 0] ------------------ 1049| 27.2M| return {node, shift, size}; 1050| 27.2M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1036| 16.6M| { 1037| 16.6M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 16.6M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 785| 28.8M| node_t* node() const { return node_; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 825| 1.15M| { 826| 1.15M| return each_regular(*this, v, args...); 827| 1.15M| } _ZN5immer6detail4rbts12each_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_DpOT1_: 343| 1.15M|{ 344| 1.15M| constexpr auto B = bits; 345| 1.15M| constexpr auto BL = bits_leaf; 346| 1.15M| auto n = p.node()->inner(); 347| 1.15M| auto last = p.count() - 1; 348| 1.15M| auto e = n + last; 349| 1.15M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 89.1k, False: 1.06M] ------------------ 350| 283k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 194k, False: 89.1k] ------------------ 351| 194k| IMMER_PREFETCH(n + 1); 352| 194k| make_full_leaf_pos(*n).visit(v, args...); 353| 194k| } 354| 89.1k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 1.06M| } else { 356| 1.06M| auto ss = p.shift() - B; 357| 3.61M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 2.54M, False: 1.06M] ------------------ 358| 2.54M| make_full_pos(*n, ss).visit(v, args...); 359| 1.06M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 1.06M| } 361| 1.15M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 787| 12.7M| shift_t shift() const { return shift_; } _ZN5immer6detail4rbts18make_full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_13full_leaf_posIT_EEPSE_: 214| 14.7M|{ 215| 14.7M| assert(node); ------------------ | Branch (215:5): [True: 14.7M, False: 0] ------------------ 216| 14.7M| return {node}; 217| 14.7M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 4.32M| { 208| 4.32M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 4.32M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 199| 9.95M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 198| 10.9M| count_t count() const { return branches; } _ZN5immer6detail4rbts13make_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_8leaf_posIT_EEPSE_m: 119| 2.53M|{ 120| 2.53M| assert(node); ------------------ | Branch (120:5): [True: 2.53M, False: 0] ------------------ 121| 2.53M| assert(size > 0); ------------------ | Branch (121:5): [True: 2.53M, False: 0] ------------------ 122| 2.53M| return {node, size}; 123| 2.53M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 786| 10.3M| size_t size() const { return size_; } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 112| 1.11M| { 113| 1.11M| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.11M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 104| 2.53M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 103| 3.41M| count_t count() const { return index(size_ - 1) + 1; } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 107| 3.44M| count_t index(size_t idx) const { return idx & mask; } _ZN5immer6detail4rbts13make_full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_8full_posIT_EEPSE_j: 1412| 11.1M|{ 1413| 11.1M| assert(node); ------------------ | Branch (1413:5): [True: 11.1M, False: 0] ------------------ 1414| 11.1M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 11.1M, False: 0] ------------------ 1415| 11.1M| return {node, shift}; 1416| 11.1M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 9.57M| { 1406| 9.57M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 9.57M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 1159| 10.2M| node_t* node() const { return node_; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 1185| 103k| { 1186| 103k| auto p = node_->inner(); 1187| 103k| auto e = p + branches; 1188| 103k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 90.4k, False: 13.2k] ------------------ 1189| 814k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 723k, False: 90.4k] ------------------ 1190| 723k| IMMER_PREFETCH(p + 1); 1191| 723k| make_full_leaf_pos(*p).visit(v, args...); 1192| 723k| } 1193| 90.4k| } else { 1194| 13.2k| auto ss = shift_ - B; 1195| 119k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 106k, False: 13.2k] ------------------ 1196| 106k| make_full_pos(*p, ss).visit(v, args...); 1197| 13.2k| } 1198| 103k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 1158| 1.30M| count_t count() const { return branches; } _ZN5immer6detail4rbts16make_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_11regular_posIT_EEPSE_jm: 690| 9.67M|{ 691| 9.67M| assert(node); ------------------ | Branch (691:5): [True: 9.67M, False: 0] ------------------ 692| 9.67M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 9.67M, False: 0] ------------------ 693| 9.67M| assert(size > 0); ------------------ | Branch (693:5): [True: 9.67M, False: 0] ------------------ 694| 9.67M| return {node, shift, size}; 695| 9.67M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 4.17M| { 337| 4.17M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.17M| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 231| 17.9M| node_t* node() const { return node_; } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 243| 4.12M| { 244| 4.12M| return each_regular(*this, v, args...); 245| 4.12M| } _ZN5immer6detail4rbts12each_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_DpOT1_: 343| 4.12M|{ 344| 4.12M| constexpr auto B = bits; 345| 4.12M| constexpr auto BL = bits_leaf; 346| 4.12M| auto n = p.node()->inner(); 347| 4.12M| auto last = p.count() - 1; 348| 4.12M| auto e = n + last; 349| 4.12M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 1.02M, False: 3.09M] ------------------ 350| 4.39M| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 3.37M, False: 1.02M] ------------------ 351| 3.37M| IMMER_PREFETCH(n + 1); 352| 3.37M| make_full_leaf_pos(*n).visit(v, args...); 353| 3.37M| } 354| 1.02M| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 3.09M| } else { 356| 3.09M| auto ss = p.shift() - B; 357| 10.0M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 6.90M, False: 3.09M] ------------------ 358| 6.90M| make_full_pos(*n, ss).visit(v, args...); 359| 3.09M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 3.09M| } 361| 4.12M|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 233| 16.8M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 232| 24.5M| size_t size() const { return size_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 230| 12.4M| count_t count() const { return index(size_ - 1) + 1; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 234| 23.4M| count_t index(size_t idx) const { return (idx >> shift_) & mask; } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 784| 20.2M| count_t count() const { return subindex(size_ - 1) + 1; } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8subindexEm: 789| 23.4M| count_t subindex(size_t idx) const { return idx >> shift_; } _ZN5immer6detail4rbts22make_empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_17empty_regular_posIT_EEPSE_: 64| 3.00M|{ 65| 3.00M| return {node}; 66| 3.00M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 3.00M| { 58| 3.00M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 3.00M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 41| 3.00M| node_t* node() const { return node_; } _ZN5immer6detail4rbts17make_leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_12leaf_sub_posIT_EEPSE_j: 151| 111M|{ 152| 111M| assert(node); ------------------ | Branch (152:5): [True: 111M, False: 0] ------------------ 153| 111M| assert(count <= branches); ------------------ | Branch (153:5): [True: 111M, False: 0] ------------------ 154| 111M| return {node, count}; 155| 111M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 80.4M| { 145| 80.4M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 80.4M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 136| 98.2M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 135| 32.7M| count_t count() const { return count_; } _ZN5immer6detail4rbts19make_empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_14empty_leaf_posIT_EEPSE_: 88| 2.81M|{ 89| 2.81M| assert(node); ------------------ | Branch (89:5): [True: 2.81M, False: 0] ------------------ 90| 2.81M| return {node}; 91| 2.81M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 2.81M| { 82| 2.81M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 2.81M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 75| 2.81M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 74| 10.0k| count_t count() const { return 0; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_DpOT0_: 1813| 497k| { 1814| 497k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 497k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 1433| 35.2M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEj: 1443| 17.0M| { 1444| 17.0M| return size_sbh(offset, size_before(offset)); 1445| 17.0M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8size_sbhEjm: 1448| 17.4M| { 1449| 17.4M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 17.4M, False: 0] ------------------ 1450| 17.4M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 17.4M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11size_beforeEj: 1438| 65.7M| { 1439| 65.7M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 41.9M, False: 23.7M] ------------------ 1440| 65.7M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11last_oh_cshINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_jmDpOT0_: 1737| 480k| { 1738| 480k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 480k, False: 0] ------------------ 1739| 480k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 480k, False: 0] ------------------ 1740| 480k| auto child = node_->inner()[offset_hint]; 1741| 480k| auto is_leaf = shift_ == BL; 1742| 480k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 480k] ------------------ 1743| 480k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 480k| : visit_maybe_relaxed_sub( 1745| 480k| child, shift_ - B, child_size_hint, v, args...); 1746| 480k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcPT_jmT0_DpOT1_: 1838| 480k|{ 1839| 480k| assert(node); ------------------ | Branch (1839:5): [True: 480k, False: 0] ------------------ 1840| 480k| auto relaxed = node->relaxed(); 1841| 480k| if (relaxed) { ------------------ | Branch (1841:9): [True: 160k, False: 320k] ------------------ 1842| 160k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 160k, False: 0] ------------------ 1843| 160k| return make_relaxed_pos(node, shift, relaxed) 1844| 160k| .visit(v, std::forward(args)...); 1845| 320k| } else { 1846| 320k| return make_regular_sub_pos(node, shift, size) 1847| 320k| .visit(v, std::forward(args)...); 1848| 320k| } 1849| 480k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_DpOT0_: 1036| 320k| { 1037| 320k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 320k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 788| 3.39M| count_t index(size_t idx) const { return (idx >> shift_) & mask; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7last_ohINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_jDpOT0_: 952| 1.02M| { 953| 1.02M| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.02M| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_: 677| 1.02M|{ 678| 1.02M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.02M, False: 0] ------------------ 679| 1.02M| constexpr auto B = bits; 680| 1.02M| constexpr auto BL = bits_leaf; 681| 1.02M| auto child = p.node()->inner()[offset_hint]; 682| 1.02M| auto is_leaf = p.shift() == BL; 683| 1.02M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.02M] ------------------ 684| 1.02M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.02M| .visit(v, args...); 686| 1.02M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 336| 3.98M| { 337| 3.98M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.98M| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7last_ohINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_jDpOT0_: 330| 2.95M| { 331| 2.95M| return last_oh_regular(*this, v, offset_hint, args...); 332| 2.95M| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_: 677| 2.95M|{ 678| 2.95M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 2.95M, False: 0] ------------------ 679| 2.95M| constexpr auto B = bits; 680| 2.95M| constexpr auto BL = bits_leaf; 681| 2.95M| auto child = p.node()->inner()[offset_hint]; 682| 2.95M| auto is_leaf = p.shift() == BL; 683| 2.95M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 2.95M] ------------------ 684| 2.95M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 2.95M| .visit(v, args...); 686| 2.95M|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 1432| 156M| size_t size() const { return relaxed_->d.sizes[relaxed_->d.count - 1]; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 1036| 763k| { 1037| 763k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 763k| } flex-vector-st.cpp:_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_DpOT0_: 144| 144k| { 145| 144k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 144k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 139| 1.13M| count_t index(size_t idx) const { return idx & mask; } flex-vector-st.cpp:_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSJ_E_EEEDcPSJ_jmT0_DpOT1_: 1838| 388k|{ 1839| 388k| assert(node); ------------------ | Branch (1839:5): [True: 388k, False: 0] ------------------ 1840| 388k| auto relaxed = node->relaxed(); 1841| 388k| if (relaxed) { ------------------ | Branch (1841:9): [True: 364k, False: 24.4k] ------------------ 1842| 364k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 364k, False: 0] ------------------ 1843| 364k| return make_relaxed_pos(node, shift, relaxed) 1844| 364k| .visit(v, std::forward(args)...); 1845| 364k| } else { 1846| 24.4k| return make_regular_sub_pos(node, shift, size) 1847| 24.4k| .visit(v, std::forward(args)...); 1848| 24.4k| } 1849| 388k|} flex-vector-st.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1813| 364k| { 1814| 364k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 364k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 1454| 14.3M| { 1455| 14.3M| auto offset = idx >> shift_; 1456| 20.1M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 5.80M, False: 14.3M] ------------------ 1457| 5.80M| ++offset; 1458| 14.3M| return offset; 1459| 14.3M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7relaxedEv: 1435| 364k| relaxed_t* relaxed() const { return relaxed_; } flex-vector-st.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjDpOT0_: 1686| 364k| { 1687| 364k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 364k, False: 0] ------------------ 1688| 364k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 34.7k, False: 329k] ------------------ 1689| 364k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 364k| } flex-vector-st.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjmDpOT0_: 1698| 364k| { 1699| 364k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 364k| } flex-vector-st.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjmDpOT0_: 1717| 364k| { 1718| 364k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 364k, False: 0] ------------------ 1719| 364k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 34.7k, False: 329k] | Branch (1719:9): [True: 364k, False: 0] ------------------ 1720| 364k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 364k| auto child = node_->inner()[offset_hint]; 1722| 364k| auto is_leaf = shift_ == BL; 1723| 364k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 364k| auto next_idx = idx - left_size_hint; 1725| 364k| return is_leaf ------------------ | Branch (1725:16): [True: 35.6k, False: 328k] ------------------ 1726| 364k| ? make_leaf_sub_pos(child, next_size) 1727| 35.6k| .visit(v, next_idx, args...) 1728| 364k| : visit_maybe_relaxed_sub( 1729| 328k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 364k| } flex-vector-st.cpp:_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 144| 35.6k| { 145| 35.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 35.6k| } flex-vector-st.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1036| 24.4k| { 1037| 24.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 24.4k| } flex-vector-st.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 938| 24.4k| { 939| 24.4k| return towards_oh_ch_regular( 940| 24.4k| *this, v, idx, offset_hint, count(), args...); 941| 24.4k| } flex-vector-st.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 24.4k|{ 633| 24.4k| constexpr auto B = bits; 634| 24.4k| constexpr auto BL = bits_leaf; 635| 24.4k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 24.4k, False: 0] ------------------ 636| 24.4k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 24.4k, False: 0] ------------------ 637| 24.4k| auto is_leaf = p.shift() == BL; 638| 24.4k| auto child = p.node()->inner()[offset_hint]; 639| 24.4k| auto is_full = offset_hint + 1 != count_hint; 640| 24.4k| return is_full ------------------ | Branch (640:12): [True: 14.8k, False: 9.57k] ------------------ 641| 24.4k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 5.67k, False: 9.18k] ------------------ 642| 14.8k| : make_full_pos(child, p.shift() - B) 643| 9.18k| .visit(v, idx, args...)) 644| 24.4k| : (is_leaf ------------------ | Branch (644:19): [True: 7.33k, False: 2.23k] ------------------ 645| 9.57k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 9.57k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.23k| .visit(v, idx, args...)); 648| 24.4k|} flex-vector-st.cpp:_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 207| 16.3k| { 208| 16.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 16.3k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 202| 261k| count_t index(size_t idx) const { return idx & mask; } flex-vector-st.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1405| 14.9k| { 1406| 14.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 14.9k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 1162| 677k| count_t index(size_t idx) const { return (idx >> shift_) & mask; } flex-vector-st.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 1329| 14.9k| { 1330| 14.9k| return towards_oh(v, idx, offset_hint, args...); 1331| 14.9k| } flex-vector-st.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjDpOT0_: 1336| 14.9k| { 1337| 14.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 14.9k, False: 0] ------------------ 1338| 14.9k| auto is_leaf = shift_ == BL; 1339| 14.9k| auto child = node_->inner()[offset_hint]; 1340| 14.9k| return is_leaf ------------------ | Branch (1340:16): [True: 10.1k, False: 4.88k] ------------------ 1341| 14.9k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 14.9k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 14.9k| } flex-vector-st.cpp:_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 112| 8.04k| { 113| 8.04k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 8.04k| } flex-vector-st.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 336| 2.60k| { 337| 2.60k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.60k| } flex-vector-st.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 316| 2.60k| { 317| 2.60k| return towards_oh_ch_regular( 318| 2.60k| *this, v, idx, offset_hint, count(), args...); 319| 2.60k| } flex-vector-st.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 2.60k|{ 633| 2.60k| constexpr auto B = bits; 634| 2.60k| constexpr auto BL = bits_leaf; 635| 2.60k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.60k, False: 0] ------------------ 636| 2.60k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.60k, False: 0] ------------------ 637| 2.60k| auto is_leaf = p.shift() == BL; 638| 2.60k| auto child = p.node()->inner()[offset_hint]; 639| 2.60k| auto is_full = offset_hint + 1 != count_hint; 640| 2.60k| return is_full ------------------ | Branch (640:12): [True: 1.52k, False: 1.08k] ------------------ 641| 2.60k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 603, False: 922] ------------------ 642| 1.52k| : make_full_pos(child, p.shift() - B) 643| 922| .visit(v, idx, args...)) 644| 2.60k| : (is_leaf ------------------ | Branch (644:19): [True: 713, False: 369] ------------------ 645| 1.08k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.08k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 369| .visit(v, idx, args...)); 648| 2.60k|} _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 36.9k|{ 1839| 36.9k| assert(node); ------------------ | Branch (1839:5): [True: 36.9k, False: 0] ------------------ 1840| 36.9k| auto relaxed = node->relaxed(); 1841| 36.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 30.5k, False: 6.36k] ------------------ 1842| 30.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 30.5k, False: 0] ------------------ 1843| 30.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 30.5k| .visit(v, std::forward(args)...); 1845| 30.5k| } else { 1846| 6.36k| return make_regular_sub_pos(node, shift, size) 1847| 6.36k| .visit(v, std::forward(args)...); 1848| 6.36k| } 1849| 36.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 30.5k| { 1814| 30.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 30.5k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1686| 23.3k| { 1687| 23.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 23.3k, False: 0] ------------------ 1688| 23.3k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 23.3k] ------------------ 1689| 23.3k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 23.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1698| 23.3k| { 1699| 23.3k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 23.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 23.3k| { 1718| 23.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 23.3k, False: 0] ------------------ 1719| 23.3k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 23.3k] | Branch (1719:9): [True: 23.3k, False: 0] ------------------ 1720| 23.3k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 23.3k| auto child = node_->inner()[offset_hint]; 1722| 23.3k| auto is_leaf = shift_ == BL; 1723| 23.3k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 23.3k| auto next_idx = idx - left_size_hint; 1725| 23.3k| return is_leaf ------------------ | Branch (1725:16): [True: 1.63k, False: 21.6k] ------------------ 1726| 23.3k| ? make_leaf_sub_pos(child, next_size) 1727| 1.63k| .visit(v, next_idx, args...) 1728| 23.3k| : visit_maybe_relaxed_sub( 1729| 21.6k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 23.3k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 144| 1.63k| { 145| 1.63k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.63k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1686| 12.1k| { 1687| 12.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 12.1k, False: 0] ------------------ 1688| 12.1k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 10.5k, False: 1.56k] ------------------ 1689| 12.1k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 12.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1698| 12.1k| { 1699| 12.1k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 12.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 12.1k| { 1718| 12.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 12.1k, False: 0] ------------------ 1719| 12.1k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 10.5k, False: 1.56k] | Branch (1719:9): [True: 12.1k, False: 0] ------------------ 1720| 12.1k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 12.1k| auto child = node_->inner()[offset_hint]; 1722| 12.1k| auto is_leaf = shift_ == BL; 1723| 12.1k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 12.1k| auto next_idx = idx - left_size_hint; 1725| 12.1k| return is_leaf ------------------ | Branch (1725:16): [True: 4.66k, False: 7.45k] ------------------ 1726| 12.1k| ? make_leaf_sub_pos(child, next_size) 1727| 4.66k| .visit(v, next_idx, args...) 1728| 12.1k| : visit_maybe_relaxed_sub( 1729| 7.45k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 12.1k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 4.66k| { 145| 4.66k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.66k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 7.45k|{ 1839| 7.45k| assert(node); ------------------ | Branch (1839:5): [True: 7.45k, False: 0] ------------------ 1840| 7.45k| auto relaxed = node->relaxed(); 1841| 7.45k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.90k, False: 2.55k] ------------------ 1842| 4.90k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.90k, False: 0] ------------------ 1843| 4.90k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.90k| .visit(v, std::forward(args)...); 1845| 4.90k| } else { 1846| 2.55k| return make_regular_sub_pos(node, shift, size) 1847| 2.55k| .visit(v, std::forward(args)...); 1848| 2.55k| } 1849| 7.45k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 4.90k| { 1814| 4.90k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.90k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 2.55k| { 1037| 2.55k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.55k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 927| 5.58k| { 928| 5.58k| return towards_oh_ch_regular( 929| 5.58k| *this, v, idx, offset_hint, count(), args...); 930| 5.58k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 5.58k|{ 633| 5.58k| constexpr auto B = bits; 634| 5.58k| constexpr auto BL = bits_leaf; 635| 5.58k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.58k, False: 0] ------------------ 636| 5.58k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.58k, False: 0] ------------------ 637| 5.58k| auto is_leaf = p.shift() == BL; 638| 5.58k| auto child = p.node()->inner()[offset_hint]; 639| 5.58k| auto is_full = offset_hint + 1 != count_hint; 640| 5.58k| return is_full ------------------ | Branch (640:12): [True: 1.69k, False: 3.89k] ------------------ 641| 5.58k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.02k, False: 672] ------------------ 642| 1.69k| : make_full_pos(child, p.shift() - B) 643| 672| .visit(v, idx, args...)) 644| 5.58k| : (is_leaf ------------------ | Branch (644:19): [True: 1.48k, False: 2.41k] ------------------ 645| 3.89k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.89k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.41k| .visit(v, idx, args...)); 648| 5.58k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 207| 3.87k| { 208| 3.87k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.87k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1405| 2.01k| { 1406| 2.01k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.01k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1336| 3.11k| { 1337| 3.11k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 3.11k, False: 0] ------------------ 1338| 3.11k| auto is_leaf = shift_ == BL; 1339| 3.11k| auto child = node_->inner()[offset_hint]; 1340| 3.11k| return is_leaf ------------------ | Branch (1340:16): [True: 2.38k, False: 730] ------------------ 1341| 3.11k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 3.11k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 3.11k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 1161| 51.3k| shift_t shift() const { return shift_; } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 112| 2.80k| { 113| 2.80k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.80k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 336| 2.89k| { 337| 2.89k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.89k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 305| 2.89k| { 306| 2.89k| return towards_oh_ch_regular( 307| 2.89k| *this, v, idx, offset_hint, count(), args...); 308| 2.89k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 2.89k|{ 633| 2.89k| constexpr auto B = bits; 634| 2.89k| constexpr auto BL = bits_leaf; 635| 2.89k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.89k, False: 0] ------------------ 636| 2.89k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.89k, False: 0] ------------------ 637| 2.89k| auto is_leaf = p.shift() == BL; 638| 2.89k| auto child = p.node()->inner()[offset_hint]; 639| 2.89k| auto is_full = offset_hint + 1 != count_hint; 640| 2.89k| return is_full ------------------ | Branch (640:12): [True: 1.08k, False: 1.81k] ------------------ 641| 2.89k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 469, False: 616] ------------------ 642| 1.08k| : make_full_pos(child, p.shift() - B) 643| 616| .visit(v, idx, args...)) 644| 2.89k| : (is_leaf ------------------ | Branch (644:19): [True: 1.32k, False: 486] ------------------ 645| 1.81k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.81k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 486| .visit(v, idx, args...)); 648| 2.89k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1036| 6.36k| { 1037| 6.36k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.36k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 927| 3.33k| { 928| 3.33k| return towards_oh_ch_regular( 929| 3.33k| *this, v, idx, offset_hint, count(), args...); 930| 3.33k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb1EEEJEEEDcOT_T0_mjjDpOT1_: 632| 3.33k|{ 633| 3.33k| constexpr auto B = bits; 634| 3.33k| constexpr auto BL = bits_leaf; 635| 3.33k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.33k, False: 0] ------------------ 636| 3.33k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.33k, False: 0] ------------------ 637| 3.33k| auto is_leaf = p.shift() == BL; 638| 3.33k| auto child = p.node()->inner()[offset_hint]; 639| 3.33k| auto is_full = offset_hint + 1 != count_hint; 640| 3.33k| return is_full ------------------ | Branch (640:12): [True: 2.51k, False: 824] ------------------ 641| 3.33k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 777, False: 1.73k] ------------------ 642| 2.51k| : make_full_pos(child, p.shift() - B) 643| 1.73k| .visit(v, idx, args...)) 644| 3.33k| : (is_leaf ------------------ | Branch (644:19): [True: 824, False: 0] ------------------ 645| 824| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 824| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 3.33k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 207| 1.41k| { 208| 1.41k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.41k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1405| 2.01k| { 1406| 2.01k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.01k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1336| 925| { 1337| 925| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 925, False: 0] ------------------ 1338| 925| auto is_leaf = shift_ == BL; 1339| 925| auto child = node_->inner()[offset_hint]; 1340| 925| return is_leaf ------------------ | Branch (1340:16): [True: 641, False: 284] ------------------ 1341| 925| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 925| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 925| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 824| { 113| 824| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 824| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 24.8k|{ 1839| 24.8k| assert(node); ------------------ | Branch (1839:5): [True: 24.8k, False: 0] ------------------ 1840| 24.8k| auto relaxed = node->relaxed(); 1841| 24.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 18.3k, False: 6.47k] ------------------ 1842| 18.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 18.3k, False: 0] ------------------ 1843| 18.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 18.3k| .visit(v, std::forward(args)...); 1845| 18.3k| } else { 1846| 6.47k| return make_regular_sub_pos(node, shift, size) 1847| 6.47k| .visit(v, std::forward(args)...); 1848| 6.47k| } 1849| 24.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 18.3k| { 1814| 18.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 18.3k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8subindexEm: 1434| 4.24M| count_t subindex(size_t idx) const { return index(idx); } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1705| 3.27k| { 1706| 3.27k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.27k, False: 0] ------------------ 1707| 3.27k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 2.91k, False: 361] ------------------ 1708| 3.27k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.27k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 3.27k| { 1718| 3.27k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.27k, False: 0] ------------------ 1719| 3.27k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 2.91k, False: 361] | Branch (1719:9): [True: 3.27k, False: 0] ------------------ 1720| 3.27k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.27k| auto child = node_->inner()[offset_hint]; 1722| 3.27k| auto is_leaf = shift_ == BL; 1723| 3.27k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.27k| auto next_idx = idx - left_size_hint; 1725| 3.27k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.27k] ------------------ 1726| 3.27k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.27k| : visit_maybe_relaxed_sub( 1729| 3.27k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.27k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1705| 84.0k| { 1706| 84.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 84.0k, False: 0] ------------------ 1707| 84.0k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 24.4k, False: 59.6k] ------------------ 1708| 84.0k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 84.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 84.0k| { 1718| 84.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 84.0k, False: 0] ------------------ 1719| 84.0k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 24.4k, False: 59.6k] | Branch (1719:9): [True: 84.0k, False: 0] ------------------ 1720| 84.0k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 84.0k| auto child = node_->inner()[offset_hint]; 1722| 84.0k| auto is_leaf = shift_ == BL; 1723| 84.0k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 84.0k| auto next_idx = idx - left_size_hint; 1725| 84.0k| return is_leaf ------------------ | Branch (1725:16): [True: 14.0k, False: 69.9k] ------------------ 1726| 84.0k| ? make_leaf_sub_pos(child, next_size) 1727| 14.0k| .visit(v, next_idx, args...) 1728| 84.0k| : visit_maybe_relaxed_sub( 1729| 69.9k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 84.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 14.0k| { 145| 14.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 14.0k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 69.9k|{ 1839| 69.9k| assert(node); ------------------ | Branch (1839:5): [True: 69.9k, False: 0] ------------------ 1840| 69.9k| auto relaxed = node->relaxed(); 1841| 69.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 68.9k, False: 984] ------------------ 1842| 68.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 68.9k, False: 0] ------------------ 1843| 68.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 68.9k| .visit(v, std::forward(args)...); 1845| 68.9k| } else { 1846| 984| return make_regular_sub_pos(node, shift, size) 1847| 984| .visit(v, std::forward(args)...); 1848| 984| } 1849| 69.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 68.9k| { 1814| 68.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 68.9k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 984| { 1037| 984| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 984| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11size_beforeEj: 791| 1.60M| { 792| 1.60M| return size_t{offset} << shift_; 793| 1.60M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8size_sbhEjm: 803| 20.7k| { 804| 20.7k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 20.7k, False: 0] ------------------ 805| 20.7k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 11.0k, False: 9.78k] ------------------ 806| 20.7k| : size_t{1} << shift_; 807| 20.7k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 946| 6.68k| { 947| 6.68k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 6.68k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_18slice_left_visitorISD_Lb0EEEJEEEDcOT_T0_mjDpOT1_: 653| 6.68k|{ 654| 6.68k| constexpr auto B = bits; 655| 6.68k| constexpr auto BL = bits_leaf; 656| 6.68k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 6.68k, False: 0] ------------------ 657| 6.68k| auto is_leaf = p.shift() == BL; 658| 6.68k| auto child = p.node()->inner()[offset_hint]; 659| 6.68k| auto lsize = offset_hint << p.shift(); 660| 6.68k| auto size = p.this_size(); 661| 6.68k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 6.68k| return is_full ------------------ | Branch (662:12): [True: 6.68k, False: 0] ------------------ 663| 6.68k| ? (is_leaf ------------------ | Branch (663:19): [True: 3.99k, False: 2.68k] ------------------ 664| 6.68k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 6.68k| : make_full_pos(child, p.shift() - B) 666| 2.68k| .visit(v, idx - lsize, args...)) 667| 6.68k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 6.68k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9this_sizeEv: 794| 20.7k| size_t this_size() const { return size_; } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 207| 7.46k| { 208| 7.46k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 7.46k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 1405| 4.07k| { 1406| 4.07k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.07k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8subindexEm: 1163| 10.3k| count_t subindex(size_t idx) const { return idx >> shift_; } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11size_beforeEj: 1170| 36.6k| { 1171| 36.6k| return size_t{offset} << shift_; 1172| 36.6k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8size_sbhEjm: 1166| 10.3k| { 1167| 10.3k| return size_t{1} << shift_; 1168| 10.3k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1348| 4.85k| { 1349| 4.85k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 4.85k, False: 0] ------------------ 1350| 4.85k| auto is_leaf = shift_ == BL; 1351| 4.85k| auto child = node_->inner()[offset_hint]; 1352| 4.85k| auto lsize = size_t{offset_hint} << shift_; 1353| 4.85k| return is_leaf ------------------ | Branch (1353:16): [True: 3.46k, False: 1.38k] ------------------ 1354| 4.85k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 4.85k| : make_full_pos(child, shift_ - B) 1356| 1.38k| .visit(v, idx - lsize, args...); 1357| 4.85k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1175| 10.3k| { 1176| 10.3k| auto e = sizes + n; 1177| 55.2k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 44.9k, False: 10.3k] ------------------ 1178| 44.9k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 44.9k, False: 0] ------------------ 1180| 44.9k| } 1181| 10.3k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 1160| 578k| size_t size() const { return branches << shift_; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 810| 3.08M| { 811| 3.08M| if (n) { ------------------ | Branch (811:13): [True: 3.07M, False: 5.06k] ------------------ 812| 3.07M| auto last = offset + n - 1; 813| 3.07M| auto e = sizes + n - 1; 814| 12.2M| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 9.22M, False: 3.07M] ------------------ 815| 9.22M| init = *sizes = init + (size_t{1} << shift_); 816| 9.22M| assert(init); ------------------ | Branch (816:17): [True: 9.22M, False: 0] ------------------ 817| 9.22M| } 818| 3.07M| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 3.07M, False: 0] ------------------ 820| 3.07M| } 821| 3.08M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEj: 797| 3.09M| { 798| 3.09M| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 1.54M, False: 1.54M] ------------------ 799| 3.09M| : size_t{1} << shift_; 800| 3.09M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1462| 30.5M| { 1463| 30.5M| auto e = sizes + n; 1464| 30.5M| auto prev = size_before(offset); 1465| 30.5M| auto these = relaxed_->d.sizes + offset; 1466| 139M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 109M, False: 30.5M] ------------------ 1467| 109M| auto this_size = *these; 1468| 109M| init = *sizes = init + (this_size - prev); 1469| 109M| assert(init); ------------------ | Branch (1469:13): [True: 109M, False: 0] ------------------ 1470| 109M| prev = this_size; 1471| 109M| } 1472| 30.5M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1036| 6.47k| { 1037| 6.47k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.47k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 946| 2.48k| { 947| 2.48k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.48k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_18slice_left_visitorISD_Lb1EEEJEEEDcOT_T0_mjDpOT1_: 653| 2.48k|{ 654| 2.48k| constexpr auto B = bits; 655| 2.48k| constexpr auto BL = bits_leaf; 656| 2.48k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.48k, False: 0] ------------------ 657| 2.48k| auto is_leaf = p.shift() == BL; 658| 2.48k| auto child = p.node()->inner()[offset_hint]; 659| 2.48k| auto lsize = offset_hint << p.shift(); 660| 2.48k| auto size = p.this_size(); 661| 2.48k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.48k| return is_full ------------------ | Branch (662:12): [True: 778, False: 1.70k] ------------------ 663| 2.48k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 778] ------------------ 664| 778| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 778| : make_full_pos(child, p.shift() - B) 666| 778| .visit(v, idx - lsize, args...)) 667| 2.48k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.70k] ------------------ 668| 1.70k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.70k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.70k| .visit(v, idx - lsize, args...)); 672| 2.48k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1405| 778| { 1406| 778| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 778| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1036| 1.70k| { 1037| 1.70k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.70k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaPT_j: 766| 10.0k|{ 767| 10.0k| assert(leaf); ------------------ | Branch (767:5): [True: 10.0k, False: 0] ------------------ 768| 10.0k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 10.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 10.0k, False: 0] ------------------ 769| 10.0k| assert(count > 0); ------------------ | Branch (769:5): [True: 10.0k, False: 0] ------------------ 770| 10.0k| return singleton_regular_sub_pos{leaf, count}; 771| 10.0k|} _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_14empty_leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 759| 10.0k| { 760| 10.0k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 10.0k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 10.0k|{ 1839| 10.0k| assert(node); ------------------ | Branch (1839:5): [True: 10.0k, False: 0] ------------------ 1840| 10.0k| auto relaxed = node->relaxed(); 1841| 10.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.28k, False: 2.75k] ------------------ 1842| 7.28k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.28k, False: 0] ------------------ 1843| 7.28k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.28k| .visit(v, std::forward(args)...); 1845| 7.28k| } else { 1846| 2.75k| return make_regular_sub_pos(node, shift, size) 1847| 2.75k| .visit(v, std::forward(args)...); 1848| 2.75k| } 1849| 10.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1813| 7.28k| { 1814| 7.28k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.28k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 735| 32.5k| shift_t shift() const { return BL; } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 744| 10.0k| { 745| 10.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 144| 13.3M| { 145| 13.3M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 13.3M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 1813| 155M| { 1814| 155M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 155M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 707| 3.62M| { 708| 3.62M| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 744| 10.0k| { 745| 10.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 144| 13.3M| { 145| 13.3M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 13.3M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 137| 13.3M| size_t size() const { return count_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1813| 155M| { 1814| 155M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 155M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEEvT_DpOT0_: 707| 3.62M| { 708| 3.62M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1762| 21.5k| { 1763| 21.5k| auto child = node_->inner()[0]; 1764| 21.5k| auto child_size = relaxed_->d.sizes[0]; 1765| 21.5k| auto is_leaf = shift_ == BL; 1766| 21.5k| assert(child_size); ------------------ | Branch (1766:9): [True: 21.5k, False: 0] ------------------ 1767| 21.5k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 21.5k] ------------------ 1768| 21.5k| : visit_maybe_relaxed_sub( 1769| 21.5k| child, shift_ - B, child_size, v, args...); 1770| 21.5k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 76| 10.0k| shift_t shift() const { return 0; } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 138| 5.20M| shift_t shift() const { return 0; } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 21.5k|{ 1839| 21.5k| assert(node); ------------------ | Branch (1839:5): [True: 21.5k, False: 0] ------------------ 1840| 21.5k| auto relaxed = node->relaxed(); 1841| 21.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 21.2k, False: 310] ------------------ 1842| 21.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 21.2k, False: 0] ------------------ 1843| 21.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 21.2k| .visit(v, std::forward(args)...); 1845| 21.2k| } else { 1846| 310| return make_regular_sub_pos(node, shift, size) 1847| 310| .visit(v, std::forward(args)...); 1848| 310| } 1849| 21.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1813| 21.2k| { 1814| 21.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.2k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1036| 310| { 1037| 310| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 310| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 970| 619| { 971| 619| auto is_leaf = shift_ == BL; 972| 619| auto child = node_->inner()[0]; 973| 619| auto is_full = size_ >= (size_t{1} << shift_); 974| 619| return is_full ------------------ | Branch (974:16): [True: 619, False: 0] ------------------ 975| 619| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 619] ------------------ 976| 619| ? make_full_leaf_pos(child).visit(v, args...) 977| 619| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 619| : (is_leaf ------------------ | Branch (978:23): [True: 0, False: 0] ------------------ 979| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 980| 0| : make_regular_sub_pos(child, shift_ - B, size_) 981| 0| .visit(v, args...)); 982| 619| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 201| 347k| shift_t shift() const { return 0; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1405| 945| { 1406| 945| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 945| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1361| 326| { 1362| 326| auto is_leaf = shift_ == BL; 1363| 326| auto child = node_->inner()[0]; 1364| 326| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 326] ------------------ 1365| 326| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 326| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 711| 205k| { 712| 205k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1304| 20.5k| { 1305| 20.5k| each_i(v, 1, branches, args...); 1306| 20.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE6each_iINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jjDpOT0_: 1263| 20.5k| { 1264| 20.5k| auto p = node_->inner() + i; 1265| 20.5k| auto e = node_->inner() + n; 1266| 20.5k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 11.7k, False: 8.78k] ------------------ 1267| 94.3k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 82.5k, False: 11.7k] ------------------ 1268| 82.5k| IMMER_PREFETCH(p + 1); 1269| 82.5k| make_full_leaf_pos(*p).visit(v, args...); 1270| 82.5k| } 1271| 11.7k| } else { 1272| 8.78k| auto ss = shift_ - B; 1273| 70.2k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 61.4k, False: 8.78k] ------------------ 1274| 61.4k| make_full_pos(*p, ss).visit(v, args...); 1275| 8.78k| } 1276| 20.5k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 207| 4.77M| { 208| 4.77M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 4.77M| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 1405| 574k| { 1406| 574k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 574k| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEEvT_DpOT0_: 711| 205k| { 712| 205k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1304| 20.5k| { 1305| 20.5k| each_i(v, 1, branches, args...); 1306| 20.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE6each_iINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jjDpOT0_: 1263| 20.5k| { 1264| 20.5k| auto p = node_->inner() + i; 1265| 20.5k| auto e = node_->inner() + n; 1266| 20.5k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 11.7k, False: 8.78k] ------------------ 1267| 94.3k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 82.5k, False: 11.7k] ------------------ 1268| 82.5k| IMMER_PREFETCH(p + 1); 1269| 82.5k| make_full_leaf_pos(*p).visit(v, args...); 1270| 82.5k| } 1271| 11.7k| } else { 1272| 8.78k| auto ss = shift_ - B; 1273| 70.2k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 61.4k, False: 8.78k] ------------------ 1274| 61.4k| make_full_pos(*p, ss).visit(v, args...); 1275| 8.78k| } 1276| 20.5k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 207| 4.77M| { 208| 4.77M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 4.77M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 200| 4.77M| size_t size() const { return branches; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1405| 574k| { 1406| 574k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 574k| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 753| 619| { 754| 619| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 619| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 144| 619| { 145| 619| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 619| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1370| 619| { 1371| 619| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 619, False: 0] ------------------ 1372| 619| auto child = node_->inner()[0]; 1373| 619| return make_full_leaf_pos(child).visit(v, args...); 1374| 619| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 207| 3.06k| { 208| 3.06k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.06k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 906| 347k| { 907| 347k| if (count() > 1) ------------------ | Branch (907:13): [True: 327k, False: 19.4k] ------------------ 908| 327k| each_right_sub_(v, 1, args...); 909| 347k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE15each_right_sub_INS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 879| 327k| { 880| 327k| auto last = count() - 1; 881| 327k| auto lsize = size_ - (last << shift_); 882| 327k| auto n = node()->inner() + i; 883| 327k| auto e = node()->inner() + last; 884| 327k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 316k, False: 11.7k] ------------------ 885| 2.19M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 1.87M, False: 316k] ------------------ 886| 1.87M| IMMER_PREFETCH(n + 1); 887| 1.87M| make_full_leaf_pos(*n).visit(v, args...); 888| 1.87M| } 889| 316k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 316k| } else { 891| 11.7k| auto ss = shift_ - B; 892| 44.1k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 32.3k, False: 11.7k] ------------------ 893| 32.3k| make_full_pos(*n, ss).visit(v, args...); 894| 11.7k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 11.7k| } 896| 327k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 1036| 3.48M| { 1037| 3.48M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.48M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 906| 347k| { 907| 347k| if (count() > 1) ------------------ | Branch (907:13): [True: 327k, False: 19.4k] ------------------ 908| 327k| each_right_sub_(v, 1, args...); 909| 347k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE15each_right_sub_INS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 879| 327k| { 880| 327k| auto last = count() - 1; 881| 327k| auto lsize = size_ - (last << shift_); 882| 327k| auto n = node()->inner() + i; 883| 327k| auto e = node()->inner() + last; 884| 327k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 316k, False: 11.7k] ------------------ 885| 2.19M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 1.87M, False: 316k] ------------------ 886| 1.87M| IMMER_PREFETCH(n + 1); 887| 1.87M| make_full_leaf_pos(*n).visit(v, args...); 888| 1.87M| } 889| 316k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 316k| } else { 891| 11.7k| auto ss = shift_ - B; 892| 44.1k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 32.3k, False: 11.7k] ------------------ 893| 32.3k| make_full_pos(*n, ss).visit(v, args...); 894| 11.7k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 11.7k| } 896| 327k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1036| 3.48M| { 1037| 3.48M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.48M| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 753| 2.44k| { 754| 2.44k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 2.44k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 144| 2.44k| { 145| 2.44k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.44k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 986| 2.44k| { 987| 2.44k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 2.44k, False: 0] ------------------ 988| 2.44k| auto child = node_->inner()[0]; 989| 2.44k| auto is_full = size_ >= branches; 990| 2.44k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 2.44k, False: 0] ------------------ 991| 2.44k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 2.44k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 144| 6.97k| { 145| 6.97k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.97k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1647| 13.2M| { 1648| 13.2M| each_right(v, 1, std::forward(args)...); 1649| 13.2M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 1653| 13.2M| { 1654| 13.2M| assert(start > 0); ------------------ | Branch (1654:9): [True: 13.2M, False: 0] ------------------ 1655| 13.2M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 13.2M, False: 0] ------------------ 1656| 13.2M| auto s = relaxed_->d.sizes[start - 1]; 1657| 13.2M| auto p = node_->inner(); 1658| 13.2M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 1.03M, False: 12.2M] ------------------ 1659| 6.01M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 4.97M, False: 1.03M] ------------------ 1660| 4.97M| IMMER_PREFETCH(p + i + 1); 1661| 4.97M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 4.97M| .visit(v, args...); 1663| 4.97M| s = relaxed_->d.sizes[i]; 1664| 4.97M| assert(s); ------------------ | Branch (1664:17): [True: 4.97M, False: 0] ------------------ 1665| 4.97M| } 1666| 12.2M| } else { 1667| 12.2M| auto ss = shift_ - B; 1668| 89.1M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 76.8M, False: 12.2M] ------------------ 1669| 76.8M| visit_maybe_relaxed_sub( 1670| 76.8M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 76.8M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 76.8M, False: 0] ------------------ 1673| 76.8M| } 1674| 12.2M| } 1675| 13.2M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcPT_jmT0_DpOT1_: 1838| 131M|{ 1839| 131M| assert(node); ------------------ | Branch (1839:5): [True: 131M, False: 0] ------------------ 1840| 131M| auto relaxed = node->relaxed(); 1841| 131M| if (relaxed) { ------------------ | Branch (1841:9): [True: 127M, False: 3.46M] ------------------ 1842| 127M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 127M, False: 0] ------------------ 1843| 127M| return make_relaxed_pos(node, shift, relaxed) 1844| 127M| .visit(v, std::forward(args)...); 1845| 127M| } else { 1846| 3.46M| return make_regular_sub_pos(node, shift, size) 1847| 3.46M| .visit(v, std::forward(args)...); 1848| 3.46M| } 1849| 131M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1647| 13.2M| { 1648| 13.2M| each_right(v, 1, std::forward(args)...); 1649| 13.2M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 1653| 13.2M| { 1654| 13.2M| assert(start > 0); ------------------ | Branch (1654:9): [True: 13.2M, False: 0] ------------------ 1655| 13.2M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 13.2M, False: 0] ------------------ 1656| 13.2M| auto s = relaxed_->d.sizes[start - 1]; 1657| 13.2M| auto p = node_->inner(); 1658| 13.2M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 1.03M, False: 12.2M] ------------------ 1659| 6.01M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 4.97M, False: 1.03M] ------------------ 1660| 4.97M| IMMER_PREFETCH(p + i + 1); 1661| 4.97M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 4.97M| .visit(v, args...); 1663| 4.97M| s = relaxed_->d.sizes[i]; 1664| 4.97M| assert(s); ------------------ | Branch (1664:17): [True: 4.97M, False: 0] ------------------ 1665| 4.97M| } 1666| 12.2M| } else { 1667| 12.2M| auto ss = shift_ - B; 1668| 89.1M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 76.8M, False: 12.2M] ------------------ 1669| 76.8M| visit_maybe_relaxed_sub( 1670| 76.8M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 76.8M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 76.8M, False: 0] ------------------ 1673| 76.8M| } 1674| 12.2M| } 1675| 13.2M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 131M|{ 1839| 131M| assert(node); ------------------ | Branch (1839:5): [True: 131M, False: 0] ------------------ 1840| 131M| auto relaxed = node->relaxed(); 1841| 131M| if (relaxed) { ------------------ | Branch (1841:9): [True: 127M, False: 3.46M] ------------------ 1842| 127M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 127M, False: 0] ------------------ 1843| 127M| return make_relaxed_pos(node, shift, relaxed) 1844| 127M| .visit(v, std::forward(args)...); 1845| 127M| } else { 1846| 3.46M| return make_regular_sub_pos(node, shift, size) 1847| 3.46M| .visit(v, std::forward(args)...); 1848| 3.46M| } 1849| 131M|} _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 753| 6.97k| { 754| 6.97k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 6.97k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 144| 6.97k| { 145| 6.97k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.97k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1774| 6.97k| { 1775| 6.97k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 6.97k, False: 0] ------------------ 1776| 6.97k| auto child = node_->inner()[0]; 1777| 6.97k| auto child_size = relaxed_->d.sizes[0]; 1778| 6.97k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 6.97k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1036| 2.75k| { 1037| 2.75k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.75k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcPT_jmT0_DpOT1_: 1838| 1.37M|{ 1839| 1.37M| assert(node); ------------------ | Branch (1839:5): [True: 1.37M, False: 0] ------------------ 1840| 1.37M| auto relaxed = node->relaxed(); 1841| 1.37M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.35M, False: 23.2k] ------------------ 1842| 1.35M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.35M, False: 0] ------------------ 1843| 1.35M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.35M| .visit(v, std::forward(args)...); 1845| 1.35M| } else { 1846| 23.2k| return make_regular_sub_pos(node, shift, size) 1847| 23.2k| .visit(v, std::forward(args)...); 1848| 23.2k| } 1849| 1.37M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 1813| 1.35M| { 1814| 1.35M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.35M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 1.35M|{ 1839| 1.35M| assert(node); ------------------ | Branch (1839:5): [True: 1.35M, False: 0] ------------------ 1840| 1.35M| auto relaxed = node->relaxed(); 1841| 1.35M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.34M, False: 11.0k] ------------------ 1842| 1.34M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.34M, False: 0] ------------------ 1843| 1.34M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.34M| .visit(v, std::forward(args)...); 1845| 1.34M| } else { 1846| 11.0k| return make_regular_sub_pos(node, shift, size) 1847| 11.0k| .visit(v, std::forward(args)...); 1848| 11.0k| } 1849| 1.35M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 1.34M| { 1814| 1.34M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.34M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1750| 3.59M| { 1751| 3.59M| auto offset = relaxed_->d.count - 1; 1752| 3.59M| auto child = node_->inner()[offset]; 1753| 3.59M| auto child_size = size(offset); 1754| 3.59M| auto is_leaf = shift_ == BL; 1755| 3.59M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 3.59M] ------------------ 1756| 3.59M| : visit_maybe_relaxed_sub( 1757| 3.59M| child, shift_ - B, child_size, v, args...); 1758| 3.59M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 3.59M|{ 1839| 3.59M| assert(node); ------------------ | Branch (1839:5): [True: 3.59M, False: 0] ------------------ 1840| 3.59M| auto relaxed = node->relaxed(); 1841| 3.59M| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.59M, False: 2.14k] ------------------ 1842| 3.59M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.59M, False: 0] ------------------ 1843| 3.59M| return make_relaxed_pos(node, shift, relaxed) 1844| 3.59M| .visit(v, std::forward(args)...); 1845| 3.59M| } else { 1846| 2.14k| return make_regular_sub_pos(node, shift, size) 1847| 2.14k| .visit(v, std::forward(args)...); 1848| 2.14k| } 1849| 3.59M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1813| 3.59M| { 1814| 3.59M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.59M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 1036| 4.70k| { 1037| 4.70k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.70k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 958| 2.56k| { 959| 2.56k| auto offset = count() - 1; 960| 2.56k| auto child = node_->inner()[offset]; 961| 2.56k| auto is_leaf = shift_ == BL; 962| 2.56k| auto lsize = size_ - (size_t{offset} << shift_); 963| 2.56k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 2.56k] ------------------ 964| 2.56k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 2.56k| .visit(v, args...); 966| 2.56k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 913| 1.51M| { 914| 1.51M| each_left(v, count() - 1, args...); 915| 1.51M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_leftINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 873| 1.51M| { 874| 1.51M| return each_left_regular(*this, v, last, args...); 875| 1.51M| } _ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvOT_T0_jDpOT1_: 575| 1.51M|{ 576| 1.51M| constexpr auto B = bits; 577| 1.51M| constexpr auto BL = bits_leaf; 578| 1.51M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.51M, False: 0] ------------------ 579| 1.51M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 759k, False: 757k] ------------------ 580| 759k| auto n = p.node()->inner(); 581| 759k| auto e = n + last; 582| 3.56M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 2.80M, False: 759k] ------------------ 583| 2.80M| IMMER_PREFETCH(n + 1); 584| 2.80M| make_full_leaf_pos(*n).visit(v, args...); 585| 2.80M| } 586| 759k| } else { 587| 757k| auto n = p.node()->inner(); 588| 757k| auto e = n + last; 589| 757k| auto ss = p.shift() - B; 590| 1.23M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 480k, False: 757k] ------------------ 591| 480k| make_full_pos(*n, ss).visit(v, args...); 592| 757k| } 593| 1.51M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 913| 1.51M| { 914| 1.51M| each_left(v, count() - 1, args...); 915| 1.51M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_leftINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 873| 1.51M| { 874| 1.51M| return each_left_regular(*this, v, last, args...); 875| 1.51M| } _ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISD_EEEEEvOT_T0_jDpOT1_: 575| 1.51M|{ 576| 1.51M| constexpr auto B = bits; 577| 1.51M| constexpr auto BL = bits_leaf; 578| 1.51M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.51M, False: 0] ------------------ 579| 1.51M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 759k, False: 757k] ------------------ 580| 759k| auto n = p.node()->inner(); 581| 759k| auto e = n + last; 582| 3.56M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 2.80M, False: 759k] ------------------ 583| 2.80M| IMMER_PREFETCH(n + 1); 584| 2.80M| make_full_leaf_pos(*n).visit(v, args...); 585| 2.80M| } 586| 759k| } else { 587| 757k| auto n = p.node()->inner(); 588| 757k| auto e = n + last; 589| 757k| auto ss = p.shift() - B; 590| 1.23M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 480k, False: 757k] ------------------ 591| 480k| make_full_pos(*n, ss).visit(v, args...); 592| 757k| } 593| 1.51M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1762| 1.47M| { 1763| 1.47M| auto child = node_->inner()[0]; 1764| 1.47M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.47M| auto is_leaf = shift_ == BL; 1766| 1.47M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.47M, False: 0] ------------------ 1767| 1.47M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.47M] ------------------ 1768| 1.47M| : visit_maybe_relaxed_sub( 1769| 1.47M| child, shift_ - B, child_size, v, args...); 1770| 1.47M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 106| 1.37M| shift_t shift() const { return 0; } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 1.47M|{ 1839| 1.47M| assert(node); ------------------ | Branch (1839:5): [True: 1.47M, False: 0] ------------------ 1840| 1.47M| auto relaxed = node->relaxed(); 1841| 1.47M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.16M, False: 314k] ------------------ 1842| 1.16M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.16M, False: 0] ------------------ 1843| 1.16M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.16M| .visit(v, std::forward(args)...); 1845| 1.16M| } else { 1846| 314k| return make_regular_sub_pos(node, shift, size) 1847| 314k| .visit(v, std::forward(args)...); 1848| 314k| } 1849| 1.47M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 1.16M| { 1814| 1.16M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.16M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 314k| { 1037| 314k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 314k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 958| 1.26k| { 959| 1.26k| auto offset = count() - 1; 960| 1.26k| auto child = node_->inner()[offset]; 961| 1.26k| auto is_leaf = shift_ == BL; 962| 1.26k| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.26k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 1.26k] ------------------ 964| 1.26k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 1.26k| .visit(v, args...); 966| 1.26k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1036| 1.81k| { 1037| 1.81k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.81k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 9.58k| { 971| 9.58k| auto is_leaf = shift_ == BL; 972| 9.58k| auto child = node_->inner()[0]; 973| 9.58k| auto is_full = size_ >= (size_t{1} << shift_); 974| 9.58k| return is_full ------------------ | Branch (974:16): [True: 9.58k, False: 0] ------------------ 975| 9.58k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 9.58k] ------------------ 976| 9.58k| ? make_full_leaf_pos(child).visit(v, args...) 977| 9.58k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 9.58k| : (is_leaf ------------------ | Branch (978:23): [True: 0, False: 0] ------------------ 979| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 980| 0| : make_regular_sub_pos(child, shift_ - B, size_) 981| 0| .visit(v, args...)); 982| 9.58k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1405| 17.2k| { 1406| 17.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 17.2k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 7.70k| { 1362| 7.70k| auto is_leaf = shift_ == BL; 1363| 7.70k| auto child = node_->inner()[0]; 1364| 7.70k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 7.70k] ------------------ 1365| 7.70k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 7.70k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 958| 17.0k| { 959| 17.0k| auto offset = count() - 1; 960| 17.0k| auto child = node_->inner()[offset]; 961| 17.0k| auto is_leaf = shift_ == BL; 962| 17.0k| auto lsize = size_ - (size_t{offset} << shift_); 963| 17.0k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 9.79k, False: 7.26k] ------------------ 964| 17.0k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 7.26k| .visit(v, args...); 966| 17.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 144| 11.1k| { 145| 11.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 11.1k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1370| 11.1k| { 1371| 11.1k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 11.1k, False: 0] ------------------ 1372| 11.1k| auto child = node_->inner()[0]; 1373| 11.1k| return make_full_leaf_pos(child).visit(v, args...); 1374| 11.1k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 207| 344k| { 208| 344k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 344k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1036| 7.46k| { 1037| 7.46k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.46k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 958| 331k| { 959| 331k| auto offset = count() - 1; 960| 331k| auto child = node_->inner()[offset]; 961| 331k| auto is_leaf = shift_ == BL; 962| 331k| auto lsize = size_ - (size_t{offset} << shift_); 963| 331k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 326k, False: 5.64k] ------------------ 964| 331k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 5.64k| .visit(v, args...); 966| 331k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 144| 333k| { 145| 333k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 333k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 986| 333k| { 987| 333k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 333k, False: 0] ------------------ 988| 333k| auto child = node_->inner()[0]; 989| 333k| auto is_full = size_ >= branches; 990| 333k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 333k, False: 0] ------------------ 991| 333k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 333k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 144| 1.03M| { 145| 1.03M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.03M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1036| 8.87k| { 1037| 8.87k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.87k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 958| 1.16M| { 959| 1.16M| auto offset = count() - 1; 960| 1.16M| auto child = node_->inner()[offset]; 961| 1.16M| auto is_leaf = shift_ == BL; 962| 1.16M| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.16M| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 423k, False: 741k] ------------------ 964| 1.16M| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 741k| .visit(v, args...); 966| 1.16M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 144| 1.03M| { 145| 1.03M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.03M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1774| 1.03M| { 1775| 1.03M| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 1.03M, False: 0] ------------------ 1776| 1.03M| auto child = node_->inner()[0]; 1777| 1.03M| auto child_size = relaxed_->d.sizes[0]; 1778| 1.03M| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 1.03M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 1036| 1.47M| { 1037| 1.47M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.47M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1617| 15.5M| { 1618| 15.5M| each_left(v, relaxed_->d.count - 1, args...); 1619| 15.5M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_leftINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 1623| 15.5M| { 1624| 15.5M| auto p = node_->inner(); 1625| 15.5M| auto s = size_t{}; 1626| 15.5M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 617k, False: 14.9M] ------------------ 1627| 4.47M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 3.86M, False: 617k] ------------------ 1628| 3.86M| IMMER_PREFETCH(p + i + 1); 1629| 3.86M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 3.86M| .visit(v, args...); 1631| 3.86M| s = relaxed_->d.sizes[i]; 1632| 3.86M| assert(s); ------------------ | Branch (1632:17): [True: 3.86M, False: 0] ------------------ 1633| 3.86M| } 1634| 14.9M| } else { 1635| 14.9M| auto ss = shift_ - B; 1636| 69.4M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 54.4M, False: 14.9M] ------------------ 1637| 54.4M| visit_maybe_relaxed_sub( 1638| 54.4M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 54.4M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 54.4M, False: 0] ------------------ 1641| 54.4M| } 1642| 14.9M| } 1643| 15.5M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1617| 15.5M| { 1618| 15.5M| each_left(v, relaxed_->d.count - 1, args...); 1619| 15.5M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_leftINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 1623| 15.5M| { 1624| 15.5M| auto p = node_->inner(); 1625| 15.5M| auto s = size_t{}; 1626| 15.5M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 617k, False: 14.9M] ------------------ 1627| 4.47M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 3.86M, False: 617k] ------------------ 1628| 3.86M| IMMER_PREFETCH(p + i + 1); 1629| 3.86M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 3.86M| .visit(v, args...); 1631| 3.86M| s = relaxed_->d.sizes[i]; 1632| 3.86M| assert(s); ------------------ | Branch (1632:17): [True: 3.86M, False: 0] ------------------ 1633| 3.86M| } 1634| 14.9M| } else { 1635| 14.9M| auto ss = shift_ - B; 1636| 69.4M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 54.4M, False: 14.9M] ------------------ 1637| 54.4M| visit_maybe_relaxed_sub( 1638| 54.4M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 54.4M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 54.4M, False: 0] ------------------ 1641| 54.4M| } 1642| 14.9M| } 1643| 15.5M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1762| 10.7M| { 1763| 10.7M| auto child = node_->inner()[0]; 1764| 10.7M| auto child_size = relaxed_->d.sizes[0]; 1765| 10.7M| auto is_leaf = shift_ == BL; 1766| 10.7M| assert(child_size); ------------------ | Branch (1766:9): [True: 10.7M, False: 0] ------------------ 1767| 10.7M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 10.7M] ------------------ 1768| 10.7M| : visit_maybe_relaxed_sub( 1769| 10.7M| child, shift_ - B, child_size, v, args...); 1770| 10.7M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 10.7M|{ 1839| 10.7M| assert(node); ------------------ | Branch (1839:5): [True: 10.7M, False: 0] ------------------ 1840| 10.7M| auto relaxed = node->relaxed(); 1841| 10.7M| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.7M, False: 1.26k] ------------------ 1842| 10.7M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 10.7M, False: 0] ------------------ 1843| 10.7M| return make_relaxed_pos(node, shift, relaxed) 1844| 10.7M| .visit(v, std::forward(args)...); 1845| 10.7M| } else { 1846| 1.26k| return make_regular_sub_pos(node, shift, size) 1847| 1.26k| .visit(v, std::forward(args)...); 1848| 1.26k| } 1849| 10.7M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 10.7M| { 1814| 10.7M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 10.7M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 1.26k| { 1037| 1.26k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.26k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1750| 22.2k| { 1751| 22.2k| auto offset = relaxed_->d.count - 1; 1752| 22.2k| auto child = node_->inner()[offset]; 1753| 22.2k| auto child_size = size(offset); 1754| 22.2k| auto is_leaf = shift_ == BL; 1755| 22.2k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 22.2k] ------------------ 1756| 22.2k| : visit_maybe_relaxed_sub( 1757| 22.2k| child, shift_ - B, child_size, v, args...); 1758| 22.2k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 22.2k|{ 1839| 22.2k| assert(node); ------------------ | Branch (1839:5): [True: 22.2k, False: 0] ------------------ 1840| 22.2k| auto relaxed = node->relaxed(); 1841| 22.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 21.7k, False: 550] ------------------ 1842| 21.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 21.7k, False: 0] ------------------ 1843| 21.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 21.7k| .visit(v, std::forward(args)...); 1845| 21.7k| } else { 1846| 550| return make_regular_sub_pos(node, shift, size) 1847| 550| .visit(v, std::forward(args)...); 1848| 550| } 1849| 22.2k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1813| 21.7k| { 1814| 21.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.7k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 1.59k| { 971| 1.59k| auto is_leaf = shift_ == BL; 972| 1.59k| auto child = node_->inner()[0]; 973| 1.59k| auto is_full = size_ >= (size_t{1} << shift_); 974| 1.59k| return is_full ------------------ | Branch (974:16): [True: 1.59k, False: 0] ------------------ 975| 1.59k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 1.59k] ------------------ 976| 1.59k| ? make_full_leaf_pos(child).visit(v, args...) 977| 1.59k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 1.59k| : (is_leaf ------------------ | Branch (978:23): [True: 0, False: 0] ------------------ 979| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 980| 0| : make_regular_sub_pos(child, shift_ - B, size_) 981| 0| .visit(v, args...)); 982| 1.59k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1405| 2.34k| { 1406| 2.34k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.34k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 752| { 1362| 752| auto is_leaf = shift_ == BL; 1363| 752| auto child = node_->inner()[0]; 1364| 752| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 752] ------------------ 1365| 752| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 752| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1750| 2.13k| { 1751| 2.13k| auto offset = relaxed_->d.count - 1; 1752| 2.13k| auto child = node_->inner()[offset]; 1753| 2.13k| auto child_size = size(offset); 1754| 2.13k| auto is_leaf = shift_ == BL; 1755| 2.13k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 1.38k, False: 750] ------------------ 1756| 2.13k| : visit_maybe_relaxed_sub( 1757| 750| child, shift_ - B, child_size, v, args...); 1758| 2.13k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 750|{ 1839| 750| assert(node); ------------------ | Branch (1839:5): [True: 750, False: 0] ------------------ 1840| 750| auto relaxed = node->relaxed(); 1841| 750| if (relaxed) { ------------------ | Branch (1841:9): [True: 544, False: 206] ------------------ 1842| 544| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 544, False: 0] ------------------ 1843| 544| return make_relaxed_pos(node, shift, relaxed) 1844| 544| .visit(v, std::forward(args)...); 1845| 544| } else { 1846| 206| return make_regular_sub_pos(node, shift, size) 1847| 206| .visit(v, std::forward(args)...); 1848| 206| } 1849| 750|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1813| 544| { 1814| 544| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 544| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1750| 11.3k| { 1751| 11.3k| auto offset = relaxed_->d.count - 1; 1752| 11.3k| auto child = node_->inner()[offset]; 1753| 11.3k| auto child_size = size(offset); 1754| 11.3k| auto is_leaf = shift_ == BL; 1755| 11.3k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 6.98k, False: 4.33k] ------------------ 1756| 11.3k| : visit_maybe_relaxed_sub( 1757| 4.33k| child, shift_ - B, child_size, v, args...); 1758| 11.3k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 4.33k|{ 1839| 4.33k| assert(node); ------------------ | Branch (1839:5): [True: 4.33k, False: 0] ------------------ 1840| 4.33k| auto relaxed = node->relaxed(); 1841| 4.33k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.11k, False: 3.22k] ------------------ 1842| 1.11k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.11k, False: 0] ------------------ 1843| 1.11k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.11k| .visit(v, std::forward(args)...); 1845| 3.22k| } else { 1846| 3.22k| return make_regular_sub_pos(node, shift, size) 1847| 3.22k| .visit(v, std::forward(args)...); 1848| 3.22k| } 1849| 4.33k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1813| 1.11k| { 1814| 1.11k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.11k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1750| 11.8M| { 1751| 11.8M| auto offset = relaxed_->d.count - 1; 1752| 11.8M| auto child = node_->inner()[offset]; 1753| 11.8M| auto child_size = size(offset); 1754| 11.8M| auto is_leaf = shift_ == BL; 1755| 11.8M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 608k, False: 11.2M] ------------------ 1756| 11.8M| : visit_maybe_relaxed_sub( 1757| 11.2M| child, shift_ - B, child_size, v, args...); 1758| 11.8M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 11.2M|{ 1839| 11.2M| assert(node); ------------------ | Branch (1839:5): [True: 11.2M, False: 0] ------------------ 1840| 11.2M| auto relaxed = node->relaxed(); 1841| 11.2M| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.5M, False: 730k] ------------------ 1842| 10.5M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 10.5M, False: 0] ------------------ 1843| 10.5M| return make_relaxed_pos(node, shift, relaxed) 1844| 10.5M| .visit(v, std::forward(args)...); 1845| 10.5M| } else { 1846| 730k| return make_regular_sub_pos(node, shift, size) 1847| 730k| .visit(v, std::forward(args)...); 1848| 730k| } 1849| 11.2M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1813| 10.5M| { 1814| 10.5M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 10.5M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 11.0k| { 1037| 11.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 11.0k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 1036| 23.2k| { 1037| 23.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 23.2k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 23.2k|{ 1839| 23.2k| assert(node); ------------------ | Branch (1839:5): [True: 23.2k, False: 0] ------------------ 1840| 23.2k| auto relaxed = node->relaxed(); 1841| 23.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.19k, False: 17.0k] ------------------ 1842| 6.19k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.19k, False: 0] ------------------ 1843| 6.19k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.19k| .visit(v, std::forward(args)...); 1845| 17.0k| } else { 1846| 17.0k| return make_regular_sub_pos(node, shift, size) 1847| 17.0k| .visit(v, std::forward(args)...); 1848| 17.0k| } 1849| 23.2k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 6.19k| { 1814| 6.19k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.19k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 17.0k| { 1037| 17.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 17.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1813| 197k| { 1814| 197k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 197k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11last_oh_cshINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_jmDpOT0_: 1737| 191k| { 1738| 191k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 191k, False: 0] ------------------ 1739| 191k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 191k, False: 0] ------------------ 1740| 191k| auto child = node_->inner()[offset_hint]; 1741| 191k| auto is_leaf = shift_ == BL; 1742| 191k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 191k] ------------------ 1743| 191k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 191k| : visit_maybe_relaxed_sub( 1745| 191k| child, shift_ - B, child_size_hint, v, args...); 1746| 191k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcPT_jmT0_DpOT1_: 1838| 191k|{ 1839| 191k| assert(node); ------------------ | Branch (1839:5): [True: 191k, False: 0] ------------------ 1840| 191k| auto relaxed = node->relaxed(); 1841| 191k| if (relaxed) { ------------------ | Branch (1841:9): [True: 24.9k, False: 166k] ------------------ 1842| 24.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 24.9k, False: 0] ------------------ 1843| 24.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 24.9k| .visit(v, std::forward(args)...); 1845| 166k| } else { 1846| 166k| return make_regular_sub_pos(node, shift, size) 1847| 166k| .visit(v, std::forward(args)...); 1848| 166k| } 1849| 191k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1036| 166k| { 1037| 166k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 166k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 952| 316k| { 953| 316k| return last_oh_regular(*this, v, offset_hint, args...); 954| 316k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_21push_tail_mut_visitorISD_Lb1EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 316k|{ 678| 316k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 316k, False: 0] ------------------ 679| 316k| constexpr auto B = bits; 680| 316k| constexpr auto BL = bits_leaf; 681| 316k| auto child = p.node()->inner()[offset_hint]; 682| 316k| auto is_leaf = p.shift() == BL; 683| 316k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 316k] ------------------ 684| 316k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 316k| .visit(v, args...); 686| 316k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 336| 1.45M| { 337| 1.45M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.45M| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 330| 1.13M| { 331| 1.13M| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.13M| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_21push_tail_mut_visitorISD_Lb1EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 1.13M|{ 678| 1.13M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.13M, False: 0] ------------------ 679| 1.13M| constexpr auto B = bits; 680| 1.13M| constexpr auto BL = bits_leaf; 681| 1.13M| auto child = p.node()->inner()[offset_hint]; 682| 1.13M| auto is_leaf = p.shift() == BL; 683| 1.13M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.13M] ------------------ 684| 1.13M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.13M| .visit(v, args...); 686| 1.13M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 330| 2.32k| { 331| 2.32k| return last_oh_regular(*this, v, offset_hint, args...); 332| 2.32k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_21push_tail_mut_visitorISD_Lb0EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 2.32k|{ 678| 2.32k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 2.32k, False: 0] ------------------ 679| 2.32k| constexpr auto B = bits; 680| 2.32k| constexpr auto BL = bits_leaf; 681| 2.32k| auto child = p.node()->inner()[offset_hint]; 682| 2.32k| auto is_leaf = p.shift() == BL; 683| 2.32k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 2.32k] ------------------ 684| 2.32k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 2.32k| .visit(v, args...); 686| 2.32k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 336| 3.44k| { 337| 3.44k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.44k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 952| 1.11k| { 953| 1.11k| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.11k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_21push_tail_mut_visitorISD_Lb0EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 1.11k|{ 678| 1.11k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.11k, False: 0] ------------------ 679| 1.11k| constexpr auto B = bits; 680| 1.11k| constexpr auto BL = bits_leaf; 681| 1.11k| auto child = p.node()->inner()[offset_hint]; 682| 1.11k| auto is_leaf = p.shift() == BL; 683| 1.11k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.11k] ------------------ 684| 1.11k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.11k| .visit(v, args...); 686| 1.11k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11last_oh_cshINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_jmDpOT0_: 1737| 5.17k| { 1738| 5.17k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 5.17k, False: 0] ------------------ 1739| 5.17k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 5.17k, False: 0] ------------------ 1740| 5.17k| auto child = node_->inner()[offset_hint]; 1741| 5.17k| auto is_leaf = shift_ == BL; 1742| 5.17k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 5.17k] ------------------ 1743| 5.17k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 5.17k| : visit_maybe_relaxed_sub( 1745| 5.17k| child, shift_ - B, child_size_hint, v, args...); 1746| 5.17k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcPT_jmT0_DpOT1_: 1838| 5.17k|{ 1839| 5.17k| assert(node); ------------------ | Branch (1839:5): [True: 5.17k, False: 0] ------------------ 1840| 5.17k| auto relaxed = node->relaxed(); 1841| 5.17k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.44k, False: 726] ------------------ 1842| 4.44k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.44k, False: 0] ------------------ 1843| 4.44k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.44k| .visit(v, std::forward(args)...); 1845| 4.44k| } else { 1846| 726| return make_regular_sub_pos(node, shift, size) 1847| 726| .visit(v, std::forward(args)...); 1848| 726| } 1849| 5.17k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1813| 4.44k| { 1814| 4.44k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.44k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1036| 726| { 1037| 726| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 726| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 1036| 162k| { 1037| 162k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 162k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcPT_jmT0_DpOT1_: 1838| 15.6k|{ 1839| 15.6k| assert(node); ------------------ | Branch (1839:5): [True: 15.6k, False: 0] ------------------ 1840| 15.6k| auto relaxed = node->relaxed(); 1841| 15.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 13.3k, False: 2.32k] ------------------ 1842| 13.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 13.3k, False: 0] ------------------ 1843| 13.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 13.3k| .visit(v, std::forward(args)...); 1845| 13.3k| } else { 1846| 2.32k| return make_regular_sub_pos(node, shift, size) 1847| 2.32k| .visit(v, std::forward(args)...); 1848| 2.32k| } 1849| 15.6k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_: 1813| 13.3k| { 1814| 13.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 13.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjDpOT0_: 1686| 70.5k| { 1687| 70.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 70.5k, False: 0] ------------------ 1688| 70.5k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 17.6k, False: 52.8k] ------------------ 1689| 70.5k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 70.5k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjmDpOT0_: 1698| 70.5k| { 1699| 70.5k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 70.5k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjmDpOT0_: 1717| 70.5k| { 1718| 70.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 70.5k, False: 0] ------------------ 1719| 70.5k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 17.6k, False: 52.8k] | Branch (1719:9): [True: 70.5k, False: 0] ------------------ 1720| 70.5k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 70.5k| auto child = node_->inner()[offset_hint]; 1722| 70.5k| auto is_leaf = shift_ == BL; 1723| 70.5k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 70.5k| auto next_idx = idx - left_size_hint; 1725| 70.5k| return is_leaf ------------------ | Branch (1725:16): [True: 11.3k, False: 59.1k] ------------------ 1726| 70.5k| ? make_leaf_sub_pos(child, next_size) 1727| 11.3k| .visit(v, next_idx, args...) 1728| 70.5k| : visit_maybe_relaxed_sub( 1729| 59.1k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 70.5k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 144| 11.3k| { 145| 11.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 11.3k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcPT_jmT0_DpOT1_: 1838| 59.1k|{ 1839| 59.1k| assert(node); ------------------ | Branch (1839:5): [True: 59.1k, False: 0] ------------------ 1840| 59.1k| auto relaxed = node->relaxed(); 1841| 59.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 57.1k, False: 1.99k] ------------------ 1842| 57.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 57.1k, False: 0] ------------------ 1843| 57.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 57.1k| .visit(v, std::forward(args)...); 1845| 57.1k| } else { 1846| 1.99k| return make_regular_sub_pos(node, shift, size) 1847| 1.99k| .visit(v, std::forward(args)...); 1848| 1.99k| } 1849| 59.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1813| 57.1k| { 1814| 57.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 57.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1036| 1.99k| { 1037| 1.99k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.99k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 938| 4.31k| { 939| 4.31k| return towards_oh_ch_regular( 940| 4.31k| *this, v, idx, offset_hint, count(), args...); 941| 4.31k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_: 632| 4.31k|{ 633| 4.31k| constexpr auto B = bits; 634| 4.31k| constexpr auto BL = bits_leaf; 635| 4.31k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.31k, False: 0] ------------------ 636| 4.31k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.31k, False: 0] ------------------ 637| 4.31k| auto is_leaf = p.shift() == BL; 638| 4.31k| auto child = p.node()->inner()[offset_hint]; 639| 4.31k| auto is_full = offset_hint + 1 != count_hint; 640| 4.31k| return is_full ------------------ | Branch (640:12): [True: 2.07k, False: 2.24k] ------------------ 641| 4.31k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 903, False: 1.16k] ------------------ 642| 2.07k| : make_full_pos(child, p.shift() - B) 643| 1.16k| .visit(v, idx, args...)) 644| 4.31k| : (is_leaf ------------------ | Branch (644:19): [True: 497, False: 1.74k] ------------------ 645| 2.24k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.24k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.74k| .visit(v, idx, args...)); 648| 4.31k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 207| 3.40k| { 208| 3.40k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.40k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1405| 2.84k| { 1406| 2.84k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.84k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 1329| 2.84k| { 1330| 2.84k| return towards_oh(v, idx, offset_hint, args...); 1331| 2.84k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjDpOT0_: 1336| 2.84k| { 1337| 2.84k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.84k, False: 0] ------------------ 1338| 2.84k| auto is_leaf = shift_ == BL; 1339| 2.84k| auto child = node_->inner()[offset_hint]; 1340| 2.84k| return is_leaf ------------------ | Branch (1340:16): [True: 2.09k, False: 744] ------------------ 1341| 2.84k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.84k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.84k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 112| 907| { 113| 907| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 907| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 336| 2.30k| { 337| 2.30k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.30k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 316| 2.30k| { 317| 2.30k| return towards_oh_ch_regular( 318| 2.30k| *this, v, idx, offset_hint, count(), args...); 319| 2.30k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_: 632| 2.30k|{ 633| 2.30k| constexpr auto B = bits; 634| 2.30k| constexpr auto BL = bits_leaf; 635| 2.30k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.30k, False: 0] ------------------ 636| 2.30k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.30k, False: 0] ------------------ 637| 2.30k| auto is_leaf = p.shift() == BL; 638| 2.30k| auto child = p.node()->inner()[offset_hint]; 639| 2.30k| auto is_full = offset_hint + 1 != count_hint; 640| 2.30k| return is_full ------------------ | Branch (640:12): [True: 1.33k, False: 968] ------------------ 641| 2.30k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 408, False: 930] ------------------ 642| 1.33k| : make_full_pos(child, p.shift() - B) 643| 930| .visit(v, idx, args...)) 644| 2.30k| : (is_leaf ------------------ | Branch (644:19): [True: 410, False: 558] ------------------ 645| 968| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 968| : make_regular_pos(child, p.shift() - B, p.size()) 647| 558| .visit(v, idx, args...)); 648| 2.30k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_: 1036| 2.32k| { 1037| 2.32k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.32k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 40.5k|{ 1839| 40.5k| assert(node); ------------------ | Branch (1839:5): [True: 40.5k, False: 0] ------------------ 1840| 40.5k| auto relaxed = node->relaxed(); 1841| 40.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 28.7k, False: 11.8k] ------------------ 1842| 28.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 28.7k, False: 0] ------------------ 1843| 28.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 28.7k| .visit(v, std::forward(args)...); 1845| 28.7k| } else { 1846| 11.8k| return make_regular_sub_pos(node, shift, size) 1847| 11.8k| .visit(v, std::forward(args)...); 1848| 11.8k| } 1849| 40.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 28.7k| { 1814| 28.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 28.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 10.0k| { 1687| 10.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 10.0k, False: 0] ------------------ 1688| 10.0k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 10.0k] ------------------ 1689| 10.0k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 10.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 10.0k| { 1699| 10.0k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 10.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 10.0k| { 1718| 10.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 10.0k, False: 0] ------------------ 1719| 10.0k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 10.0k] | Branch (1719:9): [True: 10.0k, False: 0] ------------------ 1720| 10.0k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 10.0k| auto child = node_->inner()[offset_hint]; 1722| 10.0k| auto is_leaf = shift_ == BL; 1723| 10.0k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 10.0k| auto next_idx = idx - left_size_hint; 1725| 10.0k| return is_leaf ------------------ | Branch (1725:16): [True: 974, False: 9.06k] ------------------ 1726| 10.0k| ? make_leaf_sub_pos(child, next_size) 1727| 974| .visit(v, next_idx, args...) 1728| 10.0k| : visit_maybe_relaxed_sub( 1729| 9.06k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 10.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 974| { 145| 974| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 974| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 19.7k| { 1687| 19.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 19.7k, False: 0] ------------------ 1688| 19.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 19.7k] ------------------ 1689| 19.7k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 19.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 19.7k| { 1699| 19.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 19.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 19.7k| { 1718| 19.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 19.7k, False: 0] ------------------ 1719| 19.7k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 19.7k] | Branch (1719:9): [True: 19.7k, False: 0] ------------------ 1720| 19.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 19.7k| auto child = node_->inner()[offset_hint]; 1722| 19.7k| auto is_leaf = shift_ == BL; 1723| 19.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 19.7k| auto next_idx = idx - left_size_hint; 1725| 19.7k| return is_leaf ------------------ | Branch (1725:16): [True: 955, False: 18.8k] ------------------ 1726| 19.7k| ? make_leaf_sub_pos(child, next_size) 1727| 955| .visit(v, next_idx, args...) 1728| 19.7k| : visit_maybe_relaxed_sub( 1729| 18.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 19.7k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 955| { 145| 955| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 955| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 18.8k|{ 1839| 18.8k| assert(node); ------------------ | Branch (1839:5): [True: 18.8k, False: 0] ------------------ 1840| 18.8k| auto relaxed = node->relaxed(); 1841| 18.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 17.5k, False: 1.26k] ------------------ 1842| 17.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 17.5k, False: 0] ------------------ 1843| 17.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 17.5k| .visit(v, std::forward(args)...); 1845| 17.5k| } else { 1846| 1.26k| return make_regular_sub_pos(node, shift, size) 1847| 1.26k| .visit(v, std::forward(args)...); 1848| 1.26k| } 1849| 18.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 17.5k| { 1814| 17.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 17.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.26k| { 1037| 1.26k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.26k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 2.38k| { 928| 2.38k| return towards_oh_ch_regular( 929| 2.38k| *this, v, idx, offset_hint, count(), args...); 930| 2.38k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 2.38k|{ 633| 2.38k| constexpr auto B = bits; 634| 2.38k| constexpr auto BL = bits_leaf; 635| 2.38k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.38k, False: 0] ------------------ 636| 2.38k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.38k, False: 0] ------------------ 637| 2.38k| auto is_leaf = p.shift() == BL; 638| 2.38k| auto child = p.node()->inner()[offset_hint]; 639| 2.38k| auto is_full = offset_hint + 1 != count_hint; 640| 2.38k| return is_full ------------------ | Branch (640:12): [True: 1.98k, False: 406] ------------------ 641| 2.38k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 478, False: 1.50k] ------------------ 642| 1.98k| : make_full_pos(child, p.shift() - B) 643| 1.50k| .visit(v, idx, args...)) 644| 2.38k| : (is_leaf ------------------ | Branch (644:19): [True: 406, False: 0] ------------------ 645| 406| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 406| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.38k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 1.44k| { 208| 1.44k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.44k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 1.78k| { 1406| 1.78k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.78k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 1.24k| { 1337| 1.24k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.24k, False: 0] ------------------ 1338| 1.24k| auto is_leaf = shift_ == BL; 1339| 1.24k| auto child = node_->inner()[offset_hint]; 1340| 1.24k| return is_leaf ------------------ | Branch (1340:16): [True: 964, False: 282] ------------------ 1341| 1.24k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.24k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.24k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 2.63k| { 1337| 2.63k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.63k, False: 0] ------------------ 1338| 2.63k| auto is_leaf = shift_ == BL; 1339| 2.63k| auto child = node_->inner()[offset_hint]; 1340| 2.63k| return is_leaf ------------------ | Branch (1340:16): [True: 1.66k, False: 962] ------------------ 1341| 2.63k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.63k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.63k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 3.30k| { 208| 3.30k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.30k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 4.00k| { 1406| 4.00k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.00k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 3.05k| { 1406| 3.05k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.05k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 10.2k| { 1337| 10.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 10.2k, False: 0] ------------------ 1338| 10.2k| auto is_leaf = shift_ == BL; 1339| 10.2k| auto child = node_->inner()[offset_hint]; 1340| 10.2k| return is_leaf ------------------ | Branch (1340:16): [True: 7.67k, False: 2.61k] ------------------ 1341| 10.2k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 10.2k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 10.2k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 10.1k| { 208| 10.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.1k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 6.06k| { 1406| 6.06k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 6.06k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 3.58k| { 1311| 3.58k| each_i(v, start, branches, args...); 1312| 3.58k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 5.10k| { 1264| 5.10k| auto p = node_->inner() + i; 1265| 5.10k| auto e = node_->inner() + n; 1266| 5.10k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 3.15k, False: 1.94k] ------------------ 1267| 16.1k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 13.0k, False: 3.15k] ------------------ 1268| 13.0k| IMMER_PREFETCH(p + 1); 1269| 13.0k| make_full_leaf_pos(*p).visit(v, args...); 1270| 13.0k| } 1271| 3.15k| } else { 1272| 1.94k| auto ss = shift_ - B; 1273| 11.2k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 9.26k, False: 1.94k] ------------------ 1274| 9.26k| make_full_pos(*p, ss).visit(v, args...); 1275| 1.94k| } 1276| 5.10k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 406| { 113| 406| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 406| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 305| 3.14k| { 306| 3.14k| return towards_oh_ch_regular( 307| 3.14k| *this, v, idx, offset_hint, count(), args...); 308| 3.14k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 3.14k|{ 633| 3.14k| constexpr auto B = bits; 634| 3.14k| constexpr auto BL = bits_leaf; 635| 3.14k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.14k, False: 0] ------------------ 636| 3.14k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.14k, False: 0] ------------------ 637| 3.14k| auto is_leaf = p.shift() == BL; 638| 3.14k| auto child = p.node()->inner()[offset_hint]; 639| 3.14k| auto is_full = offset_hint + 1 != count_hint; 640| 3.14k| return is_full ------------------ | Branch (640:12): [True: 2.15k, False: 994] ------------------ 641| 3.14k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 834, False: 1.32k] ------------------ 642| 2.15k| : make_full_pos(child, p.shift() - B) 643| 1.32k| .visit(v, idx, args...)) 644| 3.14k| : (is_leaf ------------------ | Branch (644:19): [True: 644, False: 350] ------------------ 645| 994| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 994| : make_regular_pos(child, p.shift() - B, p.size()) 647| 350| .visit(v, idx, args...)); 648| 3.14k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 1.54k| { 113| 1.54k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.54k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 336| 4.27k| { 337| 4.27k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.27k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 1.58k| { 337| 1.58k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.58k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 305| 4.31k| { 306| 4.31k| return towards_oh_ch_regular( 307| 4.31k| *this, v, idx, offset_hint, count(), args...); 308| 4.31k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 4.31k|{ 633| 4.31k| constexpr auto B = bits; 634| 4.31k| constexpr auto BL = bits_leaf; 635| 4.31k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.31k, False: 0] ------------------ 636| 4.31k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.31k, False: 0] ------------------ 637| 4.31k| auto is_leaf = p.shift() == BL; 638| 4.31k| auto child = p.node()->inner()[offset_hint]; 639| 4.31k| auto is_full = offset_hint + 1 != count_hint; 640| 4.31k| return is_full ------------------ | Branch (640:12): [True: 2.07k, False: 2.24k] ------------------ 641| 4.31k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.07k, False: 1.00k] ------------------ 642| 2.07k| : make_full_pos(child, p.shift() - B) 643| 1.00k| .visit(v, idx, args...)) 644| 4.31k| : (is_leaf ------------------ | Branch (644:19): [True: 1.61k, False: 623] ------------------ 645| 2.24k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.24k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 623| .visit(v, idx, args...)); 648| 4.31k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 2.36k| { 113| 2.36k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.36k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 336| 3.19k| { 337| 3.19k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.19k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 3.14k| { 286| 3.14k| return each_right_regular(*this, v, start, args...); 287| 3.14k| } _ZN5immer6detail4rbts18each_right_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 597| 3.14k|{ 598| 3.14k| constexpr auto B = bits; 599| 3.14k| constexpr auto BL = bits_leaf; 600| | 601| 3.14k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 1.47k, False: 1.67k] ------------------ 602| 1.47k| auto n = p.node()->inner() + start; 603| 1.47k| auto last = p.count() - 1; 604| 1.47k| auto e = p.node()->inner() + last; 605| 1.47k| if (n <= e) { ------------------ | Branch (605:13): [True: 834, False: 644] ------------------ 606| 2.55k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.72k, False: 834] ------------------ 607| 1.72k| IMMER_PREFETCH(n + 1); 608| 1.72k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.72k| } 610| 834| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 834| } 612| 1.67k| } else { 613| 1.67k| auto n = p.node()->inner() + start; 614| 1.67k| auto last = p.count() - 1; 615| 1.67k| auto e = p.node()->inner() + last; 616| 1.67k| auto ss = p.shift() - B; 617| 1.67k| if (n <= e) { ------------------ | Branch (617:13): [True: 1.32k, False: 350] ------------------ 618| 2.89k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.57k, False: 1.32k] ------------------ 619| 1.57k| make_full_pos(*n, ss).visit(v, args...); 620| 1.32k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 1.32k| } 622| 1.67k| } 623| 3.14k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 7.35k| { 928| 7.35k| return towards_oh_ch_regular( 929| 7.35k| *this, v, idx, offset_hint, count(), args...); 930| 7.35k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 7.35k|{ 633| 7.35k| constexpr auto B = bits; 634| 7.35k| constexpr auto BL = bits_leaf; 635| 7.35k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.35k, False: 0] ------------------ 636| 7.35k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.35k, False: 0] ------------------ 637| 7.35k| auto is_leaf = p.shift() == BL; 638| 7.35k| auto child = p.node()->inner()[offset_hint]; 639| 7.35k| auto is_full = offset_hint + 1 != count_hint; 640| 7.35k| return is_full ------------------ | Branch (640:12): [True: 2.52k, False: 4.83k] ------------------ 641| 7.35k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 806, False: 1.72k] ------------------ 642| 2.52k| : make_full_pos(child, p.shift() - B) 643| 1.72k| .visit(v, idx, args...)) 644| 7.35k| : (is_leaf ------------------ | Branch (644:19): [True: 905, False: 3.92k] ------------------ 645| 4.83k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.83k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.92k| .visit(v, idx, args...)); 648| 7.35k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 7.20k| { 928| 7.20k| return towards_oh_ch_regular( 929| 7.20k| *this, v, idx, offset_hint, count(), args...); 930| 7.20k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 7.20k|{ 633| 7.20k| constexpr auto B = bits; 634| 7.20k| constexpr auto BL = bits_leaf; 635| 7.20k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.20k, False: 0] ------------------ 636| 7.20k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.20k, False: 0] ------------------ 637| 7.20k| auto is_leaf = p.shift() == BL; 638| 7.20k| auto child = p.node()->inner()[offset_hint]; 639| 7.20k| auto is_full = offset_hint + 1 != count_hint; 640| 7.20k| return is_full ------------------ | Branch (640:12): [True: 3.89k, False: 3.31k] ------------------ 641| 7.20k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.44k, False: 2.44k] ------------------ 642| 3.89k| : make_full_pos(child, p.shift() - B) 643| 2.44k| .visit(v, idx, args...)) 644| 7.20k| : (is_leaf ------------------ | Branch (644:19): [True: 744, False: 2.56k] ------------------ 645| 3.31k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.31k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.56k| .visit(v, idx, args...)); 648| 7.20k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 867| 11.9k| { 868| 11.9k| return each_right_regular(*this, v, start, args...); 869| 11.9k| } _ZN5immer6detail4rbts18each_right_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 597| 11.9k|{ 598| 11.9k| constexpr auto B = bits; 599| 11.9k| constexpr auto BL = bits_leaf; 600| | 601| 11.9k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 3.48k, False: 8.51k] ------------------ 602| 3.48k| auto n = p.node()->inner() + start; 603| 3.48k| auto last = p.count() - 1; 604| 3.48k| auto e = p.node()->inner() + last; 605| 3.48k| if (n <= e) { ------------------ | Branch (605:13): [True: 1.87k, False: 1.61k] ------------------ 606| 2.98k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.11k, False: 1.87k] ------------------ 607| 1.11k| IMMER_PREFETCH(n + 1); 608| 1.11k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.11k| } 610| 1.87k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 1.87k| } 612| 8.51k| } else { 613| 8.51k| auto n = p.node()->inner() + start; 614| 8.51k| auto last = p.count() - 1; 615| 8.51k| auto e = p.node()->inner() + last; 616| 8.51k| auto ss = p.shift() - B; 617| 8.51k| if (n <= e) { ------------------ | Branch (617:13): [True: 4.58k, False: 3.92k] ------------------ 618| 5.74k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.16k, False: 4.58k] ------------------ 619| 1.16k| make_full_pos(*n, ss).visit(v, args...); 620| 4.58k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 4.58k| } 622| 8.51k| } 623| 11.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 19.1k| { 1814| 19.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 19.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 12.3k| { 1687| 12.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 12.3k, False: 0] ------------------ 1688| 12.3k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 11.3k, False: 1.03k] ------------------ 1689| 12.3k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 12.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 12.3k| { 1699| 12.3k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 12.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 12.3k| { 1718| 12.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 12.3k, False: 0] ------------------ 1719| 12.3k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 11.3k, False: 1.03k] | Branch (1719:9): [True: 12.3k, False: 0] ------------------ 1720| 12.3k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 12.3k| auto child = node_->inner()[offset_hint]; 1722| 12.3k| auto is_leaf = shift_ == BL; 1723| 12.3k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 12.3k| auto next_idx = idx - left_size_hint; 1725| 12.3k| return is_leaf ------------------ | Branch (1725:16): [True: 2.60k, False: 9.76k] ------------------ 1726| 12.3k| ? make_leaf_sub_pos(child, next_size) 1727| 2.60k| .visit(v, next_idx, args...) 1728| 12.3k| : visit_maybe_relaxed_sub( 1729| 9.76k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 12.3k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 2.60k| { 145| 2.60k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.60k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 9.76k|{ 1839| 9.76k| assert(node); ------------------ | Branch (1839:5): [True: 9.76k, False: 0] ------------------ 1840| 9.76k| auto relaxed = node->relaxed(); 1841| 9.76k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.29k, False: 5.47k] ------------------ 1842| 4.29k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.29k, False: 0] ------------------ 1843| 4.29k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.29k| .visit(v, std::forward(args)...); 1845| 5.47k| } else { 1846| 5.47k| return make_regular_sub_pos(node, shift, size) 1847| 5.47k| .visit(v, std::forward(args)...); 1848| 5.47k| } 1849| 9.76k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 4.29k| { 1814| 4.29k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.29k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 5.47k| { 1037| 5.47k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.47k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1036| 9.85k| { 1037| 9.85k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 9.85k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 12.7k| { 1687| 12.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 12.7k, False: 0] ------------------ 1688| 12.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 10.0k, False: 2.72k] ------------------ 1689| 12.7k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 12.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 12.7k| { 1699| 12.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 12.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 12.7k| { 1718| 12.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 12.7k, False: 0] ------------------ 1719| 12.7k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 10.0k, False: 2.72k] | Branch (1719:9): [True: 12.7k, False: 0] ------------------ 1720| 12.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 12.7k| auto child = node_->inner()[offset_hint]; 1722| 12.7k| auto is_leaf = shift_ == BL; 1723| 12.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 12.7k| auto next_idx = idx - left_size_hint; 1725| 12.7k| return is_leaf ------------------ | Branch (1725:16): [True: 5.40k, False: 7.32k] ------------------ 1726| 12.7k| ? make_leaf_sub_pos(child, next_size) 1727| 5.40k| .visit(v, next_idx, args...) 1728| 12.7k| : visit_maybe_relaxed_sub( 1729| 7.32k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 12.7k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 5.40k| { 145| 5.40k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.40k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 7.32k|{ 1839| 7.32k| assert(node); ------------------ | Branch (1839:5): [True: 7.32k, False: 0] ------------------ 1840| 7.32k| auto relaxed = node->relaxed(); 1841| 7.32k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.34k, False: 2.98k] ------------------ 1842| 4.34k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.34k, False: 0] ------------------ 1843| 4.34k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.34k| .visit(v, std::forward(args)...); 1845| 4.34k| } else { 1846| 2.98k| return make_regular_sub_pos(node, shift, size) 1847| 2.98k| .visit(v, std::forward(args)...); 1848| 2.98k| } 1849| 7.32k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 4.34k| { 1814| 4.34k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.34k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 2.98k| { 1037| 2.98k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.98k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 22.4k| { 1654| 22.4k| assert(start > 0); ------------------ | Branch (1654:9): [True: 22.4k, False: 0] ------------------ 1655| 22.4k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 22.4k, False: 0] ------------------ 1656| 22.4k| auto s = relaxed_->d.sizes[start - 1]; 1657| 22.4k| auto p = node_->inner(); 1658| 22.4k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 3.58k, False: 18.8k] ------------------ 1659| 16.2k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 12.6k, False: 3.58k] ------------------ 1660| 12.6k| IMMER_PREFETCH(p + i + 1); 1661| 12.6k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 12.6k| .visit(v, args...); 1663| 12.6k| s = relaxed_->d.sizes[i]; 1664| 12.6k| assert(s); ------------------ | Branch (1664:17): [True: 12.6k, False: 0] ------------------ 1665| 12.6k| } 1666| 18.8k| } else { 1667| 18.8k| auto ss = shift_ - B; 1668| 79.0k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 60.2k, False: 18.8k] ------------------ 1669| 60.2k| visit_maybe_relaxed_sub( 1670| 60.2k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 60.2k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 60.2k, False: 0] ------------------ 1673| 60.2k| } 1674| 18.8k| } 1675| 22.4k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 11.8k| { 1037| 11.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 11.8k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 4.63k| { 928| 4.63k| return towards_oh_ch_regular( 929| 4.63k| *this, v, idx, offset_hint, count(), args...); 930| 4.63k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 4.63k|{ 633| 4.63k| constexpr auto B = bits; 634| 4.63k| constexpr auto BL = bits_leaf; 635| 4.63k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.63k, False: 0] ------------------ 636| 4.63k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.63k, False: 0] ------------------ 637| 4.63k| auto is_leaf = p.shift() == BL; 638| 4.63k| auto child = p.node()->inner()[offset_hint]; 639| 4.63k| auto is_full = offset_hint + 1 != count_hint; 640| 4.63k| return is_full ------------------ | Branch (640:12): [True: 3.93k, False: 705] ------------------ 641| 4.63k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.06k, False: 2.86k] ------------------ 642| 3.93k| : make_full_pos(child, p.shift() - B) 643| 2.86k| .visit(v, idx, args...)) 644| 4.63k| : (is_leaf ------------------ | Branch (644:19): [True: 705, False: 0] ------------------ 645| 705| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 705| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 4.63k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 1.61k| { 208| 1.61k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.61k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.27k| { 1406| 3.27k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.27k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 956| { 1337| 956| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 956, False: 0] ------------------ 1338| 956| auto is_leaf = shift_ == BL; 1339| 956| auto child = node_->inner()[offset_hint]; 1340| 956| return is_leaf ------------------ | Branch (1340:16): [True: 549, False: 407] ------------------ 1341| 956| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 956| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 956| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 705| { 113| 705| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 705| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 998| { 145| 998| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 998| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 71.2k|{ 1839| 71.2k| assert(node); ------------------ | Branch (1839:5): [True: 71.2k, False: 0] ------------------ 1840| 71.2k| auto relaxed = node->relaxed(); 1841| 71.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 65.4k, False: 5.72k] ------------------ 1842| 65.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 65.4k, False: 0] ------------------ 1843| 65.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 65.4k| .visit(v, std::forward(args)...); 1845| 65.4k| } else { 1846| 5.72k| return make_regular_sub_pos(node, shift, size) 1847| 5.72k| .visit(v, std::forward(args)...); 1848| 5.72k| } 1849| 71.2k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 65.4k| { 1814| 65.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 65.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 1.87k| { 1706| 1.87k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 1.87k, False: 0] ------------------ 1707| 1.87k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 1.49k, False: 380] ------------------ 1708| 1.87k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 1.87k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 1.87k| { 1718| 1.87k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 1.87k, False: 0] ------------------ 1719| 1.87k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 1.49k, False: 380] | Branch (1719:9): [True: 1.87k, False: 0] ------------------ 1720| 1.87k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 1.87k| auto child = node_->inner()[offset_hint]; 1722| 1.87k| auto is_leaf = shift_ == BL; 1723| 1.87k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 1.87k| auto next_idx = idx - left_size_hint; 1725| 1.87k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 1.87k] ------------------ 1726| 1.87k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 1.87k| : visit_maybe_relaxed_sub( 1729| 1.87k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 1.87k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 3.50k| { 1706| 3.50k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.50k, False: 0] ------------------ 1707| 3.50k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 2.99k, False: 507] ------------------ 1708| 3.50k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.50k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 3.50k| { 1718| 3.50k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.50k, False: 0] ------------------ 1719| 3.50k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 2.99k, False: 507] | Branch (1719:9): [True: 3.50k, False: 0] ------------------ 1720| 3.50k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.50k| auto child = node_->inner()[offset_hint]; 1722| 3.50k| auto is_leaf = shift_ == BL; 1723| 3.50k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.50k| auto next_idx = idx - left_size_hint; 1725| 3.50k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.50k] ------------------ 1726| 3.50k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.50k| : visit_maybe_relaxed_sub( 1729| 3.50k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.50k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 3.50k|{ 1839| 3.50k| assert(node); ------------------ | Branch (1839:5): [True: 3.50k, False: 0] ------------------ 1840| 3.50k| auto relaxed = node->relaxed(); 1841| 3.50k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.29k, False: 1.20k] ------------------ 1842| 2.29k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.29k, False: 0] ------------------ 1843| 2.29k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.29k| .visit(v, std::forward(args)...); 1845| 2.29k| } else { 1846| 1.20k| return make_regular_sub_pos(node, shift, size) 1847| 1.20k| .visit(v, std::forward(args)...); 1848| 1.20k| } 1849| 3.50k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 2.29k| { 1814| 2.29k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.29k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.20k| { 1037| 1.20k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.20k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 1.45k| { 947| 1.45k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 1.45k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_22slice_left_mut_visitorISD_Lb1ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 1.45k|{ 654| 1.45k| constexpr auto B = bits; 655| 1.45k| constexpr auto BL = bits_leaf; 656| 1.45k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 1.45k, False: 0] ------------------ 657| 1.45k| auto is_leaf = p.shift() == BL; 658| 1.45k| auto child = p.node()->inner()[offset_hint]; 659| 1.45k| auto lsize = offset_hint << p.shift(); 660| 1.45k| auto size = p.this_size(); 661| 1.45k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 1.45k| return is_full ------------------ | Branch (662:12): [True: 621, False: 837] ------------------ 663| 1.45k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 621] ------------------ 664| 621| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 621| : make_full_pos(child, p.shift() - B) 666| 621| .visit(v, idx - lsize, args...)) 667| 1.45k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 837] ------------------ 668| 837| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 837| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 837| .visit(v, idx - lsize, args...)); 672| 1.45k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 621| { 1406| 621| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 621| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 1.51k| { 1349| 1.51k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 1.51k, False: 0] ------------------ 1350| 1.51k| auto is_leaf = shift_ == BL; 1351| 1.51k| auto child = node_->inner()[offset_hint]; 1352| 1.51k| auto lsize = size_t{offset_hint} << shift_; 1353| 1.51k| return is_leaf ------------------ | Branch (1353:16): [True: 940, False: 576] ------------------ 1354| 1.51k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 1.51k| : make_full_pos(child, shift_ - B) 1356| 576| .visit(v, idx - lsize, args...); 1357| 1.51k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 2.88k| { 208| 2.88k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.88k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 1.68k| { 1406| 1.68k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.68k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 4.00k| { 1349| 4.00k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 4.00k, False: 0] ------------------ 1350| 4.00k| auto is_leaf = shift_ == BL; 1351| 4.00k| auto child = node_->inner()[offset_hint]; 1352| 4.00k| auto lsize = size_t{offset_hint} << shift_; 1353| 4.00k| return is_leaf ------------------ | Branch (1353:16): [True: 3.27k, False: 724] ------------------ 1354| 4.00k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 4.00k| : make_full_pos(child, shift_ - B) 1356| 724| .visit(v, idx - lsize, args...); 1357| 4.00k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 6.98k| { 208| 6.98k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.98k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 2.13k| { 1406| 2.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.13k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1316| 1.51k| { 1317| 1.51k| each_i(v, 0, last, args...); 1318| 1.51k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 837| { 1037| 837| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 837| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1036| 2.00k| { 1037| 2.00k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.00k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 3.04k| { 947| 3.04k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.04k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_22slice_left_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 3.04k|{ 654| 3.04k| constexpr auto B = bits; 655| 3.04k| constexpr auto BL = bits_leaf; 656| 3.04k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.04k, False: 0] ------------------ 657| 3.04k| auto is_leaf = p.shift() == BL; 658| 3.04k| auto child = p.node()->inner()[offset_hint]; 659| 3.04k| auto lsize = offset_hint << p.shift(); 660| 3.04k| auto size = p.this_size(); 661| 3.04k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.04k| return is_full ------------------ | Branch (662:12): [True: 3.04k, False: 0] ------------------ 663| 3.04k| ? (is_leaf ------------------ | Branch (663:19): [True: 1.94k, False: 1.10k] ------------------ 664| 3.04k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.04k| : make_full_pos(child, p.shift() - B) 666| 1.10k| .visit(v, idx - lsize, args...)) 667| 3.04k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 3.04k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 5.11k| { 947| 5.11k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 5.11k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_22slice_left_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 5.11k|{ 654| 5.11k| constexpr auto B = bits; 655| 5.11k| constexpr auto BL = bits_leaf; 656| 5.11k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 5.11k, False: 0] ------------------ 657| 5.11k| auto is_leaf = p.shift() == BL; 658| 5.11k| auto child = p.node()->inner()[offset_hint]; 659| 5.11k| auto lsize = offset_hint << p.shift(); 660| 5.11k| auto size = p.this_size(); 661| 5.11k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 5.11k| return is_full ------------------ | Branch (662:12): [True: 5.11k, False: 0] ------------------ 663| 5.11k| ? (is_leaf ------------------ | Branch (663:19): [True: 3.70k, False: 1.40k] ------------------ 664| 5.11k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 5.11k| : make_full_pos(child, p.shift() - B) 666| 1.40k| .visit(v, idx - lsize, args...)) 667| 5.11k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 5.11k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 873| 5.05k| { 874| 5.05k| return each_left_regular(*this, v, last, args...); 875| 5.05k| } _ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 575| 5.05k|{ 576| 5.05k| constexpr auto B = bits; 577| 5.05k| constexpr auto BL = bits_leaf; 578| 5.05k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 5.05k, False: 0] ------------------ 579| 5.05k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 1.94k, False: 3.11k] ------------------ 580| 1.94k| auto n = p.node()->inner(); 581| 1.94k| auto e = n + last; 582| 5.51k| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.57k, False: 1.94k] ------------------ 583| 3.57k| IMMER_PREFETCH(n + 1); 584| 3.57k| make_full_leaf_pos(*n).visit(v, args...); 585| 3.57k| } 586| 3.11k| } else { 587| 3.11k| auto n = p.node()->inner(); 588| 3.11k| auto e = n + last; 589| 3.11k| auto ss = p.shift() - B; 590| 5.37k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 2.26k, False: 3.11k] ------------------ 591| 2.26k| make_full_pos(*n, ss).visit(v, args...); 592| 3.11k| } 593| 5.05k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 1.87k| { 1814| 1.87k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.87k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 232k| { 1706| 232k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 232k, False: 0] ------------------ 1707| 232k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 47.0k, False: 185k] ------------------ 1708| 232k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 232k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 232k| { 1718| 232k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 232k, False: 0] ------------------ 1719| 232k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 47.0k, False: 185k] | Branch (1719:9): [True: 232k, False: 0] ------------------ 1720| 232k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 232k| auto child = node_->inner()[offset_hint]; 1722| 232k| auto is_leaf = shift_ == BL; 1723| 232k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 232k| auto next_idx = idx - left_size_hint; 1725| 232k| return is_leaf ------------------ | Branch (1725:16): [True: 4.01k, False: 228k] ------------------ 1726| 232k| ? make_leaf_sub_pos(child, next_size) 1727| 4.01k| .visit(v, next_idx, args...) 1728| 232k| : visit_maybe_relaxed_sub( 1729| 228k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 232k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 4.01k| { 145| 4.01k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.01k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 228k|{ 1839| 228k| assert(node); ------------------ | Branch (1839:5): [True: 228k, False: 0] ------------------ 1840| 228k| auto relaxed = node->relaxed(); 1841| 228k| if (relaxed) { ------------------ | Branch (1841:9): [True: 226k, False: 1.69k] ------------------ 1842| 226k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 226k, False: 0] ------------------ 1843| 226k| return make_relaxed_pos(node, shift, relaxed) 1844| 226k| .visit(v, std::forward(args)...); 1845| 226k| } else { 1846| 1.69k| return make_regular_sub_pos(node, shift, size) 1847| 1.69k| .visit(v, std::forward(args)...); 1848| 1.69k| } 1849| 228k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 226k| { 1814| 226k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 226k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.69k| { 1037| 1.69k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.69k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 135k| { 1706| 135k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 135k, False: 0] ------------------ 1707| 135k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 80.0k, False: 54.9k] ------------------ 1708| 135k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 135k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 135k| { 1718| 135k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 135k, False: 0] ------------------ 1719| 135k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 80.0k, False: 54.9k] | Branch (1719:9): [True: 135k, False: 0] ------------------ 1720| 135k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 135k| auto child = node_->inner()[offset_hint]; 1722| 135k| auto is_leaf = shift_ == BL; 1723| 135k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 135k| auto next_idx = idx - left_size_hint; 1725| 135k| return is_leaf ------------------ | Branch (1725:16): [True: 55.4k, False: 79.6k] ------------------ 1726| 135k| ? make_leaf_sub_pos(child, next_size) 1727| 55.4k| .visit(v, next_idx, args...) 1728| 135k| : visit_maybe_relaxed_sub( 1729| 79.6k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 135k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 55.4k| { 145| 55.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 55.4k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 79.6k|{ 1839| 79.6k| assert(node); ------------------ | Branch (1839:5): [True: 79.6k, False: 0] ------------------ 1840| 79.6k| auto relaxed = node->relaxed(); 1841| 79.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 78.3k, False: 1.24k] ------------------ 1842| 78.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 78.3k, False: 0] ------------------ 1843| 78.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 78.3k| .visit(v, std::forward(args)...); 1845| 78.3k| } else { 1846| 1.24k| return make_regular_sub_pos(node, shift, size) 1847| 1.24k| .visit(v, std::forward(args)...); 1848| 1.24k| } 1849| 79.6k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 78.3k| { 1814| 78.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 78.3k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.24k| { 1037| 1.24k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.24k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 5.72k| { 1037| 5.72k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.72k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 2.00k| { 947| 2.00k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.00k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_22slice_left_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 2.00k|{ 654| 2.00k| constexpr auto B = bits; 655| 2.00k| constexpr auto BL = bits_leaf; 656| 2.00k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.00k, False: 0] ------------------ 657| 2.00k| auto is_leaf = p.shift() == BL; 658| 2.00k| auto child = p.node()->inner()[offset_hint]; 659| 2.00k| auto lsize = offset_hint << p.shift(); 660| 2.00k| auto size = p.this_size(); 661| 2.00k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.00k| return is_full ------------------ | Branch (662:12): [True: 1.08k, False: 924] ------------------ 663| 2.00k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.08k] ------------------ 664| 1.08k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.08k| : make_full_pos(child, p.shift() - B) 666| 1.08k| .visit(v, idx - lsize, args...)) 667| 2.00k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 924] ------------------ 668| 924| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 924| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 924| .visit(v, idx - lsize, args...)); 672| 2.00k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 1.08k| { 1406| 1.08k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.08k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 924| { 1037| 924| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 924| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcPT_jmT0_DpOT1_: 1838| 19.8k|{ 1839| 19.8k| assert(node); ------------------ | Branch (1839:5): [True: 19.8k, False: 0] ------------------ 1840| 19.8k| auto relaxed = node->relaxed(); 1841| 19.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.1k, False: 9.68k] ------------------ 1842| 10.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 10.1k, False: 0] ------------------ 1843| 10.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 10.1k| .visit(v, std::forward(args)...); 1845| 10.1k| } else { 1846| 9.68k| return make_regular_sub_pos(node, shift, size) 1847| 9.68k| .visit(v, std::forward(args)...); 1848| 9.68k| } 1849| 19.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcT_DpOT0_: 1813| 10.1k| { 1814| 10.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 10.1k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcPT_jmT0_DpOT1_: 1838| 10.1k|{ 1839| 10.1k| assert(node); ------------------ | Branch (1839:5): [True: 10.1k, False: 0] ------------------ 1840| 10.1k| auto relaxed = node->relaxed(); 1841| 10.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.77k, False: 3.37k] ------------------ 1842| 6.77k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.77k, False: 0] ------------------ 1843| 6.77k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.77k| .visit(v, std::forward(args)...); 1845| 6.77k| } else { 1846| 3.37k| return make_regular_sub_pos(node, shift, size) 1847| 3.37k| .visit(v, std::forward(args)...); 1848| 3.37k| } 1849| 10.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1813| 6.77k| { 1814| 6.77k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.77k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 34.1k| { 1794| 34.1k| auto child = node_->inner()[offset]; 1795| 34.1k| auto child_size = size(offset); 1796| 34.1k| auto is_leaf = shift_ == BL; 1797| 34.1k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 15.8k, False: 18.2k] ------------------ 1798| 34.1k| : visit_maybe_relaxed_sub( 1799| 18.2k| child, shift_ - B, child_size, v, args...); 1800| 34.1k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 16.4k| { 145| 16.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 16.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1804| 16.4k| { 1805| 16.4k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 16.4k, False: 0] ------------------ 1806| 16.4k| auto child = node_->inner()[offset]; 1807| 16.4k| auto child_size = size(offset); 1808| 16.4k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 16.4k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 17.2k| { 145| 17.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 17.2k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 18.2k|{ 1839| 18.2k| assert(node); ------------------ | Branch (1839:5): [True: 18.2k, False: 0] ------------------ 1840| 18.2k| auto relaxed = node->relaxed(); 1841| 18.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 16.0k, False: 2.18k] ------------------ 1842| 16.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 16.0k, False: 0] ------------------ 1843| 16.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 16.0k| .visit(v, std::forward(args)...); 1845| 16.0k| } else { 1846| 2.18k| return make_regular_sub_pos(node, shift, size) 1847| 2.18k| .visit(v, std::forward(args)...); 1848| 2.18k| } 1849| 18.2k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 16.0k| { 1814| 16.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 16.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 16.0k| { 1794| 16.0k| auto child = node_->inner()[offset]; 1795| 16.0k| auto child_size = size(offset); 1796| 16.0k| auto is_leaf = shift_ == BL; 1797| 16.0k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 16.0k] ------------------ 1798| 16.0k| : visit_maybe_relaxed_sub( 1799| 16.0k| child, shift_ - B, child_size, v, args...); 1800| 16.0k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 16.0k|{ 1839| 16.0k| assert(node); ------------------ | Branch (1839:5): [True: 16.0k, False: 0] ------------------ 1840| 16.0k| auto relaxed = node->relaxed(); 1841| 16.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 15.7k, False: 325] ------------------ 1842| 15.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 15.7k, False: 0] ------------------ 1843| 15.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 15.7k| .visit(v, std::forward(args)...); 1845| 15.7k| } else { 1846| 325| return make_regular_sub_pos(node, shift, size) 1847| 325| .visit(v, std::forward(args)...); 1848| 325| } 1849| 16.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 15.7k| { 1814| 15.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 15.7k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 799| { 1037| 799| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 799| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 6.55k| { 1794| 6.55k| auto child = node_->inner()[offset]; 1795| 6.55k| auto child_size = size(offset); 1796| 6.55k| auto is_leaf = shift_ == BL; 1797| 6.55k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 3.81k, False: 2.73k] ------------------ 1798| 6.55k| : visit_maybe_relaxed_sub( 1799| 2.73k| child, shift_ - B, child_size, v, args...); 1800| 6.55k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 3.81k| { 145| 3.81k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.81k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1025| 3.81k| { 1026| 3.81k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 3.81k, False: 0] ------------------ 1027| 3.81k| auto child = node_->inner()[idx]; 1028| 3.81k| auto lsize = size(idx); 1029| 3.81k| auto is_full = idx + 1 < count(); 1030| 3.81k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 3.00k, False: 809] ------------------ 1031| 3.81k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 3.81k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 207| 10.6k| { 208| 10.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.6k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.73k|{ 1839| 2.73k| assert(node); ------------------ | Branch (1839:5): [True: 2.73k, False: 0] ------------------ 1840| 2.73k| auto relaxed = node->relaxed(); 1841| 2.73k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.17k, False: 561] ------------------ 1842| 2.17k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.17k, False: 0] ------------------ 1843| 2.17k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.17k| .visit(v, std::forward(args)...); 1845| 2.17k| } else { 1846| 561| return make_regular_sub_pos(node, shift, size) 1847| 561| .visit(v, std::forward(args)...); 1848| 561| } 1849| 2.73k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 2.17k| { 1814| 2.17k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.17k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1007| 2.17k| { 1008| 2.17k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.17k, False: 0] ------------------ 1009| 2.17k| auto is_leaf = shift_ == BL; 1010| 2.17k| auto child = node_->inner()[idx]; 1011| 2.17k| auto lsize = size(idx); 1012| 2.17k| auto is_full = idx + 1 < count(); 1013| 2.17k| return is_full ------------------ | Branch (1013:16): [True: 1.70k, False: 474] ------------------ 1014| 2.17k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.70k] ------------------ 1015| 1.70k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.70k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.17k| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 474] ------------------ 1018| 474| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 474| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 474| .visit(v, args...)); 1021| 2.17k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1405| 2.17k| { 1406| 2.17k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.17k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 8.95k| { 1794| 8.95k| auto child = node_->inner()[offset]; 1795| 8.95k| auto child_size = size(offset); 1796| 8.95k| auto is_leaf = shift_ == BL; 1797| 8.95k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 7.62k, False: 1.32k] ------------------ 1798| 8.95k| : visit_maybe_relaxed_sub( 1799| 1.32k| child, shift_ - B, child_size, v, args...); 1800| 8.95k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 7.62k| { 145| 7.62k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.62k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1396| 7.62k| { 1397| 7.62k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 7.62k, False: 0] ------------------ 1398| 7.62k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 7.62k, False: 0] ------------------ 1399| 7.62k| auto child = node_->inner()[idx]; 1400| 7.62k| return make_full_leaf_pos(child).visit(v, args...); 1401| 7.62k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 1.32k|{ 1839| 1.32k| assert(node); ------------------ | Branch (1839:5): [True: 1.32k, False: 0] ------------------ 1840| 1.32k| auto relaxed = node->relaxed(); 1841| 1.32k| if (relaxed) { ------------------ | Branch (1841:9): [True: 476, False: 851] ------------------ 1842| 476| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 476, False: 0] ------------------ 1843| 476| return make_relaxed_pos(node, shift, relaxed) 1844| 476| .visit(v, std::forward(args)...); 1845| 851| } else { 1846| 851| return make_regular_sub_pos(node, shift, size) 1847| 851| .visit(v, std::forward(args)...); 1848| 851| } 1849| 1.32k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 476| { 1814| 476| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 476| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1386| 476| { 1387| 476| assert(idx < count()); ------------------ | Branch (1387:9): [True: 476, False: 0] ------------------ 1388| 476| auto is_leaf = shift_ == BL; 1389| 476| auto child = node_->inner()[idx]; 1390| 476| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 476] ------------------ 1391| 476| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 476| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 851| { 1037| 851| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 851| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1386| 851| { 1387| 851| assert(idx < count()); ------------------ | Branch (1387:9): [True: 851, False: 0] ------------------ 1388| 851| auto is_leaf = shift_ == BL; 1389| 851| auto child = node_->inner()[idx]; 1390| 851| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 851] ------------------ 1391| 851| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 851| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1405| 1.41k| { 1406| 1.41k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.41k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 1222| 7.50k| { 1223| 7.50k| auto p = node_->inner(); 1224| 7.50k| auto p2 = other->inner(); 1225| 7.50k| auto e = p + branches; 1226| 7.50k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 5.18k, False: 2.32k] ------------------ 1227| 25.5k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 23.3k, False: 2.14k] ------------------ 1228| 23.3k| IMMER_PREFETCH(p + 1); 1229| 23.3k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 3.03k, False: 20.3k] ------------------ 1230| 3.03k| return false; 1231| 23.3k| } 1232| 5.18k| } else { 1233| 2.32k| auto ss = shift_ - B; 1234| 9.57k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 8.73k, False: 839] ------------------ 1235| 8.73k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 1.48k, False: 7.24k] ------------------ 1236| 1.48k| return false; 1237| 2.32k| } 1238| 2.98k| return true; 1239| 7.50k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 29.6k| { 208| 29.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 29.6k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 19.0k| { 1406| 19.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 19.0k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 837| 7.01k| { 838| 7.01k| return each_pred_zip_regular(*this, v, other, args...); 839| 7.01k| } _ZN5immer6detail4rbts21each_pred_zip_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_14equals_visitorEJEEEbOT_T0_PNSt3__15decayISH_E4type6node_tEDpOT1_: 392| 7.01k|{ 393| 7.01k| constexpr auto B = bits; 394| 7.01k| constexpr auto BL = bits_leaf; 395| | 396| 7.01k| auto n = p.node()->inner(); 397| 7.01k| auto n2 = other->inner(); 398| 7.01k| auto last = p.count() - 1; 399| 7.01k| auto e = n + last; 400| 7.01k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.41k, False: 5.59k] ------------------ 401| 3.39k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 2.57k, False: 817] ------------------ 402| 2.57k| IMMER_PREFETCH(n + 1); 403| 2.57k| IMMER_PREFETCH(n2 + 1); 404| 2.57k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 601, False: 1.97k] ------------------ 405| 601| return false; 406| 2.57k| } 407| 817| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 5.59k| } else { 409| 5.59k| auto ss = p.shift() - B; 410| 10.6k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 7.47k, False: 3.15k] ------------------ 411| 7.47k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 2.43k, False: 5.03k] ------------------ 412| 2.43k| return false; 413| 3.15k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 5.59k| } 415| 7.01k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 2.86k| { 113| 2.86k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.86k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 4.17k| { 337| 4.17k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.17k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 255| 3.50k| { 256| 3.50k| return each_pred_zip_regular(*this, v, other, args...); 257| 3.50k| } _ZN5immer6detail4rbts21each_pred_zip_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_14equals_visitorEJEEEbOT_T0_PNSt3__15decayISH_E4type6node_tEDpOT1_: 392| 3.50k|{ 393| 3.50k| constexpr auto B = bits; 394| 3.50k| constexpr auto BL = bits_leaf; 395| | 396| 3.50k| auto n = p.node()->inner(); 397| 3.50k| auto n2 = other->inner(); 398| 3.50k| auto last = p.count() - 1; 399| 3.50k| auto e = n + last; 400| 3.50k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.27k, False: 1.22k] ------------------ 401| 5.70k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 3.66k, False: 2.04k] ------------------ 402| 3.66k| IMMER_PREFETCH(n + 1); 403| 3.66k| IMMER_PREFETCH(n2 + 1); 404| 3.66k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 231, False: 3.42k] ------------------ 405| 231| return false; 406| 3.66k| } 407| 2.04k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 2.27k| } else { 409| 1.22k| auto ss = p.shift() - B; 410| 3.88k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 2.86k, False: 1.02k] ------------------ 411| 2.86k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 205, False: 2.65k] ------------------ 412| 205| return false; 413| 1.02k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 1.22k| } 415| 3.50k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1386| 5.61k| { 1387| 5.61k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 5.61k, False: 0] ------------------ 1388| 5.61k| auto is_leaf = shift_ == BL; 1389| 5.61k| auto child = node_->inner()[idx]; 1390| 5.61k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 4.46k, False: 1.14k] ------------------ 1391| 5.61k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 5.61k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 207| 195k| { 208| 195k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 195k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_18region_for_visitorIiEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 4.00M|{ 1839| 4.00M| assert(node); ------------------ | Branch (1839:5): [True: 4.00M, False: 0] ------------------ 1840| 4.00M| auto relaxed = node->relaxed(); 1841| 4.00M| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.78M, False: 216k] ------------------ 1842| 3.78M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.78M, False: 0] ------------------ 1843| 3.78M| return make_relaxed_pos(node, shift, relaxed) 1844| 3.78M| .visit(v, std::forward(args)...); 1845| 3.78M| } else { 1846| 216k| return make_regular_sub_pos(node, shift, size) 1847| 216k| .visit(v, std::forward(args)...); 1848| 216k| } 1849| 4.00M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 3.78M| { 1814| 3.78M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.78M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 3.78M| { 1680| 3.78M| return towards_oh(v, idx, subindex(idx), args...); 1681| 3.78M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1686| 3.78M| { 1687| 3.78M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 3.78M, False: 0] ------------------ 1688| 3.78M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 2.68M, False: 1.10M] ------------------ 1689| 3.78M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 3.78M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_18region_for_visitorIiEEJEEEDcT_mjmDpOT0_: 1698| 3.78M| { 1699| 3.78M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 3.78M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_18region_for_visitorIiEEJEEEDcT_mjmDpOT0_: 1717| 3.78M| { 1718| 3.78M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.78M, False: 0] ------------------ 1719| 3.78M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 2.68M, False: 1.10M] | Branch (1719:9): [True: 3.78M, False: 0] ------------------ 1720| 3.78M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.78M| auto child = node_->inner()[offset_hint]; 1722| 3.78M| auto is_leaf = shift_ == BL; 1723| 3.78M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.78M| auto next_idx = idx - left_size_hint; 1725| 3.78M| return is_leaf ------------------ | Branch (1725:16): [True: 848k, False: 2.93M] ------------------ 1726| 3.78M| ? make_leaf_sub_pos(child, next_size) 1727| 848k| .visit(v, next_idx, args...) 1728| 3.78M| : visit_maybe_relaxed_sub( 1729| 2.93M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.78M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 144| 848k| { 145| 848k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 848k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 216k| { 1037| 216k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 216k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 216k| { 920| 216k| return towards_oh_ch_regular( 921| 216k| *this, v, idx, index(idx), count(), args...); 922| 216k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_18region_for_visitorIiEEJEEEDcOT_T0_mjjDpOT1_: 632| 216k|{ 633| 216k| constexpr auto B = bits; 634| 216k| constexpr auto BL = bits_leaf; 635| 216k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 216k, False: 0] ------------------ 636| 216k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 216k, False: 0] ------------------ 637| 216k| auto is_leaf = p.shift() == BL; 638| 216k| auto child = p.node()->inner()[offset_hint]; 639| 216k| auto is_full = offset_hint + 1 != count_hint; 640| 216k| return is_full ------------------ | Branch (640:12): [True: 175k, False: 41.1k] ------------------ 641| 216k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 43.0k, False: 132k] ------------------ 642| 175k| : make_full_pos(child, p.shift() - B) 643| 132k| .visit(v, idx, args...)) 644| 216k| : (is_leaf ------------------ | Branch (644:19): [True: 10.2k, False: 30.9k] ------------------ 645| 41.1k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 41.1k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 30.9k| .visit(v, idx, args...)); 648| 216k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 202k| { 208| 202k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 202k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 296k| { 1406| 296k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 296k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 296k| { 1323| 296k| return towards_oh(v, idx, index(idx), args...); 1324| 296k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 296k| { 1337| 296k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 296k, False: 0] ------------------ 1338| 296k| auto is_leaf = shift_ == BL; 1339| 296k| auto child = node_->inner()[offset_hint]; 1340| 296k| return is_leaf ------------------ | Branch (1340:16): [True: 152k, False: 143k] ------------------ 1341| 296k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 296k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 296k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 14.2k| { 113| 14.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 14.2k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 36.1k| { 337| 36.1k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 36.1k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 36.1k| { 298| 36.1k| return towards_oh_ch_regular( 299| 36.1k| *this, v, idx, index(idx), count(), args...); 300| 36.1k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_18region_for_visitorIiEEJEEEDcOT_T0_mjjDpOT1_: 632| 36.1k|{ 633| 36.1k| constexpr auto B = bits; 634| 36.1k| constexpr auto BL = bits_leaf; 635| 36.1k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 36.1k, False: 0] ------------------ 636| 36.1k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 36.1k, False: 0] ------------------ 637| 36.1k| auto is_leaf = p.shift() == BL; 638| 36.1k| auto child = p.node()->inner()[offset_hint]; 639| 36.1k| auto is_full = offset_hint + 1 != count_hint; 640| 36.1k| return is_full ------------------ | Branch (640:12): [True: 26.8k, False: 9.24k] ------------------ 641| 36.1k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 6.95k, False: 19.9k] ------------------ 642| 26.8k| : make_full_pos(child, p.shift() - B) 643| 19.9k| .visit(v, idx, args...)) 644| 36.1k| : (is_leaf ------------------ | Branch (644:19): [True: 4.05k, False: 5.19k] ------------------ 645| 9.24k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 9.24k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 5.19k| .visit(v, idx, args...)); 648| 36.1k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1405| 21.1k| { 1406| 21.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 21.1k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1202| 21.1k| { 1203| 21.1k| auto p = node_->inner(); 1204| 21.1k| auto e = p + branches; 1205| 21.1k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 19.4k, False: 1.69k] ------------------ 1206| 172k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 153k, False: 18.8k] ------------------ 1207| 153k| IMMER_PREFETCH(p + 1); 1208| 153k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 676, False: 152k] ------------------ 1209| 676| return false; 1210| 153k| } 1211| 19.4k| } else { 1212| 1.69k| auto ss = shift_ - B; 1213| 14.2k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 12.7k, False: 1.45k] ------------------ 1214| 12.7k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 240, False: 12.5k] ------------------ 1215| 240| return false; 1216| 1.69k| } 1217| 20.2k| return true; 1218| 21.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 561| { 1037| 561| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 561| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1007| 561| { 1008| 561| assert(idx < count()); ------------------ | Branch (1008:9): [True: 561, False: 0] ------------------ 1009| 561| auto is_leaf = shift_ == BL; 1010| 561| auto child = node_->inner()[idx]; 1011| 561| auto lsize = size(idx); 1012| 561| auto is_full = idx + 1 < count(); 1013| 561| return is_full ------------------ | Branch (1013:16): [True: 561, False: 0] ------------------ 1014| 561| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 561] ------------------ 1015| 561| ? make_full_leaf_pos(child).visit(v, args...) 1016| 561| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 561| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 0] ------------------ 1018| 0| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 0| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 561| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 1.92k| { 1037| 1.92k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.92k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1007| 3.17k| { 1008| 3.17k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 3.17k, False: 0] ------------------ 1009| 3.17k| auto is_leaf = shift_ == BL; 1010| 3.17k| auto child = node_->inner()[idx]; 1011| 3.17k| auto lsize = size(idx); 1012| 3.17k| auto is_full = idx + 1 < count(); 1013| 3.17k| return is_full ------------------ | Branch (1013:16): [True: 1.38k, False: 1.79k] ------------------ 1014| 3.17k| ? (is_leaf ------------------ | Branch (1014:23): [True: 930, False: 453] ------------------ 1015| 1.38k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.38k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 3.17k| : (is_leaf ------------------ | Branch (1017:23): [True: 947, False: 845] ------------------ 1018| 1.79k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 1.79k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 845| .visit(v, args...)); 1021| 3.17k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 144| 812k| { 145| 812k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 812k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1036| 8.90k| { 1037| 8.90k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.90k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 831| 8.90k| { 832| 8.90k| return each_pred_regular(*this, v, args...); 833| 8.90k| } _ZN5immer6detail4rbts17each_pred_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSC_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEEbSM_SN_DpOT1_: 365| 8.90k|{ 366| 8.90k| constexpr auto B = bits; 367| 8.90k| constexpr auto BL = bits_leaf; 368| 8.90k| auto n = p.node()->inner(); 369| 8.90k| auto last = p.count() - 1; 370| 8.90k| auto e = n + last; 371| 8.90k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 5.64k, False: 3.25k] ------------------ 372| 36.6k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 31.2k, False: 5.43k] ------------------ 373| 31.2k| IMMER_PREFETCH(n + 1); 374| 31.2k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 216, False: 31.0k] ------------------ 375| 216| return false; 376| 31.2k| } 377| 5.43k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 5.64k| } else { 379| 3.25k| auto ss = p.shift() - B; 380| 7.92k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 5.11k, False: 2.80k] ------------------ 381| 5.11k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 448, False: 4.66k] ------------------ 382| 448| return false; 383| 2.80k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 3.25k| } 385| 8.90k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 112| 7.81k| { 113| 7.81k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 7.81k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 336| 3.92k| { 337| 3.92k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.92k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 249| 3.92k| { 250| 3.92k| return each_pred_regular(*this, v, args...); 251| 3.92k| } _ZN5immer6detail4rbts17each_pred_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSC_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEEbSM_SN_DpOT1_: 365| 3.92k|{ 366| 3.92k| constexpr auto B = bits; 367| 3.92k| constexpr auto BL = bits_leaf; 368| 3.92k| auto n = p.node()->inner(); 369| 3.92k| auto last = p.count() - 1; 370| 3.92k| auto e = n + last; 371| 3.92k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 2.59k, False: 1.33k] ------------------ 372| 8.25k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 5.88k, False: 2.37k] ------------------ 373| 5.88k| IMMER_PREFETCH(n + 1); 374| 5.88k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 214, False: 5.66k] ------------------ 375| 214| return false; 376| 5.88k| } 377| 2.37k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 2.59k| } else { 379| 1.33k| auto ss = p.shift() - B; 380| 2.81k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 1.70k, False: 1.11k] ------------------ 381| 1.70k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 215, False: 1.48k] ------------------ 382| 215| return false; 383| 1.11k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 1.33k| } 385| 3.92k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 2.18k| { 1037| 2.18k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.18k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 2.18k| { 1794| 2.18k| auto child = node_->inner()[offset]; 1795| 2.18k| auto child_size = size(offset); 1796| 2.18k| auto is_leaf = shift_ == BL; 1797| 2.18k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.18k] ------------------ 1798| 2.18k| : visit_maybe_relaxed_sub( 1799| 2.18k| child, shift_ - B, child_size, v, args...); 1800| 2.18k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.18k|{ 1839| 2.18k| assert(node); ------------------ | Branch (1839:5): [True: 2.18k, False: 0] ------------------ 1840| 2.18k| auto relaxed = node->relaxed(); 1841| 2.18k| if (relaxed) { ------------------ | Branch (1841:9): [True: 257, False: 1.92k] ------------------ 1842| 257| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 257, False: 0] ------------------ 1843| 257| return make_relaxed_pos(node, shift, relaxed) 1844| 257| .visit(v, std::forward(args)...); 1845| 1.92k| } else { 1846| 1.92k| return make_regular_sub_pos(node, shift, size) 1847| 1.92k| .visit(v, std::forward(args)...); 1848| 1.92k| } 1849| 2.18k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 257| { 1814| 257| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 257| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1007| 3.87k| { 1008| 3.87k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 3.87k, False: 0] ------------------ 1009| 3.87k| auto is_leaf = shift_ == BL; 1010| 3.87k| auto child = node_->inner()[idx]; 1011| 3.87k| auto lsize = size(idx); 1012| 3.87k| auto is_full = idx + 1 < count(); 1013| 3.87k| return is_full ------------------ | Branch (1013:16): [True: 3.31k, False: 563] ------------------ 1014| 3.87k| ? (is_leaf ------------------ | Branch (1014:23): [True: 1.67k, False: 1.64k] ------------------ 1015| 3.31k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 3.31k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 3.87k| : (is_leaf ------------------ | Branch (1017:23): [True: 563, False: 0] ------------------ 1018| 563| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 563| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 3.87k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 207| 5.07k| { 208| 5.07k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.07k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1804| 5.07k| { 1805| 5.07k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 5.07k, False: 0] ------------------ 1806| 5.07k| auto child = node_->inner()[offset]; 1807| 5.07k| auto child_size = size(offset); 1808| 5.07k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 5.07k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 5.07k| { 145| 5.07k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.07k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1405| 1.99k| { 1406| 1.99k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.99k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 1.99k| { 1794| 1.99k| auto child = node_->inner()[offset]; 1795| 1.99k| auto child_size = size(offset); 1796| 1.99k| auto is_leaf = shift_ == BL; 1797| 1.99k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 1.99k] ------------------ 1798| 1.99k| : visit_maybe_relaxed_sub( 1799| 1.99k| child, shift_ - B, child_size, v, args...); 1800| 1.99k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 1.99k|{ 1839| 1.99k| assert(node); ------------------ | Branch (1839:5): [True: 1.99k, False: 0] ------------------ 1840| 1.99k| auto relaxed = node->relaxed(); 1841| 1.99k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.12k, False: 876] ------------------ 1842| 1.12k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.12k, False: 0] ------------------ 1843| 1.12k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.12k| .visit(v, std::forward(args)...); 1845| 1.12k| } else { 1846| 876| return make_regular_sub_pos(node, shift, size) 1847| 876| .visit(v, std::forward(args)...); 1848| 876| } 1849| 1.99k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 1.12k| { 1814| 1.12k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.12k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1386| 3.75k| { 1387| 3.75k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 3.75k, False: 0] ------------------ 1388| 3.75k| auto is_leaf = shift_ == BL; 1389| 3.75k| auto child = node_->inner()[idx]; 1390| 3.75k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 3.40k, False: 357] ------------------ 1391| 3.75k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 3.75k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 876| { 1037| 876| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 876| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1793| 43.1k| { 1794| 43.1k| auto child = node_->inner()[offset]; 1795| 43.1k| auto child_size = size(offset); 1796| 43.1k| auto is_leaf = shift_ == BL; 1797| 43.1k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 19.0k, False: 24.1k] ------------------ 1798| 43.1k| : visit_maybe_relaxed_sub( 1799| 24.1k| child, shift_ - B, child_size, v, args...); 1800| 43.1k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSI_T0_E_EEEDcPSI_jmSK_DpOT1_: 1838| 128k|{ 1839| 128k| assert(node); ------------------ | Branch (1839:5): [True: 128k, False: 0] ------------------ 1840| 128k| auto relaxed = node->relaxed(); 1841| 128k| if (relaxed) { ------------------ | Branch (1841:9): [True: 120k, False: 8.05k] ------------------ 1842| 120k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 120k, False: 0] ------------------ 1843| 120k| return make_relaxed_pos(node, shift, relaxed) 1844| 120k| .visit(v, std::forward(args)...); 1845| 120k| } else { 1846| 8.05k| return make_regular_sub_pos(node, shift, size) 1847| 8.05k| .visit(v, std::forward(args)...); 1848| 8.05k| } 1849| 128k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1813| 120k| { 1814| 120k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 120k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1482| 120k| { 1483| 120k| auto p = node_->inner(); 1484| 120k| auto s = size_t{}; 1485| 120k| auto n = count(); 1486| 120k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 105k, False: 14.5k] ------------------ 1487| 898k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 792k, False: 105k] ------------------ 1488| 792k| IMMER_PREFETCH(p + i + 1); 1489| 792k| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 304, False: 792k] ------------------ 1490| 792k| .visit(v, args...)) 1491| 304| return false; 1492| 792k| s = relaxed_->d.sizes[i]; 1493| 792k| } 1494| 105k| } else { 1495| 14.5k| auto ss = shift_ - B; 1496| 118k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 104k, False: 14.2k] ------------------ 1497| 104k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 260, False: 103k] ------------------ 1498| 104k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 260| return false; 1500| 103k| s = relaxed_->d.sizes[i]; 1501| 103k| } 1502| 14.5k| } 1503| 119k| return true; 1504| 120k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1036| 3.37k| { 1037| 3.37k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.37k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE15first_sub_innerINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERPSC_RjRmEEEDcT_DpOT0_: 1783| 973| { 1784| 973| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 973, False: 0] ------------------ 1785| 973| auto child = node_->inner()[0]; 1786| 973| auto child_size = relaxed_->d.sizes[0]; 1787| 973| return visit_maybe_relaxed_sub( 1788| 973| child, shift_ - B, child_size, v, args...); 1789| 973| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERPSC_RjRmEEEDcPT_jmT0_DpOT1_: 1838| 973|{ 1839| 973| assert(node); ------------------ | Branch (1839:5): [True: 973, False: 0] ------------------ 1840| 973| auto relaxed = node->relaxed(); 1841| 973| if (relaxed) { ------------------ | Branch (1841:9): [True: 973, False: 0] ------------------ 1842| 973| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 973, False: 0] ------------------ 1843| 973| return make_relaxed_pos(node, shift, relaxed) 1844| 973| .visit(v, std::forward(args)...); 1845| 973| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 973|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERPSC_RjRmEEEDcT_DpOT0_: 1813| 973| { 1814| 973| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 973| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcPT_jmT0_DpOT1_: 1838| 9.68k|{ 1839| 9.68k| assert(node); ------------------ | Branch (1839:5): [True: 9.68k, False: 0] ------------------ 1840| 9.68k| auto relaxed = node->relaxed(); 1841| 9.68k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.09k, False: 7.59k] ------------------ 1842| 2.09k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.09k, False: 0] ------------------ 1843| 2.09k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.09k| .visit(v, std::forward(args)...); 1845| 7.59k| } else { 1846| 7.59k| return make_regular_sub_pos(node, shift, size) 1847| 7.59k| .visit(v, std::forward(args)...); 1848| 7.59k| } 1849| 9.68k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1813| 2.09k| { 1814| 2.09k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.09k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1036| 7.59k| { 1037| 7.59k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.59k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcT_DpOT0_: 1036| 9.68k| { 1037| 9.68k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 9.68k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRKPSC_EEEDcT_DpOT0_: 144| 6.51k| { 145| 6.51k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.51k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2Ev: 114| 2.81M| : size{0} 115| 2.81M| , shift{BL} 116| 2.81M| , root{empty_root()} 117| 2.81M| , tail{empty_tail()} 118| 2.81M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 2.81M, False: 0] ------------------ 120| 2.81M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10empty_rootEv: 61| 2.82M| { 62| 2.82M| static const auto empty_ = [] { 63| 2.82M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 2.82M| static std::aligned_storage_t 65| 2.82M| storage; 66| 2.82M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 2.82M| }(); 68| 2.82M| return empty_->inc(); 69| 2.82M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10empty_rootEvENKUlvE_clEv: 62| 1| static const auto empty_ = [] { 63| 1| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1| static std::aligned_storage_t 65| 1| storage; 66| 1| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1| }(); _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10empty_tailEv: 72| 2.81M| { 73| 2.81M| static const auto empty_ = [] { 74| 2.81M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 2.81M| static std::aligned_storage_t 76| 2.81M| storage; 77| 2.81M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 2.81M| }(); 79| 2.81M| return empty_->inc(); 80| 2.81M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10empty_tailEvENKUlvE_clEv: 73| 1| static const auto empty_ = [] { 74| 1| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1| static std::aligned_storage_t 76| 1| storage; 77| 1| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1| }(); _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10check_treeEv: 1372| 5.86M| { 1373| 5.86M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 5.86M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 1.56k, False: 5.86M] | | ------------------ | | 33| 5.86M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 1.56k|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 5.86M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 5.86M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 5.86M] | | ------------------ | | 33| 5.86M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 5.86M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 5.86M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 5.86M] | | ------------------ | | 33| 5.86M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 5.86M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 5.86M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 5.86M] | | ------------------ | | 33| 5.86M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1377| |#if IMMER_DEBUG_DEEP_CHECK 1378| | IMMER_INVALID_STATE_ASSERT(check_root()); 1379| | IMMER_INVALID_STATE_ASSERT(check_tail()); 1380| |#endif 1381| 5.86M| return true; 1382| 5.86M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11tail_offsetEv: 197| 28.9M| { 198| 28.9M| auto r = root->relaxed(); 199| 28.9M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 14.6M, False: 14.3M] | Branch (199:9): [True: 14.3M, False: 0] | Branch (199:9): [True: 28.9M, False: 0] ------------------ 200| 28.9M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 14.3M, False: 14.6M] ------------------ 201| 28.9M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 6.16M, False: 8.45M] ------------------ 202| | /* otherwise */ 203| 14.6M| : 0; 204| 28.9M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9tail_sizeEv: 194| 6.17M| auto tail_size() const { return size - tail_offset(); } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EED2Ev: 184| 5.86M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE3decEv: 192| 5.86M| void dec() const { traverse(dec_visitor()); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8traverseINS1_11dec_visitorEJEEEvT_DpOT0_: 208| 5.86M| { 209| 5.86M| auto tail_off = tail_offset(); 210| 5.86M| auto tail_size = size - tail_off; 211| | 212| 5.86M| if (tail_off) ------------------ | Branch (212:13): [True: 2.85M, False: 3.00M] ------------------ 213| 2.85M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 3.00M| else 215| 3.00M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 5.86M| if (tail_size) ------------------ | Branch (217:13): [True: 3.04M, False: 2.81M] ------------------ 218| 3.04M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 2.81M| else 220| 2.81M| make_empty_leaf_pos(tail).visit(v, args...); 221| 5.86M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_backEi: 500| 279k| { 501| 279k| auto ts = tail_size(); 502| 279k| if (ts < branches) { ------------------ | Branch (502:13): [True: 236k, False: 43.4k] ------------------ 503| 236k| auto new_tail = 504| 236k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 236k| return {size + 1, shift, root->inc(), new_tail}; 506| 236k| } else { 507| 43.4k| using std::get; 508| 43.4k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 43.4k| auto tail_off = tail_offset(); 510| 43.4k| IMMER_TRY { ------------------ | | 49| 43.4k|#define IMMER_TRY try ------------------ 511| 43.4k| auto new_root = 512| 43.4k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 43.4k| tail->inc(); 514| 43.4k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 43.4k| } 516| 43.4k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 43.4k| } 521| 279k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2EmjPNS1_4nodeIiSA_Lj3ELj3EEESE_: 127| 3.05M| : size{sz} 128| 3.05M| , shift{sh} 129| 3.05M| , root{r} 130| 3.05M| , tail{t} 131| 3.05M| { 132| 3.05M|#if IMMER_THROW_ON_INVALID_STATE 133| | // assert only happens in the Debug build, but when 134| | // IMMER_THROW_ON_INVALID_STATE is activated, we want to just check_tree 135| | // even in Release. 136| 3.05M| try { 137| 3.05M| check_tree(); 138| 3.05M| } catch (...) { 139| | // This not fully constructed rrbtree owns the nodes already, have 140| | // to dec them. 141| 1.56k| if (r && t) ------------------ | Branch (141:17): [True: 1.56k, False: 0] | Branch (141:22): [True: 1.56k, False: 0] ------------------ 142| 1.56k| dec(); 143| 1.56k| throw; 144| 1.56k| } 145| |#else 146| | assert(check_tree()); 147| |#endif 148| 3.05M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_tailEPNS1_4nodeIiSA_Lj3ELj3EEEjmSE_j: 369| 1.12M| { 370| 1.12M| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 336k, False: 792k] ------------------ 371| 336k| auto new_root = 372| 336k| make_relaxed_pos(root, shift, r) 373| 336k| .visit(push_tail_visitor{}, tail, tail_size); 374| 336k| if (new_root) ------------------ | Branch (374:17): [True: 334k, False: 2.36k] ------------------ 375| 334k| return std::make_tuple(shift, new_root); 376| 2.36k| else { 377| 2.36k| auto new_root = node_t::make_inner_r_n(2); 378| 2.36k| IMMER_TRY { ------------------ | | 49| 2.36k|#define IMMER_TRY try ------------------ 379| 2.36k| auto new_path = node_t::make_path(shift, tail); 380| 2.36k| new_root->inner()[0] = root->inc(); 381| 2.36k| new_root->inner()[1] = new_path; 382| 2.36k| new_root->relaxed()->d.sizes[0] = size; 383| 2.36k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 2.36k| assert(size); ------------------ | Branch (384:21): [True: 2.36k, False: 0] ------------------ 385| 2.36k| assert(tail_size); ------------------ | Branch (385:21): [True: 2.36k, False: 0] ------------------ 386| 2.36k| new_root->relaxed()->d.count = 2u; 387| 2.36k| } 388| 2.36k| IMMER_CATCH (...) { 389| 0| node_t::delete_inner_r(new_root, 2); 390| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 391| 0| } 392| 2.36k| return std::make_tuple(shift + B, new_root); 393| 2.36k| } 394| 792k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 6.68k, False: 785k] ------------------ 395| 6.68k| auto new_root = node_t::make_inner_n(2); 396| 6.68k| IMMER_TRY { ------------------ | | 49| 6.68k|#define IMMER_TRY try ------------------ 397| 6.68k| auto new_path = node_t::make_path(shift, tail); 398| 6.68k| new_root->inner()[0] = root->inc(); 399| 6.68k| new_root->inner()[1] = new_path; 400| 6.68k| } 401| 6.68k| IMMER_CATCH (...) { 402| 0| node_t::delete_inner(new_root, 2); 403| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 404| 0| } 405| 6.68k| return std::make_tuple(shift + B, new_root); 406| 785k| } else if (size) { ------------------ | Branch (406:20): [True: 763k, False: 22.0k] ------------------ 407| 763k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 763k| .visit(push_tail_visitor{}, tail); 409| 763k| return std::make_tuple(shift, new_root); 410| 763k| } else { 411| 22.0k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 22.0k| } 413| 1.12M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2EOSB_: 157| 2.72M| : rrbtree{} 158| 2.72M| { 159| 2.72M| swap(*this, other); 160| 2.72M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEESC_: 176| 5.16M| { 177| 5.16M| using std::swap; 178| 5.16M| swap(x.size, y.size); 179| 5.16M| swap(x.shift, y.shift); 180| 5.16M| swap(x.root, y.root); 181| 5.16M| swap(x.tail, y.tail); 182| 5.16M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEaSEOSB_: 170| 2.43M| { 171| 2.43M| swap(*this, other); 172| 2.43M| return *this; 173| 2.43M| } flex-vector-st.cpp:_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSG_E_EESB_mOSG_: 580| 204k| { 581| 204k| auto tail_off = tail_offset(); 582| 204k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 144k, False: 60.1k] ------------------ 583| 144k| auto tail_size = size - tail_off; 584| 144k| auto new_tail = 585| 144k| make_leaf_sub_pos(tail, tail_size) 586| 144k| .visit(update_visitor{}, idx - tail_off, fn); 587| 144k| return {size, shift, root->inc(), new_tail}; 588| 144k| } else { 589| 60.1k| auto new_root = visit_maybe_relaxed_sub( 590| 60.1k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 60.1k| return {size, shift, new_root, tail->inc()}; 592| 60.1k| } 593| 204k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4takeEm: 647| 21.9k| { 648| 21.9k| auto tail_off = tail_offset(); 649| 21.9k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 3.84k, False: 18.1k] ------------------ 650| 3.84k| return {}; 651| 18.1k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 757, False: 17.3k] ------------------ 652| 757| return *this; 653| 17.3k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 2.17k, False: 15.2k] ------------------ 654| 2.17k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 2.17k| return {new_size, shift, root->inc(), new_tail}; 656| 15.2k| } else { 657| 15.2k| using std::get; 658| 15.2k| auto l = new_size - 1; 659| 15.2k| auto v = slice_right_visitor(); 660| 15.2k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 15.2k| auto new_shift = get<0>(r); 662| 15.2k| auto new_root = get<1>(r); 663| 15.2k| auto new_tail = get<3>(r); 664| 15.2k| if (new_root) { ------------------ | Branch (664:17): [True: 11.3k, False: 3.87k] ------------------ 665| 11.3k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 11.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 11.3k, False: 0] ------------------ 666| 11.3k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 11.3k, False: 0] ------------------ 667| 11.3k| return {new_size, new_shift, new_root, new_tail}; 668| 11.3k| } else { 669| 3.87k| return {new_size, BL, empty_root(), new_tail}; 670| 3.87k| } 671| 15.2k| } 672| 21.9k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2ERKSB_: 151| 13.1k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 13.1k| { 153| 13.1k| inc(); 154| 13.1k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE3incEv: 187| 13.1k| { 188| 13.1k| root->inc(); 189| 13.1k| tail->inc(); 190| 13.1k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4dropEm: 711| 29.2k| { 712| 29.2k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.09k, False: 27.1k] ------------------ 713| 2.09k| return *this; 714| 27.1k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 1.24k, False: 25.9k] ------------------ 715| 1.24k| return {}; 716| 25.9k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 2.12k, False: 23.8k] ------------------ 717| 2.12k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 23.8k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 2.26k, False: 21.5k] ------------------ 719| 2.26k| auto tail_off = tail_offset(); 720| 2.26k| auto new_tail = 721| 2.26k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 2.26k| return {size - elems, BL, empty_root(), new_tail}; 723| 21.5k| } else { 724| 21.5k| using std::get; 725| 21.5k| auto v = slice_left_visitor(); 726| 21.5k| auto r = 727| 21.5k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 21.5k| auto new_root = get<1>(r); 729| 21.5k| auto new_shift = get<0>(r); 730| 21.5k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 21.5k| } 732| 29.2k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8max_sizeEv: 54| 3.63M| { 55| 3.63M| auto S = sizeof(size_t) * 8; 56| 3.63M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 3.63M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 3.63M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6concatERKSB_: 735| 2.16M| { 736| 2.16M| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 2.16M, False: 0] ------------------ 737| 2.16M| using std::get; 738| 2.16M| if (size == 0) ------------------ | Branch (738:13): [True: 4.23k, False: 2.15M] ------------------ 739| 4.23k| return r; 740| 2.15M| else if (r.size == 0) ------------------ | Branch (740:18): [True: 3.65k, False: 2.15M] ------------------ 741| 3.65k| return *this; 742| 2.15M| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 1.12M, False: 1.03M] ------------------ 743| | // just concat the tail, similar to push_back 744| 1.12M| auto tail_offst = tail_offset(); 745| 1.12M| auto tail_size = size - tail_offst; 746| 1.12M| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 165k, False: 957k] ------------------ 747| 165k| auto new_root = 748| 165k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 165k| tail->inc(); 750| 165k| return {size + r.size, 751| 165k| get<0>(new_root), 752| 165k| get<1>(new_root), 753| 165k| r.tail->inc()}; 754| 957k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 38.3k, False: 918k] ------------------ 755| 38.3k| auto new_tail = 756| 38.3k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 38.3k| return {size + r.size, shift, root->inc(), new_tail}; 758| 918k| } else { 759| 918k| auto remaining = branches - tail_size; 760| 918k| auto add_tail = 761| 918k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 918k| IMMER_TRY { ------------------ | | 49| 918k|#define IMMER_TRY try ------------------ 763| 918k| auto new_tail = 764| 918k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 918k| IMMER_TRY { ------------------ | | 49| 918k|#define IMMER_TRY try ------------------ 766| 918k| auto new_root = push_tail( 767| 918k| root, shift, tail_offst, add_tail, branches); 768| 918k| return {size + r.size, 769| 918k| get<0>(new_root), 770| 918k| get<1>(new_root), 771| 918k| new_tail}; 772| 918k| } 773| 918k| IMMER_CATCH (...) { 774| 0| node_t::delete_leaf(new_tail, r.size - remaining); 775| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 776| 0| } 777| 918k| } 778| 918k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 918k| } 783| 1.12M| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 5.73k, False: 1.02M] ------------------ 784| 5.73k| auto tail_offst = tail_offset(); 785| 5.73k| auto tail_size = size - tail_offst; 786| 5.73k| auto concated = 787| 5.73k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 5.73k| auto new_shift = concated.shift(); 789| 5.73k| auto new_root = concated.node(); 790| 5.73k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 5.73k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 5.73k, False: 0] ------------------ 791| 5.73k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 5.73k, False: 0] ------------------ 792| 5.73k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 1.02M| } else { 794| 1.02M| auto tail_offst = tail_offset(); 795| 1.02M| auto tail_size = size - tail_offst; 796| 1.02M| auto concated = concat_trees(root, 797| 1.02M| shift, 798| 1.02M| tail_offst, 799| 1.02M| tail, 800| 1.02M| tail_size, 801| 1.02M| r.root, 802| 1.02M| r.shift, 803| 1.02M| r.tail_offset()); 804| 1.02M| auto new_shift = concated.shift(); 805| 1.02M| auto new_root = concated.node(); 806| 1.02M| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 1.02M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 1.02M, False: 0] ------------------ 807| 1.02M| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 1.02M, False: 0] ------------------ 808| 1.02M| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 1.02M| } 810| 2.16M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 27.0k| { 479| 27.0k| auto ts = tail_size(); 480| 27.0k| if (ts < branches) { ------------------ | Branch (480:13): [True: 20.1k, False: 6.82k] ------------------ 481| 20.1k| ensure_mutable_tail(e, ts); 482| 20.1k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 20.1k| } else { 484| 6.82k| using std::get; 485| 6.82k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 6.82k| auto tail_off = tail_offset(); 487| 6.82k| IMMER_TRY { ------------------ | | 49| 6.82k|#define IMMER_TRY try ------------------ 488| 6.82k| push_tail_mut(e, tail_off, tail, ts); 489| 6.82k| tail = new_tail; 490| 6.82k| } 491| 6.82k| IMMER_CATCH (...) { 492| 0| node_t::delete_leaf(new_tail, 1u); 493| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 494| 0| } 495| 6.82k| } 496| 27.0k| ++size; 497| 27.0k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 309k| { 470| 309k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 6.89k, False: 302k] ------------------ 471| 6.89k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 6.89k| dec_leaf(tail, n); 473| 6.89k| tail = new_tail; 474| 6.89k| } 475| 309k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj3ELj3EEEj: 417| 338k| { 418| 338k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 172k, False: 165k] ------------------ 419| 172k| auto new_root = 420| 172k| make_relaxed_pos(root, shift, r) 421| 172k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 172k| if (new_root) { ------------------ | Branch (422:17): [True: 171k, False: 1.41k] ------------------ 423| 171k| root = new_root; 424| 171k| } else { 425| 1.41k| auto new_root = node_t::make_inner_r_e(e); 426| 1.41k| IMMER_TRY { ------------------ | | 49| 1.41k|#define IMMER_TRY try ------------------ 427| 1.41k| auto new_path = node_t::make_path_e(e, shift, tail); 428| 1.41k| new_root->inner()[0] = root; 429| 1.41k| new_root->inner()[1] = new_path; 430| 1.41k| new_root->relaxed()->d.sizes[0] = tail_off; 431| 1.41k| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 1.41k| assert(tail_off); ------------------ | Branch (432:21): [True: 1.41k, False: 0] ------------------ 433| 1.41k| assert(tail_size); ------------------ | Branch (433:21): [True: 1.41k, False: 0] ------------------ 434| 1.41k| new_root->relaxed()->d.count = 2u; 435| 1.41k| root = new_root; 436| 1.41k| shift += B; 437| 1.41k| } 438| 1.41k| IMMER_CATCH (...) { 439| 0| node_t::delete_inner_r_e(new_root); 440| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 441| 0| } 442| 1.41k| } 443| 172k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 1.74k, False: 163k] ------------------ 444| 1.74k| auto new_root = node_t::make_inner_e(e); 445| 1.74k| IMMER_TRY { ------------------ | | 49| 1.74k|#define IMMER_TRY try ------------------ 446| 1.74k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 1.74k| new_root->inner()[0] = root; 448| 1.74k| new_root->inner()[1] = new_path; 449| 1.74k| root = new_root; 450| 1.74k| shift += B; 451| 1.74k| } 452| 1.74k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 163k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 162k, False: 1.80k] ------------------ 457| 162k| auto new_root = 458| 162k| make_regular_sub_pos(root, shift, tail_off) 459| 162k| .visit(push_tail_mut_visitor{}, e, tail); 460| 162k| root = new_root; 461| 162k| } else { 462| 1.80k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 1.80k| dec_empty_regular(root); 464| 1.80k| root = new_root; 465| 1.80k| } 466| 338k| } flex-vector-st.cpp:_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10update_mutIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSG_E0_EEvNS9_5applyIS6_E4type4editEmOSG_: 573| 16.4k| { 574| 16.4k| auto& elem = get_mut(e, idx); 575| 16.4k| elem = std::forward(fn)(std::move(elem)); 576| 16.4k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 16.4k| { 540| 16.4k| auto tail_off = tail_offset(); 541| 16.4k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 751, False: 15.6k] ------------------ 542| 751| ensure_mutable_tail(e, size - tail_off); 543| 751| return tail->leaf()[(idx - tail_off) & mask]; 544| 15.6k| } else { 545| 15.6k| return visit_maybe_relaxed_sub(root, 546| 15.6k| shift, 547| 15.6k| tail_off, 548| 15.6k| get_mut_visitor{}, 549| 15.6k| idx, 550| 15.6k| e, 551| 15.6k| &root); 552| 15.6k| } 553| 16.4k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 33.8k| { 607| 33.8k| auto tail_off = tail_offset(); 608| 33.8k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 933, False: 32.9k] ------------------ 609| 933| *this = {}; 610| 32.9k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 753, False: 32.1k] ------------------ 611| 753| return; 612| 32.1k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 664, False: 31.5k] ------------------ 613| 664| auto ts = size - tail_off; 614| 664| auto newts = new_size - tail_off; 615| 664| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 349, False: 315] ------------------ 616| 349| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 349| } else { 618| 315| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 315| dec_leaf(tail, ts); 620| 315| tail = new_tail; 621| 315| } 622| 664| size = new_size; 623| 664| return; 624| 31.5k| } else { 625| 31.5k| using std::get; 626| 31.5k| auto l = new_size - 1; 627| 31.5k| auto v = slice_right_mut_visitor(); 628| 31.5k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 31.5k| auto new_shift = get<0>(r); 630| 31.5k| auto new_root = get<1>(r); 631| 31.5k| auto new_tail = get<3>(r); 632| 31.5k| if (new_root) { ------------------ | Branch (632:17): [True: 25.4k, False: 6.09k] ------------------ 633| 25.4k| root = new_root; 634| 25.4k| shift = new_shift; 635| 25.4k| } else { 636| 6.09k| root = empty_root(); 637| 6.09k| shift = BL; 638| 6.09k| } 639| 31.5k| dec_leaf(tail, size - tail_off); 640| 31.5k| size = new_size; 641| 31.5k| tail = new_tail; 642| 31.5k| return; 643| 31.5k| } 644| 33.8k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 75.4k| { 676| 75.4k| using std::get; 677| 75.4k| auto tail_off = tail_offset(); 678| 75.4k| if (elems == 0) { ------------------ | Branch (678:13): [True: 4.63k, False: 70.7k] ------------------ 679| 4.63k| return; 680| 70.7k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 227, False: 70.5k] ------------------ 681| 227| *this = {}; 682| 70.5k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 210, False: 70.3k] ------------------ 683| 210| dec_inner(root, shift, tail_off); 684| 210| shift = BL; 685| 210| root = empty_root(); 686| 210| size -= elems; 687| 210| return; 688| 70.3k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 998, False: 69.3k] ------------------ 689| 998| auto v = slice_left_mut_visitor(); 690| 998| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 998| .visit(v, elems - tail_off, e)); 692| 998| if (tail_off) { ------------------ | Branch (692:17): [True: 349, False: 649] ------------------ 693| 349| dec_inner(root, shift, tail_off); 694| 349| shift = BL; 695| 349| root = empty_root(); 696| 349| } 697| 998| size -= elems; 698| 998| return; 699| 69.3k| } else { 700| 69.3k| auto v = slice_left_mut_visitor(); 701| 69.3k| auto r = 702| 69.3k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 69.3k| shift = get<0>(r); 704| 69.3k| root = get<1>(r); 705| 69.3k| size -= elems; 706| 69.3k| return; 707| 69.3k| } 708| 75.4k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editERKSB_: 816| 327k| { 817| 327k| assert(&l != &r); ------------------ | Branch (817:9): [True: 327k, False: 0] ------------------ 818| 327k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 327k, False: 0] ------------------ 819| 327k| using std::get; 820| 327k| if (l.size == 0) ------------------ | Branch (820:13): [True: 487, False: 327k] ------------------ 821| 487| l = r; 822| 327k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 846, False: 326k] ------------------ 823| 846| return; 824| 326k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 272k, False: 54.2k] ------------------ 825| | // just concat the tail, similar to push_back 826| 272k| auto tail_offst = l.tail_offset(); 827| 272k| auto tail_size = l.size - tail_offst; 828| 272k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 27.9k, False: 244k] ------------------ 829| 27.9k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 27.9k| l.tail = r.tail->inc(); 831| 27.9k| l.size += r.size; 832| 27.9k| return; 833| 244k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 1.97k, False: 242k] ------------------ 834| 1.97k| l.ensure_mutable_tail(el, tail_size); 835| 1.97k| detail::uninitialized_copy(r.tail->leaf(), 836| 1.97k| r.tail->leaf() + r.size, 837| 1.97k| l.tail->leaf() + tail_size); 838| 1.97k| l.size += r.size; 839| 1.97k| return; 840| 242k| } else { 841| 242k| auto remaining = branches - tail_size; 842| 242k| l.ensure_mutable_tail(el, tail_size); 843| 242k| detail::uninitialized_copy(r.tail->leaf(), 844| 242k| r.tail->leaf() + remaining, 845| 242k| l.tail->leaf() + tail_size); 846| 242k| IMMER_TRY { ------------------ | | 49| 242k|#define IMMER_TRY try ------------------ 847| 242k| auto new_tail = 848| 242k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 242k| IMMER_TRY { ------------------ | | 49| 242k|#define IMMER_TRY try ------------------ 850| 242k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 242k| l.tail = new_tail; 852| 242k| l.size += r.size; 853| 242k| return; 854| 242k| } 855| 242k| IMMER_CATCH (...) { 856| 0| node_t::delete_leaf(new_tail, r.size - remaining); 857| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 858| 0| } 859| 242k| } 860| 242k| IMMER_CATCH (...) { 861| 0| detail::destroy_n(r.tail->leaf() + tail_size, remaining); 862| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 863| 0| } 864| 242k| } 865| 272k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 621, False: 53.6k] ------------------ 866| 621| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 621] ------------------ 867| 0| auto tail_offst = l.tail_offset(); 868| 0| auto tail_size = l.size - tail_offst; 869| 0| auto concated = 870| 0| concat_trees_mut(el, 871| 0| el, 872| 0| l.tail, 873| 0| tail_size, 874| 0| MemoryPolicy::transience_t::noone, 875| 0| r.root, 876| 0| r.shift, 877| 0| r.tail_offset()); 878| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (878:17): [True: 0, False: 0] ------------------ 879| 0| concated.node()->compute_shift()); 880| 0| l.size += r.size; 881| 0| l.shift = concated.shift(); 882| 0| l.root = concated.node(); 883| 0| l.tail = r.tail; 884| 0| assert(l.check_tree()); ------------------ | Branch (884:17): [True: 0, False: 0] ------------------ 885| 621| } else { 886| 621| auto tail_offst = l.tail_offset(); 887| 621| auto tail_size = l.size - tail_offst; 888| 621| auto concated = concat_trees( 889| 621| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 621| l = {l.size + r.size, 891| 621| concated.shift(), 892| 621| concated.node(), 893| 621| r.tail->inc()}; 894| 621| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 621, False: 0] ------------------ 895| 621| return; 896| 621| } 897| 53.6k| } else { 898| 53.6k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 53.6k] ------------------ 899| 0| auto tail_offst = l.tail_offset(); 900| 0| auto tail_size = l.size - tail_offst; 901| 0| assert(l.check_tree()); ------------------ | Branch (901:17): [True: 0, False: 0] ------------------ 902| 0| assert(r.check_tree()); ------------------ | Branch (902:17): [True: 0, False: 0] ------------------ 903| 0| auto concated = 904| 0| concat_trees_mut(el, 905| 0| el, 906| 0| l.root, 907| 0| l.shift, 908| 0| tail_offst, 909| 0| l.tail, 910| 0| tail_size, 911| 0| MemoryPolicy::transience_t::noone, 912| 0| r.root, 913| 0| r.shift, 914| 0| r.tail_offset()); 915| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (915:17): [True: 0, False: 0] ------------------ 916| 0| concated.node()->compute_shift()); 917| 0| l.size += r.size; 918| 0| l.shift = concated.shift(); 919| 0| l.root = concated.node(); 920| 0| l.tail = r.tail; 921| 0| assert(l.check_tree()); ------------------ | Branch (921:17): [True: 0, False: 0] ------------------ 922| 53.6k| } else { 923| 53.6k| auto tail_offst = l.tail_offset(); 924| 53.6k| auto tail_size = l.size - tail_offst; 925| 53.6k| auto concated = concat_trees(l.root, 926| 53.6k| l.shift, 927| 53.6k| tail_offst, 928| 53.6k| l.tail, 929| 53.6k| tail_size, 930| 53.6k| r.root, 931| 53.6k| r.shift, 932| 53.6k| r.tail_offset()); 933| 53.6k| l = {l.size + r.size, 934| 53.6k| concated.shift(), 935| 53.6k| concated.node(), 936| 53.6k| r.tail->inc()}; 937| 53.6k| } 938| 53.6k| } 939| 327k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEaSERKSB_: 163| 2.39k| { 164| 2.39k| auto next{other}; 165| 2.39k| swap(*this, next); 166| 2.39k| return *this; 167| 2.39k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERSB_NS9_5applyIS6_E4type4editE: 942| 3.28k| { 943| 3.28k| assert(&l != &r); ------------------ | Branch (943:9): [True: 3.28k, False: 0] ------------------ 944| 3.28k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 3.28k, False: 0] ------------------ 945| 3.28k| using std::get; 946| 3.28k| if (r.size == 0) ------------------ | Branch (946:13): [True: 345, False: 2.93k] ------------------ 947| 345| r = std::move(l); 948| 2.93k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 218, False: 2.71k] ------------------ 949| 218| return; 950| 2.71k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 968, False: 1.75k] ------------------ 951| | // just concat the tail, similar to push_back 952| 968| auto tail_offst = l.tail_offset(); 953| 968| auto tail_size = l.size - tail_offst; 954| 968| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 405, False: 563] ------------------ 955| | // this could be improved by making sure that the 956| | // newly created nodes as part of the `push_tail()` 957| | // are tagged with `er` 958| 405| auto res = 959| 405| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 405| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 405| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 405| return; 965| 563| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 328, False: 235] ------------------ 966| | // doing this in a exception way mutating way is very 967| | // tricky while potential performance gains are 968| | // minimal (we need to move every element of the right 969| | // tail anyways to make space for the left tail) 970| | // 971| | // we could however improve this by at least moving the 972| | // elements of the right tail... 973| 328| auto new_tail = 974| 328| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 328| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 328| return; 977| 328| } else { 978| | // like the immutable version 979| 235| auto remaining = branches - tail_size; 980| 235| auto add_tail = node_t::copy_leaf_e( 981| 235| er, l.tail, tail_size, r.tail, remaining); 982| 235| IMMER_TRY { ------------------ | | 49| 235|#define IMMER_TRY try ------------------ 983| 235| auto new_tail = 984| 235| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 235| IMMER_TRY { ------------------ | | 49| 235|#define IMMER_TRY try ------------------ 986| | // this could be improved by making sure that the 987| | // newly created nodes as part of the `push_tail()` 988| | // are tagged with `er` 989| 235| auto new_root = l.push_tail(l.root, 990| 235| l.shift, 991| 235| tail_offst, 992| 235| add_tail, 993| 235| branches); 994| 235| r = {l.size + r.size, 995| 235| get<0>(new_root), 996| 235| get<1>(new_root), 997| 235| new_tail}; 998| 235| return; 999| 235| } 1000| 235| IMMER_CATCH (...) { 1001| 0| node_t::delete_leaf(new_tail, r.size - remaining); 1002| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1003| 0| } 1004| 235| } 1005| 235| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 235| } 1010| 1.75k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 461, False: 1.29k] ------------------ 1011| 461| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 461] ------------------ 1012| 0| auto tail_offst = l.tail_offset(); 1013| 0| auto tail_size = l.size - tail_offst; 1014| 0| auto concated = 1015| 0| concat_trees_mut(er, 1016| 0| MemoryPolicy::transience_t::noone, 1017| 0| l.tail, 1018| 0| tail_size, 1019| 0| er, 1020| 0| r.root, 1021| 0| r.shift, 1022| 0| r.tail_offset()); 1023| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (1023:17): [True: 0, False: 0] ------------------ 1024| 0| concated.node()->compute_shift()); 1025| 0| r.size += l.size; 1026| 0| r.shift = concated.shift(); 1027| 0| r.root = concated.node(); 1028| 0| assert(r.check_tree()); ------------------ | Branch (1028:17): [True: 0, False: 0] ------------------ 1029| 461| } else { 1030| 461| auto tail_offst = l.tail_offset(); 1031| 461| auto tail_size = l.size - tail_offst; 1032| 461| auto concated = concat_trees( 1033| 461| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 461| r = {l.size + r.size, 1035| 461| concated.shift(), 1036| 461| concated.node(), 1037| 461| r.tail->inc()}; 1038| 461| return; 1039| 461| } 1040| 1.29k| } else { 1041| 1.29k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.29k] ------------------ 1042| 0| auto tail_offst = l.tail_offset(); 1043| 0| auto tail_size = l.size - tail_offst; 1044| 0| auto concated = 1045| 0| concat_trees_mut(er, 1046| 0| MemoryPolicy::transience_t::noone, 1047| 0| l.root, 1048| 0| l.shift, 1049| 0| tail_offst, 1050| 0| l.tail, 1051| 0| tail_size, 1052| 0| er, 1053| 0| r.root, 1054| 0| r.shift, 1055| 0| r.tail_offset()); 1056| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (1056:17): [True: 0, False: 0] ------------------ 1057| 0| concated.node()->compute_shift()); 1058| 0| r.size += l.size; 1059| 0| r.shift = concated.shift(); 1060| 0| r.root = concated.node(); 1061| 0| assert(r.check_tree()); ------------------ | Branch (1061:17): [True: 0, False: 0] ------------------ 1062| 0| return; 1063| 1.29k| } else { 1064| 1.29k| auto tail_offst = l.tail_offset(); 1065| 1.29k| auto tail_size = l.size - tail_offst; 1066| 1.29k| auto concated = concat_trees(l.root, 1067| 1.29k| l.shift, 1068| 1.29k| tail_offst, 1069| 1.29k| l.tail, 1070| 1.29k| tail_size, 1071| 1.29k| r.root, 1072| 1.29k| r.shift, 1073| 1.29k| r.tail_offset()); 1074| 1.29k| r = {l.size + r.size, 1075| 1.29k| concated.shift(), 1076| 1.29k| concated.node(), 1077| 1.29k| r.tail->inc()}; 1078| 1.29k| return; 1079| 1.29k| } 1080| 1.29k| } 1081| 3.28k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 365k| { 1085| 365k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 365k, False: 0] ------------------ 1086| 365k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 365k, False: 0] ------------------ 1087| 365k| using std::get; 1088| 365k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 1.56k, False: 363k] ------------------ 1089| 1.56k| l = r; 1090| 363k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 873, False: 363k] ------------------ 1091| 873| return; 1092| 363k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 64.1k, False: 298k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 64.1k| auto tail_offst = l.tail_offset(); 1095| 64.1k| auto tail_size = l.size - tail_offst; 1096| 64.1k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 19.7k, False: 44.4k] ------------------ 1097| 19.7k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 19.7k| l.tail = r.tail->inc(); 1099| 19.7k| l.size += r.size; 1100| 19.7k| return; 1101| 44.4k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 2.77k, False: 41.6k] ------------------ 1102| 2.77k| l.ensure_mutable_tail(el, tail_size); 1103| 2.77k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 1.07k, False: 1.70k] ------------------ 1104| 1.07k| detail::uninitialized_move(r.tail->leaf(), 1105| 1.07k| r.tail->leaf() + r.size, 1106| 1.07k| l.tail->leaf() + tail_size); 1107| 1.70k| else 1108| 1.70k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.70k| r.tail->leaf() + r.size, 1110| 1.70k| l.tail->leaf() + tail_size); 1111| 2.77k| l.size += r.size; 1112| 2.77k| return; 1113| 41.6k| } else { 1114| 41.6k| auto remaining = branches - tail_size; 1115| 41.6k| l.ensure_mutable_tail(el, tail_size); 1116| 41.6k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 14.1k, False: 27.5k] ------------------ 1117| 14.1k| detail::uninitialized_move(r.tail->leaf(), 1118| 14.1k| r.tail->leaf() + remaining, 1119| 14.1k| l.tail->leaf() + tail_size); 1120| 27.5k| else 1121| 27.5k| detail::uninitialized_copy(r.tail->leaf(), 1122| 27.5k| r.tail->leaf() + remaining, 1123| 27.5k| l.tail->leaf() + tail_size); 1124| 41.6k| IMMER_TRY { ------------------ | | 49| 41.6k|#define IMMER_TRY try ------------------ 1125| 41.6k| auto new_tail = 1126| 41.6k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 41.6k| IMMER_TRY { ------------------ | | 49| 41.6k|#define IMMER_TRY try ------------------ 1128| 41.6k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 41.6k| l.tail = new_tail; 1130| 41.6k| l.size += r.size; 1131| 41.6k| return; 1132| 41.6k| } 1133| 41.6k| IMMER_CATCH (...) { 1134| 0| node_t::delete_leaf(new_tail, r.size - remaining); 1135| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1136| 0| } 1137| 41.6k| } 1138| 41.6k| IMMER_CATCH (...) { 1139| 0| detail::destroy_n(r.tail->leaf() + tail_size, remaining); 1140| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1141| 0| } 1142| 41.6k| } 1143| 298k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.22k, False: 295k] ------------------ 1144| 3.22k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.22k] ------------------ 1145| 0| auto tail_offst = l.tail_offset(); 1146| 0| auto tail_size = l.size - tail_offst; 1147| 0| auto concated = concat_trees_mut(el, 1148| 0| el, 1149| 0| l.tail, 1150| 0| tail_size, 1151| 0| er, 1152| 0| r.root, 1153| 0| r.shift, 1154| 0| r.tail_offset()); 1155| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (1155:17): [True: 0, False: 0] ------------------ 1156| 0| concated.node()->compute_shift()); 1157| 0| l.size += r.size; 1158| 0| l.shift = concated.shift(); 1159| 0| l.root = concated.node(); 1160| 0| l.tail = r.tail; 1161| 0| assert(l.check_tree()); ------------------ | Branch (1161:17): [True: 0, False: 0] ------------------ 1162| 0| r.hard_reset(); 1163| 0| return; 1164| 3.22k| } else { 1165| 3.22k| auto tail_offst = l.tail_offset(); 1166| 3.22k| auto tail_size = l.size - tail_offst; 1167| 3.22k| auto concated = concat_trees( 1168| 3.22k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.22k| l = {l.size + r.size, 1170| 3.22k| concated.shift(), 1171| 3.22k| concated.node(), 1172| 3.22k| r.tail->inc()}; 1173| 3.22k| return; 1174| 3.22k| } 1175| 295k| } else { 1176| 295k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 295k] ------------------ 1177| 0| auto tail_offst = l.tail_offset(); 1178| 0| auto tail_size = l.size - tail_offst; 1179| 0| auto concated = concat_trees_mut(el, 1180| 0| el, 1181| 0| l.root, 1182| 0| l.shift, 1183| 0| tail_offst, 1184| 0| l.tail, 1185| 0| tail_size, 1186| 0| er, 1187| 0| r.root, 1188| 0| r.shift, 1189| 0| r.tail_offset()); 1190| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (1190:17): [True: 0, False: 0] ------------------ 1191| 0| concated.node()->compute_shift()); 1192| 0| l.size += r.size; 1193| 0| l.shift = concated.shift(); 1194| 0| l.root = concated.node(); 1195| 0| l.tail = r.tail; 1196| 0| assert(l.check_tree()); ------------------ | Branch (1196:17): [True: 0, False: 0] ------------------ 1197| 0| r.hard_reset(); 1198| 0| return; 1199| 295k| } else { 1200| 295k| auto tail_offst = l.tail_offset(); 1201| 295k| auto tail_size = l.size - tail_offst; 1202| 295k| auto concated = concat_trees(l.root, 1203| 295k| l.shift, 1204| 295k| tail_offst, 1205| 295k| l.tail, 1206| 295k| tail_size, 1207| 295k| r.root, 1208| 295k| r.shift, 1209| 295k| r.tail_offset()); 1210| 295k| l = {l.size + r.size, 1211| 295k| concated.shift(), 1212| 295k| concated.node(), 1213| 295k| r.tail->inc()}; 1214| 295k| return; 1215| 295k| } 1216| 295k| } 1217| 365k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6equalsERKSB_: 315| 28.7k| { 316| 28.7k| using iter_t = rrbtree_iterator; 317| 28.7k| if (size != other.size) ------------------ | Branch (317:13): [True: 7.90k, False: 20.8k] ------------------ 318| 7.90k| return false; 319| 20.8k| if (size == 0) ------------------ | Branch (319:13): [True: 203, False: 20.6k] ------------------ 320| 203| return true; 321| 20.6k| auto tail_off = tail_offset(); 322| 20.6k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 20.6k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 20.0k, False: 665] | Branch (324:29): [True: 19.8k, False: 199] ------------------ 325| | // other.shift != shift is a theoretical possibility for 326| | // relaxed trees that sadly we haven't managed to exercise 327| | // in tests yet... 328| 19.8k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 19.3k, False: 437] ------------------ 329| 19.3k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 9.12k, False: 10.2k] ------------------ 330| 19.3k| other.shift, 331| 19.3k| tail_off_other, 332| 19.3k| equals_visitor::rrb{}, 333| 19.3k| iter_t{other}, 334| 19.3k| root, 335| 19.3k| shift, 336| 19.3k| tail_off)) 337| 9.12k| return false; 338| 19.3k| } else { 339| 437| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 207, False: 230] ------------------ 340| 437| shift, 341| 437| tail_off, 342| 437| equals_visitor::rrb{}, 343| 437| iter_t{*this}, 344| 437| other.root, 345| 437| other.shift, 346| 437| tail_off_other)) 347| 207| return false; 348| 437| } 349| 19.8k| } 350| 11.3k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 6.51k, False: 4.85k] ------------------ 351| 11.3k| ? make_leaf_sub_pos(tail, tail_size()) 352| 6.51k| .visit(equals_visitor{}, other.tail) 353| 11.3k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 1.83k, False: 3.01k] ------------------ 354| 4.85k| ? std::equal(tail->leaf(), 355| 1.83k| tail->leaf() + (size - tail_off), 356| 1.83k| other.tail->leaf() + 357| 1.83k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 4.85k| : std::equal(tail->leaf(), 360| 3.01k| tail->leaf() + (size - tail_off), 361| 3.01k| iter_t{other} + tail_off); 362| 20.6k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10region_forEm: 524| 1.07M| { 525| 1.07M| using std::get; 526| 1.07M| auto tail_off = tail_offset(); 527| 1.07M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 4.90k, False: 1.06M] ------------------ 528| 4.90k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.06M| } else { 530| 1.06M| auto subs = visit_maybe_relaxed_sub( 531| 1.06M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.06M| auto first = idx - get<1>(subs); 533| 1.06M| auto end = first + get<2>(subs); 534| 1.06M| return std::make_tuple(get<0>(subs), first, end); 535| 1.06M| } 536| 1.07M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11dereferenceEv: 90| 8.15M| { 91| 8.15M| using std::get; 92| 8.15M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 59.1k, False: 8.09M] | Branch (92:35): [True: 1.01M, False: 7.08M] ------------------ 93| 1.07M| curr_ = v_->region_for(i_); 94| 8.15M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 8.15M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7advanceEl: 74| 137k| { 75| 137k| using std::get; 76| 137k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 304, False: 136k] | Branch (76:9): [True: 136k, False: 0] | Branch (76:9): [True: 137k, False: 0] ------------------ 77| 137k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 137k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 137k, False: 0] ------------------ 78| 137k| i_ += n; 79| 137k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9incrementEv: 60| 7.13M| { 61| 7.13M| using std::get; 62| 7.13M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 7.13M, False: 0] ------------------ 63| 7.13M| ++i_; 64| 7.13M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2ERKNS1_7rrbtreeIiSA_Lj3ELj3EEE: 39| 22.8k| : v_{&v} 40| 22.8k| , i_{0} 41| 22.8k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 22.8k| { 43| 22.8k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 18.3k| { 32| 18.3k| return Deriv::visit_inner(std::forward(args)...); 33| 18.3k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 68.9k| { 32| 68.9k| return Deriv::visit_inner(std::forward(args)...); 33| 68.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EEEE13visit_regularIJRNS1_15regular_sub_posISD_EERmEEEDcDpOT_: 37| 984| { 38| 984| return Deriv::visit_inner(std::forward(args)...); 39| 984| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EEEE13visit_regularIJRNS1_8full_posISD_EEmEEEDcDpOT_: 37| 4.07k| { 38| 4.07k| return Deriv::visit_inner(std::forward(args)...); 39| 4.07k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EEEE13visit_regularIJRNS1_15regular_sub_posISD_EERmEEEDcDpOT_: 37| 6.47k| { 38| 6.47k| return Deriv::visit_inner(std::forward(args)...); 39| 6.47k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EEEE13visit_regularIJRNS1_8full_posISD_EEmEEEDcDpOT_: 37| 778| { 38| 778| return Deriv::visit_inner(std::forward(args)...); 39| 778| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EEEE13visit_regularIJRNS1_15regular_sub_posISD_EEmEEEDcDpOT_: 37| 1.70k| { 38| 1.70k| return Deriv::visit_inner(std::forward(args)...); 39| 1.70k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_25singleton_regular_sub_posISD_EENS1_14empty_leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 10.0k| { 38| 10.0k| return Deriv::visit_inner(std::forward(args)...); 39| 10.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_25singleton_regular_sub_posISD_EENS1_14empty_leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 10.0k| { 44| 10.0k| return Deriv::visit_node(std::forward(args)...); 45| 10.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 31| 7.28k| { 32| 7.28k| return Deriv::visit_inner(std::forward(args)...); 33| 7.28k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 43| 7.28k| { 44| 7.28k| return Deriv::visit_node(std::forward(args)...); 45| 7.28k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE10visit_leafIJRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 49| 13.3M| { 50| 13.3M| return Deriv::visit_node(std::forward(args)...); 51| 13.3M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 31| 155M| { 32| 155M| return Deriv::visit_inner(std::forward(args)...); 33| 155M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 43| 155M| { 44| 155M| return Deriv::visit_node(std::forward(args)...); 45| 155M| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 31| 155M| { 32| 155M| return Deriv::visit_inner(std::forward(args)...); 33| 155M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 31| 21.2k| { 32| 21.2k| return Deriv::visit_inner(std::forward(args)...); 33| 21.2k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 310| { 38| 310| return Deriv::visit_inner(std::forward(args)...); 39| 310| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 945| { 38| 945| return Deriv::visit_inner(std::forward(args)...); 39| 945| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE10visit_leafIJRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 49| 4.77M| { 50| 4.77M| return Deriv::visit_node(std::forward(args)...); 51| 4.77M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 37| 574k| { 38| 574k| return Deriv::visit_inner(std::forward(args)...); 39| 574k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 43| 574k| { 44| 574k| return Deriv::visit_node(std::forward(args)...); 45| 574k| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 37| 574k| { 38| 574k| return Deriv::visit_inner(std::forward(args)...); 39| 574k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 37| 3.48M| { 38| 3.48M| return Deriv::visit_inner(std::forward(args)...); 39| 3.48M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 43| 3.48M| { 44| 3.48M| return Deriv::visit_node(std::forward(args)...); 45| 3.48M| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 37| 3.48M| { 38| 3.48M| return Deriv::visit_inner(std::forward(args)...); 39| 3.48M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 2.75k| { 38| 2.75k| return Deriv::visit_inner(std::forward(args)...); 39| 2.75k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 43| 2.75k| { 44| 2.75k| return Deriv::visit_node(std::forward(args)...); 45| 2.75k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 31| 1.35M| { 32| 1.35M| return Deriv::visit_inner(std::forward(args)...); 33| 1.35M| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 1.35M| { 44| 1.35M| return Deriv::visit_node(std::forward(args)...); 45| 1.35M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 1.34M| { 32| 1.34M| return Deriv::visit_inner(std::forward(args)...); 33| 1.34M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 1.34M| { 44| 1.34M| return Deriv::visit_node(std::forward(args)...); 45| 1.34M| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 31| 3.59M| { 32| 3.59M| return Deriv::visit_inner(std::forward(args)...); 33| 3.59M| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_: 37| 4.70k| { 38| 4.70k| return Deriv::visit_inner(std::forward(args)...); 39| 4.70k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 1.16M| { 32| 1.16M| return Deriv::visit_inner(std::forward(args)...); 33| 1.16M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 314k| { 38| 314k| return Deriv::visit_inner(std::forward(args)...); 39| 314k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 37| 1.81k| { 38| 1.81k| return Deriv::visit_inner(std::forward(args)...); 39| 1.81k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 17.2k| { 38| 17.2k| return Deriv::visit_inner(std::forward(args)...); 39| 17.2k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_: 37| 7.46k| { 38| 7.46k| return Deriv::visit_inner(std::forward(args)...); 39| 7.46k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 37| 8.87k| { 38| 8.87k| return Deriv::visit_inner(std::forward(args)...); 39| 8.87k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_: 37| 1.47M| { 38| 1.47M| return Deriv::visit_inner(std::forward(args)...); 39| 1.47M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 10.7M| { 32| 10.7M| return Deriv::visit_inner(std::forward(args)...); 33| 10.7M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 1.26k| { 38| 1.26k| return Deriv::visit_inner(std::forward(args)...); 39| 1.26k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_15regular_sub_posISD_EEEEEDcDpOT_: 31| 21.7k| { 32| 21.7k| return Deriv::visit_inner(std::forward(args)...); 33| 21.7k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 2.34k| { 38| 2.34k| return Deriv::visit_inner(std::forward(args)...); 39| 2.34k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_: 31| 544| { 32| 544| return Deriv::visit_inner(std::forward(args)...); 33| 544| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_15regular_sub_posISD_EEEEEDcDpOT_: 31| 1.11k| { 32| 1.11k| return Deriv::visit_inner(std::forward(args)...); 33| 1.11k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 31| 10.5M| { 32| 10.5M| return Deriv::visit_inner(std::forward(args)...); 33| 10.5M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 11.0k| { 38| 11.0k| return Deriv::visit_inner(std::forward(args)...); 39| 11.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 11.0k| { 44| 11.0k| return Deriv::visit_node(std::forward(args)...); 45| 11.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 23.2k| { 38| 23.2k| return Deriv::visit_inner(std::forward(args)...); 39| 23.2k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 23.2k| { 44| 23.2k| return Deriv::visit_node(std::forward(args)...); 45| 23.2k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 6.19k| { 32| 6.19k| return Deriv::visit_inner(std::forward(args)...); 33| 6.19k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 6.19k| { 44| 6.19k| return Deriv::visit_node(std::forward(args)...); 45| 6.19k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 17.0k| { 38| 17.0k| return Deriv::visit_inner(std::forward(args)...); 39| 17.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 17.0k| { 44| 17.0k| return Deriv::visit_node(std::forward(args)...); 45| 17.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 31| 10.1k| { 32| 10.1k| return Deriv::visit_inner(std::forward(args)...); 33| 10.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 43| 10.1k| { 44| 10.1k| return Deriv::visit_node(std::forward(args)...); 45| 10.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 16.0k| { 32| 16.0k| return Deriv::visit_inner(std::forward(args)...); 33| 16.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERjRNS1_15regular_sub_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 2.17k| { 32| 2.17k| return Deriv::visit_inner(std::forward(args)...); 33| 2.17k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERjRNS1_8full_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 476| { 32| 476| return Deriv::visit_inner(std::forward(args)...); 33| 476| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERjRNS1_8full_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 851| { 38| 851| return Deriv::visit_inner(std::forward(args)...); 39| 851| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERmEEEDcDpOT_: 31| 3.78M| { 32| 3.78M| return Deriv::visit_inner(std::forward(args)...); 33| 3.78M| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERmEEEDcDpOT_: 37| 216k| { 38| 216k| return Deriv::visit_inner(std::forward(args)...); 39| 216k| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERmEEEDcDpOT_: 37| 296k| { 38| 296k| return Deriv::visit_inner(std::forward(args)...); 39| 296k| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_regularIJRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERmEEEDcDpOT_: 37| 36.1k| { 38| 36.1k| return Deriv::visit_inner(std::forward(args)...); 39| 36.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj3ELj3EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 21.1k| { 38| 21.1k| return Deriv::visit_inner(std::forward(args)...); 39| 21.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 561| { 38| 561| return Deriv::visit_inner(std::forward(args)...); 39| 561| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj3ELj3EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 8.90k| { 38| 8.90k| return Deriv::visit_inner(std::forward(args)...); 39| 8.90k| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj3ELj3EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 3.92k| { 38| 3.92k| return Deriv::visit_inner(std::forward(args)...); 39| 3.92k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 2.18k| { 38| 2.18k| return Deriv::visit_inner(std::forward(args)...); 39| 2.18k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 1.99k| { 38| 1.99k| return Deriv::visit_inner(std::forward(args)...); 39| 1.99k| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj3ELj3EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 31| 120k| { 32| 120k| return Deriv::visit_inner(std::forward(args)...); 33| 120k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERPSH_RjRmEEEDcDpOT_: 31| 973| { 32| 973| return Deriv::visit_inner(std::forward(args)...); 33| 973| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERPSH_RjRmEEEDcDpOT_: 43| 973| { 44| 973| return Deriv::visit_node(std::forward(args)...); 45| 973| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 37| 9.68k| { 38| 9.68k| return Deriv::visit_inner(std::forward(args)...); 39| 9.68k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 43| 9.68k| { 44| 9.68k| return Deriv::visit_node(std::forward(args)...); 45| 9.68k| } _ZN5immer6detail15auto_const_castINS_22unsafe_refcount_policyEEERT_RKS3_: 143| 719M|{ 144| 719M| return const_cast(x); 145| 719M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 420M| { 114| 420M| check_base(); 115| 420M| auto* base = static_cast(this); 116| 420M| return reinterpret_cast(base + 1); 117| 420M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 420M| { 135| 420M| static_assert(std::is_standard_layout::value && 136| 420M| !std::is_empty::value, 137| 420M| "Please add 'true' if the derived class is emtpy"); 138| 420M| } _ZN5immer6detail9static_ifILb1EZNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14delete_inner_rEPSC_jEUlT_E_EENSt3__19enable_ifIXT_EvE4typeEOT0_: 329| 46.6M|{ 330| 46.6M| std::forward(f)(empty_t{}); 331| 46.6M|} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 3.00M|{ 189| 3.00M| return first + n; 190| 3.00M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6leaf_tEiLb1EE15get_storage_ptrEv: 75| 18.6M| { 76| 18.6M| check_base(); 77| 18.6M| return reinterpret_cast(this); 78| 18.6M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6leaf_tEiLb1EE10check_baseEv: 94| 18.6M| { 95| | // is_standard_layout requires that only one class in the hierarchy 96| | // contains non-static data members. Since this class contains one 97| | // member, the static_assert will only hold when the derived class is 98| | // empty. 99| 18.6M| static_assert(std::is_standard_layout::value, 100| 18.6M| "Please remove 'true' if the derived class is non emtpy"); 101| 18.6M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 4.38M|{ 237| 4.38M| return std::copy(first, last, out); 238| 4.38M|} _ZN5immer6detail9static_ifILb0EPNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEZNSC_15make_inner_sr_nEjPNS0_3csl10member_twoINSC_14relaxed_data_tENSE_6memberIS8_NSE_7inheritINSA_5applyIS7_E4type5owneeEvE4typeEE4typeEE4typeEEUlT_E_ZNSC_15make_inner_sr_nEjST_EUlSU_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_: 344| 364k|{ 345| 364k| return std::forward(f2)(empty_t{}); 346| 364k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 76.2M|{ 324| 76.2M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 3.63M, False: 72.6M] ------------------ 325| 76.2M|} _ZN5immer6detail9static_ifILb0EPNS0_3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14relaxed_data_tENS2_6memberISA_NS2_7inheritINSC_5applyIS9_E4type5owneeEvE4typeEE4typeEE4typeEZNSE_24ensure_mutable_relaxed_nENSK_4editEjEUlT_E_ZNSE_24ensure_mutable_relaxed_nEST_jEUlSU_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_: 344| 202k|{ 345| 202k| return std::forward(f2)(empty_t{}); 346| 202k|} _ZN5immer6detail9static_ifILb1EZNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14make_inner_r_eENSA_5applyIS7_E4type4editEEUlT_E_EENSt3__19enable_ifIXT_EvE4typeEOT0_: 329| 161k|{ 330| 161k| std::forward(f)(empty_t{}); 331| 161k|} _ZN5immer6detail9static_ifILb0EPNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEZNSC_15make_inner_sr_eENSA_5applyIS7_E4type4editEPNS0_3csl10member_twoINSC_14relaxed_data_tENSI_6memberIS8_NSI_7inheritINSG_5owneeEvE4typeEE4typeEE4typeEEUlT_E_ZNSC_15make_inner_sr_eESH_SU_EUlSV_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_: 344| 21.9k|{ 345| 21.9k| return std::forward(f2)(empty_t{}); 346| 21.9k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 349|{ 189| 349| return first + n; 190| 349|} _ZN5immer6detail9static_ifILb0EPNS0_3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14relaxed_data_tENS2_6memberISA_NS2_7inheritINSC_5applyIS9_E4type5owneeEvE4typeEE4typeEE4typeEZNSE_22ensure_mutable_relaxedENSK_4editEEUlT_E_ZNSE_22ensure_mutable_relaxedEST_EUlSU_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_: 344| 232k|{ 345| 232k| return std::forward(f2)(empty_t{}); 346| 232k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 15.2k|{ 211| 15.2k| return std::copy(first, last, out); 212| 15.2k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.01M|{ 30| 1.01M| return x; 31| 1.01M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 16.6k|{ 261| 16.6k| auto ptr = Heap::allocate(sizeof(T)); 262| 16.6k| IMMER_TRY { ------------------ | | 49| 16.6k|#define IMMER_TRY try ------------------ 263| 16.6k| return new (ptr) T(std::forward(args)...); 264| 16.6k| } 265| 16.6k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 16.6k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2Ev: 96| 80.9k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_backEi: 246| 279k| { 247| 279k| return impl_.push_back(std::move(value)); 248| 279k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj3ELj3EEE: 536| 2.69M| : impl_(std::move(impl)) 537| 2.69M| { 538| |#if IMMER_DEBUG_PRINT 539| | // force the compiler to generate debug_print, so we can call 540| | // it from a debugger 541| | [](volatile auto) {}(&flex_vector::debug_print); 542| |#endif 543| 2.69M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4sizeEv: 181| 4.83M| IMMER_NODISCARD size_type size() const { return impl_.size; } flex-vector-st.cpp:_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E_EES9_mOSE_: 323| 204k| { 324| 204k| return impl_.update(index, std::forward(fn)); 325| 204k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4takeEm: 350| 21.9k| { 351| 21.9k| return impl_.take(elems); 352| 21.9k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4dropEm: 376| 29.2k| { 377| 29.2k| return impl_.drop(elems); 378| 29.2k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8max_sizeEv: 90| 1.46M| constexpr static size_type max_size() { return impl_t::max_size(); } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEESB_: 403| 2.16M| { 404| 2.16M| return l.impl_.concat(r.impl_); 405| 2.16M| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_backEi: 251| 27.0k| { 252| 27.0k| return push_back_move(move_t{}, std::move(value)); 253| 27.0k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 27.0k| { 548| 27.0k| impl_.push_back_mut({}, std::move(value)); 549| 27.0k| return std::move(*this); 550| 27.0k| } flex-vector-st.cpp:_ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEDcmOSE_: 329| 16.4k| { 330| 16.4k| return update_move(move_t{}, index, std::forward(fn)); 331| 16.4k| } flex-vector-st.cpp:_ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11update_moveIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEOS9_NSt3__117integral_constantIbLb1EEEmOSE_: 568| 16.4k| { 569| 16.4k| impl_.update_mut({}, index, std::forward(fn)); 570| 16.4k| return std::move(*this); 571| 16.4k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4takeEm: 355| 33.8k| { 356| 33.8k| return take_move(move_t{}, elems); 357| 33.8k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 33.8k| { 580| 33.8k| impl_.take_mut({}, elems); 581| 33.8k| return std::move(*this); 582| 33.8k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4dropEm: 381| 75.4k| { 382| 75.4k| return drop_move(move_t{}, elems); 383| 75.4k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 75.4k| { 590| 75.4k| impl_.drop_mut({}, elems); 591| 75.4k| return std::move(*this); 592| 75.4k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERKS9_: 409| 327k| { 410| 327k| return concat_move(move_t{}, std::move(l), r); 411| 327k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 327k| { 601| 327k| concat_mut_l(l.impl_, {}, r.impl_); 602| 327k| return std::move(l); 603| 327k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEOS9_: 415| 3.28k| { 416| 3.28k| return concat_move(move_t{}, l, std::move(r)); 417| 3.28k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 3.28k| { 607| 3.28k| concat_mut_r(l.impl_, r.impl_, {}); 608| 3.28k| return std::move(r); 609| 3.28k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEESA_: 421| 365k| { 422| 365k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 365k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 365k| { 613| 365k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 365k| return std::move(l); 615| 365k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEeqERKS9_: 222| 28.7k| { 223| 28.7k| return impl_.equals(other.impl_); 224| 28.7k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5eraseEm: 480| 3.53k| { 481| 3.53k| return take(pos) + drop(pos + 1); 482| 3.53k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6insertEmi: 442| 16.6k| { 443| 16.6k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 16.6k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 101M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 55.0M| { 28| 55.0M| return ::operator new(size); 29| 55.0M| } _ZN5immer8cpp_heap8allocateIJNS_10norefs_tagEEEEPvmDpT_: 27| 46.2M| { 28| 46.2M| return ::operator new(size); 29| 46.2M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 16.6k| { 50| 16.6k| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 16.6k| new (p) std::size_t{size}; 52| 16.6k| return ((char*) p) + extra_size; 53| 16.6k| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 16.6k| { 58| 16.6k| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 16.6k| assert(*p == size); ------------------ | Branch (59:9): [True: 16.6k, False: 0] ------------------ 60| 16.6k| Base::deallocate(size + extra_size, p, tags...); 61| 16.6k| } _ZN5immer15refcount_policyC2Ev: 28| 16.6k| : refcount{1} {}; _ZN5immer15refcount_policy3decEv: 36| 16.6k| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer22unsafe_refcount_policyC2Ev: 27| 101M| : refcount{1} {}; _ZN5immer22unsafe_refcount_policy3incEv: 33| 307M| void inc() { ++refcount; } _ZN5immer22unsafe_refcount_policy3decEv: 34| 408M| bool dec() { return --refcount == 0; } _ZN5immer22unsafe_refcount_policy6uniqueEv: 35| 3.25M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee5ownedEv: 36| 101M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee10can_mutateENS6_4editE: 35| 204k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeaSENS6_4editE: 34| 854k| ownee& operator=(edit) { return *this; };