LLVMFuzzerTestOneInput: 24| 9.94k|{ 25| 9.94k| constexpr auto var_count = 8; 26| 9.94k| constexpr auto bits = 3; 27| | 28| 9.94k| using vector_t = immer::flex_vector; 29| 9.94k| using size_t = std::uint8_t; 30| | 31| 9.94k| auto vars = std::array{}; 32| | 33| 9.94k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 34| 9.94k| auto is_valid_var_neq = [](auto other) { 35| 9.94k| return [=](auto idx) { 36| 9.94k| return idx >= 0 && idx < var_count && idx != other; 37| 9.94k| }; 38| 9.94k| }; 39| 9.94k| auto is_valid_index = [](auto& v) { 40| 9.94k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 9.94k| }; 42| 9.94k| auto is_valid_size = [](auto& v) { 43| 9.94k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 9.94k| }; 45| 9.94k| auto can_concat = [](const auto& v1, const auto& v2) { 46| | // First, check max_size 47| 9.94k| if (v1.size() + v2.size() > vector_t::max_size()) { 48| 9.94k| return false; 49| 9.94k| } 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| 9.94k| try { 55| | // Try to concat and catch an exception if it fails 56| 9.94k| const auto v3 = v1 + v2; 57| 9.94k| if (v3.size()) { 58| 9.94k| return true; 59| 9.94k| } 60| 9.94k| } catch (const immer::detail::rbts::invalid_tree&) { 61| 9.94k| return false; 62| 9.94k| } 63| 9.94k| return true; 64| 9.94k| }; 65| 9.94k| auto can_compare = [](auto&& v) { 66| | // avoid comparing vectors that are too big, and hence, slow to compare 67| 9.94k| return v.size() < (1 << 15); 68| 9.94k| }; 69| 9.94k| return fuzzer_input{data, size}.run([&](auto& in) { 70| 9.94k| enum ops 71| 9.94k| { 72| 9.94k| op_push_back, 73| 9.94k| op_update, 74| 9.94k| op_take, 75| 9.94k| op_drop, 76| 9.94k| op_concat, 77| 9.94k| op_push_back_move, 78| 9.94k| op_update_move, 79| 9.94k| op_take_move, 80| 9.94k| op_drop_move, 81| 9.94k| op_concat_move_l, 82| 9.94k| op_concat_move_r, 83| 9.94k| op_concat_move_lr, 84| 9.94k| op_insert, 85| 9.94k| op_erase, 86| 9.94k| op_compare, 87| 9.94k| }; 88| 9.94k| auto src = read(in, is_valid_var); 89| 9.94k| auto dst = read(in, is_valid_var); 90| 9.94k| switch (read(in)) { 91| 9.94k| case op_push_back: { 92| 9.94k| vars[dst] = vars[src].push_back(42); 93| 9.94k| break; 94| 9.94k| } 95| 9.94k| case op_update: { 96| 9.94k| auto idx = read(in, is_valid_index(vars[src])); 97| 9.94k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 98| 9.94k| break; 99| 9.94k| } 100| 9.94k| case op_take: { 101| 9.94k| auto idx = read(in, is_valid_size(vars[src])); 102| 9.94k| vars[dst] = vars[src].take(idx); 103| 9.94k| break; 104| 9.94k| } 105| 9.94k| case op_drop: { 106| 9.94k| auto idx = read(in, is_valid_size(vars[src])); 107| 9.94k| vars[dst] = vars[src].drop(idx); 108| 9.94k| break; 109| 9.94k| } 110| 9.94k| case op_concat: { 111| 9.94k| auto src2 = read(in, is_valid_var); 112| 9.94k| if (can_concat(vars[src], vars[src2])) 113| 9.94k| vars[dst] = vars[src] + vars[src2]; 114| 9.94k| break; 115| 9.94k| } 116| 9.94k| case op_push_back_move: { 117| 9.94k| vars[dst] = std::move(vars[src]).push_back(21); 118| 9.94k| break; 119| 9.94k| } 120| 9.94k| case op_update_move: { 121| 9.94k| auto idx = read(in, is_valid_index(vars[src])); 122| 9.94k| vars[dst] = 123| 9.94k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 124| 9.94k| break; 125| 9.94k| } 126| 9.94k| case op_take_move: { 127| 9.94k| auto idx = read(in, is_valid_size(vars[src])); 128| 9.94k| vars[dst] = std::move(vars[src]).take(idx); 129| 9.94k| break; 130| 9.94k| } 131| 9.94k| case op_drop_move: { 132| 9.94k| auto idx = read(in, is_valid_size(vars[src])); 133| 9.94k| vars[dst] = std::move(vars[src]).drop(idx); 134| 9.94k| break; 135| 9.94k| } 136| 9.94k| case op_concat_move_l: { 137| 9.94k| auto src2 = read(in, is_valid_var_neq(src)); 138| 9.94k| if (can_concat(vars[src], vars[src2])) 139| 9.94k| vars[dst] = std::move(vars[src]) + vars[src2]; 140| 9.94k| break; 141| 9.94k| } 142| 9.94k| case op_concat_move_r: { 143| 9.94k| auto src2 = read(in, is_valid_var_neq(src)); 144| 9.94k| if (can_concat(vars[src], vars[src2])) 145| 9.94k| vars[dst] = vars[src] + std::move(vars[src2]); 146| 9.94k| break; 147| 9.94k| } 148| 9.94k| case op_concat_move_lr: { 149| 9.94k| auto src2 = read(in, is_valid_var_neq(src)); 150| 9.94k| if (can_concat(vars[src], vars[src2])) 151| 9.94k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 152| 9.94k| break; 153| 9.94k| } 154| 9.94k| case op_compare: { 155| 9.94k| using std::swap; 156| 9.94k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 157| 9.94k| swap(vars[src], vars[dst]); 158| 9.94k| break; 159| 9.94k| } 160| 9.94k| case op_erase: { 161| 9.94k| auto idx = read(in, is_valid_index(vars[src])); 162| 9.94k| vars[dst] = vars[src].erase(idx); 163| 9.94k| break; 164| 9.94k| } 165| 9.94k| case op_insert: { 166| 9.94k| auto idx = read(in, is_valid_size(vars[src])); 167| 9.94k| vars[dst] = vars[src].insert(idx, immer::box{42}); 168| 9.94k| break; 169| 9.94k| } 170| 9.94k| default: 171| 9.94k| break; 172| 9.94k| }; 173| 9.94k| return true; 174| 9.94k| }); 175| 9.94k|} 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| 289k| case op_push_back: { ------------------ | Branch (91:9): [True: 289k, False: 1.91M] ------------------ 92| 289k| vars[dst] = vars[src].push_back(42); 93| 289k| break; 94| 0| } 95| 195k| case op_update: { ------------------ | Branch (95:9): [True: 195k, False: 2.01M] ------------------ 96| 195k| auto idx = read(in, is_valid_index(vars[src])); 97| 195k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 98| 195k| break; 99| 0| } 100| 1.79k| case op_take: { ------------------ | Branch (100:9): [True: 1.79k, False: 2.20M] ------------------ 101| 1.79k| auto idx = read(in, is_valid_size(vars[src])); 102| 1.79k| vars[dst] = vars[src].take(idx); 103| 1.79k| break; 104| 0| } 105| 8.60k| case op_drop: { ------------------ | Branch (105:9): [True: 8.60k, False: 2.19M] ------------------ 106| 8.60k| auto idx = read(in, is_valid_size(vars[src])); 107| 8.60k| vars[dst] = vars[src].drop(idx); 108| 8.60k| break; 109| 0| } 110| 748k| case op_concat: { ------------------ | Branch (110:9): [True: 748k, False: 1.45M] ------------------ 111| 748k| auto src2 = read(in, is_valid_var); 112| 748k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (112:17): [True: 709k, False: 39.0k] ------------------ 113| 709k| vars[dst] = vars[src] + vars[src2]; 114| 748k| break; 115| 0| } 116| 11.0k| case op_push_back_move: { ------------------ | Branch (116:9): [True: 11.0k, False: 2.19M] ------------------ 117| 11.0k| vars[dst] = std::move(vars[src]).push_back(21); 118| 11.0k| break; 119| 0| } 120| 15.7k| case op_update_move: { ------------------ | Branch (120:9): [True: 15.7k, False: 2.19M] ------------------ 121| 15.7k| auto idx = read(in, is_valid_index(vars[src])); 122| 15.7k| vars[dst] = 123| 15.7k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 124| 15.7k| break; 125| 0| } 126| 33.8k| case op_take_move: { ------------------ | Branch (126:9): [True: 33.8k, False: 2.17M] ------------------ 127| 33.8k| auto idx = read(in, is_valid_size(vars[src])); 128| 33.8k| vars[dst] = std::move(vars[src]).take(idx); 129| 33.8k| break; 130| 0| } 131| 76.6k| case op_drop_move: { ------------------ | Branch (131:9): [True: 76.6k, False: 2.13M] ------------------ 132| 76.6k| auto idx = read(in, is_valid_size(vars[src])); 133| 76.6k| vars[dst] = std::move(vars[src]).drop(idx); 134| 76.6k| break; 135| 0| } 136| 349k| case op_concat_move_l: { ------------------ | Branch (136:9): [True: 349k, False: 1.85M] ------------------ 137| 349k| auto src2 = read(in, is_valid_var_neq(src)); 138| 349k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (138:17): [True: 345k, False: 4.40k] ------------------ 139| 345k| vars[dst] = std::move(vars[src]) + vars[src2]; 140| 349k| break; 141| 0| } 142| 3.53k| case op_concat_move_r: { ------------------ | Branch (142:9): [True: 3.53k, False: 2.20M] ------------------ 143| 3.53k| auto src2 = read(in, is_valid_var_neq(src)); 144| 3.53k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (144:17): [True: 3.25k, False: 280] ------------------ 145| 3.25k| vars[dst] = vars[src] + std::move(vars[src2]); 146| 3.53k| break; 147| 0| } 148| 370k| case op_concat_move_lr: { ------------------ | Branch (148:9): [True: 370k, False: 1.83M] ------------------ 149| 370k| auto src2 = read(in, is_valid_var_neq(src)); 150| 370k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (150:17): [True: 359k, False: 11.4k] ------------------ 151| 359k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 152| 370k| break; 153| 0| } 154| 37.7k| case op_compare: { ------------------ | Branch (154:9): [True: 37.7k, False: 2.16M] ------------------ 155| 37.7k| using std::swap; 156| 37.7k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (156:17): [True: 31.7k, False: 5.97k] | Branch (156:43): [True: 6.16k, False: 25.6k] ------------------ 157| 6.16k| swap(vars[src], vars[dst]); 158| 37.7k| break; 159| 0| } 160| 3.52k| case op_erase: { ------------------ | Branch (160:9): [True: 3.52k, False: 2.20M] ------------------ 161| 3.52k| auto idx = read(in, is_valid_index(vars[src])); 162| 3.52k| vars[dst] = vars[src].erase(idx); 163| 3.52k| break; 164| 0| } 165| 16.4k| case op_insert: { ------------------ | Branch (165:9): [True: 16.4k, False: 2.19M] ------------------ 166| 16.4k| auto idx = read(in, is_valid_size(vars[src])); 167| 16.4k| vars[dst] = vars[src].insert(idx, immer::box{42}); 168| 16.4k| break; 169| 0| } 170| 35.3k| default: ------------------ | Branch (170:9): [True: 35.3k, False: 2.17M] ------------------ 171| 35.3k| break; 172| 2.20M| }; 173| 2.19M| return true; 174| 2.20M| }); flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 33| 5.78M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (33:48): [True: 5.49M, False: 286k] | Branch (33:60): [True: 5.14M, False: 348k] ------------------ 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| 270k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (40:39): [True: 270k, False: 0] | Branch (40:51): [True: 214k, False: 55.7k] ------------------ flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaRT_: 39| 214k| auto is_valid_index = [](auto& v) { 40| 214k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 214k| }; flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 97| 195k| 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: 137k, False: 11.5k] ------------------ flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaRT_: 42| 137k| auto is_valid_size = [](auto& v) { 43| 137k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 137k| }; 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.47M| auto can_concat = [](const auto& v1, const auto& v2) { 46| | // First, check max_size 47| 1.47M| if (v1.size() + v2.size() > vector_t::max_size()) { ------------------ | Branch (47:13): [True: 53.3k, False: 1.41M] ------------------ 48| 53.3k| return false; 49| 53.3k| } 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.41M| try { 55| | // Try to concat and catch an exception if it fails 56| 1.41M| const auto v3 = v1 + v2; 57| 1.41M| if (v3.size()) { ------------------ | Branch (57:17): [True: 1.41M, False: 2.94k] ------------------ 58| 1.41M| return true; 59| 1.41M| } 60| 1.41M| } catch (const immer::detail::rbts::invalid_tree&) { 61| 1.64k| return false; 62| 1.64k| } 63| 1.30k| return true; 64| 1.41M| }; flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 123| 15.7k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 35| 806k| return [=](auto idx) { 36| 806k| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (36:20): [True: 786k, False: 19.9k] | Branch (36:32): [True: 753k, False: 32.5k] | Branch (36:51): [True: 723k, False: 29.7k] ------------------ 37| 806k| }; flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 34| 724k| auto is_valid_var_neq = [](auto other) { 35| 724k| return [=](auto idx) { 36| 724k| return idx >= 0 && idx < var_count && idx != other; 37| 724k| }; 38| 724k| }; flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaOT_: 65| 37.7k| auto can_compare = [](auto&& v) { 66| | // avoid comparing vectors that are too big, and hence, slow to compare 67| 37.7k| return v.size() < (1 << 15); 68| 37.7k| }; flex-vector-st.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 9.94k| { 51| 9.94k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 3, False: 9.94k] ------------------ 52| 3| return 0; 53| 9.94k| try { 54| 2.20M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.19M, False: 9.94k] ------------------ 55| 2.19M| continue; 56| 9.94k| } catch (const no_more_input&) { 57| 9.94k| }; 58| 9.94k| return 0; 59| 9.94k| } flex-vector-st.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 5.15M|{ 71| 5.15M| auto x = read(fz); 72| 5.79M| while (!cond(x)) ------------------ | Branch (72:12): [True: 635k, False: 5.15M] ------------------ 73| 635k| x = read(fz); 74| 5.15M| return x; 75| 5.15M|} _Z4readIcERKT_R12fuzzer_input: 64| 8.79M|{ 65| 8.79M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 8.79M|} _ZN12fuzzer_input4nextEmm: 40| 9.21M| { 41| 9.21M| auto& p = const_cast(reinterpret_cast(data_)); 42| 9.21M| auto r = std::align(align, size, p, size_); 43| 9.21M| if (r == nullptr) ------------------ | Branch (43:13): [True: 9.94k, False: 9.20M] ------------------ 44| 9.94k| throw no_more_input{}; 45| 9.20M| return next(size); 46| 9.21M| } _ZN12fuzzer_input4nextEm: 30| 9.20M| { 31| 9.20M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 9.20M] ------------------ 32| 0| throw no_more_input{}; 33| 9.20M| auto r = data_; 34| 9.20M| data_ += size; 35| 9.20M| size_ -= size; 36| 9.20M| return r; 37| 9.20M| } 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| 214k|{ 71| 214k| auto x = read(fz); 72| 270k| while (!cond(x)) ------------------ | Branch (72:12): [True: 55.7k, False: 214k] ------------------ 73| 55.7k| x = read(fz); 74| 214k| return x; 75| 214k|} _Z4readIhERKT_R12fuzzer_input: 64| 419k|{ 65| 419k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 419k|} 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| 137k|{ 71| 137k| auto x = read(fz); 72| 148k| while (!cond(x)) ------------------ | Branch (72:12): [True: 11.5k, False: 137k] ------------------ 73| 11.5k| x = read(fz); 74| 137k| return x; 75| 137k|} flex-vector-st.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 724k|{ 71| 724k| auto x = read(fz); 72| 806k| while (!cond(x)) ------------------ | Branch (72:12): [True: 82.2k, False: 724k] ------------------ 73| 82.2k| x = read(fz); 74| 724k| return x; 75| 724k|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 16.4k| : impl_{detail::make(std::forward(arg))} 86| 16.4k| { 87| 16.4k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 16.4k| : value(std::forward(args)...) 48| 16.4k| { 49| 16.4k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 16.4k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 16.4k| 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.4k| { 132| 16.4k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 16.4k, False: 0] | Branch (132:22): [True: 16.4k, False: 0] ------------------ 133| 16.4k| impl_->~holder(); 134| 16.4k| heap::deallocate(sizeof(holder), impl_); 135| 16.4k| } 136| 16.4k| } _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.5M| { 171| 47.5M| return x.get_(type_t{}); 172| 47.5M| } _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.5M| { 185| 47.5M| return n.get_(t); 186| 47.5M| } _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.5M| { 166| 46.5M| return x.get_(type_t{}); 167| 46.5M| } _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.5M| { 180| 46.5M| return n.get_(t); 181| 46.5M| } _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.5M| { 166| 55.5M| return x.get_(type_t{}); 167| 55.5M| } _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.5M| { 180| 55.5M| return n.get_(t); 181| 55.5M| } _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| 176k| { 171| 176k| return x.get_(type_t{}); 172| 176k| } _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| 176k| { 185| 176k| return n.get_(t); 186| 176k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 176k| 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.37M| 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.37M| { 23| 8.37M| return x.dereference(); 24| 8.37M| } _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.43M| { 87| 8.43M| static_assert(std::is_base_of::value, 88| 8.43M| "must pass a derived thing"); 89| 8.43M| return *static_cast(this); 90| 8.43M| } _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| 204k| { 152| 204k| access_t::advance(derived(), n); 153| 204k| return derived(); 154| 204k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEElEEDcOT_T0_: 46| 204k| { 47| 204k| return x.advance(d); 48| 204k| } _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.9M| { 93| 14.9M| static_assert(std::is_base_of::value, 94| 14.9M| "must pass a derived thing"); 95| 14.9M| return *static_cast(this); 96| 14.9M| } _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.26M| { 120| 7.26M| access_t::increment(derived()); 121| 7.26M| return derived(); 122| 7.26M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDcOT_: 28| 7.26M| { 29| 7.26M| return x.increment(); 30| 7.26M| } _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.18M| { 214| 5.18M| assert(n <= branches); ------------------ | Branch (214:9): [True: 5.18M, False: 0] ------------------ 215| 5.18M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 5.18M, False: 0] ------------------ 216| 5.18M| auto p = new (buffer) node_t; 217| 5.18M| p->impl.d.data.inner.relaxed = nullptr; 218| 5.18M|#if IMMER_TAGGED_NODE 219| 5.18M| p->impl.d.kind = node_t::kind_t::inner; 220| 5.18M|#endif 221| 5.18M| return p; 222| 5.18M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14sizeof_inner_nEj: 145| 20.8M| { 146| 20.8M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 20.8M, Folded] ------------------ 147| 20.8M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE3incEv: 956| 170M| { 957| 170M| refs(this).inc(); 958| 170M| return this; 959| 170M| } _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.55M| { 331| 2.55M| assert(n <= branches); ------------------ | Branch (331:9): [True: 2.55M, False: 0] ------------------ 332| 2.55M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 2.55M, False: 0] ------------------ 333| 2.55M| auto p = new (buffer) node_t; 334| 2.55M|#if IMMER_TAGGED_NODE 335| 2.55M| p->impl.d.kind = node_t::kind_t::leaf; 336| 2.55M|#endif 337| 2.55M| return p; 338| 2.55M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13sizeof_leaf_nEj: 160| 10.6M| { 161| 10.6M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 10.6M, Folded] ------------------ 162| 10.6M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7relaxedEv: 172| 934M| { 173| 934M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 934M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 934M, False: 0] ------------------ 174| 934M| return impl.d.data.inner.relaxed; 175| 934M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4kindEv: 168| 1.46G| 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| 361M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5innerEv: 184| 421M| { 185| 421M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 421M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 421M, False: 0] ------------------ 186| 421M| return impl.d.data.inner.get_storage_ptr(); 187| 421M| } _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.3M, False: 336k] ------------------ 838| 46.3M| heap::deallocate(node_t::ownee(r).owned() ------------------ | Branch (838:34): [True: 0, False: 46.3M] ------------------ 839| 46.3M| ? node_t::max_sizeof_relaxed 840| 46.3M| : node_t::sizeof_relaxed_n(n), 841| 46.3M| 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.5M| { 197| 47.5M| return auto_const_cast(get(*x)); 198| 47.5M| } _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.5M| 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.4M| { 156| 92.4M| return keep_headroom ? max_sizeof_relaxed : sizeof_packed_relaxed_n(n); ------------------ | Branch (156:16): [True: 92.4M, Folded] ------------------ 157| 92.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5owneeEPSB_: 210| 55.5M| 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.1M| { 151| 93.1M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 93.1M, Folded] ------------------ 152| 93.1M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11delete_leafEPSB_j: 861| 2.96M| { 862| 2.96M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 68| 2.96M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (862:9): [True: 2.96M, False: 0] ------------------ 863| 2.96M| detail::destroy_n(p->leaf(), n); 864| 2.96M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (864:26): [True: 0, False: 2.96M] ------------------ 865| 2.96M| : node_t::sizeof_leaf_n(n), 866| 2.96M| p); 867| 2.96M| } _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.26M| { 809| 5.26M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 5.26M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 5.26M, False: 0] ------------------ 810| 5.26M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 5.26M, False: 0] ------------------ 811| 5.26M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 5.26M] ------------------ 812| 5.26M| : node_t::sizeof_inner_n(n), 813| 5.26M| p); 814| 5.26M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 244k| { 795| 244k| auto dst = copy_leaf_n(n + 1, src, n); 796| 244k| IMMER_TRY { ------------------ | | 49| 244k|#define IMMER_TRY try ------------------ 797| 244k| new (dst->leaf() + n) T(std::forward(x)); 798| 244k| } 799| 244k| 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| 244k| return dst; 805| 244k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_nEjPSB_j: 696| 244k| { 697| 244k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 244k, False: 0] ------------------ 698| 244k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 244k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 244k, False: 0] ------------------ 699| 244k| auto dst = make_leaf_n(allocn); 700| 244k| IMMER_TRY { ------------------ | | 49| 244k|#define IMMER_TRY try ------------------ 701| 244k| detail::uninitialized_copy( 702| 244k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 244k| } 704| 244k| 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| 244k| return dst; 709| 244k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_nEj: 341| 2.55M| { 342| 2.55M| assert(n <= branches); ------------------ | Branch (342:9): [True: 2.55M, False: 0] ------------------ 343| 2.55M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 2.55M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 2.55M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_nIiEEPSB_jOT_: 470| 44.7k| { 471| 44.7k| assert(n >= 1); ------------------ | Branch (471:9): [True: 44.7k, False: 0] ------------------ 472| 44.7k| auto p = make_leaf_n(n); 473| 44.7k| IMMER_TRY { ------------------ | | 49| 44.7k|#define IMMER_TRY try ------------------ 474| 44.7k| new (p->leaf()) T(std::forward(x)); 475| 44.7k| } 476| 44.7k| 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| 44.7k| return p; 481| 44.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13do_copy_innerEPSB_SC_j: 558| 4.98M| { 559| 4.98M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 4.98M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 4.98M, False: 0] ------------------ 560| 4.98M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 4.98M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 4.98M, False: 0] ------------------ 561| 4.98M| auto p = src->inner(); 562| 4.98M| inc_nodes(p, n); 563| 4.98M| std::copy(p, p + n, dst->inner()); 564| 4.98M| return dst; 565| 4.98M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9inc_nodesEPPSB_j: 970| 39.3M| { 971| 175M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 136M, False: 39.3M] ------------------ 972| 136M| refs(*i).inc(); 973| 39.3M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14copy_inner_r_nEjPSB_j: 588| 471k| { 589| 471k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 471k, False: 0] ------------------ 590| 471k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 471k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 471k, False: 0] ------------------ 591| 471k| auto dst = make_inner_r_n(allocn); 592| 471k| return do_copy_inner_r(dst, src, n); 593| 471k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE15do_copy_inner_rEPSB_SC_j: 610| 491k| { 611| 491k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 491k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 491k, False: 0] ------------------ 612| 491k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 491k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 491k, False: 0] ------------------ 613| 491k| auto src_r = src->relaxed(); 614| 491k| auto dst_r = dst->relaxed(); 615| 491k| inc_nodes(src->inner(), n); 616| 491k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 491k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 491k| dst_r->d.count = n; 619| 491k| return dst; 620| 491k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14make_inner_r_nEj: 243| 46.1M| { 244| 46.1M| assert(n <= branches); ------------------ | Branch (244:9): [True: 46.1M, False: 0] ------------------ 245| 46.1M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 46.1M| auto mr = static_cast(nullptr); 247| 46.1M| if (embed_relaxed) { ------------------ | Branch (247:13): [Folded, False: 46.1M] ------------------ 248| 0| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 46.1M| } else { 250| 46.1M| IMMER_TRY { ------------------ | | 49| 46.1M|#define IMMER_TRY try ------------------ 251| 46.1M| mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{}); 252| 46.1M| } 253| 46.1M| 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.1M| } 258| 46.1M| auto p = new (mp) node_t; 259| 46.1M| auto r = new (mr) relaxed_t; 260| 46.1M| r->d.count = 0; 261| 46.1M| p->impl.d.data.inner.relaxed = r; 262| 46.1M|#if IMMER_TAGGED_NODE 263| 46.1M| p->impl.d.kind = node_t::kind_t::inner; 264| 46.1M|#endif 265| 46.1M| return p; 266| 46.1M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9make_pathEjPSB_: 498| 1.28M| { 499| 1.28M| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 1.28M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 1.28M, False: 0] ------------------ 500| 1.28M| if (shift == endshift) ------------------ | Branch (500:13): [True: 1.10M, False: 187k] ------------------ 501| 1.10M| return node; 502| 187k| else { 503| 187k| auto n = node_t::make_inner_n(1); 504| 187k| IMMER_TRY { ------------------ | | 49| 187k|#define IMMER_TRY try ------------------ 505| 187k| n->inner()[0] = make_path(shift - B, node); 506| 187k| } 507| 187k| 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| 187k| return n; 512| 187k| } 513| 1.28M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12make_inner_nEj: 224| 5.18M| { 225| 5.18M| assert(n <= branches); ------------------ | Branch (225:9): [True: 5.18M, False: 0] ------------------ 226| 5.18M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 5.18M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 5.18M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9copy_leafEPSB_j: 666| 207k| { 667| 207k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 207k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 207k, False: 0] ------------------ 668| 207k| auto dst = make_leaf_n(n); 669| 207k| IMMER_TRY { ------------------ | | 49| 207k|#define IMMER_TRY try ------------------ 670| 207k| detail::uninitialized_copy( 671| 207k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 207k| } 673| 207k| 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| 207k| return dst; 678| 207k| } _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| 343k| { 270| 343k| return static_if( 271| 343k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 343k| [&](auto) { 273| 343k| auto p = 274| 343k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 343k| assert(r->d.count >= n); 276| 343k| node_t::refs(r).inc(); 277| 343k| p->impl.d.data.inner.relaxed = r; 278| 343k|#if IMMER_TAGGED_NODE 279| 343k| p->impl.d.kind = node_t::kind_t::inner; 280| 343k|#endif 281| 343k| return p; 282| 343k| }); 283| 343k| } _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| 343k| [&](auto) { 273| 343k| auto p = 274| 343k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 343k| assert(r->d.count >= n); ------------------ | Branch (275:17): [True: 343k, False: 0] ------------------ 276| 343k| node_t::refs(r).inc(); 277| 343k| p->impl.d.data.inner.relaxed = r; 278| 343k|#if IMMER_TAGGED_NODE 279| 343k| p->impl.d.kind = node_t::kind_t::inner; 280| 343k|#endif 281| 343k| return p; 282| 343k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE24do_copy_inner_replace_srEPSB_SC_jjSC_: 652| 343k| { 653| 343k| if (embed_relaxed) ------------------ | Branch (653:13): [Folded, False: 343k] ------------------ 654| 0| return do_copy_inner_replace_r(dst, src, n, offset, child); 655| 343k| else { 656| 343k| auto p = src->inner(); 657| 343k| inc_nodes(p, offset); 658| 343k| inc_nodes(p + offset + 1, n - offset - 1); 659| 343k| std::copy(p, p + n, dst->inner()); 660| 343k| dst->inner()[offset] = child; 661| 343k| return dst; 662| 343k| } 663| 343k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 41.8k| { 570| 41.8k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 41.8k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 41.8k, False: 0] ------------------ 571| 41.8k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 41.8k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 41.8k, False: 0] ------------------ 572| 41.8k| auto p = src->inner(); 573| 41.8k| inc_nodes(p, offset); 574| 41.8k| inc_nodes(p + offset + 1, n - offset - 1); 575| 41.8k| std::copy(p, p + n, dst->inner()); 576| 41.8k| dst->inner()[offset] = child; 577| 41.8k| return dst; 578| 41.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12copy_inner_nEjPSB_j: 543| 8.51k| { 544| 8.51k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 8.51k, False: 0] ------------------ 545| 8.51k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 8.51k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 8.51k, False: 0] ------------------ 546| 8.51k| auto dst = make_inner_n(allocn); 547| 8.51k| return do_copy_inner(dst, src, n); 548| 8.51k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12copy_inner_rEPSB_j: 581| 3.88k| { 582| 3.88k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 3.88k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 3.88k, False: 0] ------------------ 583| 3.88k| auto dst = make_inner_r_n(n); 584| 3.88k| return do_copy_inner_r(dst, src, n); 585| 3.88k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13compute_shiftEv: 977| 13.7M| { 978| 13.7M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 1.03M, False: 12.6M] ------------------ 979| 1.03M| return endshift; 980| 12.6M| else 981| 12.6M| return B + inner()[0]->compute_shift(); 982| 13.7M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5checkEjm: 986| 1.03M| { 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.03M| return true; 1023| 1.03M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9copy_leafEPSB_jj: 778| 918k| { 779| 918k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 918k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 918k, False: 0] ------------------ 780| 918k| auto dst = make_leaf_n(last - idx); 781| 918k| IMMER_TRY { ------------------ | | 49| 918k|#define IMMER_TRY try ------------------ 782| 918k| detail::uninitialized_copy( 783| 918k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 918k| } 785| 918k| 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| 918k| return dst; 790| 918k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9copy_leafEPSB_jSC_j: 712| 935k| { 713| 935k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 935k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 935k, False: 0] ------------------ 714| 935k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 935k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 935k, False: 0] ------------------ 715| 935k| auto dst = make_leaf_n(n1 + n2); 716| 935k| IMMER_TRY { ------------------ | | 49| 935k|#define IMMER_TRY try ------------------ 717| 935k| detail::uninitialized_copy( 718| 935k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 935k| } 720| 935k| 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| 935k| IMMER_TRY { ------------------ | | 49| 935k|#define IMMER_TRY try ------------------ 725| 935k| detail::uninitialized_copy( 726| 935k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 935k| } 728| 935k| 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| 935k| return dst; 734| 935k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 2.96M| { 871| 2.96M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 2.79M, False: 176k] | Branch (871:39): [True: 0, False: 176k] ------------------ 872| 2.96M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5owneeEPKSB_: 207| 176k| { 208| 176k| return get(x->impl); 209| 176k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 42.2k| { 682| 42.2k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 42.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 42.2k, False: 0] ------------------ 683| 42.2k| auto dst = make_leaf_e(e); 684| 42.2k| IMMER_TRY { ------------------ | | 49| 42.2k|#define IMMER_TRY try ------------------ 685| 42.2k| detail::uninitialized_copy( 686| 42.2k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 42.2k| } 688| 42.2k| 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.2k| return dst; 693| 42.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 410k| { 349| 410k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 410k| ownee(p) = e; 351| 410k|#if IMMER_TAGGED_NODE 352| 410k| p->impl.d.kind = node_t::kind_t::leaf; 353| 410k|#endif 354| 410k| return p; 355| 410k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 7.00k| { 486| 7.00k| auto p = make_leaf_e(e); 487| 7.00k| IMMER_TRY { ------------------ | | 49| 7.00k|#define IMMER_TRY try ------------------ 488| 7.00k| new (p->leaf()) T(std::forward(x)); 489| 7.00k| } 490| 7.00k| 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| 7.00k| return p; 495| 7.00k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 204k| { 931| 204k| auto src_r = relaxed(); 932| 204k| return static_if( 933| 204k| [&](auto) { return src_r; }, 934| 204k| [&](auto) { 935| 204k| if (node_t::refs(src_r).unique() || 936| 204k| node_t::ownee(src_r).can_mutate(e)) 937| 204k| return src_r; 938| 204k| else { 939| 204k| auto dst_r = 940| 204k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 204k| if (src_r) { 942| 204k| std::copy( 943| 204k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 204k| if (node_t::refs(src_r).dec()) 945| 204k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 204k| src_r); 947| 204k| } 948| 204k| dst_r->d.count = n; 949| 204k| node_t::ownee(dst_r) = e; 950| 204k| return impl.d.data.inner.relaxed = dst_r; 951| 204k| } 952| 204k| }); 953| 204k| } _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| 204k| [&](auto) { 935| 204k| if (node_t::refs(src_r).unique() || ------------------ | Branch (935:21): [True: 198k, False: 5.51k] ------------------ 936| 5.51k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (936:21): [True: 0, False: 5.51k] ------------------ 937| 198k| return src_r; 938| 5.51k| else { 939| 5.51k| auto dst_r = 940| 5.51k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 5.51k| if (src_r) { ------------------ | Branch (941:25): [True: 5.51k, False: 0] ------------------ 942| 5.51k| std::copy( 943| 5.51k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 5.51k| if (node_t::refs(src_r).dec()) ------------------ | Branch (944:29): [True: 0, False: 5.51k] ------------------ 945| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 0| src_r); 947| 5.51k| } 948| 5.51k| dst_r->d.count = n; 949| 5.51k| node_t::ownee(dst_r) = e; 950| 5.51k| return impl.d.data.inner.relaxed = dst_r; 951| 5.51k| } 952| 204k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14copy_inner_r_eENS9_5applyIS6_E4type4editEPSB_j: 596| 15.6k| { 597| 15.6k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 15.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (597:9): [True: 15.6k, False: 0] ------------------ 598| 15.6k| auto dst = make_inner_r_e(e); 599| 15.6k| return do_copy_inner_r(dst, src, n); 600| 15.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 286| 167k| { 287| 167k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 167k| auto mr = static_cast(nullptr); 289| 167k| if (embed_relaxed) { ------------------ | Branch (289:13): [Folded, False: 167k] ------------------ 290| 0| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 167k| } else { 292| 167k| IMMER_TRY { ------------------ | | 49| 167k|#define IMMER_TRY try ------------------ 293| 167k| mr = heap::allocate(max_sizeof_relaxed, norefs_tag{}); 294| 167k| } 295| 167k| IMMER_CATCH (...) { 296| 0| heap::deallocate(max_sizeof_inner_r, mp); 297| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 298| 0| } 299| 167k| } 300| 167k| auto p = new (mp) node_t; 301| 167k| auto r = new (mr) relaxed_t; 302| 167k| ownee(p) = e; 303| 167k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 167k| r->d.count = 0; 305| 167k| p->impl.d.data.inner.relaxed = r; 306| 167k|#if IMMER_TAGGED_NODE 307| 167k| p->impl.d.kind = node_t::kind_t::inner; 308| 167k|#endif 309| 167k| return p; 310| 167k| } _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| 167k| 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| 401k| { 517| 401k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 401k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 401k, False: 0] ------------------ 518| 401k| if (shift == endshift) ------------------ | Branch (518:13): [True: 347k, False: 54.3k] ------------------ 519| 347k| return node; 520| 54.3k| else { 521| 54.3k| auto n = node_t::make_inner_e(e); 522| 54.3k| IMMER_TRY { ------------------ | | 49| 54.3k|#define IMMER_TRY try ------------------ 523| 54.3k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 54.3k| } 525| 54.3k| 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| 54.3k| return n; 530| 54.3k| } 531| 401k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 84.8k| { 232| 84.8k| auto m = heap::allocate(max_sizeof_inner); 233| 84.8k| auto p = new (m) node_t; 234| 84.8k| ownee(p) = e; 235| 84.8k| p->impl.d.data.inner.relaxed = nullptr; 236| 84.8k|#if IMMER_TAGGED_NODE 237| 84.8k| p->impl.d.kind = node_t::kind_t::inner; 238| 84.8k|#endif 239| 84.8k| return p; 240| 84.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 21.3k| { 552| 21.3k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 21.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 21.3k, False: 0] ------------------ 553| 21.3k| auto dst = make_inner_e(e); 554| 21.3k| return do_copy_inner(dst, src, n); 555| 21.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 21.6k| { 604| 21.6k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 21.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 21.6k, False: 0] ------------------ 605| 21.6k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 21.6k| return do_copy_inner_sr(dst, src, n); 607| 21.6k| } _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.6k| { 314| 21.6k| return static_if( 315| 21.6k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 21.6k| [&](auto) { 317| 21.6k| auto p = 318| 21.6k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 21.6k| node_t::refs(r).inc(); 320| 21.6k| p->impl.d.data.inner.relaxed = r; 321| 21.6k| node_t::ownee(p) = e; 322| 21.6k|#if IMMER_TAGGED_NODE 323| 21.6k| p->impl.d.kind = node_t::kind_t::inner; 324| 21.6k|#endif 325| 21.6k| return p; 326| 21.6k| }); 327| 21.6k| } _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.6k| [&](auto) { 317| 21.6k| auto p = 318| 21.6k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 21.6k| node_t::refs(r).inc(); 320| 21.6k| p->impl.d.data.inner.relaxed = r; 321| 21.6k| node_t::ownee(p) = e; 322| 21.6k|#if IMMER_TAGGED_NODE 323| 21.6k| p->impl.d.kind = node_t::kind_t::inner; 324| 21.6k|#endif 325| 21.6k| return p; 326| 21.6k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE16do_copy_inner_srEPSB_SC_j: 640| 21.6k| { 641| 21.6k| if (embed_relaxed) ------------------ | Branch (641:13): [Folded, False: 21.6k] ------------------ 642| 0| return do_copy_inner_r(dst, src, n); 643| 21.6k| else { 644| 21.6k| inc_nodes(src->inner(), n); 645| 21.6k| std::copy(src->inner(), src->inner() + n, dst->inner()); 646| 21.6k| return dst; 647| 21.6k| } 648| 21.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 361k| { 764| 361k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 361k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 361k, False: 0] ------------------ 765| 361k| auto dst = make_leaf_e(e); 766| 361k| IMMER_TRY { ------------------ | | 49| 361k|#define IMMER_TRY try ------------------ 767| 361k| detail::uninitialized_copy( 768| 361k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 361k| } 770| 361k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 361k| return dst; 775| 361k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 238k| { 878| 238k| auto src_r = relaxed(); 879| 238k| return static_if( 880| 238k| [&](auto) { return src_r; }, 881| 238k| [&](auto) { 882| 238k| if (node_t::refs(src_r).unique() || 883| 238k| node_t::ownee(src_r).can_mutate(e)) 884| 238k| return src_r; 885| 238k| else { 886| 238k| auto dst_r = impl.d.data.inner.relaxed = 887| 238k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 238k| if (src_r) { 889| 238k| auto n = dst_r->d.count = src_r->d.count; 890| 238k| std::copy( 891| 238k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 238k| if (node_t::refs(src_r).dec()) 893| 238k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 238k| src_r); 895| 238k| } 896| 238k| node_t::ownee(dst_r) = e; 897| 238k| return dst_r; 898| 238k| } 899| 238k| }); 900| 238k| } _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| 238k| [&](auto) { 882| 238k| if (node_t::refs(src_r).unique() || ------------------ | Branch (882:21): [True: 215k, False: 23.3k] ------------------ 883| 23.3k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (883:21): [True: 0, False: 23.3k] ------------------ 884| 215k| return src_r; 885| 23.3k| else { 886| 23.3k| auto dst_r = impl.d.data.inner.relaxed = 887| 23.3k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 23.3k| if (src_r) { ------------------ | Branch (888:25): [True: 23.3k, False: 0] ------------------ 889| 23.3k| auto n = dst_r->d.count = src_r->d.count; 890| 23.3k| std::copy( 891| 23.3k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 23.3k| if (node_t::refs(src_r).dec()) ------------------ | Branch (892:29): [True: 0, False: 23.3k] ------------------ 893| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 0| src_r); 895| 23.3k| } 896| 23.3k| node_t::ownee(dst_r) = e; 897| 23.3k| return dst_r; 898| 23.3k| } 899| 238k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j: 738| 238| { 739| 238| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 238|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 238, False: 0] ------------------ 740| 238| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 238|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 238, False: 0] ------------------ 741| 238| auto dst = make_leaf_e(e); 742| 238| IMMER_TRY { ------------------ | | 49| 238|#define IMMER_TRY try ------------------ 743| 238| detail::uninitialized_copy( 744| 238| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 238| } 746| 238| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 238| IMMER_TRY { ------------------ | | 49| 238|#define IMMER_TRY try ------------------ 751| 238| detail::uninitialized_copy( 752| 238| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 238| } 754| 238| 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| 238| return dst; 760| 238| } _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: 192M] ------------------ 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.7M| { 535| 16.7M| using node_t = node_type; 536| 16.7M| auto node = p.node(); 537| 16.7M| if (node->dec()) { ------------------ | Branch (537:13): [True: 1.13M, False: 15.5M] ------------------ 538| 1.13M| p.each(this_t{}); 539| 1.13M| node_t::delete_inner(node, p.count()); 540| 1.13M| } 541| 16.7M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 4.23M| { 546| 4.23M| using node_t = node_type; 547| 4.23M| auto node = p.node(); 548| 4.23M| if (node->dec()) { ------------------ | Branch (548:13): [True: 609k, False: 3.62M] ------------------ 549| 609k| node_t::delete_leaf(node, p.count()); 550| 609k| } 551| 4.23M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.09M| { 546| 1.09M| using node_t = node_type; 547| 1.09M| auto node = p.node(); 548| 1.09M| if (node->dec()) { ------------------ | Branch (548:13): [True: 614k, False: 477k] ------------------ 549| 614k| node_t::delete_leaf(node, p.count()); 550| 614k| } 551| 1.09M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 9.34M| { 535| 9.34M| using node_t = node_type; 536| 9.34M| auto node = p.node(); 537| 9.34M| if (node->dec()) { ------------------ | Branch (537:13): [True: 102k, False: 9.24M] ------------------ 538| 102k| p.each(this_t{}); 539| 102k| node_t::delete_inner(node, p.count()); 540| 102k| } 541| 9.34M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 4.07M| { 535| 4.07M| using node_t = node_type; 536| 4.07M| auto node = p.node(); 537| 4.07M| if (node->dec()) { ------------------ | Branch (537:13): [True: 4.02M, False: 54.4k] ------------------ 538| 4.02M| p.each(this_t{}); 539| 4.02M| node_t::delete_inner(node, p.count()); 540| 4.02M| } 541| 4.07M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 2.96M| { 535| 2.96M| using node_t = node_type; 536| 2.96M| auto node = p.node(); 537| 2.96M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 2.96M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 2.96M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 81.2M| { 546| 81.2M| using node_t = node_type; 547| 81.2M| auto node = p.node(); 548| 81.2M| if (node->dec()) { ------------------ | Branch (548:13): [True: 1.74M, False: 79.4M] ------------------ 549| 1.74M| node_t::delete_leaf(node, p.count()); 550| 1.74M| } 551| 81.2M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 2.77M| { 546| 2.77M| using node_t = node_type; 547| 2.77M| auto node = p.node(); 548| 2.77M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 2.77M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 2.77M| } _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| 473k| { 792| 473k| auto level = pos.shift(); 793| 473k| auto idx = pos.count() - 1; 794| 473k| auto children = pos.size(idx); 795| 473k| auto new_idx = 796| 473k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 15.5k, False: 458k] | Branch (796:47): [True: 758, False: 457k] ------------------ 797| 473k| auto new_child = static_cast(nullptr); 798| 473k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 4.20k, False: 469k] ------------------ 799| 4.20k| return nullptr; 800| 469k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 457k, False: 12.0k] ------------------ 801| 457k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 457k| if (!new_child) { ------------------ | Branch (802:17): [True: 5.19k, False: 452k] ------------------ 803| 5.19k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 1.89k, False: 3.29k] ------------------ 804| 1.89k| new_child = node_t::make_path(level - B, tail); 805| 3.29k| else 806| 3.29k| return nullptr; 807| 5.19k| } 808| 457k| } else 809| 12.0k| new_child = node_t::make_path(level - B, tail); 810| 466k| IMMER_TRY { ------------------ | | 49| 466k|#define IMMER_TRY try ------------------ 811| 466k| auto count = new_idx + 1; 812| 466k| auto new_parent = 813| 466k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 466k| auto new_relaxed = new_parent->relaxed(); 815| 466k| new_parent->inner()[new_idx] = new_child; 816| 466k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 466k| new_relaxed->d.count = count; 818| 466k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 466k, False: 0] ------------------ 819| 466k| return new_parent; 820| 466k| } 821| 466k| 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| 466k| } _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| 302k| { 835| 302k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 302k, False: 0] ------------------ 836| 302k| auto idx = pos.index(pos.size() - 1); 837| 302k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 302k| auto count = new_idx + 1; 839| 302k| auto new_parent = node_t::make_inner_n(count); 840| 302k| IMMER_TRY { ------------------ | | 49| 302k|#define IMMER_TRY try ------------------ 841| 302k| new_parent->inner()[new_idx] = 842| 302k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 291k, False: 10.8k] ------------------ 843| | /* otherwise */ 844| 302k| : node_t::make_path(pos.shift() - B, tail); 845| 302k| } 846| 302k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 302k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 302k| } _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.88M| { 835| 3.88M| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 3.88M, False: 0] ------------------ 836| 3.88M| auto idx = pos.index(pos.size() - 1); 837| 3.88M| auto new_idx = pos.index(pos.size() + branches - 1); 838| 3.88M| auto count = new_idx + 1; 839| 3.88M| auto new_parent = node_t::make_inner_n(count); 840| 3.88M| IMMER_TRY { ------------------ | | 49| 3.88M|#define IMMER_TRY try ------------------ 841| 3.88M| new_parent->inner()[new_idx] = 842| 3.88M| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 2.88M, False: 1.00M] ------------------ 843| | /* otherwise */ 844| 3.88M| : node_t::make_path(pos.shift() - B, tail); 845| 3.88M| } 846| 3.88M| 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.88M| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 3.88M| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEvPT_jm: 562| 565|{ 563| 565| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 565|} _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| 755k| { 835| 755k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 755k, False: 0] ------------------ 836| 755k| auto idx = pos.index(pos.size() - 1); 837| 755k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 755k| auto count = new_idx + 1; 839| 755k| auto new_parent = node_t::make_inner_n(count); 840| 755k| IMMER_TRY { ------------------ | | 49| 755k|#define IMMER_TRY try ------------------ 841| 755k| new_parent->inner()[new_idx] = 842| 755k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 712k, False: 43.6k] ------------------ 843| | /* otherwise */ 844| 755k| : node_t::make_path(pos.shift() - B, tail); 845| 755k| } 846| 755k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 755k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 755k| } 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| 171k| { 503| 171k| auto offset = pos.index(idx); 504| 171k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 171k| IMMER_TRY { ------------------ | | 49| 171k|#define IMMER_TRY try ------------------ 506| 171k| node->leaf()[offset] = 507| 171k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 171k| return node; 509| 171k| } 510| 171k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 171k| } 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| 343k| { 467| 343k| auto offset = pos.index(idx); 468| 343k| auto count = pos.count(); 469| 343k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 343k| IMMER_TRY { ------------------ | | 49| 343k|#define IMMER_TRY try ------------------ 471| 343k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 343k| node_t::do_copy_inner_replace_sr( 473| 343k| node, pos.node(), count, offset, child); 474| 343k| return node; 475| 343k| } 476| 343k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 343k| } 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.2k| { 485| 24.2k| auto offset = pos.index(idx); 486| 24.2k| auto count = pos.count(); 487| 24.2k| auto node = node_t::make_inner_n(count); 488| 24.2k| IMMER_TRY { ------------------ | | 49| 24.2k|#define IMMER_TRY try ------------------ 489| 24.2k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 24.2k| node_t::do_copy_inner_replace( 491| 24.2k| node, pos.node(), count, offset, child); 492| 24.2k| return node; 493| 24.2k| } 494| 24.2k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 24.2k| } 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.2k| { 503| 16.2k| auto offset = pos.index(idx); 504| 16.2k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 16.2k| IMMER_TRY { ------------------ | | 49| 16.2k|#define IMMER_TRY try ------------------ 506| 16.2k| node->leaf()[offset] = 507| 16.2k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 16.2k| return node; 509| 16.2k| } 510| 16.2k| 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.2k| } 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.7k| { 485| 14.7k| auto offset = pos.index(idx); 486| 14.7k| auto count = pos.count(); 487| 14.7k| auto node = node_t::make_inner_n(count); 488| 14.7k| IMMER_TRY { ------------------ | | 49| 14.7k|#define IMMER_TRY try ------------------ 489| 14.7k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 14.7k| node_t::do_copy_inner_replace( 491| 14.7k| node, pos.node(), count, offset, child); 492| 14.7k| return node; 493| 14.7k| } 494| 14.7k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 14.7k| } 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| 7.94k| { 503| 7.94k| auto offset = pos.index(idx); 504| 7.94k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 7.94k| IMMER_TRY { ------------------ | | 49| 7.94k|#define IMMER_TRY try ------------------ 506| 7.94k| node->leaf()[offset] = 507| 7.94k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 7.94k| return node; 509| 7.94k| } 510| 7.94k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 7.94k| } 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.87k| { 485| 2.87k| auto offset = pos.index(idx); 486| 2.87k| auto count = pos.count(); 487| 2.87k| auto node = node_t::make_inner_n(count); 488| 2.87k| IMMER_TRY { ------------------ | | 49| 2.87k|#define IMMER_TRY try ------------------ 489| 2.87k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 2.87k| node_t::do_copy_inner_replace( 491| 2.87k| node, pos.node(), count, offset, child); 492| 2.87k| return node; 493| 2.87k| } 494| 2.87k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 2.87k| } _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| 29.4k| { 1097| 29.4k| auto idx = pos.index(last); 1098| 29.4k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 29.4k, Folded] | Branch (1098:25): [True: 22.5k, False: 6.92k] ------------------ 1099| 22.5k| return pos.towards_oh(this_t{}, last, idx); 1100| 22.5k| } else { 1101| 6.92k| using std::get; 1102| 6.92k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 6.92k| auto next = get<1>(subs); 1104| 6.92k| auto ts = get<2>(subs); 1105| 6.92k| auto tail = get<3>(subs); 1106| 6.92k| IMMER_TRY { ------------------ | | 49| 6.92k|#define IMMER_TRY try ------------------ 1107| 6.92k| if (next) { ------------------ | Branch (1107:21): [True: 4.46k, False: 2.46k] ------------------ 1108| 4.46k| auto count = idx + 1; 1109| 4.46k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 4.46k| auto newr = newn->relaxed(); 1111| 4.46k| newn->inner()[idx] = next; 1112| 4.46k| newr->d.sizes[idx] = last + 1 - ts; 1113| 4.46k| newr->d.count = count; 1114| 4.46k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 4.46k, False: 0] ------------------ 1115| 4.46k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 4.46k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 2.46k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 2.46k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 2.46k, Folded] | Branch (1118:40): [True: 1.73k, False: 728] | Branch (1118:52): [True: 1.16k, False: 563] ------------------ 1119| 1.16k| auto newn = pos.node()->inner()[0]; 1120| 1.16k| return std::make_tuple( 1121| 1.16k| pos.shift() - B, newn->inc(), ts, tail); 1122| 1.29k| } else { 1123| 1.29k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.29k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.29k| } 1126| 6.92k| } 1127| 6.92k| 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| 6.92k| } 1138| 29.4k| } _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.62k| { 1182| 1.62k| auto old_tail_size = pos.count(); 1183| 1.62k| auto new_tail_size = pos.index(last) + 1; 1184| 1.62k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 356, False: 1.27k] ------------------ 1185| 1.62k| ? pos.node()->inc() 1186| 1.62k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.62k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.62k| } _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.40k| { 1182| 4.40k| auto old_tail_size = pos.count(); 1183| 4.40k| auto new_tail_size = pos.index(last) + 1; 1184| 4.40k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.33k, False: 3.07k] ------------------ 1185| 4.40k| ? pos.node()->inc() 1186| 4.40k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 4.40k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 4.40k| } _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.84k| { 1097| 4.84k| auto idx = pos.index(last); 1098| 4.84k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 4.84k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 4.84k| } else { 1101| 4.84k| using std::get; 1102| 4.84k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 4.84k| auto next = get<1>(subs); 1104| 4.84k| auto ts = get<2>(subs); 1105| 4.84k| auto tail = get<3>(subs); 1106| 4.84k| IMMER_TRY { ------------------ | | 49| 4.84k|#define IMMER_TRY try ------------------ 1107| 4.84k| if (next) { ------------------ | Branch (1107:21): [True: 1.18k, False: 3.66k] ------------------ 1108| 1.18k| auto count = idx + 1; 1109| 1.18k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 1.18k| auto newr = newn->relaxed(); 1111| 1.18k| newn->inner()[idx] = next; 1112| 1.18k| newr->d.sizes[idx] = last + 1 - ts; 1113| 1.18k| newr->d.count = count; 1114| 1.18k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 1.18k, False: 0] ------------------ 1115| 1.18k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 3.66k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 1.06k, False: 2.59k] ------------------ 1117| 1.06k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 2.59k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 2.59k] | 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.59k| } else { 1123| 2.59k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 2.59k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 2.59k| } 1126| 4.84k| } 1127| 4.84k| 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.84k| } 1138| 4.84k| } _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.52k| { 1143| 2.52k| auto idx = pos.index(last); 1144| 2.52k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.52k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.52k| } else { 1147| 2.52k| using std::get; 1148| 2.52k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.52k| auto next = get<1>(subs); 1150| 2.52k| auto ts = get<2>(subs); 1151| 2.52k| auto tail = get<3>(subs); 1152| 2.52k| IMMER_TRY { ------------------ | | 49| 2.52k|#define IMMER_TRY try ------------------ 1153| 2.52k| if (next) { ------------------ | Branch (1153:21): [True: 1.34k, False: 1.18k] ------------------ 1154| 1.34k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.34k| newn->inner()[idx] = next; 1156| 1.34k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.34k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 657, False: 528] ------------------ 1158| 657| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 657| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 528] | 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| 528| } else { 1164| 528| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 528| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 528| } 1167| 2.52k| } 1168| 2.52k| 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.52k| } 1177| 2.52k| } _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.84k| { 1182| 3.84k| auto old_tail_size = pos.count(); 1183| 3.84k| auto new_tail_size = pos.index(last) + 1; 1184| 3.84k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.49k, False: 2.35k] ------------------ 1185| 3.84k| ? pos.node()->inc() 1186| 3.84k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 3.84k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 3.84k| } _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.00k| { 1143| 2.00k| auto idx = pos.index(last); 1144| 2.00k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.00k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.00k| } else { 1147| 2.00k| using std::get; 1148| 2.00k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.00k| auto next = get<1>(subs); 1150| 2.00k| auto ts = get<2>(subs); 1151| 2.00k| auto tail = get<3>(subs); 1152| 2.00k| IMMER_TRY { ------------------ | | 49| 2.00k|#define IMMER_TRY try ------------------ 1153| 2.00k| if (next) { ------------------ | Branch (1153:21): [True: 211, False: 1.79k] ------------------ 1154| 211| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 211| newn->inner()[idx] = next; 1156| 211| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.79k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 430, False: 1.36k] ------------------ 1158| 430| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.36k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.36k] | 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.36k| } else { 1164| 1.36k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.36k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.36k| } 1167| 2.00k| } 1168| 2.00k| 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.00k| } 1177| 2.00k| } _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| 3.01k| { 1143| 3.01k| auto idx = pos.index(last); 1144| 3.01k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.01k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 3.01k| } else { 1147| 3.01k| using std::get; 1148| 3.01k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.01k| auto next = get<1>(subs); 1150| 3.01k| auto ts = get<2>(subs); 1151| 3.01k| auto tail = get<3>(subs); 1152| 3.01k| IMMER_TRY { ------------------ | | 49| 3.01k|#define IMMER_TRY try ------------------ 1153| 3.01k| if (next) { ------------------ | Branch (1153:21): [True: 1.03k, False: 1.97k] ------------------ 1154| 1.03k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.03k| newn->inner()[idx] = next; 1156| 1.03k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.97k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.01k, False: 960] ------------------ 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: 960] | 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| 960| } else { 1164| 960| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 960| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 960| } 1167| 3.01k| } 1168| 3.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| 3.01k| } 1177| 3.01k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEvPT_j: 556| 39.1k|{ 557| 39.1k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 39.1k|} _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.35k, False: 3.01k] ------------------ 1145| 3.35k| return pos.towards_oh(this_t{}, last, idx); 1146| 3.35k| } else { 1147| 3.01k| using std::get; 1148| 3.01k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.01k| auto next = get<1>(subs); 1150| 3.01k| auto ts = get<2>(subs); 1151| 3.01k| auto tail = get<3>(subs); 1152| 3.01k| IMMER_TRY { ------------------ | | 49| 3.01k|#define IMMER_TRY try ------------------ 1153| 3.01k| if (next) { ------------------ | Branch (1153:21): [True: 671, False: 2.34k] ------------------ 1154| 671| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 671| newn->inner()[idx] = next; 1156| 671| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.34k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.34k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.34k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.34k, Folded] | Branch (1159:40): [True: 1.95k, False: 388] | Branch (1159:52): [True: 847, False: 1.11k] ------------------ 1160| 847| auto newn = pos.node()->inner()[0]; 1161| 847| return std::make_tuple( 1162| 847| 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.01k| } 1168| 3.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| 3.01k| } 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: 620, False: 798] ------------------ 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.02k| { 1143| 2.02k| auto idx = pos.index(last); 1144| 2.02k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 2.02k, Folded] | Branch (1144:25): [True: 929, False: 1.10k] ------------------ 1145| 929| return pos.towards_oh(this_t{}, last, idx); 1146| 1.10k| } else { 1147| 1.10k| using std::get; 1148| 1.10k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 1.10k| auto next = get<1>(subs); 1150| 1.10k| auto ts = get<2>(subs); 1151| 1.10k| auto tail = get<3>(subs); 1152| 1.10k| IMMER_TRY { ------------------ | | 49| 1.10k|#define IMMER_TRY try ------------------ 1153| 1.10k| if (next) { ------------------ | Branch (1153:21): [True: 312, False: 788] ------------------ 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| 788| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 788] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 788| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 788, Folded] | Branch (1159:40): [True: 438, False: 350] | Branch (1159:52): [True: 201, False: 237] ------------------ 1160| 201| auto newn = pos.node()->inner()[0]; 1161| 201| return std::make_tuple( 1162| 201| pos.shift() - B, newn->inc(), ts, tail); 1163| 587| } else { 1164| 587| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 587| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 587| } 1167| 1.10k| } 1168| 1.10k| 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.10k| } 1177| 2.02k| } _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| 832| { 1182| 832| auto old_tail_size = pos.count(); 1183| 832| auto new_tail_size = pos.index(last) + 1; 1184| 832| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 418, False: 414] ------------------ 1185| 832| ? pos.node()->inc() 1186| 832| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 832| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 832| } _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| 17.2k| { 1415| 17.2k| auto idx = pos.subindex(first); 1416| 17.2k| auto count = pos.count(); 1417| 17.2k| auto left_size = pos.size_before(idx); 1418| 17.2k| auto child_size = pos.size_sbh(idx, left_size); 1419| 17.2k| auto dropped_size = first; 1420| 17.2k| auto child_dropped_size = dropped_size - left_size; 1421| 17.2k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 17.2k, Folded] | Branch (1421:25): [True: 15.6k, False: 1.61k] | Branch (1421:45): [True: 3.06k, False: 12.6k] ------------------ 1422| 3.06k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 14.2k| } else { 1424| 14.2k| using std::get; 1425| 14.2k| auto n = pos.node(); 1426| 14.2k| auto newc = count - idx; 1427| 14.2k| auto newn = node_t::make_inner_r_n(newc); 1428| 14.2k| IMMER_TRY { ------------------ | | 49| 14.2k|#define IMMER_TRY try ------------------ 1429| 14.2k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 14.2k| auto newr = newn->relaxed(); 1431| 14.2k| newr->d.count = count - idx; 1432| 14.2k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 14.2k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 14.2k, False: 0] ------------------ 1434| 14.2k| pos.copy_sizes(idx + 1, 1435| 14.2k| newr->d.count - 1, 1436| 14.2k| newr->d.sizes[0], 1437| 14.2k| newr->d.sizes + 1); 1438| 14.2k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 14.2k, False: 0] ------------------ 1439| 14.2k| pos.size() - dropped_size); 1440| 14.2k| newn->inner()[0] = get<1>(subs); 1441| 14.2k| std::copy(n->inner() + idx + 1, 1442| 14.2k| n->inner() + count, 1443| 14.2k| newn->inner() + 1); 1444| 14.2k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 14.2k| return std::make_tuple(pos.shift(), newn); 1446| 14.2k| } 1447| 14.2k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 14.2k| } 1452| 17.2k| } _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| 13.2k| { 1457| 13.2k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 13.2k| return std::make_tuple(0, n); 1459| 13.2k| } _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| 66.2k| { 1415| 66.2k| auto idx = pos.subindex(first); 1416| 66.2k| auto count = pos.count(); 1417| 66.2k| auto left_size = pos.size_before(idx); 1418| 66.2k| auto child_size = pos.size_sbh(idx, left_size); 1419| 66.2k| auto dropped_size = first; 1420| 66.2k| auto child_dropped_size = dropped_size - left_size; 1421| 66.2k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 66.2k] | 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| 66.2k| } else { 1424| 66.2k| using std::get; 1425| 66.2k| auto n = pos.node(); 1426| 66.2k| auto newc = count - idx; 1427| 66.2k| auto newn = node_t::make_inner_r_n(newc); 1428| 66.2k| IMMER_TRY { ------------------ | | 49| 66.2k|#define IMMER_TRY try ------------------ 1429| 66.2k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 66.2k| auto newr = newn->relaxed(); 1431| 66.2k| newr->d.count = count - idx; 1432| 66.2k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 66.2k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 66.2k, False: 0] ------------------ 1434| 66.2k| pos.copy_sizes(idx + 1, 1435| 66.2k| newr->d.count - 1, 1436| 66.2k| newr->d.sizes[0], 1437| 66.2k| newr->d.sizes + 1); 1438| 66.2k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 66.2k, False: 0] ------------------ 1439| 66.2k| pos.size() - dropped_size); 1440| 66.2k| newn->inner()[0] = get<1>(subs); 1441| 66.2k| std::copy(n->inner() + idx + 1, 1442| 66.2k| n->inner() + count, 1443| 66.2k| newn->inner() + 1); 1444| 66.2k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 66.2k| return std::make_tuple(pos.shift(), newn); 1446| 66.2k| } 1447| 66.2k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 66.2k| } 1452| 66.2k| } _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| 968| { 1415| 968| auto idx = pos.subindex(first); 1416| 968| auto count = pos.count(); 1417| 968| auto left_size = pos.size_before(idx); 1418| 968| auto child_size = pos.size_sbh(idx, left_size); 1419| 968| auto dropped_size = first; 1420| 968| auto child_dropped_size = dropped_size - left_size; 1421| 968| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 968] | 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| 968| } else { 1424| 968| using std::get; 1425| 968| auto n = pos.node(); 1426| 968| auto newc = count - idx; 1427| 968| auto newn = node_t::make_inner_r_n(newc); 1428| 968| IMMER_TRY { ------------------ | | 49| 968|#define IMMER_TRY try ------------------ 1429| 968| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 968| auto newr = newn->relaxed(); 1431| 968| newr->d.count = count - idx; 1432| 968| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 968| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 968, False: 0] ------------------ 1434| 968| pos.copy_sizes(idx + 1, 1435| 968| newr->d.count - 1, 1436| 968| newr->d.sizes[0], 1437| 968| newr->d.sizes + 1); 1438| 968| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 968, False: 0] ------------------ 1439| 968| pos.size() - dropped_size); 1440| 968| newn->inner()[0] = get<1>(subs); 1441| 968| std::copy(n->inner() + idx + 1, 1442| 968| n->inner() + count, 1443| 968| newn->inner() + 1); 1444| 968| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 968| return std::make_tuple(pos.shift(), newn); 1446| 968| } 1447| 968| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 968| } 1452| 968| } _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.41k| { 1457| 7.41k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 7.41k| return std::make_tuple(0, n); 1459| 7.41k| } _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.06k| { 1415| 4.06k| auto idx = pos.subindex(first); 1416| 4.06k| auto count = pos.count(); 1417| 4.06k| auto left_size = pos.size_before(idx); 1418| 4.06k| auto child_size = pos.size_sbh(idx, left_size); 1419| 4.06k| auto dropped_size = first; 1420| 4.06k| auto child_dropped_size = dropped_size - left_size; 1421| 4.06k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 4.06k] | 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.06k| } else { 1424| 4.06k| using std::get; 1425| 4.06k| auto n = pos.node(); 1426| 4.06k| auto newc = count - idx; 1427| 4.06k| auto newn = node_t::make_inner_r_n(newc); 1428| 4.06k| IMMER_TRY { ------------------ | | 49| 4.06k|#define IMMER_TRY try ------------------ 1429| 4.06k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 4.06k| auto newr = newn->relaxed(); 1431| 4.06k| newr->d.count = count - idx; 1432| 4.06k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 4.06k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 4.06k, False: 0] ------------------ 1434| 4.06k| pos.copy_sizes(idx + 1, 1435| 4.06k| newr->d.count - 1, 1436| 4.06k| newr->d.sizes[0], 1437| 4.06k| newr->d.sizes + 1); 1438| 4.06k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 4.06k, False: 0] ------------------ 1439| 4.06k| pos.size() - dropped_size); 1440| 4.06k| newn->inner()[0] = get<1>(subs); 1441| 4.06k| std::copy(n->inner() + idx + 1, 1442| 4.06k| n->inner() + count, 1443| 4.06k| newn->inner() + 1); 1444| 4.06k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 4.06k| return std::make_tuple(pos.shift(), newn); 1446| 4.06k| } 1447| 4.06k| 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.06k| } 1452| 4.06k| } _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.40k| { 1415| 8.40k| auto idx = pos.subindex(first); 1416| 8.40k| auto count = pos.count(); 1417| 8.40k| auto left_size = pos.size_before(idx); 1418| 8.40k| auto child_size = pos.size_sbh(idx, left_size); 1419| 8.40k| auto dropped_size = first; 1420| 8.40k| auto child_dropped_size = dropped_size - left_size; 1421| 8.40k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 8.40k, Folded] | Branch (1421:25): [True: 5.22k, False: 3.18k] | Branch (1421:45): [True: 2.59k, False: 2.62k] ------------------ 1422| 2.59k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 5.81k| } else { 1424| 5.81k| using std::get; 1425| 5.81k| auto n = pos.node(); 1426| 5.81k| auto newc = count - idx; 1427| 5.81k| auto newn = node_t::make_inner_r_n(newc); 1428| 5.81k| IMMER_TRY { ------------------ | | 49| 5.81k|#define IMMER_TRY try ------------------ 1429| 5.81k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 5.81k| auto newr = newn->relaxed(); 1431| 5.81k| newr->d.count = count - idx; 1432| 5.81k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 5.81k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 5.81k, False: 0] ------------------ 1434| 5.81k| pos.copy_sizes(idx + 1, 1435| 5.81k| newr->d.count - 1, 1436| 5.81k| newr->d.sizes[0], 1437| 5.81k| newr->d.sizes + 1); 1438| 5.81k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 5.81k, False: 0] ------------------ 1439| 5.81k| pos.size() - dropped_size); 1440| 5.81k| newn->inner()[0] = get<1>(subs); 1441| 5.81k| std::copy(n->inner() + idx + 1, 1442| 5.81k| n->inner() + count, 1443| 5.81k| newn->inner() + 1); 1444| 5.81k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 5.81k| return std::make_tuple(pos.shift(), newn); 1446| 5.81k| } 1447| 5.81k| 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.81k| } 1452| 8.40k| } _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| 636| { 1415| 636| auto idx = pos.subindex(first); 1416| 636| auto count = pos.count(); 1417| 636| auto left_size = pos.size_before(idx); 1418| 636| auto child_size = pos.size_sbh(idx, left_size); 1419| 636| auto dropped_size = first; 1420| 636| auto child_dropped_size = dropped_size - left_size; 1421| 636| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 636, Folded] | Branch (1421:25): [True: 325, False: 311] | Branch (1421:45): [True: 0, False: 325] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 636| } else { 1424| 636| using std::get; 1425| 636| auto n = pos.node(); 1426| 636| auto newc = count - idx; 1427| 636| auto newn = node_t::make_inner_r_n(newc); 1428| 636| IMMER_TRY { ------------------ | | 49| 636|#define IMMER_TRY try ------------------ 1429| 636| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 636| auto newr = newn->relaxed(); 1431| 636| newr->d.count = count - idx; 1432| 636| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 636| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 636, False: 0] ------------------ 1434| 636| pos.copy_sizes(idx + 1, 1435| 636| newr->d.count - 1, 1436| 636| newr->d.sizes[0], 1437| 636| newr->d.sizes + 1); 1438| 636| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 636, False: 0] ------------------ 1439| 636| pos.size() - dropped_size); 1440| 636| newn->inner()[0] = get<1>(subs); 1441| 636| std::copy(n->inner() + idx + 1, 1442| 636| n->inner() + count, 1443| 636| newn->inner() + 1); 1444| 636| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 636| return std::make_tuple(pos.shift(), newn); 1446| 636| } 1447| 636| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 636| } 1452| 636| } _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.30k| { 1959| 7.30k| return concat_inners(lpos, tpos, rpos); 1960| 7.30k| } _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.8k|{ 1873| 28.8k| auto lshift = lpos.shift(); 1874| 28.8k| auto rshift = rpos.shift(); 1875| 28.8k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 28.8k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 28.8k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 21.8k, False: 6.98k] ------------------ 1879| 21.8k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 21.8k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 21.8k| } else { 1882| 6.98k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 6.98k, False: 0] ------------------ 1883| 6.98k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 6.98k] | Branch (1883:9): [True: 6.98k, False: 0] | Branch (1883:9): [True: 6.98k, False: 0] ------------------ 1884| 6.98k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 6.98k| return concat_rebalance(lpos, cpos, rpos); 1886| 6.98k| } 1887| 28.8k|} _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.4M| { 1513| 17.4M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.39M, False: 16.0M] ------------------ 1514| 1.39M| auto s = size_t{}; 1515| 5.58M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 4.18M, False: 1.39M] ------------------ 1516| 4.18M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 4.18M| s = sizes_[i]; 1518| 4.18M| } 1519| 16.0M| } else { 1520| 44.0M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 28.0M, False: 16.0M] ------------------ 1521| 28.0M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 28.0M| .visit(v, args...); 1523| 16.0M| } 1524| 17.4M| } _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| 12.9M| { 1734| 12.9M| auto count = p.count(); 1735| 12.9M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 12.9M, False: 0] ------------------ 1736| 12.9M| plan.counts[plan.n++] = count; 1737| 12.9M| plan.total += count; 1738| 12.9M| } _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| 156M| { 1734| 156M| auto count = p.count(); 1735| 156M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 156M, False: 0] ------------------ 1736| 156M| plan.counts[plan.n++] = count; 1737| 156M| plan.total += count; 1738| 156M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE7shuffleEj: 1762| 17.4M| { 1763| | // gcc seems to not really understand this code... :( 1764| 17.4M|#if !defined(_MSC_VER) 1765| 17.4M|#pragma GCC diagnostic push 1766| 17.4M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 17.4M|#endif 1768| 17.4M| constexpr count_t rrb_extras = 2; 1769| 17.4M| constexpr count_t rrb_invariant = 1; 1770| 17.4M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 1.39M, False: 16.0M] ------------------ 1771| 17.4M| const auto branches = count_t{1} << bits; 1772| 17.4M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 17.4M| count_t i = 0; 1774| 21.9M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 4.51M, False: 17.4M] ------------------ 1775| | // skip ok nodes 1776| 10.1M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 5.68M, False: 4.51M] ------------------ 1777| 5.68M| i++; 1778| 4.51M| assert(i < n); ------------------ | Branch (1778:13): [True: 4.51M, False: 0] ------------------ 1779| | // short node, redistribute 1780| 4.51M| auto remaining = counts[i]; 1781| 17.0M| do { 1782| 17.0M| auto next = counts[i + 1]; 1783| 17.0M| auto count = std::min(remaining + next, branches); 1784| 17.0M| counts[i] = count; 1785| 17.0M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 17.0M, False: 0] ------------------ 1786| 17.0M| remaining += next - count; 1787| 17.0M| ++i; 1788| 17.0M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 12.5M, False: 4.51M] ------------------ 1789| | // remove node 1790| 4.51M| std::move(counts + i + 1, counts + n, counts + i); 1791| 4.51M| --n; 1792| 4.51M| --i; 1793| 4.51M| } 1794| 17.4M|#if !defined(_MSC_VER) 1795| 17.4M|#pragma GCC diagnostic pop 1796| 17.4M|#endif 1797| 17.4M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 1478| 34.8M| 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.4M| : curr_{counts} 1578| 17.4M| , n_{n} 1579| 17.4M| , result_{ 1580| 17.4M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 17.4M| { 1582| 17.4M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEC2EjPSC_m: 1481| 17.4M| : shift_{s} 1482| 17.4M| , count_{1} 1483| 17.4M| , nodes_{n0} 1484| 17.4M| , sizes_{s0} 1485| 17.4M| { 1486| 17.4M| } _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.4M| { 1513| 17.4M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.39M, False: 16.0M] ------------------ 1514| 1.39M| auto s = size_t{}; 1515| 5.58M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 4.18M, False: 1.39M] ------------------ 1516| 4.18M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 4.18M| s = sizes_[i]; 1518| 4.18M| } 1519| 16.0M| } else { 1520| 44.0M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 28.0M, False: 16.0M] ------------------ 1521| 28.0M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 28.0M| .visit(v, args...); 1523| 16.0M| } 1524| 17.4M| } _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| 12.9M| { 1722| 12.9M| merger.merge_leaf(p); 1723| 12.9M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_: 1614| 12.9M| { 1615| 12.9M| auto from = p.node(); 1616| 12.9M| auto from_size = p.size(); 1617| 12.9M| auto from_count = p.count(); 1618| 12.9M| assert(from_size); ------------------ | Branch (1618:9): [True: 12.9M, False: 0] ------------------ 1619| 12.9M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 12.7M, False: 211k] | Branch (1619:21): [True: 12.6M, False: 103k] ------------------ 1620| 12.6M| add_child(from, from_size); 1621| 12.6M| from->inc(); 1622| 12.6M| } else { 1623| 314k| auto from_offset = count_t{}; 1624| 314k| auto from_data = from->leaf(); 1625| 418k| do { 1626| 418k| if (!to_) { ------------------ | Branch (1626:21): [True: 207k, False: 211k] ------------------ 1627| 207k| to_ = node_t::make_leaf_n(*curr_); 1628| 207k| to_offset_ = 0; 1629| 207k| } 1630| 418k| auto data = to_->leaf(); 1631| 418k| auto to_copy = 1632| 418k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 418k| detail::uninitialized_copy(from_data + from_offset, 1634| 418k| from_data + from_offset + to_copy, 1635| 418k| data + to_offset_); 1636| 418k| to_offset_ += to_copy; 1637| 418k| from_offset += to_copy; 1638| 418k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 207k, False: 211k] ------------------ 1639| 207k| add_child(to_, to_offset_); 1640| 207k| to_ = nullptr; 1641| 207k| } 1642| 418k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 103k, False: 314k] ------------------ 1643| 314k| } 1644| 12.9M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9add_childEPSC_m: 1589| 174M| { 1590| 174M| assert(size); ------------------ | Branch (1590:9): [True: 174M, False: 0] ------------------ 1591| 174M| ++curr_; 1592| 174M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 174M| auto relaxed = parent->relaxed(); 1594| 174M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 12.0M, False: 162M] ------------------ 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| 174M| auto idx = relaxed->d.count++; 1605| 174M| result_.sizes_[result_.count_ - 1] += size; 1606| 174M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 174M, False: 0] ------------------ 1607| 174M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 145M, False: 29.5M] ------------------ 1608| 174M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 174M, False: 0] ------------------ 1609| 174M| parent->inner()[idx] = p; 1610| 174M| }; _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| 156M| { 1716| 156M| merger.merge_inner(p); 1717| 156M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 156M| { 1649| 156M| auto from = p.node(); 1650| 156M| auto from_size = p.size(); 1651| 156M| auto from_count = p.count(); 1652| 156M| assert(from_size); ------------------ | Branch (1652:9): [True: 156M, False: 0] ------------------ 1653| 156M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 141M, False: 15.1M] | Branch (1653:21): [True: 137M, False: 3.50M] ------------------ 1654| 137M| add_child(from, from_size); 1655| 137M| from->inc(); 1656| 137M| } else { 1657| 18.6M| auto from_offset = count_t{}; 1658| 18.6M| auto from_data = from->inner(); 1659| 29.4M| do { 1660| 29.4M| if (!to_) { ------------------ | Branch (1660:21): [True: 14.2M, False: 15.1M] ------------------ 1661| 14.2M| to_ = node_t::make_inner_r_n(*curr_); 1662| 14.2M| to_offset_ = 0; 1663| 14.2M| to_size_ = 0; 1664| 14.2M| } 1665| 29.4M| auto data = to_->inner(); 1666| 29.4M| auto to_copy = 1667| 29.4M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 29.4M| std::copy(from_data + from_offset, 1669| 29.4M| from_data + from_offset + to_copy, 1670| 29.4M| data + to_offset_); 1671| 29.4M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 29.4M| auto sizes = to_->relaxed()->d.sizes; 1673| 29.4M| p.copy_sizes( 1674| 29.4M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 29.4M| to_offset_ += to_copy; 1676| 29.4M| from_offset += to_copy; 1677| 29.4M| to_size_ = sizes[to_offset_ - 1]; 1678| 29.4M| assert(to_size_); ------------------ | Branch (1678:17): [True: 29.4M, False: 0] ------------------ 1679| 29.4M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 14.2M, False: 15.1M] ------------------ 1680| 14.2M| to_->relaxed()->d.count = to_offset_; 1681| 14.2M| add_child(to_, to_size_); 1682| 14.2M| to_ = nullptr; 1683| 14.2M| } 1684| 29.4M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 10.7M, False: 18.6M] ------------------ 1685| 18.6M| } 1686| 156M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE6finishEv: 1689| 17.4M| { 1690| 17.4M| assert(!to_); ------------------ | Branch (1690:9): [True: 17.4M, False: 0] ------------------ 1691| 17.4M| return result_; 1692| 17.4M| } _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.4M| { 1513| 17.4M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.39M, False: 16.0M] ------------------ 1514| 1.39M| auto s = size_t{}; 1515| 5.58M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 4.18M, False: 1.39M] ------------------ 1516| 4.18M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 4.18M| s = sizes_[i]; 1518| 4.18M| } 1519| 16.0M| } else { 1520| 44.0M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 28.0M, False: 16.0M] ------------------ 1521| 28.0M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 28.0M| .visit(v, args...); 1523| 16.0M| } 1524| 17.4M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEC2EjPSC_mSE_mSE_m: 1503| 1.38M| : shift_{s} 1504| 1.38M| , count_{3} 1505| 1.38M| , nodes_{n0, n1, n2} 1506| 1.38M| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 1.38M| { 1508| 1.38M| } _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.5k| { 1918| 21.5k| return concat_inners(lpos, tpos, rpos); 1919| 21.5k| } _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| 318| { 1918| 318| return concat_inners(lpos, tpos, rpos); 1919| 318| } _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.07k|{ 1873| 3.07k| auto lshift = lpos.shift(); 1874| 3.07k| auto rshift = rpos.shift(); 1875| 3.07k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 3.07k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 3.07k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 620, False: 2.45k] ------------------ 1879| 620| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 620| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.45k| } else { 1882| 2.45k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.45k, False: 0] ------------------ 1883| 2.45k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.45k] | Branch (1883:9): [True: 2.45k, False: 0] | Branch (1883:9): [True: 2.45k, False: 0] ------------------ 1884| 2.45k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.45k| return concat_rebalance(lpos, cpos, rpos); 1886| 2.45k| } 1887| 3.07k|} _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| 938| { 1918| 938| return concat_inners(lpos, tpos, rpos); 1919| 938| } _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| 938|{ 1873| 938| auto lshift = lpos.shift(); 1874| 938| auto rshift = rpos.shift(); 1875| 938| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 938] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 938| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 318, False: 620] ------------------ 1879| 318| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 318| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 620| } else { 1882| 620| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 620, False: 0] ------------------ 1883| 620| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 620] | Branch (1883:9): [True: 620, False: 0] | Branch (1883:9): [True: 620, False: 0] ------------------ 1884| 620| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 620| return concat_rebalance(lpos, cpos, rpos); 1886| 620| } 1887| 938|} _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| 790|{ 1824| 790| auto plan = concat_rebalance_plan{}; 1825| 790| plan.fill(lpos, cpos, rpos); 1826| 790| plan.shuffle(cpos.shift()); 1827| 790| IMMER_TRY { ------------------ | | 49| 790|#define IMMER_TRY try ------------------ 1828| 790| return plan.merge(lpos, cpos, rpos); 1829| 790| } 1830| 790| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 790|} _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| 790| { 1753| 790| assert(n == 0u); ------------------ | Branch (1753:9): [True: 790, False: 0] ------------------ 1754| 790| assert(total == 0u); ------------------ | Branch (1754:9): [True: 790, False: 0] ------------------ 1755| 790| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 790| lpos.each_left_sub(visitor_t{}, *this); 1757| 790| cpos.each_sub(visitor_t{}, *this); 1758| 790| rpos.each_right_sub(visitor_t{}, *this); 1759| 790| } _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| 5.34M| { 1734| 5.34M| auto count = p.count(); 1735| 5.34M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 5.34M, False: 0] ------------------ 1736| 5.34M| plan.counts[plan.n++] = count; 1737| 5.34M| plan.total += count; 1738| 5.34M| } _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| 551k| { 1734| 551k| auto count = p.count(); 1735| 551k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 551k, False: 0] ------------------ 1736| 551k| plan.counts[plan.n++] = count; 1737| 551k| plan.total += count; 1738| 551k| } _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| 790| { 1803| 790| using node_t = node_type; 1804| 790| using merger_t = concat_merger; 1805| 790| using visitor_t = concat_merger_visitor; 1806| 790| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 790| IMMER_TRY { ------------------ | | 49| 790|#define IMMER_TRY try ------------------ 1808| 790| lpos.each_left_sub(visitor_t{}, merger); 1809| 790| cpos.each_sub(visitor_t{}, merger); 1810| 790| rpos.each_right_sub(visitor_t{}, merger); 1811| 790| cpos.each_sub(dec_visitor{}); 1812| 790| return merger.finish(); 1813| 790| } 1814| 790| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 790| } _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| 5.34M| { 1722| 5.34M| merger.merge_leaf(p); 1723| 5.34M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10merge_leafIRNS1_13full_leaf_posISC_EEEEvOT_: 1614| 5.34M| { 1615| 5.34M| auto from = p.node(); 1616| 5.34M| auto from_size = p.size(); 1617| 5.34M| auto from_count = p.count(); 1618| 5.34M| assert(from_size); ------------------ | Branch (1618:9): [True: 5.34M, False: 0] ------------------ 1619| 5.34M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 5.34M, False: 0] | Branch (1619:21): [True: 5.34M, False: 0] ------------------ 1620| 5.34M| add_child(from, from_size); 1621| 5.34M| from->inc(); 1622| 5.34M| } 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| 5.34M| } _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| 551k| { 1716| 551k| merger.merge_inner(p); 1717| 551k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 551k| { 1649| 551k| auto from = p.node(); 1650| 551k| auto from_size = p.size(); 1651| 551k| auto from_count = p.count(); 1652| 551k| assert(from_size); ------------------ | Branch (1652:9): [True: 551k, False: 0] ------------------ 1653| 551k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 551k, False: 0] | Branch (1653:21): [True: 551k, False: 0] ------------------ 1654| 551k| add_child(from, from_size); 1655| 551k| from->inc(); 1656| 551k| } 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| 551k| } _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| 620| { 1945| 620| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 620| } _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.07k| { 1925| 3.07k| return concat_leafs(lpos, tpos, rpos); 1926| 3.07k| } _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.07k|{ 1839| 3.07k| static_assert(Node::bits >= 2, ""); 1840| 3.07k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 3.07k, False: 0] ------------------ 1841| 3.07k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 3.07k, False: 0] ------------------ 1842| 3.07k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 3.07k, False: 0] ------------------ 1843| 3.07k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 3.07k] ------------------ 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.07k| else 1854| 3.07k| return { 1855| 3.07k| Node::bits_leaf, 1856| 3.07k| lpos.node()->inc(), 1857| 3.07k| lpos.count(), 1858| 3.07k| rpos.node()->inc(), 1859| 3.07k| rpos.count(), 1860| 3.07k| }; 1861| 3.07k|} _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| 620|{ 1824| 620| auto plan = concat_rebalance_plan{}; 1825| 620| plan.fill(lpos, cpos, rpos); 1826| 620| plan.shuffle(cpos.shift()); 1827| 620| IMMER_TRY { ------------------ | | 49| 620|#define IMMER_TRY try ------------------ 1828| 620| return plan.merge(lpos, cpos, rpos); 1829| 620| } 1830| 620| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 620|} _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| 620| { 1753| 620| assert(n == 0u); ------------------ | Branch (1753:9): [True: 620, False: 0] ------------------ 1754| 620| assert(total == 0u); ------------------ | Branch (1754:9): [True: 620, False: 0] ------------------ 1755| 620| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 620| lpos.each_left_sub(visitor_t{}, *this); 1757| 620| cpos.each_sub(visitor_t{}, *this); 1758| 620| rpos.each_right_sub(visitor_t{}, *this); 1759| 620| } _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| 620| { 1803| 620| using node_t = node_type; 1804| 620| using merger_t = concat_merger; 1805| 620| using visitor_t = concat_merger_visitor; 1806| 620| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 620| IMMER_TRY { ------------------ | | 49| 620|#define IMMER_TRY try ------------------ 1808| 620| lpos.each_left_sub(visitor_t{}, merger); 1809| 620| cpos.each_sub(visitor_t{}, merger); 1810| 620| rpos.each_right_sub(visitor_t{}, merger); 1811| 620| cpos.each_sub(dec_visitor{}); 1812| 620| return merger.finish(); 1813| 620| } 1814| 620| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 620| } _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.83k|{ 1824| 1.83k| auto plan = concat_rebalance_plan{}; 1825| 1.83k| plan.fill(lpos, cpos, rpos); 1826| 1.83k| plan.shuffle(cpos.shift()); 1827| 1.83k| IMMER_TRY { ------------------ | | 49| 1.83k|#define IMMER_TRY try ------------------ 1828| 1.83k| return plan.merge(lpos, cpos, rpos); 1829| 1.83k| } 1830| 1.83k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.83k|} _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.83k| { 1753| 1.83k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.83k, False: 0] ------------------ 1754| 1.83k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.83k, False: 0] ------------------ 1755| 1.83k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.83k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.83k| cpos.each_sub(visitor_t{}, *this); 1758| 1.83k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.83k| } _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.80M| { 1734| 3.80M| auto count = p.count(); 1735| 3.80M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 3.80M, False: 0] ------------------ 1736| 3.80M| plan.counts[plan.n++] = count; 1737| 3.80M| plan.total += count; 1738| 3.80M| } _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.83k| { 1803| 1.83k| using node_t = node_type; 1804| 1.83k| using merger_t = concat_merger; 1805| 1.83k| using visitor_t = concat_merger_visitor; 1806| 1.83k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.83k| IMMER_TRY { ------------------ | | 49| 1.83k|#define IMMER_TRY try ------------------ 1808| 1.83k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.83k| cpos.each_sub(visitor_t{}, merger); 1810| 1.83k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.83k| cpos.each_sub(dec_visitor{}); 1812| 1.83k| return merger.finish(); 1813| 1.83k| } 1814| 1.83k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.83k| } _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.80M| { 1716| 3.80M| merger.merge_inner(p); 1717| 3.80M| } _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.80M| { 1649| 3.80M| auto from = p.node(); 1650| 3.80M| auto from_size = p.size(); 1651| 3.80M| auto from_count = p.count(); 1652| 3.80M| assert(from_size); ------------------ | Branch (1652:9): [True: 3.80M, False: 0] ------------------ 1653| 3.80M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 2.10M, False: 1.69M] | Branch (1653:21): [True: 2.10M, False: 0] ------------------ 1654| 2.10M| add_child(from, from_size); 1655| 2.10M| from->inc(); 1656| 2.10M| } else { 1657| 1.69M| auto from_offset = count_t{}; 1658| 1.69M| auto from_data = from->inner(); 1659| 3.39M| do { 1660| 3.39M| if (!to_) { ------------------ | Branch (1660:21): [True: 1.69M, False: 1.69M] ------------------ 1661| 1.69M| to_ = node_t::make_inner_r_n(*curr_); 1662| 1.69M| to_offset_ = 0; 1663| 1.69M| to_size_ = 0; 1664| 1.69M| } 1665| 3.39M| auto data = to_->inner(); 1666| 3.39M| auto to_copy = 1667| 3.39M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 3.39M| std::copy(from_data + from_offset, 1669| 3.39M| from_data + from_offset + to_copy, 1670| 3.39M| data + to_offset_); 1671| 3.39M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 3.39M| auto sizes = to_->relaxed()->d.sizes; 1673| 3.39M| p.copy_sizes( 1674| 3.39M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 3.39M| to_offset_ += to_copy; 1676| 3.39M| from_offset += to_copy; 1677| 3.39M| to_size_ = sizes[to_offset_ - 1]; 1678| 3.39M| assert(to_size_); ------------------ | Branch (1678:17): [True: 3.39M, False: 0] ------------------ 1679| 3.39M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 1.69M, False: 1.69M] ------------------ 1680| 1.69M| to_->relaxed()->d.count = to_offset_; 1681| 1.69M| add_child(to_, to_size_); 1682| 1.69M| to_ = nullptr; 1683| 1.69M| } 1684| 3.39M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.69M, False: 1.69M] ------------------ 1685| 1.69M| } 1686| 3.80M| } _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.45k| { 1945| 2.45k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 2.45k| } _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.98k| { 1925| 6.98k| return concat_leafs(lpos, tpos, rpos); 1926| 6.98k| } _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.98k|{ 1839| 6.98k| static_assert(Node::bits >= 2, ""); 1840| 6.98k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 6.98k, False: 0] ------------------ 1841| 6.98k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 6.98k, False: 0] ------------------ 1842| 6.98k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 6.98k, False: 0] ------------------ 1843| 6.98k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 6.98k] ------------------ 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.98k| else 1854| 6.98k| return { 1855| 6.98k| Node::bits_leaf, 1856| 6.98k| lpos.node()->inc(), 1857| 6.98k| lpos.count(), 1858| 6.98k| rpos.node()->inc(), 1859| 6.98k| rpos.count(), 1860| 6.98k| }; 1861| 6.98k|} _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.45k|{ 1824| 2.45k| auto plan = concat_rebalance_plan{}; 1825| 2.45k| plan.fill(lpos, cpos, rpos); 1826| 2.45k| plan.shuffle(cpos.shift()); 1827| 2.45k| IMMER_TRY { ------------------ | | 49| 2.45k|#define IMMER_TRY try ------------------ 1828| 2.45k| return plan.merge(lpos, cpos, rpos); 1829| 2.45k| } 1830| 2.45k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.45k|} _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.45k| { 1753| 2.45k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.45k, False: 0] ------------------ 1754| 2.45k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.45k, False: 0] ------------------ 1755| 2.45k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.45k| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.45k| cpos.each_sub(visitor_t{}, *this); 1758| 2.45k| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.45k| } _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.45k| { 1803| 2.45k| using node_t = node_type; 1804| 2.45k| using merger_t = concat_merger; 1805| 2.45k| using visitor_t = concat_merger_visitor; 1806| 2.45k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.45k| IMMER_TRY { ------------------ | | 49| 2.45k|#define IMMER_TRY try ------------------ 1808| 2.45k| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.45k| cpos.each_sub(visitor_t{}, merger); 1810| 2.45k| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.45k| cpos.each_sub(dec_visitor{}); 1812| 2.45k| return merger.finish(); 1813| 2.45k| } 1814| 2.45k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.45k| } _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| 189k|{ 1824| 189k| auto plan = concat_rebalance_plan{}; 1825| 189k| plan.fill(lpos, cpos, rpos); 1826| 189k| plan.shuffle(cpos.shift()); 1827| 189k| IMMER_TRY { ------------------ | | 49| 189k|#define IMMER_TRY try ------------------ 1828| 189k| return plan.merge(lpos, cpos, rpos); 1829| 189k| } 1830| 189k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 189k|} _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| 189k| { 1753| 189k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 189k, False: 0] ------------------ 1754| 189k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 189k, False: 0] ------------------ 1755| 189k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 189k| lpos.each_left_sub(visitor_t{}, *this); 1757| 189k| cpos.each_sub(visitor_t{}, *this); 1758| 189k| rpos.each_right_sub(visitor_t{}, *this); 1759| 189k| } _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| 189k| { 1803| 189k| using node_t = node_type; 1804| 189k| using merger_t = concat_merger; 1805| 189k| using visitor_t = concat_merger_visitor; 1806| 189k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 189k| IMMER_TRY { ------------------ | | 49| 189k|#define IMMER_TRY try ------------------ 1808| 189k| lpos.each_left_sub(visitor_t{}, merger); 1809| 189k| cpos.each_sub(visitor_t{}, merger); 1810| 189k| rpos.each_right_sub(visitor_t{}, merger); 1811| 189k| cpos.each_sub(dec_visitor{}); 1812| 189k| return merger.finish(); 1813| 189k| } 1814| 189k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 189k| } _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.98k| { 1945| 6.98k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 6.98k| } _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.98k|{ 1824| 6.98k| auto plan = concat_rebalance_plan{}; 1825| 6.98k| plan.fill(lpos, cpos, rpos); 1826| 6.98k| plan.shuffle(cpos.shift()); 1827| 6.98k| IMMER_TRY { ------------------ | | 49| 6.98k|#define IMMER_TRY try ------------------ 1828| 6.98k| return plan.merge(lpos, cpos, rpos); 1829| 6.98k| } 1830| 6.98k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 6.98k|} _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.98k| { 1753| 6.98k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 6.98k, False: 0] ------------------ 1754| 6.98k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 6.98k, False: 0] ------------------ 1755| 6.98k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 6.98k| lpos.each_left_sub(visitor_t{}, *this); 1757| 6.98k| cpos.each_sub(visitor_t{}, *this); 1758| 6.98k| rpos.each_right_sub(visitor_t{}, *this); 1759| 6.98k| } _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.98k| { 1803| 6.98k| using node_t = node_type; 1804| 6.98k| using merger_t = concat_merger; 1805| 6.98k| using visitor_t = concat_merger_visitor; 1806| 6.98k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 6.98k| IMMER_TRY { ------------------ | | 49| 6.98k|#define IMMER_TRY try ------------------ 1808| 6.98k| lpos.each_left_sub(visitor_t{}, merger); 1809| 6.98k| cpos.each_sub(visitor_t{}, merger); 1810| 6.98k| rpos.each_right_sub(visitor_t{}, merger); 1811| 6.98k| cpos.each_sub(dec_visitor{}); 1812| 6.98k| return merger.finish(); 1813| 6.98k| } 1814| 6.98k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 6.98k| } _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.76k| { 1959| 2.76k| return concat_inners(lpos, tpos, rpos); 1960| 2.76k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7realizeEv: 1527| 1.39M| { 1528| 1.39M| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 82.1k, False: 1.31M] ------------------ 1529| 82.1k| IMMER_TRY { ------------------ | | 49| 82.1k|#define IMMER_TRY try ------------------ 1530| 82.1k| auto result = node_t::make_inner_r_n(count_); 1531| 82.1k| auto r = result->relaxed(); 1532| 82.1k| r->d.count = count_; 1533| 82.1k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 82.1k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 82.1k| return {result, shift_, r}; 1536| 82.1k| } 1537| 82.1k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 1.31M| } else { 1542| 1.31M| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 1.31M, False: 0] ------------------ 1543| 1.31M| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 1.31M| } 1545| 1.39M| } _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.38M|{ 1987| 1.38M| return visit_maybe_relaxed_sub(lroot, 1988| 1.38M| lshift, 1989| 1.38M| lsize, 1990| 1.38M| concat_trees_left_visitor{}, 1991| 1.38M| make_leaf_pos(ltail, ltcount), 1992| 1.38M| rroot, 1993| 1.38M| rshift, 1994| 1.38M| rsize) 1995| 1.38M| .realize(); 1996| 1.38M|} _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.36M| { 1972| 1.36M| return visit_maybe_relaxed_sub( 1973| 1.36M| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 1.36M| } _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.35M| { 1959| 1.35M| return concat_inners(lpos, tpos, rpos); 1960| 1.35M| } _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.7M|{ 1873| 15.7M| auto lshift = lpos.shift(); 1874| 15.7M| auto rshift = rpos.shift(); 1875| 15.7M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 3.71M, False: 12.0M] ------------------ 1876| 3.71M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 3.71M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 12.0M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 160k, False: 11.9M] ------------------ 1879| 160k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 160k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 11.9M| } else { 1882| 11.9M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 11.9M, False: 0] ------------------ 1883| 11.9M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 11.9M] | Branch (1883:9): [True: 11.9M, False: 0] | Branch (1883:9): [True: 11.9M, False: 0] ------------------ 1884| 11.9M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 11.9M| return concat_rebalance(lpos, cpos, rpos); 1886| 11.9M| } 1887| 15.7M|} _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.70M| { 1898| 3.70M| return concat_inners(lpos, tpos, rpos); 1899| 3.70M| } _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.76k| { 1898| 4.76k| return concat_inners(lpos, tpos, rpos); 1899| 4.76k| } _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.15M|{ 1873| 1.15M| auto lshift = lpos.shift(); 1874| 1.15M| auto rshift = rpos.shift(); 1875| 1.15M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.66k, False: 1.15M] ------------------ 1876| 2.66k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.66k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.15M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 6.70k, False: 1.15M] ------------------ 1879| 6.70k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 6.70k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.15M| } else { 1882| 1.15M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.15M, False: 0] ------------------ 1883| 1.15M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.15M] | Branch (1883:9): [True: 1.15M, False: 0] | Branch (1883:9): [True: 1.15M, False: 0] ------------------ 1884| 1.15M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.15M| return concat_rebalance(lpos, cpos, rpos); 1886| 1.15M| } 1887| 1.15M|} _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.94k|{ 1824| 3.94k| auto plan = concat_rebalance_plan{}; 1825| 3.94k| plan.fill(lpos, cpos, rpos); 1826| 3.94k| plan.shuffle(cpos.shift()); 1827| 3.94k| IMMER_TRY { ------------------ | | 49| 3.94k|#define IMMER_TRY try ------------------ 1828| 3.94k| return plan.merge(lpos, cpos, rpos); 1829| 3.94k| } 1830| 3.94k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.94k|} _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.94k| { 1753| 3.94k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.94k, False: 0] ------------------ 1754| 3.94k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.94k, False: 0] ------------------ 1755| 3.94k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.94k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.94k| cpos.each_sub(visitor_t{}, *this); 1758| 3.94k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.94k| } _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.94k| { 1803| 3.94k| using node_t = node_type; 1804| 3.94k| using merger_t = concat_merger; 1805| 3.94k| using visitor_t = concat_merger_visitor; 1806| 3.94k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.94k| IMMER_TRY { ------------------ | | 49| 3.94k|#define IMMER_TRY try ------------------ 1808| 3.94k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.94k| cpos.each_sub(visitor_t{}, merger); 1810| 3.94k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.94k| cpos.each_sub(dec_visitor{}); 1812| 3.94k| return merger.finish(); 1813| 3.94k| } 1814| 3.94k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.94k| } _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.14M| { 1918| 1.14M| return concat_inners(lpos, tpos, rpos); 1919| 1.14M| } _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| 362k| { 1918| 362k| return concat_inners(lpos, tpos, rpos); 1919| 362k| } _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| 380k|{ 1873| 380k| auto lshift = lpos.shift(); 1874| 380k| auto rshift = rpos.shift(); 1875| 380k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 1.28k, False: 379k] ------------------ 1876| 1.28k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 1.28k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 379k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 710, False: 378k] ------------------ 1879| 710| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 710| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 378k| } else { 1882| 378k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 378k, False: 0] ------------------ 1883| 378k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 378k] | Branch (1883:9): [True: 378k, False: 0] | Branch (1883:9): [True: 378k, False: 0] ------------------ 1884| 378k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 378k| return concat_rebalance(lpos, cpos, rpos); 1886| 378k| } 1887| 380k|} _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.82k| { 1898| 1.82k| return concat_inners(lpos, tpos, rpos); 1899| 1.82k| } _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.4k| { 1918| 17.4k| return concat_inners(lpos, tpos, rpos); 1919| 17.4k| } _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.4k|{ 1873| 17.4k| auto lshift = lpos.shift(); 1874| 17.4k| auto rshift = rpos.shift(); 1875| 17.4k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 17.4k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 17.4k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 236, False: 17.1k] ------------------ 1879| 236| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 236| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 17.1k| } else { 1882| 17.1k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 17.1k, False: 0] ------------------ 1883| 17.1k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 17.1k] | Branch (1883:9): [True: 17.1k, False: 0] | Branch (1883:9): [True: 17.1k, False: 0] ------------------ 1884| 17.1k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 17.1k| return concat_rebalance(lpos, cpos, rpos); 1886| 17.1k| } 1887| 17.4k|} _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.4k| { 1945| 11.4k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 11.4k| } _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| 391k| { 1925| 391k| return concat_leafs(lpos, tpos, rpos); 1926| 391k| } _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| 391k|{ 1839| 391k| static_assert(Node::bits >= 2, ""); 1840| 391k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 391k, False: 0] ------------------ 1841| 391k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 391k, False: 0] ------------------ 1842| 391k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 391k, False: 0] ------------------ 1843| 391k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 391k, False: 0] ------------------ 1844| 391k| return { 1845| 391k| Node::bits_leaf, 1846| 391k| lpos.node()->inc(), 1847| 391k| lpos.count(), 1848| 391k| tpos.node()->inc(), 1849| 391k| tpos.count(), 1850| 391k| rpos.node()->inc(), 1851| 391k| rpos.count(), 1852| 391k| }; 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| 391k|} _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.45k| { 1938| 7.45k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 7.45k| } _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.1k|{ 1824| 17.1k| auto plan = concat_rebalance_plan{}; 1825| 17.1k| plan.fill(lpos, cpos, rpos); 1826| 17.1k| plan.shuffle(cpos.shift()); 1827| 17.1k| IMMER_TRY { ------------------ | | 49| 17.1k|#define IMMER_TRY try ------------------ 1828| 17.1k| return plan.merge(lpos, cpos, rpos); 1829| 17.1k| } 1830| 17.1k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 17.1k|} _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.1k| { 1753| 17.1k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 17.1k, False: 0] ------------------ 1754| 17.1k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 17.1k, False: 0] ------------------ 1755| 17.1k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 17.1k| lpos.each_left_sub(visitor_t{}, *this); 1757| 17.1k| cpos.each_sub(visitor_t{}, *this); 1758| 17.1k| rpos.each_right_sub(visitor_t{}, *this); 1759| 17.1k| } _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.1k| { 1803| 17.1k| using node_t = node_type; 1804| 17.1k| using merger_t = concat_merger; 1805| 17.1k| using visitor_t = concat_merger_visitor; 1806| 17.1k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 17.1k| IMMER_TRY { ------------------ | | 49| 17.1k|#define IMMER_TRY try ------------------ 1808| 17.1k| lpos.each_left_sub(visitor_t{}, merger); 1809| 17.1k| cpos.each_sub(visitor_t{}, merger); 1810| 17.1k| rpos.each_right_sub(visitor_t{}, merger); 1811| 17.1k| cpos.each_sub(dec_visitor{}); 1812| 17.1k| return merger.finish(); 1813| 17.1k| } 1814| 17.1k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 17.1k| } _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| 380k| { 1945| 380k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 380k| } _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| 997k| { 1925| 997k| return concat_leafs(lpos, tpos, rpos); 1926| 997k| } _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| 997k|{ 1839| 997k| static_assert(Node::bits >= 2, ""); 1840| 997k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 997k, False: 0] ------------------ 1841| 997k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 997k, False: 0] ------------------ 1842| 997k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 997k, False: 0] ------------------ 1843| 997k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 997k, False: 0] ------------------ 1844| 997k| return { 1845| 997k| Node::bits_leaf, 1846| 997k| lpos.node()->inc(), 1847| 997k| lpos.count(), 1848| 997k| tpos.node()->inc(), 1849| 997k| tpos.count(), 1850| 997k| rpos.node()->inc(), 1851| 997k| rpos.count(), 1852| 997k| }; 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| 997k|} _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| 9.02k| { 1938| 9.02k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 9.02k| } _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| 378k|{ 1824| 378k| auto plan = concat_rebalance_plan{}; 1825| 378k| plan.fill(lpos, cpos, rpos); 1826| 378k| plan.shuffle(cpos.shift()); 1827| 378k| IMMER_TRY { ------------------ | | 49| 378k|#define IMMER_TRY try ------------------ 1828| 378k| return plan.merge(lpos, cpos, rpos); 1829| 378k| } 1830| 378k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 378k|} _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| 378k| { 1753| 378k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 378k, False: 0] ------------------ 1754| 378k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 378k, False: 0] ------------------ 1755| 378k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 378k| lpos.each_left_sub(visitor_t{}, *this); 1757| 378k| cpos.each_sub(visitor_t{}, *this); 1758| 378k| rpos.each_right_sub(visitor_t{}, *this); 1759| 378k| } _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| 378k| { 1803| 378k| using node_t = node_type; 1804| 378k| using merger_t = concat_merger; 1805| 378k| using visitor_t = concat_merger_visitor; 1806| 378k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 378k| IMMER_TRY { ------------------ | | 49| 378k|#define IMMER_TRY try ------------------ 1808| 378k| lpos.each_left_sub(visitor_t{}, merger); 1809| 378k| cpos.each_sub(visitor_t{}, merger); 1810| 378k| rpos.each_right_sub(visitor_t{}, merger); 1811| 378k| cpos.each_sub(dec_visitor{}); 1812| 378k| return merger.finish(); 1813| 378k| } 1814| 378k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 378k| } _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| 997k| { 1945| 997k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 997k| } _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.50M| { 1938| 1.50M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.50M| } _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.15M|{ 1824| 1.15M| auto plan = concat_rebalance_plan{}; 1825| 1.15M| plan.fill(lpos, cpos, rpos); 1826| 1.15M| plan.shuffle(cpos.shift()); 1827| 1.15M| IMMER_TRY { ------------------ | | 49| 1.15M|#define IMMER_TRY try ------------------ 1828| 1.15M| return plan.merge(lpos, cpos, rpos); 1829| 1.15M| } 1830| 1.15M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.15M|} _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.15M| { 1753| 1.15M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.15M, False: 0] ------------------ 1754| 1.15M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.15M, False: 0] ------------------ 1755| 1.15M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.15M| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.15M| cpos.each_sub(visitor_t{}, *this); 1758| 1.15M| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.15M| } _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.15M| { 1803| 1.15M| using node_t = node_type; 1804| 1.15M| using merger_t = concat_merger; 1805| 1.15M| using visitor_t = concat_merger_visitor; 1806| 1.15M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.15M| IMMER_TRY { ------------------ | | 49| 1.15M|#define IMMER_TRY try ------------------ 1808| 1.15M| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.15M| cpos.each_sub(visitor_t{}, merger); 1810| 1.15M| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.15M| cpos.each_sub(dec_visitor{}); 1812| 1.15M| return merger.finish(); 1813| 1.15M| } 1814| 1.15M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.15M| } _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.73M|{ 1824| 3.73M| auto plan = concat_rebalance_plan{}; 1825| 3.73M| plan.fill(lpos, cpos, rpos); 1826| 3.73M| plan.shuffle(cpos.shift()); 1827| 3.73M| IMMER_TRY { ------------------ | | 49| 3.73M|#define IMMER_TRY try ------------------ 1828| 3.73M| return plan.merge(lpos, cpos, rpos); 1829| 3.73M| } 1830| 3.73M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.73M|} _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.73M| { 1753| 3.73M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.73M, False: 0] ------------------ 1754| 3.73M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.73M, False: 0] ------------------ 1755| 3.73M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.73M| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.73M| cpos.each_sub(visitor_t{}, *this); 1758| 3.73M| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.73M| } _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.73M| { 1803| 3.73M| using node_t = node_type; 1804| 3.73M| using merger_t = concat_merger; 1805| 3.73M| using visitor_t = concat_merger_visitor; 1806| 3.73M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.73M| IMMER_TRY { ------------------ | | 49| 3.73M|#define IMMER_TRY try ------------------ 1808| 3.73M| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.73M| cpos.each_sub(visitor_t{}, merger); 1810| 3.73M| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.73M| cpos.each_sub(dec_visitor{}); 1812| 3.73M| return merger.finish(); 1813| 3.73M| } 1814| 3.73M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.73M| } _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.19k| { 1918| 1.19k| return concat_inners(lpos, tpos, rpos); 1919| 1.19k| } _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| 36.9k|{ 1873| 36.9k| auto lshift = lpos.shift(); 1874| 36.9k| auto rshift = rpos.shift(); 1875| 36.9k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 25.0k, False: 11.9k] ------------------ 1876| 25.0k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 25.0k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 25.0k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 507, False: 11.4k] ------------------ 1879| 507| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 507| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 11.4k| } else { 1882| 11.4k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 11.4k, False: 0] ------------------ 1883| 11.4k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 11.4k] | Branch (1883:9): [True: 11.4k, False: 0] | Branch (1883:9): [True: 11.4k, False: 0] ------------------ 1884| 11.4k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 11.4k| return concat_rebalance(lpos, cpos, rpos); 1886| 11.4k| } 1887| 36.9k|} _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| 24.4k| { 1898| 24.4k| return concat_inners(lpos, tpos, rpos); 1899| 24.4k| } _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.44k| { 1918| 2.44k| return concat_inners(lpos, tpos, rpos); 1919| 2.44k| } _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.44k|{ 1873| 2.44k| auto lshift = lpos.shift(); 1874| 2.44k| auto rshift = rpos.shift(); 1875| 2.44k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.44k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.44k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 236, False: 2.20k] ------------------ 1879| 236| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 236| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.20k| } else { 1882| 2.20k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.20k, False: 0] ------------------ 1883| 2.20k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.20k] | Branch (1883:9): [True: 2.20k, False: 0] | Branch (1883:9): [True: 2.20k, False: 0] ------------------ 1884| 2.20k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.20k| return concat_rebalance(lpos, cpos, rpos); 1886| 2.20k| } 1887| 2.44k|} _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.20k|{ 1824| 2.20k| auto plan = concat_rebalance_plan{}; 1825| 2.20k| plan.fill(lpos, cpos, rpos); 1826| 2.20k| plan.shuffle(cpos.shift()); 1827| 2.20k| IMMER_TRY { ------------------ | | 49| 2.20k|#define IMMER_TRY try ------------------ 1828| 2.20k| return plan.merge(lpos, cpos, rpos); 1829| 2.20k| } 1830| 2.20k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.20k|} _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.20k| { 1753| 2.20k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.20k, False: 0] ------------------ 1754| 2.20k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.20k, False: 0] ------------------ 1755| 2.20k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.20k| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.20k| cpos.each_sub(visitor_t{}, *this); 1758| 2.20k| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.20k| } _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.20k| { 1803| 2.20k| using node_t = node_type; 1804| 2.20k| using merger_t = concat_merger; 1805| 2.20k| using visitor_t = concat_merger_visitor; 1806| 2.20k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.20k| IMMER_TRY { ------------------ | | 49| 2.20k|#define IMMER_TRY try ------------------ 1808| 2.20k| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.20k| cpos.each_sub(visitor_t{}, merger); 1810| 2.20k| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.20k| cpos.each_sub(dec_visitor{}); 1812| 2.20k| return merger.finish(); 1813| 2.20k| } 1814| 2.20k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.20k| } _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.15k| { 1938| 1.15k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.15k| } _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.4k|{ 1824| 11.4k| auto plan = concat_rebalance_plan{}; 1825| 11.4k| plan.fill(lpos, cpos, rpos); 1826| 11.4k| plan.shuffle(cpos.shift()); 1827| 11.4k| IMMER_TRY { ------------------ | | 49| 11.4k|#define IMMER_TRY try ------------------ 1828| 11.4k| return plan.merge(lpos, cpos, rpos); 1829| 11.4k| } 1830| 11.4k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 11.4k|} _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.4k| { 1753| 11.4k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 11.4k, False: 0] ------------------ 1754| 11.4k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 11.4k, False: 0] ------------------ 1755| 11.4k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 11.4k| lpos.each_left_sub(visitor_t{}, *this); 1757| 11.4k| cpos.each_sub(visitor_t{}, *this); 1758| 11.4k| rpos.each_right_sub(visitor_t{}, *this); 1759| 11.4k| } _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.4k| { 1803| 11.4k| using node_t = node_type; 1804| 11.4k| using merger_t = concat_merger; 1805| 11.4k| using visitor_t = concat_merger_visitor; 1806| 11.4k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 11.4k| IMMER_TRY { ------------------ | | 49| 11.4k|#define IMMER_TRY try ------------------ 1808| 11.4k| lpos.each_left_sub(visitor_t{}, merger); 1809| 11.4k| cpos.each_sub(visitor_t{}, merger); 1810| 11.4k| rpos.each_right_sub(visitor_t{}, merger); 1811| 11.4k| cpos.each_sub(dec_visitor{}); 1812| 11.4k| return merger.finish(); 1813| 11.4k| } 1814| 11.4k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 11.4k| } _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.9M|{ 1824| 11.9M| auto plan = concat_rebalance_plan{}; 1825| 11.9M| plan.fill(lpos, cpos, rpos); 1826| 11.9M| plan.shuffle(cpos.shift()); 1827| 11.9M| IMMER_TRY { ------------------ | | 49| 11.9M|#define IMMER_TRY try ------------------ 1828| 11.9M| return plan.merge(lpos, cpos, rpos); 1829| 11.9M| } 1830| 11.9M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 11.9M|} _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.9M| { 1753| 11.9M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 11.9M, False: 0] ------------------ 1754| 11.9M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 11.9M, False: 0] ------------------ 1755| 11.9M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 11.9M| lpos.each_left_sub(visitor_t{}, *this); 1757| 11.9M| cpos.each_sub(visitor_t{}, *this); 1758| 11.9M| rpos.each_right_sub(visitor_t{}, *this); 1759| 11.9M| } _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.9M| { 1803| 11.9M| using node_t = node_type; 1804| 11.9M| using merger_t = concat_merger; 1805| 11.9M| using visitor_t = concat_merger_visitor; 1806| 11.9M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 11.9M| IMMER_TRY { ------------------ | | 49| 11.9M|#define IMMER_TRY try ------------------ 1808| 11.9M| lpos.each_left_sub(visitor_t{}, merger); 1809| 11.9M| cpos.each_sub(visitor_t{}, merger); 1810| 11.9M| rpos.each_right_sub(visitor_t{}, merger); 1811| 11.9M| cpos.each_sub(dec_visitor{}); 1812| 11.9M| return merger.finish(); 1813| 11.9M| } 1814| 11.9M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 11.9M| } _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.3k| { 1959| 11.3k| return concat_inners(lpos, tpos, rpos); 1960| 11.3k| } _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| 22.7k| { 1972| 22.7k| return visit_maybe_relaxed_sub( 1973| 22.7k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 22.7k| } _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.00k| { 1959| 6.00k| return concat_inners(lpos, tpos, rpos); 1960| 6.00k| } _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| 16.7k| { 1959| 16.7k| return concat_inners(lpos, tpos, rpos); 1960| 16.7k| } _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| 199k| { 681| 199k| auto node = pos.node(); 682| 199k| auto level = pos.shift(); 683| 199k| auto idx = pos.count() - 1; 684| 199k| auto children = pos.size(idx); 685| 199k| auto new_idx = 686| 199k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 4.44k, False: 195k] | Branch (686:47): [True: 268, False: 195k] ------------------ 687| 199k| auto new_child = static_cast(nullptr); 688| 199k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 199k, Folded] | Branch (688:38): [True: 197k, False: 2.83k] ------------------ 689| | 690| 199k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 2.02k, False: 197k] ------------------ 691| 2.02k| return nullptr; 692| 197k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 195k, False: 2.68k] ------------------ 693| 195k| new_child = 694| 195k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 193k, False: 1.89k] ------------------ 695| 195k| : pos.last_oh_csh( 696| 1.89k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 195k| if (!new_child) { ------------------ | Branch (697:17): [True: 2.17k, False: 193k] ------------------ 698| 2.17k| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 685, False: 1.49k] ------------------ 699| 685| new_child = node_t::make_path_e(e, level - B, tail); 700| 1.49k| else 701| 1.49k| return nullptr; 702| 2.17k| } 703| 195k| } else 704| 2.68k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 196k| if (mutate) { ------------------ | Branch (706:13): [True: 194k, False: 1.99k] ------------------ 707| 194k| auto count = new_idx + 1; 708| 194k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 194k| node->inner()[new_idx] = new_child; 710| 194k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 194k| relaxed->d.count = count; 712| 194k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 194k, False: 0] ------------------ 713| 194k| return node; 714| 194k| } else { 715| 1.99k| IMMER_TRY { ------------------ | | 49| 1.99k|#define IMMER_TRY try ------------------ 716| 1.99k| auto count = new_idx + 1; 717| 1.99k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 1.99k| auto relaxed = new_node->relaxed(); 719| 1.99k| new_node->inner()[new_idx] = new_child; 720| 1.99k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 1.99k| relaxed->d.count = count; 722| 1.99k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 1.99k, False: 0] ------------------ 723| 1.99k| if (Mutating) ------------------ | Branch (723:21): [True: 1.99k, Folded] ------------------ 724| 1.99k| pos.visit(dec_visitor{}); 725| 1.99k| return new_node; 726| 1.99k| } 727| 1.99k| 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.99k| } 737| 196k| } _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| 169k| { 742| 169k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 169k, False: 0] ------------------ 743| 169k| auto node = pos.node(); 744| 169k| auto idx = pos.index(pos.size() - 1); 745| 169k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 169k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 169k, Folded] | Branch (746:36): [True: 169k, False: 603] ------------------ 747| 169k| if (mutate) { ------------------ | Branch (747:13): [True: 169k, False: 603] ------------------ 748| 169k| node->inner()[new_idx] = 749| 169k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 166k, False: 2.49k] ------------------ 750| | /* otherwise */ 751| 169k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 169k| return node; 753| 169k| } else { 754| 603| auto new_parent = node_t::make_inner_e(e); 755| 603| IMMER_TRY { ------------------ | | 49| 603|#define IMMER_TRY try ------------------ 756| 603| new_parent->inner()[new_idx] = 757| 603| idx == new_idx ------------------ | Branch (757:21): [True: 306, False: 297] ------------------ 758| 603| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 603| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 603| node_t::do_copy_inner(new_parent, node, new_idx); 762| 603| if (Mutating) ------------------ | Branch (762:21): [True: 603, Folded] ------------------ 763| 603| pos.visit(dec_visitor{}); 764| 603| return new_parent; 765| 603| } 766| 603| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 603| } 771| 169k| } _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.58M| { 742| 1.58M| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.58M, False: 0] ------------------ 743| 1.58M| auto node = pos.node(); 744| 1.58M| auto idx = pos.index(pos.size() - 1); 745| 1.58M| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.58M| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 1.58M, Folded] | Branch (746:36): [True: 1.58M, False: 1.91k] ------------------ 747| 1.58M| if (mutate) { ------------------ | Branch (747:13): [True: 1.58M, False: 1.91k] ------------------ 748| 1.58M| node->inner()[new_idx] = 749| 1.58M| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 1.25M, False: 323k] ------------------ 750| | /* otherwise */ 751| 1.58M| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 1.58M| return node; 753| 1.58M| } else { 754| 1.91k| auto new_parent = node_t::make_inner_e(e); 755| 1.91k| IMMER_TRY { ------------------ | | 49| 1.91k|#define IMMER_TRY try ------------------ 756| 1.91k| new_parent->inner()[new_idx] = 757| 1.91k| idx == new_idx ------------------ | Branch (757:21): [True: 1.14k, False: 767] ------------------ 758| 1.91k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.91k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.91k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.91k| if (Mutating) ------------------ | Branch (762:21): [True: 1.91k, Folded] ------------------ 763| 1.91k| pos.visit(dec_visitor{}); 764| 1.91k| return new_parent; 765| 1.91k| } 766| 1.91k| 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.91k| } 771| 1.58M| } _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.57k| { 742| 3.57k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 3.57k, False: 0] ------------------ 743| 3.57k| auto node = pos.node(); 744| 3.57k| auto idx = pos.index(pos.size() - 1); 745| 3.57k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 3.57k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 3.57k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 3.57k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 3.57k] ------------------ 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.57k| } else { 754| 3.57k| auto new_parent = node_t::make_inner_e(e); 755| 3.57k| IMMER_TRY { ------------------ | | 49| 3.57k|#define IMMER_TRY try ------------------ 756| 3.57k| new_parent->inner()[new_idx] = 757| 3.57k| idx == new_idx ------------------ | Branch (757:21): [True: 1.29k, False: 2.28k] ------------------ 758| 3.57k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 3.57k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 3.57k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 3.57k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 3.57k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 3.57k| return new_parent; 765| 3.57k| } 766| 3.57k| 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.57k| } 771| 3.57k| } _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.53k| { 681| 4.53k| auto node = pos.node(); 682| 4.53k| auto level = pos.shift(); 683| 4.53k| auto idx = pos.count() - 1; 684| 4.53k| auto children = pos.size(idx); 685| 4.53k| auto new_idx = 686| 4.53k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 953, False: 3.57k] | Branch (686:47): [True: 206, False: 3.37k] ------------------ 687| 4.53k| auto new_child = static_cast(nullptr); 688| 4.53k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 4.53k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 4.53k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 361, False: 4.16k] ------------------ 691| 361| return nullptr; 692| 4.16k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 3.37k, False: 798] ------------------ 693| 3.37k| new_child = 694| 3.37k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 3.37k] ------------------ 695| 3.37k| : pos.last_oh_csh( 696| 3.37k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 3.37k| if (!new_child) { ------------------ | Branch (697:17): [True: 636, False: 2.73k] ------------------ 698| 636| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 230, False: 406] ------------------ 699| 230| new_child = node_t::make_path_e(e, level - B, tail); 700| 406| else 701| 406| return nullptr; 702| 636| } 703| 3.37k| } else 704| 798| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 3.76k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 3.76k] ------------------ 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.76k| } else { 715| 3.76k| IMMER_TRY { ------------------ | | 49| 3.76k|#define IMMER_TRY try ------------------ 716| 3.76k| auto count = new_idx + 1; 717| 3.76k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 3.76k| auto relaxed = new_node->relaxed(); 719| 3.76k| new_node->inner()[new_idx] = new_child; 720| 3.76k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 3.76k| relaxed->d.count = count; 722| 3.76k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 3.76k, False: 0] ------------------ 723| 3.76k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 3.76k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 3.76k| return new_node; 726| 3.76k| } 727| 3.76k| 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.76k| } 737| 3.76k| } _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| 735| { 742| 735| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 735, False: 0] ------------------ 743| 735| auto node = pos.node(); 744| 735| auto idx = pos.index(pos.size() - 1); 745| 735| auto new_idx = pos.index(pos.size() + branches - 1); 746| 735| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 735] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 735| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 735] ------------------ 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| 735| } else { 754| 735| auto new_parent = node_t::make_inner_e(e); 755| 735| IMMER_TRY { ------------------ | | 49| 735|#define IMMER_TRY try ------------------ 756| 735| new_parent->inner()[new_idx] = 757| 735| idx == new_idx ------------------ | Branch (757:21): [True: 450, False: 285] ------------------ 758| 735| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 735| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 735| node_t::do_copy_inner(new_parent, node, new_idx); 762| 735| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 735] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 735| return new_parent; 765| 735| } 766| 735| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 735| } 771| 735| } _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| 167k| { 742| 167k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 167k, False: 0] ------------------ 743| 167k| auto node = pos.node(); 744| 167k| auto idx = pos.index(pos.size() - 1); 745| 167k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 167k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 167k, Folded] | Branch (746:36): [True: 166k, False: 674] ------------------ 747| 167k| if (mutate) { ------------------ | Branch (747:13): [True: 166k, False: 674] ------------------ 748| 166k| node->inner()[new_idx] = 749| 166k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 159k, False: 7.74k] ------------------ 750| | /* otherwise */ 751| 166k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 166k| return node; 753| 166k| } else { 754| 674| auto new_parent = node_t::make_inner_e(e); 755| 674| IMMER_TRY { ------------------ | | 49| 674|#define IMMER_TRY try ------------------ 756| 674| new_parent->inner()[new_idx] = 757| 674| idx == new_idx ------------------ | Branch (757:21): [True: 379, False: 295] ------------------ 758| 674| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 674| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 674| node_t::do_copy_inner(new_parent, node, new_idx); 762| 674| if (Mutating) ------------------ | Branch (762:21): [True: 674, Folded] ------------------ 763| 674| pos.visit(dec_visitor{}); 764| 674| return new_parent; 765| 674| } 766| 674| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 674| } 771| 167k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEvPT_: 580| 1.82k|{ 581| 1.82k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 1.82k|} _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| 67.2k| { 596| 67.2k| auto offset = pos.index(idx); 597| 67.2k| auto count = pos.count(); 598| 67.2k| auto node = pos.node(); 599| 67.2k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 45.5k, False: 21.6k] ------------------ 600| 45.5k| return pos.towards_oh( 601| 45.5k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 45.5k| } else { 603| 21.6k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 21.6k| IMMER_TRY { ------------------ | | 49| 21.6k|#define IMMER_TRY try ------------------ 605| 21.6k| auto& res = pos.towards_oh( 606| 21.6k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 21.6k| pos.visit(dec_visitor{}); 608| 21.6k| *location = new_node; 609| 21.6k| return res; 610| 21.6k| } 611| 21.6k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 21.6k| } 616| 67.2k| } _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| 10.6k| { 653| 10.6k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 10.6k, False: 0] ------------------ 654| 10.6k| auto node = pos.node(); 655| 10.6k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 746, False: 9.87k] ------------------ 656| 746| return node->leaf()[pos.index(idx)]; 657| 9.87k| } else { 658| 9.87k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 9.87k| pos.visit(dec_visitor{}); 660| 9.87k| *location = new_node; 661| 9.87k| return new_node->leaf()[pos.index(idx)]; 662| 9.87k| } 663| 10.6k| } _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.37k| { 622| 4.37k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 4.37k, False: 0] ------------------ 623| 4.37k| auto offset = pos.index(idx); 624| 4.37k| auto count = pos.count(); 625| 4.37k| auto node = pos.node(); 626| 4.37k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 2.46k, False: 1.91k] ------------------ 627| 2.46k| return pos.towards_oh_ch( 628| 2.46k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 2.46k| } else { 630| 1.91k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.91k| IMMER_TRY { ------------------ | | 49| 1.91k|#define IMMER_TRY try ------------------ 632| 1.91k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.91k| idx, 634| 1.91k| offset, 635| 1.91k| count, 636| 1.91k| e, 637| 1.91k| &new_node->inner()[offset]); 638| 1.91k| pos.visit(dec_visitor{}); 639| 1.91k| *location = new_node; 640| 1.91k| return res; 641| 1.91k| } 642| 1.91k| 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.91k| } 647| 4.37k| } _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.47k| { 653| 3.47k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 3.47k, False: 0] ------------------ 654| 3.47k| auto node = pos.node(); 655| 3.47k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.51k, False: 1.96k] ------------------ 656| 1.51k| 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.47k| } _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.90k| { 622| 2.90k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.90k, False: 0] ------------------ 623| 2.90k| auto offset = pos.index(idx); 624| 2.90k| auto count = pos.count(); 625| 2.90k| auto node = pos.node(); 626| 2.90k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.12k, False: 1.77k] ------------------ 627| 1.12k| return pos.towards_oh_ch( 628| 1.12k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.77k| } else { 630| 1.77k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.77k| IMMER_TRY { ------------------ | | 49| 1.77k|#define IMMER_TRY try ------------------ 632| 1.77k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.77k| idx, 634| 1.77k| offset, 635| 1.77k| count, 636| 1.77k| e, 637| 1.77k| &new_node->inner()[offset]); 638| 1.77k| pos.visit(dec_visitor{}); 639| 1.77k| *location = new_node; 640| 1.77k| return res; 641| 1.77k| } 642| 1.77k| 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.77k| } 647| 2.90k| } _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| 904| { 653| 904| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 904, False: 0] ------------------ 654| 904| auto node = pos.node(); 655| 904| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 567, False: 337] ------------------ 656| 567| return node->leaf()[pos.index(idx)]; 657| 567| } else { 658| 337| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 337| pos.visit(dec_visitor{}); 660| 337| *location = new_node; 661| 337| return new_node->leaf()[pos.index(idx)]; 662| 337| } 663| 904| } _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.39k| { 622| 2.39k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.39k, False: 0] ------------------ 623| 2.39k| auto offset = pos.index(idx); 624| 2.39k| auto count = pos.count(); 625| 2.39k| auto node = pos.node(); 626| 2.39k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.44k, False: 952] ------------------ 627| 1.44k| return pos.towards_oh_ch( 628| 1.44k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.44k| } else { 630| 952| auto new_node = node_t::copy_inner_e(e, node, count); 631| 952| IMMER_TRY { ------------------ | | 49| 952|#define IMMER_TRY try ------------------ 632| 952| auto& res = pos.towards_oh_ch(this_t{}, 633| 952| idx, 634| 952| offset, 635| 952| count, 636| 952| e, 637| 952| &new_node->inner()[offset]); 638| 952| pos.visit(dec_visitor{}); 639| 952| *location = new_node; 640| 952| return res; 641| 952| } 642| 952| 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| 952| } 647| 2.39k| } _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| 30.1k| { 914| 30.1k| auto idx = pos.index(last); 915| 30.1k| auto node = pos.node(); 916| 30.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 30.1k, Folded] | Branch (916:35): [True: 21.3k, False: 8.81k] ------------------ 917| 30.1k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 30.1k, Folded] | Branch (917:25): [True: 16.5k, False: 13.6k] ------------------ 918| 16.5k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 11.5k, False: 4.98k] ------------------ 919| 16.5k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 16.5k| if (Mutating) ------------------ | Branch (920:17): [True: 16.5k, Folded] ------------------ 921| 16.5k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 16.5k| return res; 923| 16.5k| } else { 924| 13.6k| using std::get; 925| 13.6k| auto subs = 926| 13.6k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 9.85k, False: 3.83k] ------------------ 927| 13.6k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 13.6k| auto next = get<1>(subs); 929| 13.6k| auto ts = get<2>(subs); 930| 13.6k| auto tail = get<3>(subs); 931| 13.6k| IMMER_TRY { ------------------ | | 49| 13.6k|#define IMMER_TRY try ------------------ 932| 13.6k| if (next) { ------------------ | Branch (932:21): [True: 9.45k, False: 4.22k] ------------------ 933| 9.45k| if (mutate) { ------------------ | Branch (933:25): [True: 6.65k, False: 2.80k] ------------------ 934| 6.65k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 6.65k| pos.each_right(dec_visitor{}, idx + 1); 936| 6.65k| node->inner()[idx] = next; 937| 6.65k| nodr->d.sizes[idx] = last + 1 - ts; 938| 6.65k| nodr->d.count = idx + 1; 939| 6.65k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 6.65k, False: 0] ------------------ 940| 6.65k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 6.65k| } else { 942| 2.80k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 2.80k| auto newr = newn->relaxed(); 944| 2.80k| newn->inner()[idx] = next; 945| 2.80k| newr->d.sizes[idx] = last + 1 - ts; 946| 2.80k| newr->d.count = idx + 1; 947| 2.80k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 2.80k, False: 0] ------------------ 948| 2.80k| if (Mutating) ------------------ | Branch (948:29): [True: 2.80k, Folded] ------------------ 949| 2.80k| pos.visit(dec_visitor{}); 950| 2.80k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 2.80k| } 952| 9.45k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 4.22k] ------------------ 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.22k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 4.22k, Folded] | Branch (956:40): [True: 3.64k, False: 585] | Branch (956:52): [True: 2.67k, False: 963] ------------------ 957| 2.67k| auto newn = pos.node()->inner()[0]; 958| 2.67k| if (!mutate) ------------------ | Branch (958:25): [True: 680, False: 1.99k] ------------------ 959| 680| newn->inc(); 960| 2.67k| if (Mutating) ------------------ | Branch (960:25): [True: 2.67k, Folded] ------------------ 961| 2.67k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 2.67k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.67k| } else { 964| 1.54k| if (mutate) { ------------------ | Branch (964:25): [True: 1.20k, False: 348] ------------------ 965| 1.20k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.20k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.20k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.20k| } else { 969| 348| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 348| if (Mutating) ------------------ | Branch (970:29): [True: 348, Folded] ------------------ 971| 348| pos.visit(dec_visitor{}); 972| 348| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 348| } 974| 1.54k| } 975| 13.6k| } 976| 13.6k| 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.6k| } 987| 30.1k| } _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| 964| { 1060| 964| auto old_tail_size = pos.count(); 1061| 964| auto new_tail_size = pos.index(last) + 1; 1062| 964| auto node = pos.node(); 1063| 964| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 964, Folded] | Branch (1063:42): [True: 277, False: 687] ------------------ 1064| 964| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 231, False: 733] ------------------ 1065| 231| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 231] ------------------ 1066| 0| node->inc(); 1067| 231| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 733| } else if (mutate) { ------------------ | Branch (1068:20): [True: 271, False: 462] ------------------ 1069| 271| detail::destroy_n(node->leaf() + new_tail_size, 1070| 271| old_tail_size - new_tail_size); 1071| 271| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 462| } else { 1073| 462| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 462| if (Mutating) ------------------ | Branch (1074:17): [True: 462, Folded] ------------------ 1075| 462| pos.visit(dec_visitor{}); 1076| 462| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 462| } 1078| 964| } _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| 917| { 1060| 917| auto old_tail_size = pos.count(); 1061| 917| auto new_tail_size = pos.index(last) + 1; 1062| 917| auto node = pos.node(); 1063| 917| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 917] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 917| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 527, False: 390] ------------------ 1065| 527| if (!Mutating) ------------------ | Branch (1065:17): [True: 527, Folded] ------------------ 1066| 527| node->inc(); 1067| 527| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 527| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 390] ------------------ 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| 390| } else { 1073| 390| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 390| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 390] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 390| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 390| } 1078| 917| } _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.7k, False: 2.80k] ------------------ 918| 14.7k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 14.7k] ------------------ 919| 14.7k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 14.7k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 14.7k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 14.7k| return res; 923| 14.7k| } else { 924| 2.80k| using std::get; 925| 2.80k| auto subs = 926| 2.80k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 2.80k] ------------------ 927| 2.80k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 2.80k| auto next = get<1>(subs); 929| 2.80k| auto ts = get<2>(subs); 930| 2.80k| auto tail = get<3>(subs); 931| 2.80k| IMMER_TRY { ------------------ | | 49| 2.80k|#define IMMER_TRY try ------------------ 932| 2.80k| if (next) { ------------------ | Branch (932:21): [True: 1.64k, False: 1.16k] ------------------ 933| 1.64k| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 1.64k] ------------------ 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.64k| } else { 942| 1.64k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.64k| auto newr = newn->relaxed(); 944| 1.64k| newn->inner()[idx] = next; 945| 1.64k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.64k| newr->d.count = idx + 1; 947| 1.64k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.64k, False: 0] ------------------ 948| 1.64k| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 1.64k] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 1.64k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.64k| } 952| 1.64k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 1.16k] ------------------ 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.16k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 1.16k, Folded] | Branch (956:40): [True: 628, False: 536] | Branch (956:52): [True: 287, False: 341] ------------------ 957| 287| auto newn = pos.node()->inner()[0]; 958| 287| if (!mutate) ------------------ | Branch (958:25): [True: 287, False: 0] ------------------ 959| 287| newn->inc(); 960| 287| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 287] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 287| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 877| } else { 964| 877| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 877] ------------------ 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| 877| } else { 969| 877| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 877| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 877] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 877| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 877| } 974| 877| } 975| 2.80k| } 976| 2.80k| 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.80k| } 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.25k| { 992| 1.25k| auto idx = pos.index(last); 993| 1.25k| auto node = pos.node(); 994| 1.25k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.25k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.25k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.25k, Folded] | Branch (995:25): [True: 343, False: 912] ------------------ 996| 343| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 343] ------------------ 997| 343| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 343| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 343] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 343| return res; 1001| 912| } else { 1002| 912| using std::get; 1003| 912| auto subs = 1004| 912| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 912] ------------------ 1005| 912| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 912| auto next = get<1>(subs); 1007| 912| auto ts = get<2>(subs); 1008| 912| auto tail = get<3>(subs); 1009| 912| IMMER_TRY { ------------------ | | 49| 912|#define IMMER_TRY try ------------------ 1010| 912| if (next) { ------------------ | Branch (1010:21): [True: 269, False: 643] ------------------ 1011| 269| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 269] ------------------ 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| 269| } else { 1016| 269| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 269| newn->inner()[idx] = next; 1018| 269| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 269] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 269| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 269| } 1022| 643| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 643] ------------------ 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| 643| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 643, Folded] | Branch (1026:40): [True: 394, False: 249] | Branch (1026:52): [True: 199, False: 195] ------------------ 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| 444| } else { 1034| 444| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 444] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 444| } else { 1038| 444| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 444| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 444] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 444| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 444| } 1043| 444| } 1044| 912| } 1045| 912| 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| 912| } 1055| 1.25k| } _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: 803, False: 984] ------------------ 996| 803| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 803] ------------------ 997| 803| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 803| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 803] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 803| return res; 1001| 984| } else { 1002| 984| using std::get; 1003| 984| auto subs = 1004| 984| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 984] ------------------ 1005| 984| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 984| auto next = get<1>(subs); 1007| 984| auto ts = get<2>(subs); 1008| 984| auto tail = get<3>(subs); 1009| 984| IMMER_TRY { ------------------ | | 49| 984|#define IMMER_TRY try ------------------ 1010| 984| if (next) { ------------------ | Branch (1010:21): [True: 310, False: 674] ------------------ 1011| 310| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 310] ------------------ 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| 310| } else { 1016| 310| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 310| newn->inner()[idx] = next; 1018| 310| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 310] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 310| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 310| } 1022| 674| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 674] ------------------ 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| 674| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 674, Folded] | Branch (1026:40): [True: 429, False: 245] | Branch (1026:52): [True: 203, False: 226] ------------------ 1027| 203| auto newn = pos.node()->inner()[0]; 1028| 203| if (!mutate) ------------------ | Branch (1028:25): [True: 203, False: 0] ------------------ 1029| 203| newn->inc(); 1030| 203| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 203] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 203| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 471| } else { 1034| 471| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 471] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 471| } else { 1038| 471| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 471| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 471] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 471| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 471| } 1043| 471| } 1044| 984| } 1045| 984| 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| 984| } 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.34k| { 1060| 3.34k| auto old_tail_size = pos.count(); 1061| 3.34k| auto new_tail_size = pos.index(last) + 1; 1062| 3.34k| auto node = pos.node(); 1063| 3.34k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 3.34k, Folded] | Branch (1063:42): [True: 661, False: 2.68k] ------------------ 1064| 3.34k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.10k, False: 2.24k] ------------------ 1065| 1.10k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.10k] ------------------ 1066| 0| node->inc(); 1067| 1.10k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.24k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 569, False: 1.67k] ------------------ 1069| 569| detail::destroy_n(node->leaf() + new_tail_size, 1070| 569| old_tail_size - new_tail_size); 1071| 569| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.67k| } else { 1073| 1.67k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.67k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.67k, Folded] ------------------ 1075| 1.67k| pos.visit(dec_visitor{}); 1076| 1.67k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.67k| } 1078| 3.34k| } _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| 3.80k| { 992| 3.80k| auto idx = pos.index(last); 993| 3.80k| auto node = pos.node(); 994| 3.80k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.80k, Folded] | Branch (994:35): [True: 1.57k, False: 2.22k] ------------------ 995| 3.80k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.80k] | 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| 3.80k| } else { 1002| 3.80k| using std::get; 1003| 3.80k| auto subs = 1004| 3.80k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 1.57k, False: 2.22k] ------------------ 1005| 3.80k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.80k| auto next = get<1>(subs); 1007| 3.80k| auto ts = get<2>(subs); 1008| 3.80k| auto tail = get<3>(subs); 1009| 3.80k| IMMER_TRY { ------------------ | | 49| 3.80k|#define IMMER_TRY try ------------------ 1010| 3.80k| if (next) { ------------------ | Branch (1010:21): [True: 941, False: 2.85k] ------------------ 1011| 941| if (mutate) { ------------------ | Branch (1011:25): [True: 379, False: 562] ------------------ 1012| 379| node->inner()[idx] = next; 1013| 379| pos.each_right(dec_visitor{}, idx + 1); 1014| 379| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 562| } else { 1016| 562| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 562| newn->inner()[idx] = next; 1018| 562| if (Mutating) ------------------ | Branch (1018:29): [True: 562, Folded] ------------------ 1019| 562| pos.visit(dec_visitor{}); 1020| 562| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 562| } 1022| 2.85k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 894, False: 1.96k] ------------------ 1023| 894| if (Mutating) ------------------ | Branch (1023:25): [True: 894, Folded] ------------------ 1024| 894| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 894| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.96k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.96k] | 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.96k| } else { 1034| 1.96k| if (mutate) { ------------------ | Branch (1034:25): [True: 765, False: 1.20k] ------------------ 1035| 765| pos.each_right(dec_visitor{}, idx + 1); 1036| 765| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.20k| } else { 1038| 1.20k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.20k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.20k, Folded] ------------------ 1040| 1.20k| pos.visit(dec_visitor{}); 1041| 1.20k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.20k| } 1043| 1.96k| } 1044| 3.80k| } 1045| 3.80k| 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.80k| } 1055| 3.80k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 2.93k| { 879| 2.93k| using node_t = node_type; 880| 2.93k| auto node = p.node(); 881| 2.93k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.65k, False: 1.28k] ------------------ 882| 1.65k| p.each_right(dec_t{}, idx); 883| 1.65k| node_t::delete_inner(node, p.count()); 884| 1.65k| } 885| 2.93k| } _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.0k| { 1060| 10.0k| auto old_tail_size = pos.count(); 1061| 10.0k| auto new_tail_size = pos.index(last) + 1; 1062| 10.0k| auto node = pos.node(); 1063| 10.0k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 10.0k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 10.0k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.29k, False: 8.73k] ------------------ 1065| 1.29k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.29k, Folded] ------------------ 1066| 1.29k| node->inc(); 1067| 1.29k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 8.73k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 8.73k] ------------------ 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.73k| } else { 1073| 8.73k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 8.73k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 8.73k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 8.73k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 8.73k| } 1078| 10.0k| } _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.07k| { 992| 6.07k| auto idx = pos.index(last); 993| 6.07k| auto node = pos.node(); 994| 6.07k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 6.07k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 6.07k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 6.07k] | 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.07k| } else { 1002| 6.07k| using std::get; 1003| 6.07k| auto subs = 1004| 6.07k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 6.07k] ------------------ 1005| 6.07k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 6.07k| auto next = get<1>(subs); 1007| 6.07k| auto ts = get<2>(subs); 1008| 6.07k| auto tail = get<3>(subs); 1009| 6.07k| IMMER_TRY { ------------------ | | 49| 6.07k|#define IMMER_TRY try ------------------ 1010| 6.07k| if (next) { ------------------ | Branch (1010:21): [True: 707, False: 5.36k] ------------------ 1011| 707| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 707] ------------------ 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| 707| } else { 1016| 707| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 707| newn->inner()[idx] = next; 1018| 707| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 707] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 707| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 707| } 1022| 5.36k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.26k, False: 4.10k] ------------------ 1023| 1.26k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.26k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.26k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 4.10k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 4.10k] | 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.10k| } else { 1034| 4.10k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 4.10k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 4.10k| } else { 1038| 4.10k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 4.10k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 4.10k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 4.10k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 4.10k| } 1043| 4.10k| } 1044| 6.07k| } 1045| 6.07k| 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.07k| } 1055| 6.07k| } _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| 405| { 1060| 405| auto old_tail_size = pos.count(); 1061| 405| auto new_tail_size = pos.index(last) + 1; 1062| 405| auto node = pos.node(); 1063| 405| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 405] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 405| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 195, False: 210] ------------------ 1065| 195| if (!Mutating) ------------------ | Branch (1065:17): [True: 195, Folded] ------------------ 1066| 195| node->inc(); 1067| 195| 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| 405| } _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.55k| { 1060| 1.55k| auto old_tail_size = pos.count(); 1061| 1.55k| auto new_tail_size = pos.index(last) + 1; 1062| 1.55k| auto node = pos.node(); 1063| 1.55k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.55k, Folded] | Branch (1063:42): [True: 212, False: 1.34k] ------------------ 1064| 1.55k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 329, False: 1.22k] ------------------ 1065| 329| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 329] ------------------ 1066| 0| node->inc(); 1067| 329| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.22k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 210, False: 1.01k] ------------------ 1069| 210| detail::destroy_n(node->leaf() + new_tail_size, 1070| 210| old_tail_size - new_tail_size); 1071| 210| 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.55k| } _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.14k| { 992| 4.14k| auto idx = pos.index(last); 993| 4.14k| auto node = pos.node(); 994| 4.14k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.14k, Folded] | Branch (994:35): [True: 3.09k, False: 1.05k] ------------------ 995| 4.14k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.14k] | 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.14k| } else { 1002| 4.14k| using std::get; 1003| 4.14k| auto subs = 1004| 4.14k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.09k, False: 1.05k] ------------------ 1005| 4.14k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.14k| auto next = get<1>(subs); 1007| 4.14k| auto ts = get<2>(subs); 1008| 4.14k| auto tail = get<3>(subs); 1009| 4.14k| IMMER_TRY { ------------------ | | 49| 4.14k|#define IMMER_TRY try ------------------ 1010| 4.14k| if (next) { ------------------ | Branch (1010:21): [True: 1.93k, False: 2.21k] ------------------ 1011| 1.93k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.36k, False: 571] ------------------ 1012| 1.36k| node->inner()[idx] = next; 1013| 1.36k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.36k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.36k| } else { 1016| 571| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 571| newn->inner()[idx] = next; 1018| 571| if (Mutating) ------------------ | Branch (1018:29): [True: 571, Folded] ------------------ 1019| 571| pos.visit(dec_visitor{}); 1020| 571| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 571| } 1022| 2.21k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.46k, False: 753] ------------------ 1023| 1.46k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.46k, Folded] ------------------ 1024| 1.46k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.46k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.46k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 753] | 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| 753| } else { 1034| 753| if (mutate) { ------------------ | Branch (1034:25): [True: 498, False: 255] ------------------ 1035| 498| pos.each_right(dec_visitor{}, idx + 1); 1036| 498| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 498| } else { 1038| 255| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 255| if (Mutating) ------------------ | Branch (1039:29): [True: 255, Folded] ------------------ 1040| 255| pos.visit(dec_visitor{}); 1041| 255| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 255| } 1043| 753| } 1044| 4.14k| } 1045| 4.14k| 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.14k| } 1055| 4.14k| } _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.46k| { 879| 1.46k| using node_t = node_type; 880| 1.46k| auto node = p.node(); 881| 1.46k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.23k, False: 229] ------------------ 882| 1.23k| p.each_right(dec_t{}, idx); 883| 1.23k| node_t::delete_inner(node, p.count()); 884| 1.23k| } 885| 1.46k| } _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.48k| { 1060| 2.48k| auto old_tail_size = pos.count(); 1061| 2.48k| auto new_tail_size = pos.index(last) + 1; 1062| 2.48k| auto node = pos.node(); 1063| 2.48k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.48k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.48k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 325, False: 2.16k] ------------------ 1065| 325| if (!Mutating) ------------------ | Branch (1065:17): [True: 325, Folded] ------------------ 1066| 325| node->inc(); 1067| 325| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.16k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 2.16k] ------------------ 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.16k| } else { 1073| 2.16k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 2.16k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 2.16k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 2.16k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 2.16k| } 1078| 2.48k| } _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.17k| { 992| 3.17k| auto idx = pos.index(last); 993| 3.17k| auto node = pos.node(); 994| 3.17k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.17k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.17k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.17k] | 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.17k| } else { 1002| 3.17k| using std::get; 1003| 3.17k| auto subs = 1004| 3.17k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.17k] ------------------ 1005| 3.17k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.17k| auto next = get<1>(subs); 1007| 3.17k| auto ts = get<2>(subs); 1008| 3.17k| auto tail = get<3>(subs); 1009| 3.17k| IMMER_TRY { ------------------ | | 49| 3.17k|#define IMMER_TRY try ------------------ 1010| 3.17k| if (next) { ------------------ | Branch (1010:21): [True: 973, False: 2.20k] ------------------ 1011| 973| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 973] ------------------ 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| 973| } else { 1016| 973| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 973| newn->inner()[idx] = next; 1018| 973| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 973] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 973| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 973| } 1022| 2.20k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 826, False: 1.37k] ------------------ 1023| 826| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 826] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 826| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.37k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.37k] | 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.37k| } else { 1034| 1.37k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.37k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.37k| } else { 1038| 1.37k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.37k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.37k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.37k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.37k| } 1043| 1.37k| } 1044| 3.17k| } 1045| 3.17k| 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.17k| } 1055| 3.17k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_j: 867| 20.4k| { 868| 20.4k| using node_t = node_type; 869| 20.4k| auto node = p.node(); 870| 20.4k| if (node->dec()) { ------------------ | Branch (870:13): [True: 14.1k, False: 6.35k] ------------------ 871| 14.1k| p.each_right(dec_t{}, idx); 872| 14.1k| node_t::delete_inner_r(node, p.count()); 873| 14.1k| } 874| 20.4k| } _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.56k| { 1060| 2.56k| auto old_tail_size = pos.count(); 1061| 2.56k| auto new_tail_size = pos.index(last) + 1; 1062| 2.56k| auto node = pos.node(); 1063| 2.56k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 2.56k, Folded] | Branch (1063:42): [True: 361, False: 2.20k] ------------------ 1064| 2.56k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 745, False: 1.81k] ------------------ 1065| 745| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 745] ------------------ 1066| 0| node->inc(); 1067| 745| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.81k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 314, False: 1.50k] ------------------ 1069| 314| detail::destroy_n(node->leaf() + new_tail_size, 1070| 314| old_tail_size - new_tail_size); 1071| 314| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.50k| } else { 1073| 1.50k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.50k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.50k, Folded] ------------------ 1075| 1.50k| pos.visit(dec_visitor{}); 1076| 1.50k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.50k| } 1078| 2.56k| } _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.36k| { 914| 4.36k| auto idx = pos.index(last); 915| 4.36k| auto node = pos.node(); 916| 4.36k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 4.36k, Folded] | Branch (916:35): [True: 2.62k, False: 1.73k] ------------------ 917| 4.36k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 4.36k] | 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.36k| } else { 924| 4.36k| using std::get; 925| 4.36k| auto subs = 926| 4.36k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 2.62k, False: 1.73k] ------------------ 927| 4.36k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 4.36k| auto next = get<1>(subs); 929| 4.36k| auto ts = get<2>(subs); 930| 4.36k| auto tail = get<3>(subs); 931| 4.36k| IMMER_TRY { ------------------ | | 49| 4.36k|#define IMMER_TRY try ------------------ 932| 4.36k| if (next) { ------------------ | Branch (932:21): [True: 1.32k, False: 3.03k] ------------------ 933| 1.32k| if (mutate) { ------------------ | Branch (933:25): [True: 1.03k, False: 291] ------------------ 934| 1.03k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 1.03k| pos.each_right(dec_visitor{}, idx + 1); 936| 1.03k| node->inner()[idx] = next; 937| 1.03k| nodr->d.sizes[idx] = last + 1 - ts; 938| 1.03k| nodr->d.count = idx + 1; 939| 1.03k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 1.03k, False: 0] ------------------ 940| 1.03k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 1.03k| } else { 942| 291| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 291| auto newr = newn->relaxed(); 944| 291| newn->inner()[idx] = next; 945| 291| newr->d.sizes[idx] = last + 1 - ts; 946| 291| newr->d.count = idx + 1; 947| 291| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 291, False: 0] ------------------ 948| 291| if (Mutating) ------------------ | Branch (948:29): [True: 291, Folded] ------------------ 949| 291| pos.visit(dec_visitor{}); 950| 291| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 291| } 952| 3.03k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 1.29k, False: 1.74k] ------------------ 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.74k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.74k] | 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.74k| } else { 964| 1.74k| if (mutate) { ------------------ | Branch (964:25): [True: 992, False: 750] ------------------ 965| 992| pos.each_right(dec_visitor{}, idx + 1); 966| 992| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 992| return std::make_tuple(pos.shift(), node, ts, tail); 968| 992| } else { 969| 750| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 750| if (Mutating) ------------------ | Branch (970:29): [True: 750, Folded] ------------------ 971| 750| pos.visit(dec_visitor{}); 972| 750| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 750| } 974| 1.74k| } 975| 4.36k| } 976| 4.36k| 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.36k| } 987| 4.36k| } _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.55k| { 992| 5.55k| auto idx = pos.index(last); 993| 5.55k| auto node = pos.node(); 994| 5.55k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 5.55k, Folded] | Branch (994:35): [True: 4.16k, False: 1.38k] ------------------ 995| 5.55k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 5.55k] | 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.55k| } else { 1002| 5.55k| using std::get; 1003| 5.55k| auto subs = 1004| 5.55k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 4.16k, False: 1.38k] ------------------ 1005| 5.55k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.55k| auto next = get<1>(subs); 1007| 5.55k| auto ts = get<2>(subs); 1008| 5.55k| auto tail = get<3>(subs); 1009| 5.55k| IMMER_TRY { ------------------ | | 49| 5.55k|#define IMMER_TRY try ------------------ 1010| 5.55k| if (next) { ------------------ | Branch (1010:21): [True: 3.87k, False: 1.67k] ------------------ 1011| 3.87k| if (mutate) { ------------------ | Branch (1011:25): [True: 3.14k, False: 732] ------------------ 1012| 3.14k| node->inner()[idx] = next; 1013| 3.14k| pos.each_right(dec_visitor{}, idx + 1); 1014| 3.14k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 3.14k| } else { 1016| 732| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 732| newn->inner()[idx] = next; 1018| 732| if (Mutating) ------------------ | Branch (1018:29): [True: 732, Folded] ------------------ 1019| 732| pos.visit(dec_visitor{}); 1020| 732| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 732| } 1022| 3.87k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 929, False: 750] ------------------ 1023| 929| if (Mutating) ------------------ | Branch (1023:25): [True: 929, Folded] ------------------ 1024| 929| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 929| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 929| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 750] | 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| 750| } else { 1034| 750| if (mutate) { ------------------ | Branch (1034:25): [True: 391, False: 359] ------------------ 1035| 391| pos.each_right(dec_visitor{}, idx + 1); 1036| 391| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 391| } else { 1038| 359| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 359| if (Mutating) ------------------ | Branch (1039:29): [True: 359, Folded] ------------------ 1040| 359| pos.visit(dec_visitor{}); 1041| 359| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 359| } 1043| 750| } 1044| 5.55k| } 1045| 5.55k| 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.55k| } 1055| 5.55k| } _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.89k| { 879| 9.89k| using node_t = node_type; 880| 9.89k| auto node = p.node(); 881| 9.89k| if (node->dec()) { ------------------ | Branch (881:13): [True: 6.78k, False: 3.10k] ------------------ 882| 6.78k| p.each_right(dec_t{}, idx); 883| 6.78k| node_t::delete_inner(node, p.count()); 884| 6.78k| } 885| 9.89k| } _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.39k| { 1060| 5.39k| auto old_tail_size = pos.count(); 1061| 5.39k| auto new_tail_size = pos.index(last) + 1; 1062| 5.39k| auto node = pos.node(); 1063| 5.39k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 5.39k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 5.39k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.11k, False: 4.28k] ------------------ 1065| 1.11k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.11k, Folded] ------------------ 1066| 1.11k| node->inc(); 1067| 1.11k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 4.28k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 4.28k] ------------------ 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.28k| } else { 1073| 4.28k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 4.28k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 4.28k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 4.28k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 4.28k| } 1078| 5.39k| } _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.33k| { 914| 4.33k| auto idx = pos.index(last); 915| 4.33k| auto node = pos.node(); 916| 4.33k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 4.33k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 4.33k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 4.33k] | 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.33k| } else { 924| 4.33k| using std::get; 925| 4.33k| auto subs = 926| 4.33k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 4.33k] ------------------ 927| 4.33k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 4.33k| auto next = get<1>(subs); 929| 4.33k| auto ts = get<2>(subs); 930| 4.33k| auto tail = get<3>(subs); 931| 4.33k| IMMER_TRY { ------------------ | | 49| 4.33k|#define IMMER_TRY try ------------------ 932| 4.33k| if (next) { ------------------ | Branch (932:21): [True: 990, False: 3.34k] ------------------ 933| 990| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 990] ------------------ 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| 990| } else { 942| 990| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 990| auto newr = newn->relaxed(); 944| 990| newn->inner()[idx] = next; 945| 990| newr->d.sizes[idx] = last + 1 - ts; 946| 990| newr->d.count = idx + 1; 947| 990| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 990, False: 0] ------------------ 948| 990| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 990] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 990| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 990| } 952| 3.34k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 1.11k, False: 2.23k] ------------------ 953| 1.11k| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 1.11k] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 1.11k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 2.23k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 2.23k] | 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.23k| } else { 964| 2.23k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 2.23k] ------------------ 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.23k| } else { 969| 2.23k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 2.23k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 2.23k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 2.23k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 2.23k| } 974| 2.23k| } 975| 4.33k| } 976| 4.33k| 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.33k| } 987| 4.33k| } _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.15k, False: 831] ------------------ 1011| 2.15k| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 2.15k] ------------------ 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.15k| } else { 1016| 2.15k| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 2.15k| newn->inner()[idx] = next; 1018| 2.15k| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 2.15k] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 2.15k| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 2.15k| } 1022| 2.15k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 484, False: 347] ------------------ 1023| 484| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 484] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 484| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 484| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 347] | 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| 347| } else { 1034| 347| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 347] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 347| } else { 1038| 347| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 347| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 347] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 347| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 347| } 1043| 347| } 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.7k| { 992| 11.7k| auto idx = pos.index(last); 993| 11.7k| auto node = pos.node(); 994| 11.7k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 11.7k, Folded] | Branch (994:35): [True: 7.85k, False: 3.93k] ------------------ 995| 11.7k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 11.7k, Folded] | Branch (995:25): [True: 6.73k, False: 5.05k] ------------------ 996| 6.73k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 4.68k, False: 2.04k] ------------------ 997| 6.73k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 6.73k| if (Mutating) ------------------ | Branch (998:17): [True: 6.73k, Folded] ------------------ 999| 6.73k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 6.73k| return res; 1001| 6.73k| } else { 1002| 5.05k| using std::get; 1003| 5.05k| auto subs = 1004| 5.05k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.16k, False: 1.88k] ------------------ 1005| 5.05k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.05k| auto next = get<1>(subs); 1007| 5.05k| auto ts = get<2>(subs); 1008| 5.05k| auto tail = get<3>(subs); 1009| 5.05k| IMMER_TRY { ------------------ | | 49| 5.05k|#define IMMER_TRY try ------------------ 1010| 5.05k| if (next) { ------------------ | Branch (1010:21): [True: 1.03k, False: 4.02k] ------------------ 1011| 1.03k| if (mutate) { ------------------ | Branch (1011:25): [True: 500, False: 533] ------------------ 1012| 500| node->inner()[idx] = next; 1013| 500| pos.each_right(dec_visitor{}, idx + 1); 1014| 500| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 533| } else { 1016| 533| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 533| newn->inner()[idx] = next; 1018| 533| if (Mutating) ------------------ | Branch (1018:29): [True: 533, Folded] ------------------ 1019| 533| pos.visit(dec_visitor{}); 1020| 533| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 533| } 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.64k, False: 381] | Branch (1026:52): [True: 2.23k, False: 1.40k] ------------------ 1027| 2.23k| auto newn = pos.node()->inner()[0]; 1028| 2.23k| if (!mutate) ------------------ | Branch (1028:25): [True: 774, False: 1.46k] ------------------ 1029| 774| newn->inc(); 1030| 2.23k| if (Mutating) ------------------ | Branch (1030:25): [True: 2.23k, Folded] ------------------ 1031| 2.23k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 2.23k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 2.23k| } else { 1034| 1.79k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.20k, False: 582] ------------------ 1035| 1.20k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.20k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.20k| } else { 1038| 582| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 582| if (Mutating) ------------------ | Branch (1039:29): [True: 582, Folded] ------------------ 1040| 582| pos.visit(dec_visitor{}); 1041| 582| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 582| } 1043| 1.79k| } 1044| 5.05k| } 1045| 5.05k| 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.05k| } 1055| 11.7k| } _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: 572, False: 1.03k] ------------------ 1064| 1.61k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 396, False: 1.21k] ------------------ 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.21k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 571, False: 643] ------------------ 1069| 571| detail::destroy_n(node->leaf() + new_tail_size, 1070| 571| old_tail_size - new_tail_size); 1071| 571| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 643| } else { 1073| 643| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 643| if (Mutating) ------------------ | Branch (1074:17): [True: 643, Folded] ------------------ 1075| 643| pos.visit(dec_visitor{}); 1076| 643| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 643| } 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.32k| { 992| 3.32k| auto idx = pos.index(last); 993| 3.32k| auto node = pos.node(); 994| 3.32k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.32k, Folded] | Branch (994:35): [True: 1.79k, False: 1.52k] ------------------ 995| 3.32k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.32k, Folded] | Branch (995:25): [True: 1.39k, False: 1.93k] ------------------ 996| 1.39k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 944, False: 446] ------------------ 997| 1.39k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 1.39k| if (Mutating) ------------------ | Branch (998:17): [True: 1.39k, Folded] ------------------ 999| 1.39k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 1.39k| return res; 1001| 1.93k| } else { 1002| 1.93k| using std::get; 1003| 1.93k| auto subs = 1004| 1.93k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 849, False: 1.08k] ------------------ 1005| 1.93k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.93k| auto next = get<1>(subs); 1007| 1.93k| auto ts = get<2>(subs); 1008| 1.93k| auto tail = get<3>(subs); 1009| 1.93k| IMMER_TRY { ------------------ | | 49| 1.93k|#define IMMER_TRY try ------------------ 1010| 1.93k| if (next) { ------------------ | Branch (1010:21): [True: 557, False: 1.37k] ------------------ 1011| 557| if (mutate) { ------------------ | Branch (1011:25): [True: 211, False: 346] ------------------ 1012| 211| node->inner()[idx] = next; 1013| 211| pos.each_right(dec_visitor{}, idx + 1); 1014| 211| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 346| } else { 1016| 346| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 346| newn->inner()[idx] = next; 1018| 346| if (Mutating) ------------------ | Branch (1018:29): [True: 346, Folded] ------------------ 1019| 346| pos.visit(dec_visitor{}); 1020| 346| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 346| } 1022| 1.37k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.37k] ------------------ 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.37k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.37k, Folded] | Branch (1026:40): [True: 1.05k, False: 314] | Branch (1026:52): [True: 654, False: 405] ------------------ 1027| 654| auto newn = pos.node()->inner()[0]; 1028| 654| if (!mutate) ------------------ | Branch (1028:25): [True: 377, False: 277] ------------------ 1029| 377| newn->inc(); 1030| 654| if (Mutating) ------------------ | Branch (1030:25): [True: 654, Folded] ------------------ 1031| 654| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 654| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 719| } else { 1034| 719| if (mutate) { ------------------ | Branch (1034:25): [True: 361, False: 358] ------------------ 1035| 361| pos.each_right(dec_visitor{}, idx + 1); 1036| 361| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 361| } else { 1038| 358| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 358| if (Mutating) ------------------ | Branch (1039:29): [True: 358, Folded] ------------------ 1040| 358| pos.visit(dec_visitor{}); 1041| 358| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 358| } 1043| 719| } 1044| 1.93k| } 1045| 1.93k| 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.93k| } 1055| 3.32k| } _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| 703| { 1060| 703| auto old_tail_size = pos.count(); 1061| 703| auto new_tail_size = pos.index(last) + 1; 1062| 703| auto node = pos.node(); 1063| 703| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 703, Folded] | Branch (1063:42): [True: 268, False: 435] ------------------ 1064| 703| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 236, False: 467] ------------------ 1065| 236| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 236] ------------------ 1066| 0| node->inc(); 1067| 236| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 467| } else if (mutate) { ------------------ | Branch (1068:20): [True: 199, False: 268] ------------------ 1069| 199| detail::destroy_n(node->leaf() + new_tail_size, 1070| 199| old_tail_size - new_tail_size); 1071| 199| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 268| } else { 1073| 268| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 268| if (Mutating) ------------------ | Branch (1074:17): [True: 268, Folded] ------------------ 1075| 268| pos.visit(dec_visitor{}); 1076| 268| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 268| } 1078| 703| } _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| 1.10k| { 1378| 1.10k| auto node = pos.node(); 1379| 1.10k| auto idx = pos.index(first); 1380| 1.10k| auto count = pos.count(); 1381| 1.10k| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 1.10k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 845, False: 259] ------------------ 1384| 1.10k| if (mutate) { ------------------ | Branch (1384:13): [True: 845, False: 259] ------------------ 1385| 845| auto data = node->leaf(); 1386| 845| auto newcount = count - idx; 1387| 845| std::move(data + idx, data + count, data); 1388| 845| detail::destroy_n(data + newcount, idx); 1389| 845| return std::make_tuple(0, node); 1390| 845| } else { 1391| 259| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 259| if (Mutating) ------------------ | Branch (1392:17): [True: 259, Folded] ------------------ 1393| 259| pos.visit(dec_visitor{}); 1394| 259| return std::make_tuple(0, newn); 1395| 259| } 1396| 1.10k| } _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| 66.9k| { 1247| 66.9k| auto idx = pos.subindex(first); 1248| 66.9k| auto count = pos.count(); 1249| 66.9k| auto node = pos.node(); 1250| 66.9k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 66.9k, Folded] | Branch (1250:47): [True: 51.6k, False: 15.3k] ------------------ 1251| 66.9k| auto left_size = pos.size_before(idx); 1252| 66.9k| auto child_size = pos.size_sbh(idx, left_size); 1253| 66.9k| auto dropped_size = first; 1254| 66.9k| auto child_dropped_size = dropped_size - left_size; 1255| 66.9k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 66.9k, Folded] | Branch (1255:25): [True: 64.9k, False: 1.96k] | Branch (1255:45): [True: 4.78k, False: 60.1k] ------------------ 1256| 4.78k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 1.97k, False: 2.80k] ------------------ 1257| 4.78k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 4.78k| if (mutate) ------------------ | Branch (1258:17): [True: 1.97k, False: 2.80k] ------------------ 1259| 1.97k| pos.visit(dec_left_visitor{}, idx); 1260| 2.80k| else if (Mutating) ------------------ | Branch (1260:22): [True: 2.80k, Folded] ------------------ 1261| 2.80k| pos.visit(dec_visitor{}); 1262| 4.78k| return r; 1263| 62.1k| } else { 1264| 62.1k| using std::get; 1265| 62.1k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 49.6k, False: 12.4k] ------------------ 1266| 62.1k| : node_t::make_inner_r_e(e); 1267| 62.1k| auto newr = newn->relaxed(); 1268| 62.1k| auto newcount = count - idx; 1269| 62.1k| auto new_child_size = child_size - child_dropped_size; 1270| 62.1k| IMMER_TRY { ------------------ | | 49| 62.1k|#define IMMER_TRY try ------------------ 1271| 62.1k| auto subs = 1272| 62.1k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 49.6k, False: 12.4k] ------------------ 1273| 62.1k| : pos.towards_sub_oh( 1274| 12.4k| no_collapse_no_mut_t{}, first, idx, e); 1275| 62.1k| if (mutate) ------------------ | Branch (1275:21): [True: 49.6k, False: 12.4k] ------------------ 1276| 49.6k| pos.each_left(dec_visitor{}, idx); 1277| 62.1k| pos.copy_sizes( 1278| 62.1k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 62.1k| std::copy(node->inner() + idx + 1, 1280| 62.1k| node->inner() + count, 1281| 62.1k| newn->inner() + 1); 1282| 62.1k| newn->inner()[0] = get<1>(subs); 1283| 62.1k| newr->d.sizes[0] = new_child_size; 1284| 62.1k| newr->d.count = newcount; 1285| 62.1k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 62.1k, False: 0] ------------------ 1286| 62.1k| if (!mutate) { ------------------ | Branch (1286:21): [True: 12.4k, False: 49.6k] ------------------ 1287| 12.4k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 12.4k| if (Mutating) ------------------ | Branch (1288:25): [True: 12.4k, Folded] ------------------ 1289| 12.4k| pos.visit(dec_visitor{}); 1290| 12.4k| } 1291| 62.1k| return std::make_tuple(pos.shift(), newn); 1292| 62.1k| } 1293| 62.1k| 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| 62.1k| } 1299| 66.9k| } _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.23k| { 1247| 2.23k| auto idx = pos.subindex(first); 1248| 2.23k| auto count = pos.count(); 1249| 2.23k| auto node = pos.node(); 1250| 2.23k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.23k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.23k| auto left_size = pos.size_before(idx); 1252| 2.23k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.23k| auto dropped_size = first; 1254| 2.23k| auto child_dropped_size = dropped_size - left_size; 1255| 2.23k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.23k, Folded] | Branch (1255:25): [True: 1.05k, False: 1.17k] | Branch (1255:45): [True: 610, False: 448] ------------------ 1256| 610| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 610] ------------------ 1257| 610| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 610| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 610] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 610| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 610] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 610| return r; 1263| 1.62k| } else { 1264| 1.62k| using std::get; 1265| 1.62k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.62k] ------------------ 1266| 1.62k| : node_t::make_inner_r_e(e); 1267| 1.62k| auto newr = newn->relaxed(); 1268| 1.62k| auto newcount = count - idx; 1269| 1.62k| auto new_child_size = child_size - child_dropped_size; 1270| 1.62k| IMMER_TRY { ------------------ | | 49| 1.62k|#define IMMER_TRY try ------------------ 1271| 1.62k| auto subs = 1272| 1.62k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.62k] ------------------ 1273| 1.62k| : pos.towards_sub_oh( 1274| 1.62k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.62k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.62k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.62k| pos.copy_sizes( 1278| 1.62k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.62k| std::copy(node->inner() + idx + 1, 1280| 1.62k| node->inner() + count, 1281| 1.62k| newn->inner() + 1); 1282| 1.62k| newn->inner()[0] = get<1>(subs); 1283| 1.62k| newr->d.sizes[0] = new_child_size; 1284| 1.62k| newr->d.count = newcount; 1285| 1.62k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.62k, False: 0] ------------------ 1286| 1.62k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.62k, False: 0] ------------------ 1287| 1.62k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.62k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.62k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.62k| } 1291| 1.62k| return std::make_tuple(pos.shift(), newn); 1292| 1.62k| } 1293| 1.62k| 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.62k| } 1299| 2.23k| } _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.05k| { 1304| 2.05k| auto idx = pos.subindex(first); 1305| 2.05k| auto count = pos.count(); 1306| 2.05k| auto node = pos.node(); 1307| 2.05k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.05k] ------------------ 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.05k| auto left_size = pos.size_before(idx); 1313| 2.05k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.05k| auto dropped_size = first; 1315| 2.05k| auto child_dropped_size = dropped_size - left_size; 1316| 2.05k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.05k, Folded] | Branch (1316:25): [True: 1.02k, False: 1.02k] | Branch (1316:45): [True: 784, False: 244] ------------------ 1317| 784| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 784] ------------------ 1318| 784| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 784| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 784] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 784| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 784] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 784| return r; 1324| 1.27k| } else { 1325| 1.27k| 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.27k| auto newcount = count - idx; 1330| 1.27k| auto newn = 1331| 1.27k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.27k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.27k| : node_t::make_inner_r_e(e); 1336| 1.27k| auto newr = newn->relaxed(); 1337| 1.27k| IMMER_TRY { ------------------ | | 49| 1.27k|#define IMMER_TRY try ------------------ 1338| 1.27k| auto subs = 1339| 1.27k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.27k] ------------------ 1340| 1.27k| : pos.towards_sub_oh( 1341| 1.27k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.27k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.27k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.27k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.27k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.27k, False: 0] ------------------ 1346| 1.27k| pos.copy_sizes( 1347| 1.27k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.27k| newr->d.count = newcount; 1349| 1.27k| newn->inner()[0] = get<1>(subs); 1350| 1.27k| std::copy(node->inner() + idx + 1, 1351| 1.27k| node->inner() + count, 1352| 1.27k| newn->inner() + 1); 1353| 1.27k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.27k, False: 0] ------------------ 1354| 1.27k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.27k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.27k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.27k| } 1358| 1.27k| return std::make_tuple(pos.shift(), newn); 1359| 1.27k| } 1360| 1.27k| 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.27k| } 1373| 2.05k| } _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: 198, False: 423] | Branch (1316:45): [True: 0, False: 198] ------------------ 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.91k| { 1378| 2.91k| auto node = pos.node(); 1379| 2.91k| auto idx = pos.index(first); 1380| 2.91k| auto count = pos.count(); 1381| 2.91k| 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.91k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 764, False: 2.14k] ------------------ 1384| 2.91k| if (mutate) { ------------------ | Branch (1384:13): [True: 764, False: 2.14k] ------------------ 1385| 764| auto data = node->leaf(); 1386| 764| auto newcount = count - idx; 1387| 764| std::move(data + idx, data + count, data); 1388| 764| detail::destroy_n(data + newcount, idx); 1389| 764| 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| 2.91k| } _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.66k| { 1304| 1.66k| auto idx = pos.subindex(first); 1305| 1.66k| auto count = pos.count(); 1306| 1.66k| auto node = pos.node(); 1307| 1.66k| 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.66k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 872, False: 797] ------------------ 1312| 1.66k| auto left_size = pos.size_before(idx); 1313| 1.66k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.66k| auto dropped_size = first; 1315| 1.66k| auto child_dropped_size = dropped_size - left_size; 1316| 1.66k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.66k] | 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.66k| } else { 1325| 1.66k| 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.66k| auto newcount = count - idx; 1330| 1.66k| auto newn = 1331| 1.66k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 872, False: 797] ------------------ 1332| 872| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 872| norefs_tag{})) relaxed_t, 1334| 872| node) 1335| 1.66k| : node_t::make_inner_r_e(e); 1336| 1.66k| auto newr = newn->relaxed(); 1337| 1.66k| IMMER_TRY { ------------------ | | 49| 1.66k|#define IMMER_TRY try ------------------ 1338| 1.66k| auto subs = 1339| 1.66k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 872, False: 797] ------------------ 1340| 1.66k| : pos.towards_sub_oh( 1341| 797| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.66k| if (mutate) ------------------ | Branch (1342:21): [True: 872, False: 797] ------------------ 1343| 872| pos.each_left(dec_visitor{}, idx); 1344| 1.66k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.66k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.66k, False: 0] ------------------ 1346| 1.66k| pos.copy_sizes( 1347| 1.66k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.66k| newr->d.count = newcount; 1349| 1.66k| newn->inner()[0] = get<1>(subs); 1350| 1.66k| std::copy(node->inner() + idx + 1, 1351| 1.66k| node->inner() + count, 1352| 1.66k| newn->inner() + 1); 1353| 1.66k| if (!mutate) { ------------------ | Branch (1353:21): [True: 797, False: 872] ------------------ 1354| 797| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 797| if (Mutating) ------------------ | Branch (1355:25): [True: 797, Folded] ------------------ 1356| 797| pos.visit(dec_visitor{}); 1357| 797| } 1358| 1.66k| return std::make_tuple(pos.shift(), newn); 1359| 1.66k| } 1360| 1.66k| 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.66k| } 1373| 1.66k| } _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| 7.35k| { 1378| 7.35k| auto node = pos.node(); 1379| 7.35k| auto idx = pos.index(first); 1380| 7.35k| auto count = pos.count(); 1381| 7.35k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 7.35k] ------------------ 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| 7.35k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 7.35k] ------------------ 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| 7.35k| } else { 1391| 7.35k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 7.35k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 7.35k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 7.35k| return std::make_tuple(0, newn); 1395| 7.35k| } 1396| 7.35k| } _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.20k| { 1304| 2.20k| auto idx = pos.subindex(first); 1305| 2.20k| auto count = pos.count(); 1306| 2.20k| auto node = pos.node(); 1307| 2.20k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.20k] ------------------ 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.20k| auto left_size = pos.size_before(idx); 1313| 2.20k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.20k| auto dropped_size = first; 1315| 2.20k| auto child_dropped_size = dropped_size - left_size; 1316| 2.20k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.20k] | 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.20k| } else { 1325| 2.20k| 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.20k| auto newcount = count - idx; 1330| 2.20k| auto newn = 1331| 2.20k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.20k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.20k| : node_t::make_inner_r_e(e); 1336| 2.20k| auto newr = newn->relaxed(); 1337| 2.20k| IMMER_TRY { ------------------ | | 49| 2.20k|#define IMMER_TRY try ------------------ 1338| 2.20k| auto subs = 1339| 2.20k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.20k] ------------------ 1340| 2.20k| : pos.towards_sub_oh( 1341| 2.20k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.20k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.20k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.20k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.20k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.20k, False: 0] ------------------ 1346| 2.20k| pos.copy_sizes( 1347| 2.20k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.20k| newr->d.count = newcount; 1349| 2.20k| newn->inner()[0] = get<1>(subs); 1350| 2.20k| std::copy(node->inner() + idx + 1, 1351| 2.20k| node->inner() + count, 1352| 2.20k| newn->inner() + 1); 1353| 2.20k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.20k, False: 0] ------------------ 1354| 2.20k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.20k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.20k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.20k| } 1358| 2.20k| return std::make_tuple(pos.shift(), newn); 1359| 2.20k| } 1360| 2.20k| 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.20k| } 1373| 2.20k| } _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.03k| { 1210| 2.03k| using node_t = node_type; 1211| 2.03k| auto node = p.node(); 1212| 2.03k| if (node->dec()) { ------------------ | Branch (1212:13): [True: 2.03k, False: 0] ------------------ 1213| 2.03k| p.each_left(dec_t{}, idx); 1214| 2.03k| node_t::delete_inner(node, p.count()); 1215| 2.03k| } 1216| 2.03k| } _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.44k| { 1378| 4.44k| auto node = pos.node(); 1379| 4.44k| auto idx = pos.index(first); 1380| 4.44k| auto count = pos.count(); 1381| 4.44k| 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.44k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 2.22k, False: 2.21k] ------------------ 1384| 4.44k| if (mutate) { ------------------ | Branch (1384:13): [True: 2.22k, False: 2.21k] ------------------ 1385| 2.22k| auto data = node->leaf(); 1386| 2.22k| auto newcount = count - idx; 1387| 2.22k| std::move(data + idx, data + count, data); 1388| 2.22k| detail::destroy_n(data + newcount, idx); 1389| 2.22k| return std::make_tuple(0, node); 1390| 2.22k| } else { 1391| 2.21k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.21k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.21k, Folded] ------------------ 1393| 2.21k| pos.visit(dec_visitor{}); 1394| 2.21k| return std::make_tuple(0, newn); 1395| 2.21k| } 1396| 4.44k| } _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.84k| { 1304| 1.84k| auto idx = pos.subindex(first); 1305| 1.84k| auto count = pos.count(); 1306| 1.84k| auto node = pos.node(); 1307| 1.84k| 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.84k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 410, False: 1.43k] ------------------ 1312| 1.84k| auto left_size = pos.size_before(idx); 1313| 1.84k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.84k| auto dropped_size = first; 1315| 1.84k| auto child_dropped_size = dropped_size - left_size; 1316| 1.84k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.84k] | 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.84k| } else { 1325| 1.84k| 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.84k| auto newcount = count - idx; 1330| 1.84k| auto newn = 1331| 1.84k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 410, False: 1.43k] ------------------ 1332| 410| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 410| norefs_tag{})) relaxed_t, 1334| 410| node) 1335| 1.84k| : node_t::make_inner_r_e(e); 1336| 1.84k| auto newr = newn->relaxed(); 1337| 1.84k| IMMER_TRY { ------------------ | | 49| 1.84k|#define IMMER_TRY try ------------------ 1338| 1.84k| auto subs = 1339| 1.84k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 410, False: 1.43k] ------------------ 1340| 1.84k| : pos.towards_sub_oh( 1341| 1.43k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.84k| if (mutate) ------------------ | Branch (1342:21): [True: 410, False: 1.43k] ------------------ 1343| 410| pos.each_left(dec_visitor{}, idx); 1344| 1.84k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.84k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.84k, False: 0] ------------------ 1346| 1.84k| pos.copy_sizes( 1347| 1.84k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.84k| newr->d.count = newcount; 1349| 1.84k| newn->inner()[0] = get<1>(subs); 1350| 1.84k| std::copy(node->inner() + idx + 1, 1351| 1.84k| node->inner() + count, 1352| 1.84k| newn->inner() + 1); 1353| 1.84k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.43k, False: 410] ------------------ 1354| 1.43k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.43k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.43k, Folded] ------------------ 1356| 1.43k| pos.visit(dec_visitor{}); 1357| 1.43k| } 1358| 1.84k| return std::make_tuple(pos.shift(), newn); 1359| 1.84k| } 1360| 1.84k| 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.84k| } 1373| 1.84k| } _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.9k| { 1378| 55.9k| auto node = pos.node(); 1379| 55.9k| auto idx = pos.index(first); 1380| 55.9k| auto count = pos.count(); 1381| 55.9k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 55.9k] ------------------ 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.9k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 55.9k] ------------------ 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.9k| } else { 1391| 55.9k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 55.9k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 55.9k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 55.9k| return std::make_tuple(0, newn); 1395| 55.9k| } 1396| 55.9k| } _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.49k| { 1304| 1.49k| auto idx = pos.subindex(first); 1305| 1.49k| auto count = pos.count(); 1306| 1.49k| auto node = pos.node(); 1307| 1.49k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.49k] ------------------ 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.49k| auto left_size = pos.size_before(idx); 1313| 1.49k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.49k| auto dropped_size = first; 1315| 1.49k| auto child_dropped_size = dropped_size - left_size; 1316| 1.49k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.49k] | 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.49k| } else { 1325| 1.49k| 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.49k| auto newcount = count - idx; 1330| 1.49k| auto newn = 1331| 1.49k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.49k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.49k| : node_t::make_inner_r_e(e); 1336| 1.49k| auto newr = newn->relaxed(); 1337| 1.49k| IMMER_TRY { ------------------ | | 49| 1.49k|#define IMMER_TRY try ------------------ 1338| 1.49k| auto subs = 1339| 1.49k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.49k] ------------------ 1340| 1.49k| : pos.towards_sub_oh( 1341| 1.49k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.49k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.49k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.49k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.49k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.49k, False: 0] ------------------ 1346| 1.49k| pos.copy_sizes( 1347| 1.49k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.49k| newr->d.count = newcount; 1349| 1.49k| newn->inner()[0] = get<1>(subs); 1350| 1.49k| std::copy(node->inner() + idx + 1, 1351| 1.49k| node->inner() + count, 1352| 1.49k| newn->inner() + 1); 1353| 1.49k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.49k, False: 0] ------------------ 1354| 1.49k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.49k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.49k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.49k| } 1358| 1.49k| return std::make_tuple(pos.shift(), newn); 1359| 1.49k| } 1360| 1.49k| 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.49k| } 1373| 1.49k| } _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.97k| { 1199| 1.97k| using node_t = node_type; 1200| 1.97k| auto node = p.node(); 1201| 1.97k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 1.97k, False: 0] ------------------ 1202| 1.97k| p.each_left(dec_t{}, idx); 1203| 1.97k| node_t::delete_inner_r(node, p.count()); 1204| 1.97k| } 1205| 1.97k| } _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| 232k| { 1247| 232k| auto idx = pos.subindex(first); 1248| 232k| auto count = pos.count(); 1249| 232k| auto node = pos.node(); 1250| 232k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 232k, Folded] | Branch (1250:47): [True: 188k, False: 43.3k] ------------------ 1251| 232k| auto left_size = pos.size_before(idx); 1252| 232k| auto child_size = pos.size_sbh(idx, left_size); 1253| 232k| auto dropped_size = first; 1254| 232k| auto child_dropped_size = dropped_size - left_size; 1255| 232k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 232k] | 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| 232k| } else { 1264| 232k| using std::get; 1265| 232k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 188k, False: 43.3k] ------------------ 1266| 232k| : node_t::make_inner_r_e(e); 1267| 232k| auto newr = newn->relaxed(); 1268| 232k| auto newcount = count - idx; 1269| 232k| auto new_child_size = child_size - child_dropped_size; 1270| 232k| IMMER_TRY { ------------------ | | 49| 232k|#define IMMER_TRY try ------------------ 1271| 232k| auto subs = 1272| 232k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 188k, False: 43.3k] ------------------ 1273| 232k| : pos.towards_sub_oh( 1274| 43.3k| no_collapse_no_mut_t{}, first, idx, e); 1275| 232k| if (mutate) ------------------ | Branch (1275:21): [True: 188k, False: 43.3k] ------------------ 1276| 188k| pos.each_left(dec_visitor{}, idx); 1277| 232k| pos.copy_sizes( 1278| 232k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 232k| std::copy(node->inner() + idx + 1, 1280| 232k| node->inner() + count, 1281| 232k| newn->inner() + 1); 1282| 232k| newn->inner()[0] = get<1>(subs); 1283| 232k| newr->d.sizes[0] = new_child_size; 1284| 232k| newr->d.count = newcount; 1285| 232k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 232k, False: 0] ------------------ 1286| 232k| if (!mutate) { ------------------ | Branch (1286:21): [True: 43.3k, False: 188k] ------------------ 1287| 43.3k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 43.3k| if (Mutating) ------------------ | Branch (1288:25): [True: 43.3k, Folded] ------------------ 1289| 43.3k| pos.visit(dec_visitor{}); 1290| 43.3k| } 1291| 232k| return std::make_tuple(pos.shift(), newn); 1292| 232k| } 1293| 232k| 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| 232k| } 1299| 232k| } _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| 83.3k| { 1247| 83.3k| auto idx = pos.subindex(first); 1248| 83.3k| auto count = pos.count(); 1249| 83.3k| auto node = pos.node(); 1250| 83.3k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 83.3k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 83.3k| auto left_size = pos.size_before(idx); 1252| 83.3k| auto child_size = pos.size_sbh(idx, left_size); 1253| 83.3k| auto dropped_size = first; 1254| 83.3k| auto child_dropped_size = dropped_size - left_size; 1255| 83.3k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 83.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| 83.3k| } else { 1264| 83.3k| using std::get; 1265| 83.3k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 83.3k] ------------------ 1266| 83.3k| : node_t::make_inner_r_e(e); 1267| 83.3k| auto newr = newn->relaxed(); 1268| 83.3k| auto newcount = count - idx; 1269| 83.3k| auto new_child_size = child_size - child_dropped_size; 1270| 83.3k| IMMER_TRY { ------------------ | | 49| 83.3k|#define IMMER_TRY try ------------------ 1271| 83.3k| auto subs = 1272| 83.3k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 83.3k] ------------------ 1273| 83.3k| : pos.towards_sub_oh( 1274| 83.3k| no_collapse_no_mut_t{}, first, idx, e); 1275| 83.3k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 83.3k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 83.3k| pos.copy_sizes( 1278| 83.3k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 83.3k| std::copy(node->inner() + idx + 1, 1280| 83.3k| node->inner() + count, 1281| 83.3k| newn->inner() + 1); 1282| 83.3k| newn->inner()[0] = get<1>(subs); 1283| 83.3k| newr->d.sizes[0] = new_child_size; 1284| 83.3k| newr->d.count = newcount; 1285| 83.3k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 83.3k, False: 0] ------------------ 1286| 83.3k| if (!mutate) { ------------------ | Branch (1286:21): [True: 83.3k, False: 0] ------------------ 1287| 83.3k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 83.3k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 83.3k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 83.3k| } 1291| 83.3k| return std::make_tuple(pos.shift(), newn); 1292| 83.3k| } 1293| 83.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| 83.3k| } 1299| 83.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.67k| { 1304| 6.67k| auto idx = pos.subindex(first); 1305| 6.67k| auto count = pos.count(); 1306| 6.67k| auto node = pos.node(); 1307| 6.67k| 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.67k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 4.68k, False: 1.99k] ------------------ 1312| 6.67k| auto left_size = pos.size_before(idx); 1313| 6.67k| auto child_size = pos.size_sbh(idx, left_size); 1314| 6.67k| auto dropped_size = first; 1315| 6.67k| auto child_dropped_size = dropped_size - left_size; 1316| 6.67k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 6.67k, Folded] | Branch (1316:25): [True: 4.53k, False: 2.14k] | Branch (1316:45): [True: 2.73k, False: 1.80k] ------------------ 1317| 2.73k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 2.03k, False: 705] ------------------ 1318| 2.73k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 2.73k| if (mutate) ------------------ | Branch (1319:17): [True: 2.03k, False: 705] ------------------ 1320| 2.03k| 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.73k| 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.65k, False: 1.29k] ------------------ 1332| 2.65k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 2.65k| norefs_tag{})) relaxed_t, 1334| 2.65k| 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.65k, False: 1.29k] ------------------ 1340| 3.94k| : pos.towards_sub_oh( 1341| 1.29k| no_collapse_no_mut_t{}, first, idx, e); 1342| 3.94k| if (mutate) ------------------ | Branch (1342:21): [True: 2.65k, False: 1.29k] ------------------ 1343| 2.65k| 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.29k, False: 2.65k] ------------------ 1354| 1.29k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.29k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.29k, Folded] ------------------ 1356| 1.29k| pos.visit(dec_visitor{}); 1357| 1.29k| } 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.67k| } _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: 649, False: 436] ------------------ 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: 649, False: 436] ------------------ 1332| 649| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 649| norefs_tag{})) relaxed_t, 1334| 649| 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: 649, False: 436] ------------------ 1340| 1.08k| : pos.towards_sub_oh( 1341| 436| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.08k| if (mutate) ------------------ | Branch (1342:21): [True: 649, False: 436] ------------------ 1343| 649| 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: 436, False: 649] ------------------ 1354| 436| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 436| if (Mutating) ------------------ | Branch (1355:25): [True: 436, Folded] ------------------ 1356| 436| pos.visit(dec_visitor{}); 1357| 436| } 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.9k| { 350| 10.9k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 10.9k, False: 0] ------------------ 351| 10.9k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 10.1k, False: 710] ------------------ 352| 10.9k| ? visit_maybe_relaxed_sub(rootl, 353| 10.1k| shiftl, 354| 10.1k| sizel, 355| 10.1k| this_t{}, 356| 10.1k| posr, 357| 10.1k| first, 358| 10.1k| size_t{}) 359| 10.9k| : posr.first_sub_inner( 360| 710| rrb{}, first, rootl, shiftl, sizel); 361| 10.9k| } _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| 25.5k| { 383| 25.5k| auto nl = posl.node(); 384| 25.5k| auto nr = posr.node(); 385| 25.5k| if (nl == nr) ------------------ | Branch (385:13): [True: 9.02k, False: 16.4k] ------------------ 386| 9.02k| return true; 387| 16.4k| auto cl = posl.count(); 388| 16.4k| auto cr = posr.count(); 389| 16.4k| assert(cr > 0); ------------------ | Branch (389:9): [True: 16.4k, False: 0] ------------------ 390| 16.4k| auto sbr = size_t{}; 391| 16.4k| auto i = count_t{}; 392| 16.4k| auto j = count_t{}; 393| 86.4k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 75.9k, False: 10.5k] ------------------ 394| 75.9k| auto sbl = posl.size_before(i); 395| 135k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 118k, False: 16.3k] | Branch (395:34): [True: 59.1k, False: 59.5k] ------------------ 396| 59.1k| ; 397| 75.9k| auto res = 398| 75.9k| sbl == sbr ------------------ | Branch (398:17): [True: 37.8k, False: 38.0k] ------------------ 399| 75.9k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 75.9k| : posl.nth_sub(i, 401| 38.0k| for_each_chunk_p_visitor{}, 402| 38.0k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 75.9k| if (!res) ------------------ | Branch (403:17): [True: 5.96k, False: 69.9k] ------------------ 404| 5.96k| return false; 405| 75.9k| } 406| 10.5k| return true; 407| 16.4k| } _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| 17.5k| { 337| 17.5k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 17.5k| } _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| 18.3k| { 428| 18.3k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 11.5k, False: 6.82k] ------------------ 429| 11.5k| return true; 430| 6.82k| auto cl = posl.count(); 431| 6.82k| auto cr = posr.count(); 432| 6.82k| auto mp = std::min(cl, cr); 433| 6.82k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 5.59k, False: 1.22k] ------------------ 434| 6.82k| posl.node()->leaf() + mp, 435| 6.82k| posr.node()->leaf()) && 436| 5.59k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 5.36k, False: 227] ------------------ 437| 5.59k| posl.node()->leaf() + posl.count(), 438| 5.59k| first + (idx + mp)); 439| 18.3k| } _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| 18.2k| { 330| 18.2k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 18.2k| } _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.05k| { 413| 4.05k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.05k| } _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.05k| { 383| 4.05k| auto nl = posl.node(); 384| 4.05k| auto nr = posr.node(); 385| 4.05k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.05k] ------------------ 386| 0| return true; 387| 4.05k| auto cl = posl.count(); 388| 4.05k| auto cr = posr.count(); 389| 4.05k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.05k, False: 0] ------------------ 390| 4.05k| auto sbr = size_t{}; 391| 4.05k| auto i = count_t{}; 392| 4.05k| auto j = count_t{}; 393| 11.8k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 9.45k, False: 2.36k] ------------------ 394| 9.45k| auto sbl = posl.size_before(i); 395| 14.9k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 12.1k, False: 2.73k] | Branch (395:34): [True: 5.45k, False: 6.71k] ------------------ 396| 5.45k| ; 397| 9.45k| auto res = 398| 9.45k| sbl == sbr ------------------ | Branch (398:17): [True: 6.46k, False: 2.98k] ------------------ 399| 9.45k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 9.45k| : posl.nth_sub(i, 401| 2.98k| for_each_chunk_p_visitor{}, 402| 2.98k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 9.45k| if (!res) ------------------ | Branch (403:17): [True: 1.68k, False: 7.76k] ------------------ 404| 1.68k| return false; 405| 9.45k| } 406| 2.36k| return true; 407| 4.05k| } _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.83k| { 337| 3.83k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 3.83k| } _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.0k| { 428| 10.0k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 7.72k, False: 2.34k] ------------------ 429| 7.72k| return true; 430| 2.34k| auto cl = posl.count(); 431| 2.34k| auto cr = posr.count(); 432| 2.34k| auto mp = std::min(cl, cr); 433| 2.34k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 1.90k, False: 438] ------------------ 434| 2.34k| posl.node()->leaf() + mp, 435| 2.34k| posr.node()->leaf()) && 436| 1.90k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 1.69k, False: 218] ------------------ 437| 1.90k| posl.node()->leaf() + posl.count(), 438| 1.90k| first + (idx + mp)); 439| 10.0k| } _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.06k| { 330| 2.06k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.06k| } _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| 1.98k| { 413| 1.98k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 1.98k| } _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| 1.98k| { 383| 1.98k| auto nl = posl.node(); 384| 1.98k| auto nr = posr.node(); 385| 1.98k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.98k] ------------------ 386| 0| return true; 387| 1.98k| auto cl = posl.count(); 388| 1.98k| auto cr = posr.count(); 389| 1.98k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.98k, False: 0] ------------------ 390| 1.98k| auto sbr = size_t{}; 391| 1.98k| auto i = count_t{}; 392| 1.98k| auto j = count_t{}; 393| 14.7k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 13.2k, False: 1.57k] ------------------ 394| 13.2k| auto sbl = posl.size_before(i); 395| 22.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 18.9k, False: 3.88k] | Branch (395:34): [True: 9.57k, False: 9.33k] ------------------ 396| 9.57k| ; 397| 13.2k| auto res = 398| 13.2k| sbl == sbr ------------------ | Branch (398:17): [True: 8.13k, False: 5.08k] ------------------ 399| 13.2k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 13.2k| : posl.nth_sub(i, 401| 5.08k| for_each_chunk_p_visitor{}, 402| 5.08k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 13.2k| if (!res) ------------------ | Branch (403:17): [True: 415, False: 12.8k] ------------------ 404| 415| return false; 405| 13.2k| } 406| 1.57k| return true; 407| 1.98k| } _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.03k| { 337| 7.03k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 7.03k| } _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| 385| { 330| 385| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 385| } _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| 715| { 330| 715| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 715| } _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.28k| { 420| 1.28k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.28k, False: 0] ------------------ 421| 1.28k| ? this_t::visit_regular(posl, posr.node()) 422| 1.28k| : this_t::visit_regular(posr, posl.node()); 423| 1.28k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 21.8k| { 444| 21.8k| auto node = pos.node(); 445| 21.8k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 13.7k, False: 8.06k] | Branch (445:33): [True: 3.17k, False: 4.88k] ------------------ 446| 21.8k| } _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| 30.5k| { 451| 30.5k| auto node = pos.node(); 452| 30.5k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 20.5k, False: 9.98k] | Branch (452:33): [True: 5.80k, False: 4.18k] ------------------ 453| 9.98k| node->leaf() + pos.count(), 454| 9.98k| other->leaf()); 455| 30.5k| } _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| 11.1k| { 444| 11.1k| auto node = pos.node(); 445| 11.1k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 3.75k, False: 7.40k] | Branch (445:33): [True: 2.80k, False: 4.60k] ------------------ 446| 11.1k| } _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.88k| { 451| 2.88k| auto node = pos.node(); 452| 2.88k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.47k, False: 1.40k] | Branch (452:33): [True: 592, False: 817] ------------------ 453| 1.40k| node->leaf() + pos.count(), 454| 1.40k| other->leaf()); 455| 2.88k| } _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.34k| { 444| 4.34k| auto node = pos.node(); 445| 4.34k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 736, False: 3.60k] | Branch (445:33): [True: 2.39k, False: 1.21k] ------------------ 446| 4.34k| } _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| 248k| { 113| 248k| auto data = as_const(pos.node()->leaf()); 114| 248k| return fn(data, data + pos.count()); 115| 248k| } _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.10M| return [iter](auto f, auto e) mutable { 368| 1.10M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 141k, False: 960k] ------------------ 369| 141k| iter += e - f; 370| 141k| return true; 371| 141k| } 372| 8.20M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 7.24M, False: 958k] ------------------ 373| 7.24M| if (*f != *iter) ------------------ | Branch (373:21): [True: 2.39k, False: 7.24M] ------------------ 374| 2.39k| return false; 375| 958k| return true; 376| 960k| }; _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| 4.09M| { 54| 4.09M| return pos.towards(this_t{}, idx); 55| 4.09M| } _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| 877k| { 60| 877k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 877k| } _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| 273k| { 54| 273k| return pos.towards(this_t{}, idx); 55| 273k| } _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| 254k| { 60| 254k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 254k| } _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| 309k| { 54| 309k| return pos.towards(this_t{}, idx); 55| 309k| } _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| 18.7k| { 60| 18.7k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 18.7k| } _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| 39.2k| { 54| 39.2k| return pos.towards(this_t{}, idx); 55| 39.2k| } _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| 23.6k| { 107| 23.6k| return pos.each_pred(this_t{}, fn); 108| 23.6k| } _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| 570| { 330| 570| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 570| } _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| 10.2k| { 420| 10.2k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 10.2k, False: 0] ------------------ 421| 10.2k| ? this_t::visit_regular(posl, posr.node()) 422| 10.2k| : this_t::visit_regular(posr, posl.node()); 423| 10.2k| } _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| 841k| { 113| 841k| auto data = as_const(pos.node()->leaf()); 114| 841k| return fn(data, data + pos.count()); 115| 841k| } _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| 13.7k| { 107| 13.7k| return pos.each_pred(this_t{}, fn); 108| 13.7k| } _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| 12.6k| { 113| 12.6k| auto data = as_const(pos.node()->leaf()); 114| 12.6k| return fn(data, data + pos.count()); 115| 12.6k| } _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| 4.32k| { 107| 4.32k| return pos.each_pred(this_t{}, fn); 108| 4.32k| } _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.63k| { 330| 2.63k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.63k| } _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.50k| { 383| 2.50k| auto nl = posl.node(); 384| 2.50k| auto nr = posr.node(); 385| 2.50k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.50k] ------------------ 386| 0| return true; 387| 2.50k| auto cl = posl.count(); 388| 2.50k| auto cr = posr.count(); 389| 2.50k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.50k, False: 0] ------------------ 390| 2.50k| auto sbr = size_t{}; 391| 2.50k| auto i = count_t{}; 392| 2.50k| auto j = count_t{}; 393| 8.25k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 7.08k, False: 1.16k] ------------------ 394| 7.08k| auto sbl = posl.size_before(i); 395| 10.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 8.36k, False: 2.42k] | Branch (395:34): [True: 3.70k, False: 4.65k] ------------------ 396| 3.70k| ; 397| 7.08k| auto res = 398| 7.08k| sbl == sbr ------------------ | Branch (398:17): [True: 4.31k, False: 2.77k] ------------------ 399| 7.08k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 7.08k| : posl.nth_sub(i, 401| 2.77k| for_each_chunk_p_visitor{}, 402| 2.77k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 7.08k| if (!res) ------------------ | Branch (403:17): [True: 1.33k, False: 5.75k] ------------------ 404| 1.33k| return false; 405| 7.08k| } 406| 1.16k| return true; 407| 2.50k| } _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.63k| { 337| 5.63k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 5.63k| } _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.63k| { 428| 5.63k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 3.99k, False: 1.63k] ------------------ 429| 3.99k| return true; 430| 1.63k| auto cl = posl.count(); 431| 1.63k| auto cr = posr.count(); 432| 1.63k| auto mp = std::min(cl, cr); 433| 1.63k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 972, False: 664] ------------------ 434| 1.63k| posl.node()->leaf() + mp, 435| 1.63k| posr.node()->leaf()) && 436| 972| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 972, False: 0] ------------------ 437| 972| posl.node()->leaf() + posl.count(), 438| 972| first + (idx + mp)); 439| 5.63k| } _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| 2.03k| { 330| 2.03k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.03k| } _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.17k| { 383| 1.17k| auto nl = posl.node(); 384| 1.17k| auto nr = posr.node(); 385| 1.17k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.17k] ------------------ 386| 0| return true; 387| 1.17k| auto cl = posl.count(); 388| 1.17k| auto cr = posr.count(); 389| 1.17k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.17k, False: 0] ------------------ 390| 1.17k| auto sbr = size_t{}; 391| 1.17k| auto i = count_t{}; 392| 1.17k| auto j = count_t{}; 393| 7.67k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 6.83k, False: 836] ------------------ 394| 6.83k| 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: 724] | Branch (395:34): [True: 5.62k, False: 6.11k] ------------------ 396| 5.62k| ; 397| 6.83k| auto res = 398| 6.83k| sbl == sbr ------------------ | Branch (398:17): [True: 3.85k, False: 2.97k] ------------------ 399| 6.83k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 6.83k| : posl.nth_sub(i, 401| 2.97k| for_each_chunk_p_visitor{}, 402| 2.97k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 6.83k| if (!res) ------------------ | Branch (403:17): [True: 335, False: 6.50k] ------------------ 404| 335| return false; 405| 6.83k| } 406| 836| return true; 407| 1.17k| } _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| 866| { 420| 866| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 866, False: 0] ------------------ 421| 866| ? this_t::visit_regular(posl, posr.node()) 422| 866| : this_t::visit_regular(posr, posl.node()); 423| 866| } _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| 126k| { 107| 126k| return pos.each_pred(this_t{}, fn); 108| 126k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaOT_: 366| 51.8k| { 367| 51.8k| return [iter](auto f, auto e) mutable { 368| 51.8k| if (f == &*iter) { 369| 51.8k| iter += e - f; 370| 51.8k| return true; 371| 51.8k| } 372| 51.8k| for (; f != e; ++f, ++iter) 373| 51.8k| if (*f != *iter) 374| 51.8k| return false; 375| 51.8k| return true; 376| 51.8k| }; 377| 51.8k| } _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| 907| { 350| 907| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 907, False: 0] ------------------ 351| 907| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 710, False: 197] ------------------ 352| 907| ? visit_maybe_relaxed_sub(rootl, 353| 710| shiftl, 354| 710| sizel, 355| 710| this_t{}, 356| 710| posr, 357| 710| first, 358| 710| size_t{}) 359| 907| : posr.first_sub_inner( 360| 197| rrb{}, first, rootl, shiftl, sizel); 361| 907| } _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| 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: 10.1k, False: 0] ------------------ 352| 10.1k| ? visit_maybe_relaxed_sub(rootl, 353| 10.1k| shiftl, 354| 10.1k| sizel, 355| 10.1k| this_t{}, 356| 10.1k| posr, 357| 10.1k| first, 358| 10.1k| size_t{}) 359| 10.1k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 10.1k| } _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| 7.01k| { 451| 7.01k| auto node = pos.node(); 452| 7.01k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.44k, False: 5.57k] | Branch (452:33): [True: 1.83k, False: 3.74k] ------------------ 453| 5.57k| node->leaf() + pos.count(), 454| 5.57k| other->leaf()); 455| 7.01k| } _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: 211M, False: 16.6M] ------------------ 1842| 211M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 211M, False: 0] ------------------ 1843| 211M| return make_relaxed_pos(node, shift, relaxed) 1844| 211M| .visit(v, std::forward(args)...); 1845| 211M| } 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| 587M|{ 1829| 587M| assert(node); ------------------ | Branch (1829:5): [True: 587M, False: 0] ------------------ 1830| 587M| assert(relaxed); ------------------ | Branch (1830:5): [True: 587M, False: 0] ------------------ 1831| 587M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 587M, False: 0] ------------------ 1832| 587M| return {node, shift, relaxed}; 1833| 587M|} _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| 399M| 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.9M| { 1624| 46.9M| auto p = node_->inner(); 1625| 46.9M| auto s = size_t{}; 1626| 46.9M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 10.3M, False: 36.5M] ------------------ 1627| 84.3M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 73.9M, False: 10.3M] ------------------ 1628| 73.9M| IMMER_PREFETCH(p + i + 1); 1629| 73.9M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 73.9M| .visit(v, args...); 1631| 73.9M| s = relaxed_->d.sizes[i]; 1632| 73.9M| assert(s); ------------------ | Branch (1632:17): [True: 73.9M, False: 0] ------------------ 1633| 73.9M| } 1634| 36.5M| } else { 1635| 36.5M| auto ss = shift_ - B; 1636| 261M| 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.9M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 1430| 362M| 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| 28.0M|{ 1045| 28.0M| assert(node); ------------------ | Branch (1045:5): [True: 28.0M, False: 0] ------------------ 1046| 28.0M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 28.0M, False: 0] ------------------ 1047| 28.0M| assert(size > 0); ------------------ | Branch (1047:5): [True: 28.0M, False: 0] ------------------ 1048| 28.0M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 28.0M, False: 0] ------------------ 1049| 28.0M| return {node, shift, size}; 1050| 28.0M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1036| 16.7M| { 1037| 16.7M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 16.7M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 785| 29.4M| 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.13M| { 826| 1.13M| return each_regular(*this, v, args...); 827| 1.13M| } _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.13M|{ 344| 1.13M| constexpr auto B = bits; 345| 1.13M| constexpr auto BL = bits_leaf; 346| 1.13M| auto n = p.node()->inner(); 347| 1.13M| auto last = p.count() - 1; 348| 1.13M| auto e = n + last; 349| 1.13M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 88.0k, False: 1.04M] ------------------ 350| 281k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 192k, False: 88.0k] ------------------ 351| 192k| IMMER_PREFETCH(n + 1); 352| 192k| make_full_leaf_pos(*n).visit(v, args...); 353| 192k| } 354| 88.0k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 1.04M| } else { 356| 1.04M| auto ss = p.shift() - B; 357| 3.55M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 2.50M, False: 1.04M] ------------------ 358| 2.50M| make_full_pos(*n, ss).visit(v, args...); 359| 1.04M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 1.04M| } 361| 1.13M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 787| 12.9M| 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| 15.9M|{ 215| 15.9M| assert(node); ------------------ | Branch (215:5): [True: 15.9M, False: 0] ------------------ 216| 15.9M| return {node}; 217| 15.9M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 4.23M| { 208| 4.23M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 4.23M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 199| 10.6M| 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| 12.2M| 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.5M| 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.09M| { 113| 1.09M| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.09M| } _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.44M| 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.47M| 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| 10.8M|{ 1413| 10.8M| assert(node); ------------------ | Branch (1413:5): [True: 10.8M, False: 0] ------------------ 1414| 10.8M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 10.8M, False: 0] ------------------ 1415| 10.8M| return {node, shift}; 1416| 10.8M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 9.34M| { 1406| 9.34M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 9.34M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 1159| 9.97M| 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| 102k| { 1186| 102k| auto p = node_->inner(); 1187| 102k| auto e = p + branches; 1188| 102k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 89.5k, False: 13.3k] ------------------ 1189| 805k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 716k, False: 89.5k] ------------------ 1190| 716k| IMMER_PREFETCH(p + 1); 1191| 716k| make_full_leaf_pos(*p).visit(v, args...); 1192| 716k| } 1193| 89.5k| } else { 1194| 13.3k| auto ss = shift_ - B; 1195| 120k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 106k, False: 13.3k] ------------------ 1196| 106k| make_full_pos(*p, ss).visit(v, args...); 1197| 13.3k| } 1198| 102k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 1158| 1.25M| 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.60M|{ 691| 9.60M| assert(node); ------------------ | Branch (691:5): [True: 9.60M, False: 0] ------------------ 692| 9.60M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 9.60M, False: 0] ------------------ 693| 9.60M| assert(size > 0); ------------------ | Branch (693:5): [True: 9.60M, False: 0] ------------------ 694| 9.60M| return {node, shift, size}; 695| 9.60M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 4.07M| { 337| 4.07M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.07M| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 231| 17.7M| 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.02M| { 244| 4.02M| return each_regular(*this, v, args...); 245| 4.02M| } _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.02M|{ 344| 4.02M| constexpr auto B = bits; 345| 4.02M| constexpr auto BL = bits_leaf; 346| 4.02M| auto n = p.node()->inner(); 347| 4.02M| auto last = p.count() - 1; 348| 4.02M| auto e = n + last; 349| 4.02M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 999k, False: 3.02M] ------------------ 350| 4.30M| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 3.30M, False: 999k] ------------------ 351| 3.30M| IMMER_PREFETCH(n + 1); 352| 3.30M| make_full_leaf_pos(*n).visit(v, args...); 353| 3.30M| } 354| 999k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 3.02M| } else { 356| 3.02M| auto ss = p.shift() - B; 357| 9.73M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 6.71M, False: 3.02M] ------------------ 358| 6.71M| make_full_pos(*n, ss).visit(v, args...); 359| 3.02M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 3.02M| } 361| 4.02M|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 233| 16.7M| 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.6M| 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.3M| 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.3M| 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| 21.3M| 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| 24.7M| 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| 2.96M|{ 65| 2.96M| return {node}; 66| 2.96M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 2.96M| { 58| 2.96M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 2.96M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 41| 2.96M| 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| 81.2M| { 145| 81.2M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 81.2M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 136| 98.6M| 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.0M| 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.77M|{ 89| 2.77M| assert(node); ------------------ | Branch (89:5): [True: 2.77M, False: 0] ------------------ 90| 2.77M| return {node}; 91| 2.77M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 2.77M| { 82| 2.77M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 2.77M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 75| 2.77M| 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| 473k| { 1814| 473k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 473k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 1433| 35.5M| 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.1M| { 1444| 17.1M| return size_sbh(offset, size_before(offset)); 1445| 17.1M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8size_sbhEjm: 1448| 17.6M| { 1449| 17.6M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 17.6M, False: 0] ------------------ 1450| 17.6M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 17.6M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11size_beforeEj: 1438| 65.3M| { 1439| 65.3M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 41.9M, False: 23.4M] ------------------ 1440| 65.3M| } _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| 457k| { 1738| 457k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 457k, False: 0] ------------------ 1739| 457k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 457k, False: 0] ------------------ 1740| 457k| auto child = node_->inner()[offset_hint]; 1741| 457k| auto is_leaf = shift_ == BL; 1742| 457k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 457k] ------------------ 1743| 457k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 457k| : visit_maybe_relaxed_sub( 1745| 457k| child, shift_ - B, child_size_hint, v, args...); 1746| 457k| } _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| 457k|{ 1839| 457k| assert(node); ------------------ | Branch (1839:5): [True: 457k, False: 0] ------------------ 1840| 457k| auto relaxed = node->relaxed(); 1841| 457k| if (relaxed) { ------------------ | Branch (1841:9): [True: 155k, False: 302k] ------------------ 1842| 155k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 155k, False: 0] ------------------ 1843| 155k| return make_relaxed_pos(node, shift, relaxed) 1844| 155k| .visit(v, std::forward(args)...); 1845| 302k| } else { 1846| 302k| return make_regular_sub_pos(node, shift, size) 1847| 302k| .visit(v, std::forward(args)...); 1848| 302k| } 1849| 457k|} _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| 302k| { 1037| 302k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 302k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 788| 3.47M| 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.00M| { 953| 1.00M| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.00M| } _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.00M|{ 678| 1.00M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.00M, False: 0] ------------------ 679| 1.00M| constexpr auto B = bits; 680| 1.00M| constexpr auto BL = bits_leaf; 681| 1.00M| auto child = p.node()->inner()[offset_hint]; 682| 1.00M| auto is_leaf = p.shift() == BL; 683| 1.00M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.00M] ------------------ 684| 1.00M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.00M| .visit(v, args...); 686| 1.00M|} _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.88M| { 337| 3.88M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.88M| } _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.88M| { 331| 2.88M| return last_oh_regular(*this, v, offset_hint, args...); 332| 2.88M| } _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.88M|{ 678| 2.88M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 2.88M, False: 0] ------------------ 679| 2.88M| constexpr auto B = bits; 680| 2.88M| constexpr auto BL = bits_leaf; 681| 2.88M| auto child = p.node()->inner()[offset_hint]; 682| 2.88M| auto is_leaf = p.shift() == BL; 683| 2.88M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 2.88M] ------------------ 684| 2.88M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 2.88M| .visit(v, args...); 686| 2.88M|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 1432| 157M| 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| 755k| { 1037| 755k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 755k| } 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| 136k| { 145| 136k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 136k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 139| 1.14M| 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| 367k|{ 1839| 367k| assert(node); ------------------ | Branch (1839:5): [True: 367k, False: 0] ------------------ 1840| 367k| auto relaxed = node->relaxed(); 1841| 367k| if (relaxed) { ------------------ | Branch (1841:9): [True: 343k, False: 24.2k] ------------------ 1842| 343k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 343k, False: 0] ------------------ 1843| 343k| return make_relaxed_pos(node, shift, relaxed) 1844| 343k| .visit(v, std::forward(args)...); 1845| 343k| } else { 1846| 24.2k| return make_regular_sub_pos(node, shift, size) 1847| 24.2k| .visit(v, std::forward(args)...); 1848| 24.2k| } 1849| 367k|} 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| 343k| { 1814| 343k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 343k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 1454| 15.2M| { 1455| 15.2M| auto offset = idx >> shift_; 1456| 21.5M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 6.34M, False: 15.2M] ------------------ 1457| 6.34M| ++offset; 1458| 15.2M| return offset; 1459| 15.2M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7relaxedEv: 1435| 343k| 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| 343k| { 1687| 343k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 343k, False: 0] ------------------ 1688| 343k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 33.4k, False: 310k] ------------------ 1689| 343k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 343k| } 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| 343k| { 1699| 343k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 343k| } 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| 343k| { 1718| 343k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 343k, False: 0] ------------------ 1719| 343k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 33.4k, False: 310k] | Branch (1719:9): [True: 343k, False: 0] ------------------ 1720| 343k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 343k| auto child = node_->inner()[offset_hint]; 1722| 343k| auto is_leaf = shift_ == BL; 1723| 343k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 343k| auto next_idx = idx - left_size_hint; 1725| 343k| return is_leaf ------------------ | Branch (1725:16): [True: 34.2k, False: 309k] ------------------ 1726| 343k| ? make_leaf_sub_pos(child, next_size) 1727| 34.2k| .visit(v, next_idx, args...) 1728| 343k| : visit_maybe_relaxed_sub( 1729| 309k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 343k| } 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| 34.2k| { 145| 34.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 34.2k| } 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.2k| { 1037| 24.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 24.2k| } 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.2k| { 939| 24.2k| return towards_oh_ch_regular( 940| 24.2k| *this, v, idx, offset_hint, count(), args...); 941| 24.2k| } 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.2k|{ 633| 24.2k| constexpr auto B = bits; 634| 24.2k| constexpr auto BL = bits_leaf; 635| 24.2k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 24.2k, False: 0] ------------------ 636| 24.2k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 24.2k, False: 0] ------------------ 637| 24.2k| auto is_leaf = p.shift() == BL; 638| 24.2k| auto child = p.node()->inner()[offset_hint]; 639| 24.2k| auto is_full = offset_hint + 1 != count_hint; 640| 24.2k| return is_full ------------------ | Branch (640:12): [True: 14.8k, False: 9.40k] ------------------ 641| 24.2k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 5.77k, False: 9.04k] ------------------ 642| 14.8k| : make_full_pos(child, p.shift() - B) 643| 9.04k| .visit(v, idx, args...)) 644| 24.2k| : (is_leaf ------------------ | Branch (644:19): [True: 7.04k, False: 2.35k] ------------------ 645| 9.40k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 9.40k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.35k| .visit(v, idx, args...)); 648| 24.2k|} 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.2k| { 208| 16.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 16.2k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 202| 314k| 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.7k| { 1406| 14.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 14.7k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 1162| 703k| 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.7k| { 1330| 14.7k| return towards_oh(v, idx, offset_hint, args...); 1331| 14.7k| } 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.7k| { 1337| 14.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 14.7k, False: 0] ------------------ 1338| 14.7k| auto is_leaf = shift_ == BL; 1339| 14.7k| auto child = node_->inner()[offset_hint]; 1340| 14.7k| return is_leaf ------------------ | Branch (1340:16): [True: 9.93k, False: 4.86k] ------------------ 1341| 14.7k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 14.7k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 14.7k| } 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| 7.94k| { 113| 7.94k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 7.94k| } 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.87k| { 337| 2.87k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.87k| } 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.87k| { 317| 2.87k| return towards_oh_ch_regular( 318| 2.87k| *this, v, idx, offset_hint, count(), args...); 319| 2.87k| } 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.87k|{ 633| 2.87k| constexpr auto B = bits; 634| 2.87k| constexpr auto BL = bits_leaf; 635| 2.87k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.87k, False: 0] ------------------ 636| 2.87k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.87k, False: 0] ------------------ 637| 2.87k| auto is_leaf = p.shift() == BL; 638| 2.87k| auto child = p.node()->inner()[offset_hint]; 639| 2.87k| auto is_full = offset_hint + 1 != count_hint; 640| 2.87k| return is_full ------------------ | Branch (640:12): [True: 1.45k, False: 1.41k] ------------------ 641| 2.87k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 566, False: 890] ------------------ 642| 1.45k| : make_full_pos(child, p.shift() - B) 643| 890| .visit(v, idx, args...)) 644| 2.87k| : (is_leaf ------------------ | Branch (644:19): [True: 899, False: 518] ------------------ 645| 1.41k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.41k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 518| .visit(v, idx, args...)); 648| 2.87k|} _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| 35.8k|{ 1839| 35.8k| assert(node); ------------------ | Branch (1839:5): [True: 35.8k, False: 0] ------------------ 1840| 35.8k| auto relaxed = node->relaxed(); 1841| 35.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 29.4k, False: 6.36k] ------------------ 1842| 29.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 29.4k, False: 0] ------------------ 1843| 29.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 29.4k| .visit(v, std::forward(args)...); 1845| 29.4k| } else { 1846| 6.36k| return make_regular_sub_pos(node, shift, size) 1847| 6.36k| .visit(v, std::forward(args)...); 1848| 6.36k| } 1849| 35.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 29.4k| { 1814| 29.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 29.4k| } _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| 22.5k| { 1687| 22.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 22.5k, False: 0] ------------------ 1688| 22.5k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 22.5k] ------------------ 1689| 22.5k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 22.5k| } _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| 22.5k| { 1699| 22.5k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 22.5k| } _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| 22.5k| { 1718| 22.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 22.5k, False: 0] ------------------ 1719| 22.5k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 22.5k] | Branch (1719:9): [True: 22.5k, False: 0] ------------------ 1720| 22.5k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 22.5k| auto child = node_->inner()[offset_hint]; 1722| 22.5k| auto is_leaf = shift_ == BL; 1723| 22.5k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 22.5k| auto next_idx = idx - left_size_hint; 1725| 22.5k| return is_leaf ------------------ | Branch (1725:16): [True: 1.62k, False: 20.8k] ------------------ 1726| 22.5k| ? make_leaf_sub_pos(child, next_size) 1727| 1.62k| .visit(v, next_idx, args...) 1728| 22.5k| : visit_maybe_relaxed_sub( 1729| 20.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 22.5k| } _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.62k| { 145| 1.62k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.62k| } _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| 11.7k| { 1687| 11.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 11.7k, False: 0] ------------------ 1688| 11.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 10.2k, False: 1.51k] ------------------ 1689| 11.7k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 11.7k| } _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| 11.7k| { 1699| 11.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 11.7k| } _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| 11.7k| { 1718| 11.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 11.7k, False: 0] ------------------ 1719| 11.7k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 10.2k, False: 1.51k] | Branch (1719:9): [True: 11.7k, False: 0] ------------------ 1720| 11.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 11.7k| auto child = node_->inner()[offset_hint]; 1722| 11.7k| auto is_leaf = shift_ == BL; 1723| 11.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 11.7k| auto next_idx = idx - left_size_hint; 1725| 11.7k| return is_leaf ------------------ | Branch (1725:16): [True: 4.40k, False: 7.37k] ------------------ 1726| 11.7k| ? make_leaf_sub_pos(child, next_size) 1727| 4.40k| .visit(v, next_idx, args...) 1728| 11.7k| : visit_maybe_relaxed_sub( 1729| 7.37k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 11.7k| } _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.40k| { 145| 4.40k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.40k| } _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.37k|{ 1839| 7.37k| assert(node); ------------------ | Branch (1839:5): [True: 7.37k, False: 0] ------------------ 1840| 7.37k| auto relaxed = node->relaxed(); 1841| 7.37k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.84k, False: 2.52k] ------------------ 1842| 4.84k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.84k, False: 0] ------------------ 1843| 4.84k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.84k| .visit(v, std::forward(args)...); 1845| 4.84k| } else { 1846| 2.52k| return make_regular_sub_pos(node, shift, size) 1847| 2.52k| .visit(v, std::forward(args)...); 1848| 2.52k| } 1849| 7.37k|} _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.84k| { 1814| 4.84k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.84k| } _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.52k| { 1037| 2.52k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.52k| } _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.54k| { 928| 5.54k| return towards_oh_ch_regular( 929| 5.54k| *this, v, idx, offset_hint, count(), args...); 930| 5.54k| } _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.54k|{ 633| 5.54k| constexpr auto B = bits; 634| 5.54k| constexpr auto BL = bits_leaf; 635| 5.54k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.54k, False: 0] ------------------ 636| 5.54k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.54k, False: 0] ------------------ 637| 5.54k| auto is_leaf = p.shift() == BL; 638| 5.54k| auto child = p.node()->inner()[offset_hint]; 639| 5.54k| auto is_full = offset_hint + 1 != count_hint; 640| 5.54k| return is_full ------------------ | Branch (640:12): [True: 1.67k, False: 3.87k] ------------------ 641| 5.54k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.00k, False: 665] ------------------ 642| 1.67k| : make_full_pos(child, p.shift() - B) 643| 665| .visit(v, idx, args...)) 644| 5.54k| : (is_leaf ------------------ | Branch (644:19): [True: 1.48k, False: 2.39k] ------------------ 645| 3.87k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.87k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.39k| .visit(v, idx, args...)); 648| 5.54k|} _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.84k| { 208| 3.84k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.84k| } _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.00k| { 1406| 2.00k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.00k| } _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.10k| { 1337| 3.10k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 3.10k, False: 0] ------------------ 1338| 3.10k| auto is_leaf = shift_ == BL; 1339| 3.10k| auto child = node_->inner()[offset_hint]; 1340| 3.10k| return is_leaf ------------------ | Branch (1340:16): [True: 2.37k, False: 728] ------------------ 1341| 3.10k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 3.10k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 3.10k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 1161| 51.2k| 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| 3.01k| { 337| 3.01k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.01k| } _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| 3.01k| { 306| 3.01k| return towards_oh_ch_regular( 307| 3.01k| *this, v, idx, offset_hint, count(), args...); 308| 3.01k| } _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| 3.01k|{ 633| 3.01k| constexpr auto B = bits; 634| 3.01k| constexpr auto BL = bits_leaf; 635| 3.01k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.01k, False: 0] ------------------ 636| 3.01k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.01k, False: 0] ------------------ 637| 3.01k| auto is_leaf = p.shift() == BL; 638| 3.01k| auto child = p.node()->inner()[offset_hint]; 639| 3.01k| auto is_full = offset_hint + 1 != count_hint; 640| 3.01k| return is_full ------------------ | Branch (640:12): [True: 1.07k, False: 1.93k] ------------------ 641| 3.01k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 460, False: 614] ------------------ 642| 1.07k| : make_full_pos(child, p.shift() - B) 643| 614| .visit(v, idx, args...)) 644| 3.01k| : (is_leaf ------------------ | Branch (644:19): [True: 1.31k, False: 619] ------------------ 645| 1.93k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.93k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 619| .visit(v, idx, args...)); 648| 3.01k|} _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.35k| { 928| 3.35k| return towards_oh_ch_regular( 929| 3.35k| *this, v, idx, offset_hint, count(), args...); 930| 3.35k| } _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.35k|{ 633| 3.35k| constexpr auto B = bits; 634| 3.35k| constexpr auto BL = bits_leaf; 635| 3.35k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.35k, False: 0] ------------------ 636| 3.35k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.35k, False: 0] ------------------ 637| 3.35k| auto is_leaf = p.shift() == BL; 638| 3.35k| auto child = p.node()->inner()[offset_hint]; 639| 3.35k| auto is_full = offset_hint + 1 != count_hint; 640| 3.35k| return is_full ------------------ | Branch (640:12): [True: 2.51k, False: 832] ------------------ 641| 3.35k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 774, False: 1.74k] ------------------ 642| 2.51k| : make_full_pos(child, p.shift() - B) 643| 1.74k| .visit(v, idx, args...)) 644| 3.35k| : (is_leaf ------------------ | Branch (644:19): [True: 832, False: 0] ------------------ 645| 832| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 832| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 3.35k|} _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.02k| { 1406| 2.02k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.02k| } _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| 929| { 1337| 929| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 929, False: 0] ------------------ 1338| 929| auto is_leaf = shift_ == BL; 1339| 929| auto child = node_->inner()[offset_hint]; 1340| 929| return is_leaf ------------------ | Branch (1340:16): [True: 644, False: 285] ------------------ 1341| 929| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 929| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 929| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 832| { 113| 832| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 832| } _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| 23.7k|{ 1839| 23.7k| assert(node); ------------------ | Branch (1839:5): [True: 23.7k, False: 0] ------------------ 1840| 23.7k| auto relaxed = node->relaxed(); 1841| 23.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 17.2k, False: 6.44k] ------------------ 1842| 17.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 17.2k, False: 0] ------------------ 1843| 17.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 17.2k| .visit(v, std::forward(args)...); 1845| 17.2k| } else { 1846| 6.44k| return make_regular_sub_pos(node, shift, size) 1847| 6.44k| .visit(v, std::forward(args)...); 1848| 6.44k| } 1849| 23.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 17.2k| { 1814| 17.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 17.2k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8subindexEm: 1434| 4.56M| 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.06k| { 1706| 3.06k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.06k, False: 0] ------------------ 1707| 3.06k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 2.70k, False: 360] ------------------ 1708| 3.06k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.06k| } _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.06k| { 1718| 3.06k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.06k, False: 0] ------------------ 1719| 3.06k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 2.70k, False: 360] | Branch (1719:9): [True: 3.06k, False: 0] ------------------ 1720| 3.06k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.06k| auto child = node_->inner()[offset_hint]; 1722| 3.06k| auto is_leaf = shift_ == BL; 1723| 3.06k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.06k| auto next_idx = idx - left_size_hint; 1725| 3.06k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.06k] ------------------ 1726| 3.06k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.06k| : visit_maybe_relaxed_sub( 1729| 3.06k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.06k| } _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| 80.4k| { 1706| 80.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 80.4k, False: 0] ------------------ 1707| 80.4k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 23.0k, False: 57.4k] ------------------ 1708| 80.4k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 80.4k| } _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| 80.4k| { 1718| 80.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 80.4k, False: 0] ------------------ 1719| 80.4k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 23.0k, False: 57.4k] | Branch (1719:9): [True: 80.4k, False: 0] ------------------ 1720| 80.4k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 80.4k| auto child = node_->inner()[offset_hint]; 1722| 80.4k| auto is_leaf = shift_ == BL; 1723| 80.4k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 80.4k| auto next_idx = idx - left_size_hint; 1725| 80.4k| return is_leaf ------------------ | Branch (1725:16): [True: 13.2k, False: 67.2k] ------------------ 1726| 80.4k| ? make_leaf_sub_pos(child, next_size) 1727| 13.2k| .visit(v, next_idx, args...) 1728| 80.4k| : visit_maybe_relaxed_sub( 1729| 67.2k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 80.4k| } _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| 13.2k| { 145| 13.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 13.2k| } _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| 67.2k|{ 1839| 67.2k| assert(node); ------------------ | Branch (1839:5): [True: 67.2k, False: 0] ------------------ 1840| 67.2k| auto relaxed = node->relaxed(); 1841| 67.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 66.2k, False: 968] ------------------ 1842| 66.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 66.2k, False: 0] ------------------ 1843| 66.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 66.2k| .visit(v, std::forward(args)...); 1845| 66.2k| } else { 1846| 968| return make_regular_sub_pos(node, shift, size) 1847| 968| .visit(v, std::forward(args)...); 1848| 968| } 1849| 67.2k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 66.2k| { 1814| 66.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 66.2k| } _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| 968| { 1037| 968| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 968| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11size_beforeEj: 791| 1.77M| { 792| 1.77M| return size_t{offset} << shift_; 793| 1.77M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8size_sbhEjm: 803| 21.4k| { 804| 21.4k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 21.4k, False: 0] ------------------ 805| 21.4k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 11.1k, False: 10.2k] ------------------ 806| 21.4k| : size_t{1} << shift_; 807| 21.4k| } _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.78k| { 947| 6.78k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 6.78k| } _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.78k|{ 654| 6.78k| constexpr auto B = bits; 655| 6.78k| constexpr auto BL = bits_leaf; 656| 6.78k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 6.78k, False: 0] ------------------ 657| 6.78k| auto is_leaf = p.shift() == BL; 658| 6.78k| auto child = p.node()->inner()[offset_hint]; 659| 6.78k| auto lsize = offset_hint << p.shift(); 660| 6.78k| auto size = p.this_size(); 661| 6.78k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 6.78k| return is_full ------------------ | Branch (662:12): [True: 6.78k, False: 0] ------------------ 663| 6.78k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.10k, False: 2.68k] ------------------ 664| 6.78k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 6.78k| : make_full_pos(child, p.shift() - B) 666| 2.68k| .visit(v, idx - lsize, args...)) 667| 6.78k| : (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.78k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9this_sizeEv: 794| 21.4k| 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.41k| { 208| 7.41k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 7.41k| } _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.06k| { 1406| 4.06k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.06k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8subindexEm: 1163| 10.2k| 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| 35.2k| { 1171| 35.2k| return size_t{offset} << shift_; 1172| 35.2k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8size_sbhEjm: 1166| 10.2k| { 1167| 10.2k| return size_t{1} << shift_; 1168| 10.2k| } _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.70k| { 1349| 4.70k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 4.70k, False: 0] ------------------ 1350| 4.70k| auto is_leaf = shift_ == BL; 1351| 4.70k| auto child = node_->inner()[offset_hint]; 1352| 4.70k| auto lsize = size_t{offset_hint} << shift_; 1353| 4.70k| return is_leaf ------------------ | Branch (1353:16): [True: 3.31k, False: 1.38k] ------------------ 1354| 4.70k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 4.70k| : make_full_pos(child, shift_ - B) 1356| 1.38k| .visit(v, idx - lsize, args...); 1357| 4.70k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1175| 10.2k| { 1176| 10.2k| auto e = sizes + n; 1177| 54.9k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 44.6k, False: 10.2k] ------------------ 1178| 44.6k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 44.6k, False: 0] ------------------ 1180| 44.6k| } 1181| 10.2k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 1160| 556k| 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.40M| { 811| 3.40M| if (n) { ------------------ | Branch (811:13): [True: 3.40M, False: 5.04k] ------------------ 812| 3.40M| auto last = offset + n - 1; 813| 3.40M| auto e = sizes + n - 1; 814| 13.5M| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 10.1M, False: 3.40M] ------------------ 815| 10.1M| init = *sizes = init + (size_t{1} << shift_); 816| 10.1M| assert(init); ------------------ | Branch (816:17): [True: 10.1M, False: 0] ------------------ 817| 10.1M| } 818| 3.40M| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 3.40M, False: 0] ------------------ 820| 3.40M| } 821| 3.40M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEj: 797| 3.41M| { 798| 3.41M| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 1.70M, False: 1.70M] ------------------ 799| 3.41M| : size_t{1} << shift_; 800| 3.41M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1462| 29.9M| { 1463| 29.9M| auto e = sizes + n; 1464| 29.9M| auto prev = size_before(offset); 1465| 29.9M| auto these = relaxed_->d.sizes + offset; 1466| 137M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 107M, False: 29.9M] ------------------ 1467| 107M| auto this_size = *these; 1468| 107M| init = *sizes = init + (this_size - prev); 1469| 107M| assert(init); ------------------ | Branch (1469:13): [True: 107M, False: 0] ------------------ 1470| 107M| prev = this_size; 1471| 107M| } 1472| 29.9M| } _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.44k| { 1037| 6.44k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.44k| } _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.59k| { 947| 2.59k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.59k| } _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.59k|{ 654| 2.59k| constexpr auto B = bits; 655| 2.59k| constexpr auto BL = bits_leaf; 656| 2.59k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.59k, False: 0] ------------------ 657| 2.59k| auto is_leaf = p.shift() == BL; 658| 2.59k| auto child = p.node()->inner()[offset_hint]; 659| 2.59k| auto lsize = offset_hint << p.shift(); 660| 2.59k| auto size = p.this_size(); 661| 2.59k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.59k| return is_full ------------------ | Branch (662:12): [True: 636, False: 1.95k] ------------------ 663| 2.59k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 636] ------------------ 664| 636| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 636| : make_full_pos(child, p.shift() - B) 666| 636| .visit(v, idx - lsize, args...)) 667| 2.59k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.95k] ------------------ 668| 1.95k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.95k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.95k| .visit(v, idx - lsize, args...)); 672| 2.59k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1405| 636| { 1406| 636| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 636| } _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.95k| { 1037| 1.95k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.95k| } _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.30k, False: 2.76k] ------------------ 1842| 7.30k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.30k, False: 0] ------------------ 1843| 7.30k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.30k| .visit(v, std::forward(args)...); 1845| 7.30k| } else { 1846| 2.76k| return make_regular_sub_pos(node, shift, size) 1847| 2.76k| .visit(v, std::forward(args)...); 1848| 2.76k| } 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.30k| { 1814| 7.30k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.30k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 735| 32.8k| 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| 12.9M| { 145| 12.9M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 12.9M| } _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| 156M| { 1814| 156M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 156M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 707| 3.73M| { 708| 3.73M| } _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| 12.9M| { 145| 12.9M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 12.9M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 137| 12.9M| 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| 156M| { 1814| 156M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 156M| } _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.73M| { 708| 3.73M| } _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.8k| { 1763| 21.8k| auto child = node_->inner()[0]; 1764| 21.8k| auto child_size = relaxed_->d.sizes[0]; 1765| 21.8k| auto is_leaf = shift_ == BL; 1766| 21.8k| assert(child_size); ------------------ | Branch (1766:9): [True: 21.8k, False: 0] ------------------ 1767| 21.8k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 21.8k] ------------------ 1768| 21.8k| : visit_maybe_relaxed_sub( 1769| 21.8k| child, shift_ - B, child_size, v, args...); 1770| 21.8k| } _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.8k|{ 1839| 21.8k| assert(node); ------------------ | Branch (1839:5): [True: 21.8k, False: 0] ------------------ 1840| 21.8k| auto relaxed = node->relaxed(); 1841| 21.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 21.5k, False: 318] ------------------ 1842| 21.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 21.5k, False: 0] ------------------ 1843| 21.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 21.5k| .visit(v, std::forward(args)...); 1845| 21.5k| } else { 1846| 318| return make_regular_sub_pos(node, shift, size) 1847| 318| .visit(v, std::forward(args)...); 1848| 318| } 1849| 21.8k|} _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.5k| { 1814| 21.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.5k| } _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| 318| { 1037| 318| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 318| } _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| 620| { 971| 620| auto is_leaf = shift_ == BL; 972| 620| auto child = node_->inner()[0]; 973| 620| auto is_full = size_ >= (size_t{1} << shift_); 974| 620| return is_full ------------------ | Branch (974:16): [True: 620, False: 0] ------------------ 975| 620| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 620] ------------------ 976| 620| ? make_full_leaf_pos(child).visit(v, args...) 977| 620| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 620| : (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| 620| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 201| 394k| 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| 938| { 1406| 938| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 938| } _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| 318| { 1362| 318| auto is_leaf = shift_ == BL; 1363| 318| auto child = node_->inner()[0]; 1364| 318| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 318] ------------------ 1365| 318| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 318| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 711| 192k| { 712| 192k| } _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.8k| { 1305| 20.8k| each_i(v, 1, branches, args...); 1306| 20.8k| } _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.8k| { 1264| 20.8k| auto p = node_->inner() + i; 1265| 20.8k| auto e = node_->inner() + n; 1266| 20.8k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 12.0k, False: 8.79k] ------------------ 1267| 96.1k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 84.1k, False: 12.0k] ------------------ 1268| 84.1k| IMMER_PREFETCH(p + 1); 1269| 84.1k| make_full_leaf_pos(*p).visit(v, args...); 1270| 84.1k| } 1271| 12.0k| } else { 1272| 8.79k| auto ss = shift_ - B; 1273| 70.3k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 61.5k, False: 8.79k] ------------------ 1274| 61.5k| make_full_pos(*p, ss).visit(v, args...); 1275| 8.79k| } 1276| 20.8k| } _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| 5.34M| { 208| 5.34M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.34M| } _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| 551k| { 1406| 551k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 551k| } _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| 192k| { 712| 192k| } _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.8k| { 1305| 20.8k| each_i(v, 1, branches, args...); 1306| 20.8k| } _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.8k| { 1264| 20.8k| auto p = node_->inner() + i; 1265| 20.8k| auto e = node_->inner() + n; 1266| 20.8k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 12.0k, False: 8.79k] ------------------ 1267| 96.1k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 84.1k, False: 12.0k] ------------------ 1268| 84.1k| IMMER_PREFETCH(p + 1); 1269| 84.1k| make_full_leaf_pos(*p).visit(v, args...); 1270| 84.1k| } 1271| 12.0k| } else { 1272| 8.79k| auto ss = shift_ - B; 1273| 70.3k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 61.5k, False: 8.79k] ------------------ 1274| 61.5k| make_full_pos(*p, ss).visit(v, args...); 1275| 8.79k| } 1276| 20.8k| } _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| 5.34M| { 208| 5.34M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.34M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 200| 5.34M| 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| 551k| { 1406| 551k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 551k| } _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| 620| { 754| 620| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 620| } _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| 620| { 145| 620| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 620| } _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| 620| { 1371| 620| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 620, False: 0] ------------------ 1372| 620| auto child = node_->inner()[0]; 1373| 620| return make_full_leaf_pos(child).visit(v, args...); 1374| 620| } _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.07k| { 208| 3.07k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.07k| } _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| 394k| { 907| 394k| if (count() > 1) ------------------ | Branch (907:13): [True: 375k, False: 18.8k] ------------------ 908| 375k| each_right_sub_(v, 1, args...); 909| 394k| } _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| 375k| { 880| 375k| auto last = count() - 1; 881| 375k| auto lsize = size_ - (last << shift_); 882| 375k| auto n = node()->inner() + i; 883| 375k| auto e = node()->inner() + last; 884| 375k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 363k, False: 12.0k] ------------------ 885| 2.52M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.16M, False: 363k] ------------------ 886| 2.16M| IMMER_PREFETCH(n + 1); 887| 2.16M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.16M| } 889| 363k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 363k| } else { 891| 12.0k| auto ss = shift_ - B; 892| 44.4k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 32.3k, False: 12.0k] ------------------ 893| 32.3k| make_full_pos(*n, ss).visit(v, args...); 894| 12.0k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 12.0k| } 896| 375k| } _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.80M| { 1037| 3.80M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.80M| } _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| 394k| { 907| 394k| if (count() > 1) ------------------ | Branch (907:13): [True: 375k, False: 18.8k] ------------------ 908| 375k| each_right_sub_(v, 1, args...); 909| 394k| } _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| 375k| { 880| 375k| auto last = count() - 1; 881| 375k| auto lsize = size_ - (last << shift_); 882| 375k| auto n = node()->inner() + i; 883| 375k| auto e = node()->inner() + last; 884| 375k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 363k, False: 12.0k] ------------------ 885| 2.52M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.16M, False: 363k] ------------------ 886| 2.16M| IMMER_PREFETCH(n + 1); 887| 2.16M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.16M| } 889| 363k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 363k| } else { 891| 12.0k| auto ss = shift_ - B; 892| 44.4k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 32.3k, False: 12.0k] ------------------ 893| 32.3k| make_full_pos(*n, ss).visit(v, args...); 894| 12.0k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 12.0k| } 896| 375k| } _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.80M| { 1037| 3.80M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.80M| } _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.45k| { 754| 2.45k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 2.45k| } _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.45k| { 145| 2.45k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.45k| } _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.45k| { 987| 2.45k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 2.45k, False: 0] ------------------ 988| 2.45k| auto child = node_->inner()[0]; 989| 2.45k| auto is_full = size_ >= branches; 990| 2.45k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 2.45k, False: 0] ------------------ 991| 2.45k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 2.45k| } _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.98k| { 145| 6.98k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.98k| } _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.00M, False: 12.2M] ------------------ 1659| 5.76M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 4.75M, False: 1.00M] ------------------ 1660| 4.75M| IMMER_PREFETCH(p + i + 1); 1661| 4.75M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 4.75M| .visit(v, args...); 1663| 4.75M| s = relaxed_->d.sizes[i]; 1664| 4.75M| assert(s); ------------------ | Branch (1664:17): [True: 4.75M, False: 0] ------------------ 1665| 4.75M| } 1666| 12.2M| } else { 1667| 12.2M| auto ss = shift_ - B; 1668| 89.3M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 77.1M, False: 12.2M] ------------------ 1669| 77.1M| visit_maybe_relaxed_sub( 1670| 77.1M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 77.1M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 77.1M, False: 0] ------------------ 1673| 77.1M| } 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| 132M|{ 1839| 132M| assert(node); ------------------ | Branch (1839:5): [True: 132M, False: 0] ------------------ 1840| 132M| auto relaxed = node->relaxed(); 1841| 132M| if (relaxed) { ------------------ | Branch (1841:9): [True: 128M, False: 3.79M] ------------------ 1842| 128M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 128M, False: 0] ------------------ 1843| 128M| return make_relaxed_pos(node, shift, relaxed) 1844| 128M| .visit(v, std::forward(args)...); 1845| 128M| } else { 1846| 3.79M| return make_regular_sub_pos(node, shift, size) 1847| 3.79M| .visit(v, std::forward(args)...); 1848| 3.79M| } 1849| 132M|} _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.00M, False: 12.2M] ------------------ 1659| 5.76M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 4.75M, False: 1.00M] ------------------ 1660| 4.75M| IMMER_PREFETCH(p + i + 1); 1661| 4.75M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 4.75M| .visit(v, args...); 1663| 4.75M| s = relaxed_->d.sizes[i]; 1664| 4.75M| assert(s); ------------------ | Branch (1664:17): [True: 4.75M, False: 0] ------------------ 1665| 4.75M| } 1666| 12.2M| } else { 1667| 12.2M| auto ss = shift_ - B; 1668| 89.3M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 77.1M, False: 12.2M] ------------------ 1669| 77.1M| visit_maybe_relaxed_sub( 1670| 77.1M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 77.1M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 77.1M, False: 0] ------------------ 1673| 77.1M| } 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| 132M|{ 1839| 132M| assert(node); ------------------ | Branch (1839:5): [True: 132M, False: 0] ------------------ 1840| 132M| auto relaxed = node->relaxed(); 1841| 132M| if (relaxed) { ------------------ | Branch (1841:9): [True: 128M, False: 3.79M] ------------------ 1842| 128M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 128M, False: 0] ------------------ 1843| 128M| return make_relaxed_pos(node, shift, relaxed) 1844| 128M| .visit(v, std::forward(args)...); 1845| 128M| } else { 1846| 3.79M| return make_regular_sub_pos(node, shift, size) 1847| 3.79M| .visit(v, std::forward(args)...); 1848| 3.79M| } 1849| 132M|} _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.98k| { 754| 6.98k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 6.98k| } _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.98k| { 145| 6.98k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.98k| } _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.98k| { 1775| 6.98k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 6.98k, False: 0] ------------------ 1776| 6.98k| auto child = node_->inner()[0]; 1777| 6.98k| auto child_size = relaxed_->d.sizes[0]; 1778| 6.98k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 6.98k| } _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.76k| { 1037| 2.76k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.76k| } _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.38M|{ 1839| 1.38M| assert(node); ------------------ | Branch (1839:5): [True: 1.38M, False: 0] ------------------ 1840| 1.38M| auto relaxed = node->relaxed(); 1841| 1.38M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.36M, False: 22.7k] ------------------ 1842| 1.36M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.36M, False: 0] ------------------ 1843| 1.36M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.36M| .visit(v, std::forward(args)...); 1845| 1.36M| } else { 1846| 22.7k| return make_regular_sub_pos(node, shift, size) 1847| 22.7k| .visit(v, std::forward(args)...); 1848| 22.7k| } 1849| 1.38M|} _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.36M| { 1814| 1.36M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.36M| } _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.36M|{ 1839| 1.36M| assert(node); ------------------ | Branch (1839:5): [True: 1.36M, False: 0] ------------------ 1840| 1.36M| auto relaxed = node->relaxed(); 1841| 1.36M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.35M, False: 11.3k] ------------------ 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| 11.3k| return make_regular_sub_pos(node, shift, size) 1847| 11.3k| .visit(v, std::forward(args)...); 1848| 11.3k| } 1849| 1.36M|} _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.35M| { 1814| 1.35M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.35M| } _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.71M| { 1751| 3.71M| auto offset = relaxed_->d.count - 1; 1752| 3.71M| auto child = node_->inner()[offset]; 1753| 3.71M| auto child_size = size(offset); 1754| 3.71M| auto is_leaf = shift_ == BL; 1755| 3.71M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 3.71M] ------------------ 1756| 3.71M| : visit_maybe_relaxed_sub( 1757| 3.71M| child, shift_ - B, child_size, v, args...); 1758| 3.71M| } _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.71M|{ 1839| 3.71M| assert(node); ------------------ | Branch (1839:5): [True: 3.71M, False: 0] ------------------ 1840| 3.71M| auto relaxed = node->relaxed(); 1841| 3.71M| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.70M, False: 2.10k] ------------------ 1842| 3.70M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.70M, False: 0] ------------------ 1843| 3.70M| return make_relaxed_pos(node, shift, relaxed) 1844| 3.70M| .visit(v, std::forward(args)...); 1845| 3.70M| } else { 1846| 2.10k| return make_regular_sub_pos(node, shift, size) 1847| 2.10k| .visit(v, std::forward(args)...); 1848| 2.10k| } 1849| 3.71M|} _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.70M| { 1814| 3.70M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.70M| } _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.76k| { 1037| 4.76k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.76k| } _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.66k| { 959| 2.66k| auto offset = count() - 1; 960| 2.66k| auto child = node_->inner()[offset]; 961| 2.66k| auto is_leaf = shift_ == BL; 962| 2.66k| auto lsize = size_ - (size_t{offset} << shift_); 963| 2.66k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 2.66k] ------------------ 964| 2.66k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 2.66k| .visit(v, args...); 966| 2.66k| } _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.55M| { 914| 1.55M| each_left(v, count() - 1, args...); 915| 1.55M| } _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.55M| { 874| 1.55M| return each_left_regular(*this, v, last, args...); 875| 1.55M| } _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.55M|{ 576| 1.55M| constexpr auto B = bits; 577| 1.55M| constexpr auto BL = bits_leaf; 578| 1.55M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.55M, False: 0] ------------------ 579| 1.55M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 805k, False: 744k] ------------------ 580| 805k| auto n = p.node()->inner(); 581| 805k| auto e = n + last; 582| 3.90M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.10M, False: 805k] ------------------ 583| 3.10M| IMMER_PREFETCH(n + 1); 584| 3.10M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.10M| } 586| 805k| } else { 587| 744k| auto n = p.node()->inner(); 588| 744k| auto e = n + last; 589| 744k| auto ss = p.shift() - B; 590| 1.20M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 457k, False: 744k] ------------------ 591| 457k| make_full_pos(*n, ss).visit(v, args...); 592| 744k| } 593| 1.55M|} _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.55M| { 914| 1.55M| each_left(v, count() - 1, args...); 915| 1.55M| } _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.55M| { 874| 1.55M| return each_left_regular(*this, v, last, args...); 875| 1.55M| } _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.55M|{ 576| 1.55M| constexpr auto B = bits; 577| 1.55M| constexpr auto BL = bits_leaf; 578| 1.55M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.55M, False: 0] ------------------ 579| 1.55M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 805k, False: 744k] ------------------ 580| 805k| auto n = p.node()->inner(); 581| 805k| auto e = n + last; 582| 3.90M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.10M, False: 805k] ------------------ 583| 3.10M| IMMER_PREFETCH(n + 1); 584| 3.10M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.10M| } 586| 805k| } else { 587| 744k| auto n = p.node()->inner(); 588| 744k| auto e = n + last; 589| 744k| auto ss = p.shift() - B; 590| 1.20M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 457k, False: 744k] ------------------ 591| 457k| make_full_pos(*n, ss).visit(v, args...); 592| 744k| } 593| 1.55M|} _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.51M| { 1763| 1.51M| auto child = node_->inner()[0]; 1764| 1.51M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.51M| auto is_leaf = shift_ == BL; 1766| 1.51M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.51M, False: 0] ------------------ 1767| 1.51M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.51M] ------------------ 1768| 1.51M| : visit_maybe_relaxed_sub( 1769| 1.51M| child, shift_ - B, child_size, v, args...); 1770| 1.51M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 106| 1.38M| 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.51M|{ 1839| 1.51M| assert(node); ------------------ | Branch (1839:5): [True: 1.51M, False: 0] ------------------ 1840| 1.51M| auto relaxed = node->relaxed(); 1841| 1.51M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.14M, False: 362k] ------------------ 1842| 1.14M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.14M, False: 0] ------------------ 1843| 1.14M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.14M| .visit(v, std::forward(args)...); 1845| 1.14M| } else { 1846| 362k| return make_regular_sub_pos(node, shift, size) 1847| 362k| .visit(v, std::forward(args)...); 1848| 362k| } 1849| 1.51M|} _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.14M| { 1814| 1.14M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.14M| } _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| 362k| { 1037| 362k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 362k| } _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.28k| { 959| 1.28k| auto offset = count() - 1; 960| 1.28k| auto child = node_->inner()[offset]; 961| 1.28k| auto is_leaf = shift_ == BL; 962| 1.28k| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.28k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 1.28k] ------------------ 964| 1.28k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 1.28k| .visit(v, args...); 966| 1.28k| } _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.82k| { 1037| 1.82k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.82k| } _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.73k| { 971| 9.73k| auto is_leaf = shift_ == BL; 972| 9.73k| auto child = node_->inner()[0]; 973| 9.73k| auto is_full = size_ >= (size_t{1} << shift_); 974| 9.73k| return is_full ------------------ | Branch (974:16): [True: 9.73k, False: 0] ------------------ 975| 9.73k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 9.73k] ------------------ 976| 9.73k| ? make_full_leaf_pos(child).visit(v, args...) 977| 9.73k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 9.73k| : (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.73k| } _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.4k| { 1406| 17.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 17.4k| } _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.69k| { 1362| 7.69k| auto is_leaf = shift_ == BL; 1363| 7.69k| auto child = node_->inner()[0]; 1364| 7.69k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 7.69k] ------------------ 1365| 7.69k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 7.69k| } _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.1k| { 959| 17.1k| auto offset = count() - 1; 960| 17.1k| auto child = node_->inner()[offset]; 961| 17.1k| auto is_leaf = shift_ == BL; 962| 17.1k| auto lsize = size_ - (size_t{offset} << shift_); 963| 17.1k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 9.94k, False: 7.24k] ------------------ 964| 17.1k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 7.24k| .visit(v, args...); 966| 17.1k| } _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.4k| { 145| 11.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 11.4k| } _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.4k| { 1371| 11.4k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 11.4k, False: 0] ------------------ 1372| 11.4k| auto child = node_->inner()[0]; 1373| 11.4k| return make_full_leaf_pos(child).visit(v, args...); 1374| 11.4k| } _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| 391k| { 208| 391k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 391k| } _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.45k| { 1037| 7.45k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.45k| } _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| 378k| { 959| 378k| auto offset = count() - 1; 960| 378k| auto child = node_->inner()[offset]; 961| 378k| auto is_leaf = shift_ == BL; 962| 378k| auto lsize = size_ - (size_t{offset} << shift_); 963| 378k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 373k, False: 5.50k] ------------------ 964| 378k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 5.50k| .visit(v, args...); 966| 378k| } _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| 380k| { 145| 380k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 380k| } _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| 380k| { 987| 380k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 380k, False: 0] ------------------ 988| 380k| auto child = node_->inner()[0]; 989| 380k| auto is_full = size_ >= branches; 990| 380k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 380k, False: 0] ------------------ 991| 380k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 380k| } _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| 997k| { 145| 997k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 997k| } _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| 9.02k| { 1037| 9.02k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 9.02k| } _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.15M| { 959| 1.15M| auto offset = count() - 1; 960| 1.15M| auto child = node_->inner()[offset]; 961| 1.15M| auto is_leaf = shift_ == BL; 962| 1.15M| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.15M| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 422k, False: 728k] ------------------ 964| 1.15M| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 728k| .visit(v, args...); 966| 1.15M| } _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| 997k| { 145| 997k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 997k| } _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| 997k| { 1775| 997k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 997k, False: 0] ------------------ 1776| 997k| auto child = node_->inner()[0]; 1777| 997k| auto child_size = relaxed_->d.sizes[0]; 1778| 997k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 997k| } _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.50M| { 1037| 1.50M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.50M| } _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.6M| { 1618| 15.6M| each_left(v, relaxed_->d.count - 1, args...); 1619| 15.6M| } _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.6M| { 1624| 15.6M| auto p = node_->inner(); 1625| 15.6M| auto s = size_t{}; 1626| 15.6M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 583k, False: 15.0M] ------------------ 1627| 4.20M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 3.62M, False: 583k] ------------------ 1628| 3.62M| IMMER_PREFETCH(p + i + 1); 1629| 3.62M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 3.62M| .visit(v, args...); 1631| 3.62M| s = relaxed_->d.sizes[i]; 1632| 3.62M| assert(s); ------------------ | Branch (1632:17): [True: 3.62M, False: 0] ------------------ 1633| 3.62M| } 1634| 15.0M| } else { 1635| 15.0M| auto ss = shift_ - B; 1636| 70.2M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 55.1M, False: 15.0M] ------------------ 1637| 55.1M| visit_maybe_relaxed_sub( 1638| 55.1M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 55.1M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 55.1M, False: 0] ------------------ 1641| 55.1M| } 1642| 15.0M| } 1643| 15.6M| } _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.6M| { 1618| 15.6M| each_left(v, relaxed_->d.count - 1, args...); 1619| 15.6M| } _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.6M| { 1624| 15.6M| auto p = node_->inner(); 1625| 15.6M| auto s = size_t{}; 1626| 15.6M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 583k, False: 15.0M] ------------------ 1627| 4.20M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 3.62M, False: 583k] ------------------ 1628| 3.62M| IMMER_PREFETCH(p + i + 1); 1629| 3.62M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 3.62M| .visit(v, args...); 1631| 3.62M| s = relaxed_->d.sizes[i]; 1632| 3.62M| assert(s); ------------------ | Branch (1632:17): [True: 3.62M, False: 0] ------------------ 1633| 3.62M| } 1634| 15.0M| } else { 1635| 15.0M| auto ss = shift_ - B; 1636| 70.2M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 55.1M, False: 15.0M] ------------------ 1637| 55.1M| visit_maybe_relaxed_sub( 1638| 55.1M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 55.1M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 55.1M, False: 0] ------------------ 1641| 55.1M| } 1642| 15.0M| } 1643| 15.6M| } _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.19k] ------------------ 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.19k| return make_regular_sub_pos(node, shift, size) 1847| 1.19k| .visit(v, std::forward(args)...); 1848| 1.19k| } 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.19k| { 1037| 1.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.19k| } _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| 25.0k| { 1751| 25.0k| auto offset = relaxed_->d.count - 1; 1752| 25.0k| auto child = node_->inner()[offset]; 1753| 25.0k| auto child_size = size(offset); 1754| 25.0k| auto is_leaf = shift_ == BL; 1755| 25.0k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 25.0k] ------------------ 1756| 25.0k| : visit_maybe_relaxed_sub( 1757| 25.0k| child, shift_ - B, child_size, v, args...); 1758| 25.0k| } _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| 25.0k|{ 1839| 25.0k| assert(node); ------------------ | Branch (1839:5): [True: 25.0k, False: 0] ------------------ 1840| 25.0k| auto relaxed = node->relaxed(); 1841| 25.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 24.4k, False: 546] ------------------ 1842| 24.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 24.4k, False: 0] ------------------ 1843| 24.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 24.4k| .visit(v, std::forward(args)...); 1845| 24.4k| } else { 1846| 546| return make_regular_sub_pos(node, shift, size) 1847| 546| .visit(v, std::forward(args)...); 1848| 546| } 1849| 25.0k|} _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| 24.4k| { 1814| 24.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 24.4k| } _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.66k| { 971| 1.66k| auto is_leaf = shift_ == BL; 972| 1.66k| auto child = node_->inner()[0]; 973| 1.66k| auto is_full = size_ >= (size_t{1} << shift_); 974| 1.66k| return is_full ------------------ | Branch (974:16): [True: 1.66k, False: 0] ------------------ 975| 1.66k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 1.66k] ------------------ 976| 1.66k| ? make_full_leaf_pos(child).visit(v, args...) 977| 1.66k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 1.66k| : (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.66k| } _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.44k| { 1406| 2.44k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.44k| } _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| 780| { 1362| 780| auto is_leaf = shift_ == BL; 1363| 780| auto child = node_->inner()[0]; 1364| 780| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 780] ------------------ 1365| 780| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 780| } _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.20k| { 1751| 2.20k| auto offset = relaxed_->d.count - 1; 1752| 2.20k| auto child = node_->inner()[offset]; 1753| 2.20k| auto child_size = size(offset); 1754| 2.20k| auto is_leaf = shift_ == BL; 1755| 2.20k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 1.45k, False: 752] ------------------ 1756| 2.20k| : visit_maybe_relaxed_sub( 1757| 752| child, shift_ - B, child_size, v, args...); 1758| 2.20k| } _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| 752|{ 1839| 752| assert(node); ------------------ | Branch (1839:5): [True: 752, False: 0] ------------------ 1840| 752| auto relaxed = node->relaxed(); 1841| 752| if (relaxed) { ------------------ | Branch (1841:9): [True: 544, False: 208] ------------------ 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| 208| return make_regular_sub_pos(node, shift, size) 1847| 208| .visit(v, std::forward(args)...); 1848| 208| } 1849| 752|} _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.4k| { 1751| 11.4k| auto offset = relaxed_->d.count - 1; 1752| 11.4k| auto child = node_->inner()[offset]; 1753| 11.4k| auto child_size = size(offset); 1754| 11.4k| auto is_leaf = shift_ == BL; 1755| 11.4k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 6.76k, False: 4.68k] ------------------ 1756| 11.4k| : visit_maybe_relaxed_sub( 1757| 4.68k| child, shift_ - B, child_size, v, args...); 1758| 11.4k| } _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.68k|{ 1839| 4.68k| assert(node); ------------------ | Branch (1839:5): [True: 4.68k, False: 0] ------------------ 1840| 4.68k| auto relaxed = node->relaxed(); 1841| 4.68k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.15k, False: 3.52k] ------------------ 1842| 1.15k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.15k, False: 0] ------------------ 1843| 1.15k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.15k| .visit(v, std::forward(args)...); 1845| 3.52k| } else { 1846| 3.52k| return make_regular_sub_pos(node, shift, size) 1847| 3.52k| .visit(v, std::forward(args)...); 1848| 3.52k| } 1849| 4.68k|} _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.15k| { 1814| 1.15k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.15k| } _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.9M| { 1751| 11.9M| auto offset = relaxed_->d.count - 1; 1752| 11.9M| auto child = node_->inner()[offset]; 1753| 11.9M| auto child_size = size(offset); 1754| 11.9M| auto is_leaf = shift_ == BL; 1755| 11.9M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 575k, False: 11.3M] ------------------ 1756| 11.9M| : visit_maybe_relaxed_sub( 1757| 11.3M| child, shift_ - B, child_size, v, args...); 1758| 11.9M| } _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.3M|{ 1839| 11.3M| assert(node); ------------------ | Branch (1839:5): [True: 11.3M, False: 0] ------------------ 1840| 11.3M| auto relaxed = node->relaxed(); 1841| 11.3M| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.5M, False: 776k] ------------------ 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| 776k| return make_regular_sub_pos(node, shift, size) 1847| 776k| .visit(v, std::forward(args)...); 1848| 776k| } 1849| 11.3M|} _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.3k| { 1037| 11.3k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 11.3k| } _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| 22.7k| { 1037| 22.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 22.7k| } _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| 22.7k|{ 1839| 22.7k| assert(node); ------------------ | Branch (1839:5): [True: 22.7k, False: 0] ------------------ 1840| 22.7k| auto relaxed = node->relaxed(); 1841| 22.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.00k, False: 16.7k] ------------------ 1842| 6.00k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.00k, False: 0] ------------------ 1843| 6.00k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.00k| .visit(v, std::forward(args)...); 1845| 16.7k| } else { 1846| 16.7k| return make_regular_sub_pos(node, shift, size) 1847| 16.7k| .visit(v, std::forward(args)...); 1848| 16.7k| } 1849| 22.7k|} _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.00k| { 1814| 6.00k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.00k| } _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| 16.7k| { 1037| 16.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 16.7k| } _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| 199k| { 1814| 199k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 199k| } _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| 193k| { 1738| 193k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 193k, False: 0] ------------------ 1739| 193k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 193k, False: 0] ------------------ 1740| 193k| auto child = node_->inner()[offset_hint]; 1741| 193k| auto is_leaf = shift_ == BL; 1742| 193k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 193k] ------------------ 1743| 193k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 193k| : visit_maybe_relaxed_sub( 1745| 193k| child, shift_ - B, child_size_hint, v, args...); 1746| 193k| } _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| 193k|{ 1839| 193k| assert(node); ------------------ | Branch (1839:5): [True: 193k, False: 0] ------------------ 1840| 193k| auto relaxed = node->relaxed(); 1841| 193k| if (relaxed) { ------------------ | Branch (1841:9): [True: 23.6k, False: 169k] ------------------ 1842| 23.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 23.6k, False: 0] ------------------ 1843| 23.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 23.6k| .visit(v, std::forward(args)...); 1845| 169k| } else { 1846| 169k| return make_regular_sub_pos(node, shift, size) 1847| 169k| .visit(v, std::forward(args)...); 1848| 169k| } 1849| 193k|} _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| 169k| { 1037| 169k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 169k| } _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| 325k| { 953| 325k| return last_oh_regular(*this, v, offset_hint, args...); 954| 325k| } _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| 325k|{ 678| 325k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 325k, False: 0] ------------------ 679| 325k| constexpr auto B = bits; 680| 325k| constexpr auto BL = bits_leaf; 681| 325k| auto child = p.node()->inner()[offset_hint]; 682| 325k| auto is_leaf = p.shift() == BL; 683| 325k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 325k] ------------------ 684| 325k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 325k| .visit(v, args...); 686| 325k|} _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.58M| { 337| 1.58M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.58M| } _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.25M| { 331| 1.25M| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.25M| } _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.25M|{ 678| 1.25M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.25M, False: 0] ------------------ 679| 1.25M| constexpr auto B = bits; 680| 1.25M| constexpr auto BL = bits_leaf; 681| 1.25M| auto child = p.node()->inner()[offset_hint]; 682| 1.25M| auto is_leaf = p.shift() == BL; 683| 1.25M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.25M] ------------------ 684| 1.25M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.25M| .visit(v, args...); 686| 1.25M|} _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.44k| { 331| 2.44k| return last_oh_regular(*this, v, offset_hint, args...); 332| 2.44k| } _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.44k|{ 678| 2.44k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 2.44k, False: 0] ------------------ 679| 2.44k| constexpr auto B = bits; 680| 2.44k| constexpr auto BL = bits_leaf; 681| 2.44k| auto child = p.node()->inner()[offset_hint]; 682| 2.44k| auto is_leaf = p.shift() == BL; 683| 2.44k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 2.44k] ------------------ 684| 2.44k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 2.44k| .visit(v, args...); 686| 2.44k|} _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.57k| { 337| 3.57k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.57k| } _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.13k| { 953| 1.13k| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.13k| } _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.13k|{ 678| 1.13k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.13k, False: 0] ------------------ 679| 1.13k| constexpr auto B = bits; 680| 1.13k| constexpr auto BL = bits_leaf; 681| 1.13k| auto child = p.node()->inner()[offset_hint]; 682| 1.13k| auto is_leaf = p.shift() == BL; 683| 1.13k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.13k] ------------------ 684| 1.13k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.13k| .visit(v, args...); 686| 1.13k|} _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.26k| { 1738| 5.26k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 5.26k, False: 0] ------------------ 1739| 5.26k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 5.26k, False: 0] ------------------ 1740| 5.26k| auto child = node_->inner()[offset_hint]; 1741| 5.26k| auto is_leaf = shift_ == BL; 1742| 5.26k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 5.26k] ------------------ 1743| 5.26k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 5.26k| : visit_maybe_relaxed_sub( 1745| 5.26k| child, shift_ - B, child_size_hint, v, args...); 1746| 5.26k| } _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.26k|{ 1839| 5.26k| assert(node); ------------------ | Branch (1839:5): [True: 5.26k, False: 0] ------------------ 1840| 5.26k| auto relaxed = node->relaxed(); 1841| 5.26k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.53k, False: 735] ------------------ 1842| 4.53k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.53k, False: 0] ------------------ 1843| 4.53k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.53k| .visit(v, std::forward(args)...); 1845| 4.53k| } else { 1846| 735| return make_regular_sub_pos(node, shift, size) 1847| 735| .visit(v, std::forward(args)...); 1848| 735| } 1849| 5.26k|} _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.53k| { 1814| 4.53k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.53k| } _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| 735| { 1037| 735| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 735| } _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| 167k| { 1037| 167k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 167k| } _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| 14.9k|{ 1839| 14.9k| assert(node); ------------------ | Branch (1839:5): [True: 14.9k, False: 0] ------------------ 1840| 14.9k| auto relaxed = node->relaxed(); 1841| 14.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.7k, False: 2.25k] ------------------ 1842| 12.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.7k, False: 0] ------------------ 1843| 12.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 12.7k| .visit(v, std::forward(args)...); 1845| 12.7k| } else { 1846| 2.25k| return make_regular_sub_pos(node, shift, size) 1847| 2.25k| .visit(v, std::forward(args)...); 1848| 2.25k| } 1849| 14.9k|} _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| 12.7k| { 1814| 12.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 12.7k| } _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| 67.2k| { 1687| 67.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 67.2k, False: 0] ------------------ 1688| 67.2k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 16.6k, False: 50.5k] ------------------ 1689| 67.2k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 67.2k| } _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| 67.2k| { 1699| 67.2k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 67.2k| } _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| 67.2k| { 1718| 67.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 67.2k, False: 0] ------------------ 1719| 67.2k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 16.6k, False: 50.5k] | Branch (1719:9): [True: 67.2k, False: 0] ------------------ 1720| 67.2k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 67.2k| auto child = node_->inner()[offset_hint]; 1722| 67.2k| auto is_leaf = shift_ == BL; 1723| 67.2k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 67.2k| auto next_idx = idx - left_size_hint; 1725| 67.2k| return is_leaf ------------------ | Branch (1725:16): [True: 10.6k, False: 56.5k] ------------------ 1726| 67.2k| ? make_leaf_sub_pos(child, next_size) 1727| 10.6k| .visit(v, next_idx, args...) 1728| 67.2k| : visit_maybe_relaxed_sub( 1729| 56.5k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 67.2k| } _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| 10.6k| { 145| 10.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 10.6k| } _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| 56.5k|{ 1839| 56.5k| assert(node); ------------------ | Branch (1839:5): [True: 56.5k, False: 0] ------------------ 1840| 56.5k| auto relaxed = node->relaxed(); 1841| 56.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 54.4k, False: 2.11k] ------------------ 1842| 54.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 54.4k, False: 0] ------------------ 1843| 54.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 54.4k| .visit(v, std::forward(args)...); 1845| 54.4k| } else { 1846| 2.11k| return make_regular_sub_pos(node, shift, size) 1847| 2.11k| .visit(v, std::forward(args)...); 1848| 2.11k| } 1849| 56.5k|} _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| 54.4k| { 1814| 54.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 54.4k| } _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| 2.11k| { 1037| 2.11k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.11k| } _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.37k| { 939| 4.37k| return towards_oh_ch_regular( 940| 4.37k| *this, v, idx, offset_hint, count(), args...); 941| 4.37k| } _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.37k|{ 633| 4.37k| constexpr auto B = bits; 634| 4.37k| constexpr auto BL = bits_leaf; 635| 4.37k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.37k, False: 0] ------------------ 636| 4.37k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.37k, False: 0] ------------------ 637| 4.37k| auto is_leaf = p.shift() == BL; 638| 4.37k| auto child = p.node()->inner()[offset_hint]; 639| 4.37k| auto is_full = offset_hint + 1 != count_hint; 640| 4.37k| return is_full ------------------ | Branch (640:12): [True: 2.07k, False: 2.30k] ------------------ 641| 4.37k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 888, False: 1.18k] ------------------ 642| 2.07k| : make_full_pos(child, p.shift() - B) 643| 1.18k| .visit(v, idx, args...)) 644| 4.37k| : (is_leaf ------------------ | Branch (644:19): [True: 497, False: 1.80k] ------------------ 645| 2.30k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.30k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.80k| .visit(v, idx, args...)); 648| 4.37k|} _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.47k| { 208| 3.47k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.47k| } _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.90k| { 1406| 2.90k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.90k| } _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.90k| { 1330| 2.90k| return towards_oh(v, idx, offset_hint, args...); 1331| 2.90k| } _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.90k| { 1337| 2.90k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.90k, False: 0] ------------------ 1338| 2.90k| auto is_leaf = shift_ == BL; 1339| 2.90k| auto child = node_->inner()[offset_hint]; 1340| 2.90k| return is_leaf ------------------ | Branch (1340:16): [True: 2.17k, False: 726] ------------------ 1341| 2.90k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.90k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.90k| } _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| 904| { 113| 904| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 904| } _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.39k| { 337| 2.39k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.39k| } _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.39k| { 317| 2.39k| return towards_oh_ch_regular( 318| 2.39k| *this, v, idx, offset_hint, count(), args...); 319| 2.39k| } _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.39k|{ 633| 2.39k| constexpr auto B = bits; 634| 2.39k| constexpr auto BL = bits_leaf; 635| 2.39k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.39k, False: 0] ------------------ 636| 2.39k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.39k, False: 0] ------------------ 637| 2.39k| auto is_leaf = p.shift() == BL; 638| 2.39k| auto child = p.node()->inner()[offset_hint]; 639| 2.39k| auto is_full = offset_hint + 1 != count_hint; 640| 2.39k| return is_full ------------------ | Branch (640:12): [True: 1.40k, False: 995] ------------------ 641| 2.39k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 406, False: 995] ------------------ 642| 1.40k| : make_full_pos(child, p.shift() - B) 643| 995| .visit(v, idx, args...)) 644| 2.39k| : (is_leaf ------------------ | Branch (644:19): [True: 407, False: 588] ------------------ 645| 995| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 995| : make_regular_pos(child, p.shift() - B, p.size()) 647| 588| .visit(v, idx, args...)); 648| 2.39k|} _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.25k| { 1037| 2.25k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.25k| } _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| 41.9k|{ 1839| 41.9k| assert(node); ------------------ | Branch (1839:5): [True: 41.9k, False: 0] ------------------ 1840| 41.9k| auto relaxed = node->relaxed(); 1841| 41.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 30.1k, False: 11.7k] ------------------ 1842| 30.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 30.1k, False: 0] ------------------ 1843| 30.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 30.1k| .visit(v, std::forward(args)...); 1845| 30.1k| } else { 1846| 11.7k| return make_regular_sub_pos(node, shift, size) 1847| 11.7k| .visit(v, std::forward(args)...); 1848| 11.7k| } 1849| 41.9k|} _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| 30.1k| { 1814| 30.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 30.1k| } _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| 11.5k| { 1687| 11.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 11.5k, False: 0] ------------------ 1688| 11.5k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 11.5k] ------------------ 1689| 11.5k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 11.5k| } _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| 11.5k| { 1699| 11.5k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 11.5k| } _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| 11.5k| { 1718| 11.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 11.5k, False: 0] ------------------ 1719| 11.5k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 11.5k] | Branch (1719:9): [True: 11.5k, False: 0] ------------------ 1720| 11.5k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 11.5k| auto child = node_->inner()[offset_hint]; 1722| 11.5k| auto is_leaf = shift_ == BL; 1723| 11.5k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 11.5k| auto next_idx = idx - left_size_hint; 1725| 11.5k| return is_leaf ------------------ | Branch (1725:16): [True: 964, False: 10.5k] ------------------ 1726| 11.5k| ? make_leaf_sub_pos(child, next_size) 1727| 964| .visit(v, next_idx, args...) 1728| 11.5k| : visit_maybe_relaxed_sub( 1729| 10.5k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 11.5k| } _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| 964| { 145| 964| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 964| } _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: 917, False: 18.8k] ------------------ 1726| 19.7k| ? make_leaf_sub_pos(child, next_size) 1727| 917| .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| 917| { 145| 917| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 917| } _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.25k] ------------------ 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.25k| return make_regular_sub_pos(node, shift, size) 1847| 1.25k| .visit(v, std::forward(args)...); 1848| 1.25k| } 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.25k| { 1037| 1.25k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.25k| } _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: 405] ------------------ 641| 2.38k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 477, 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: 405, False: 0] ------------------ 645| 405| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 405| : 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: 965, False: 284] ------------------ 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.42k| { 1337| 2.42k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.42k, False: 0] ------------------ 1338| 2.42k| auto is_leaf = shift_ == BL; 1339| 2.42k| auto child = node_->inner()[offset_hint]; 1340| 2.42k| return is_leaf ------------------ | Branch (1340:16): [True: 1.54k, False: 873] ------------------ 1341| 2.42k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.42k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.42k| } _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.34k| { 208| 3.34k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.34k| } _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| 3.80k| { 1406| 3.80k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.80k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 2.93k| { 1406| 2.93k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.93k| } _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.3k| { 1337| 10.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 10.3k, False: 0] ------------------ 1338| 10.3k| auto is_leaf = shift_ == BL; 1339| 10.3k| auto child = node_->inner()[offset_hint]; 1340| 10.3k| return is_leaf ------------------ | Branch (1340:16): [True: 7.75k, False: 2.61k] ------------------ 1341| 10.3k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 10.3k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 10.3k| } _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.0k| { 208| 10.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.0k| } _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.07k| { 1406| 6.07k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 6.07k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 3.36k| { 1311| 3.36k| each_i(v, start, branches, args...); 1312| 3.36k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 4.88k| { 1264| 4.88k| auto p = node_->inner() + i; 1265| 4.88k| auto e = node_->inner() + n; 1266| 4.88k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 3.04k, False: 1.84k] ------------------ 1267| 15.9k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 12.8k, False: 3.04k] ------------------ 1268| 12.8k| IMMER_PREFETCH(p + 1); 1269| 12.8k| make_full_leaf_pos(*p).visit(v, args...); 1270| 12.8k| } 1271| 3.04k| } else { 1272| 1.84k| auto ss = shift_ - B; 1273| 10.4k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 8.61k, False: 1.84k] ------------------ 1274| 8.61k| make_full_pos(*p, ss).visit(v, args...); 1275| 1.84k| } 1276| 4.88k| } _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| 405| { 113| 405| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 405| } _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.09k| { 306| 3.09k| return towards_oh_ch_regular( 307| 3.09k| *this, v, idx, offset_hint, count(), args...); 308| 3.09k| } _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.09k|{ 633| 3.09k| constexpr auto B = bits; 634| 3.09k| constexpr auto BL = bits_leaf; 635| 3.09k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.09k, False: 0] ------------------ 636| 3.09k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.09k, False: 0] ------------------ 637| 3.09k| auto is_leaf = p.shift() == BL; 638| 3.09k| auto child = p.node()->inner()[offset_hint]; 639| 3.09k| auto is_full = offset_hint + 1 != count_hint; 640| 3.09k| return is_full ------------------ | Branch (640:12): [True: 2.09k, False: 997] ------------------ 641| 3.09k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 838, False: 1.25k] ------------------ 642| 2.09k| : make_full_pos(child, p.shift() - B) 643| 1.25k| .visit(v, idx, args...)) 644| 3.09k| : (is_leaf ------------------ | Branch (644:19): [True: 645, False: 352] ------------------ 645| 997| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 997| : make_regular_pos(child, p.shift() - B, p.size()) 647| 352| .visit(v, idx, args...)); 648| 3.09k|} _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.55k| { 113| 1.55k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.55k| } _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.14k| { 337| 4.14k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.14k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 1.46k| { 337| 1.46k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.46k| } _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.22k| { 306| 4.22k| return towards_oh_ch_regular( 307| 4.22k| *this, v, idx, offset_hint, count(), args...); 308| 4.22k| } _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.22k|{ 633| 4.22k| constexpr auto B = bits; 634| 4.22k| constexpr auto BL = bits_leaf; 635| 4.22k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.22k, False: 0] ------------------ 636| 4.22k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.22k, False: 0] ------------------ 637| 4.22k| auto is_leaf = p.shift() == BL; 638| 4.22k| auto child = p.node()->inner()[offset_hint]; 639| 4.22k| auto is_full = offset_hint + 1 != count_hint; 640| 4.22k| return is_full ------------------ | Branch (640:12): [True: 2.02k, False: 2.20k] ------------------ 641| 4.22k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 938, False: 1.08k] ------------------ 642| 2.02k| : make_full_pos(child, p.shift() - B) 643| 1.08k| .visit(v, idx, args...)) 644| 4.22k| : (is_leaf ------------------ | Branch (644:19): [True: 1.60k, False: 602] ------------------ 645| 2.20k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.20k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 602| .visit(v, idx, args...)); 648| 4.22k|} _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.48k| { 113| 2.48k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.48k| } _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.17k| { 337| 3.17k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.17k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 3.09k| { 286| 3.09k| return each_right_regular(*this, v, start, args...); 287| 3.09k| } _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.09k|{ 598| 3.09k| constexpr auto B = bits; 599| 3.09k| constexpr auto BL = bits_leaf; 600| | 601| 3.09k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 1.48k, False: 1.60k] ------------------ 602| 1.48k| auto n = p.node()->inner() + start; 603| 1.48k| auto last = p.count() - 1; 604| 1.48k| auto e = p.node()->inner() + last; 605| 1.48k| if (n <= e) { ------------------ | Branch (605:13): [True: 838, False: 645] ------------------ 606| 2.56k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.72k, False: 838] ------------------ 607| 1.72k| IMMER_PREFETCH(n + 1); 608| 1.72k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.72k| } 610| 838| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 838| } 612| 1.60k| } else { 613| 1.60k| auto n = p.node()->inner() + start; 614| 1.60k| auto last = p.count() - 1; 615| 1.60k| auto e = p.node()->inner() + last; 616| 1.60k| auto ss = p.shift() - B; 617| 1.60k| if (n <= e) { ------------------ | Branch (617:13): [True: 1.25k, False: 352] ------------------ 618| 3.08k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.82k, False: 1.25k] ------------------ 619| 1.82k| make_full_pos(*n, ss).visit(v, args...); 620| 1.25k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 1.25k| } 622| 1.60k| } 623| 3.09k|} _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.33k| { 928| 7.33k| return towards_oh_ch_regular( 929| 7.33k| *this, v, idx, offset_hint, count(), args...); 930| 7.33k| } _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.33k|{ 633| 7.33k| constexpr auto B = bits; 634| 7.33k| constexpr auto BL = bits_leaf; 635| 7.33k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.33k, False: 0] ------------------ 636| 7.33k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.33k, False: 0] ------------------ 637| 7.33k| auto is_leaf = p.shift() == BL; 638| 7.33k| auto child = p.node()->inner()[offset_hint]; 639| 7.33k| auto is_full = offset_hint + 1 != count_hint; 640| 7.33k| return is_full ------------------ | Branch (640:12): [True: 2.63k, False: 4.70k] ------------------ 641| 7.33k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 959, False: 1.67k] ------------------ 642| 2.63k| : make_full_pos(child, p.shift() - B) 643| 1.67k| .visit(v, idx, args...)) 644| 7.33k| : (is_leaf ------------------ | Branch (644:19): [True: 913, False: 3.79k] ------------------ 645| 4.70k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.70k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.79k| .visit(v, idx, args...)); 648| 7.33k|} _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.17k| { 928| 7.17k| return towards_oh_ch_regular( 929| 7.17k| *this, v, idx, offset_hint, count(), args...); 930| 7.17k| } _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.17k|{ 633| 7.17k| constexpr auto B = bits; 634| 7.17k| constexpr auto BL = bits_leaf; 635| 7.17k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.17k, False: 0] ------------------ 636| 7.17k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.17k, False: 0] ------------------ 637| 7.17k| auto is_leaf = p.shift() == BL; 638| 7.17k| auto child = p.node()->inner()[offset_hint]; 639| 7.17k| auto is_full = offset_hint + 1 != count_hint; 640| 7.17k| return is_full ------------------ | Branch (640:12): [True: 3.71k, False: 3.45k] ------------------ 641| 7.17k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.34k, False: 2.37k] ------------------ 642| 3.71k| : make_full_pos(child, p.shift() - B) 643| 2.37k| .visit(v, idx, args...)) 644| 7.17k| : (is_leaf ------------------ | Branch (644:19): [True: 884, False: 2.57k] ------------------ 645| 3.45k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.45k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.57k| .visit(v, idx, args...)); 648| 7.17k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 867| 12.0k| { 868| 12.0k| return each_right_regular(*this, v, start, args...); 869| 12.0k| } _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| 12.0k|{ 598| 12.0k| constexpr auto B = bits; 599| 12.0k| constexpr auto BL = bits_leaf; 600| | 601| 12.0k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 3.64k, False: 8.38k] ------------------ 602| 3.64k| auto n = p.node()->inner() + start; 603| 3.64k| auto last = p.count() - 1; 604| 3.64k| auto e = p.node()->inner() + last; 605| 3.64k| if (n <= e) { ------------------ | Branch (605:13): [True: 2.02k, False: 1.61k] ------------------ 606| 3.77k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.74k, False: 2.02k] ------------------ 607| 1.74k| IMMER_PREFETCH(n + 1); 608| 1.74k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.74k| } 610| 2.02k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 2.02k| } 612| 8.38k| } else { 613| 8.38k| auto n = p.node()->inner() + start; 614| 8.38k| auto last = p.count() - 1; 615| 8.38k| auto e = p.node()->inner() + last; 616| 8.38k| auto ss = p.shift() - B; 617| 8.38k| if (n <= e) { ------------------ | Branch (617:13): [True: 4.58k, False: 3.79k] ------------------ 618| 5.78k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.19k, False: 4.58k] ------------------ 619| 1.19k| 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.38k| } 623| 12.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 20.4k| { 1814| 20.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 20.4k| } _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.4k| { 1687| 12.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 12.4k, False: 0] ------------------ 1688| 12.4k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 11.4k, False: 1.04k] ------------------ 1689| 12.4k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 12.4k| } _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.4k| { 1699| 12.4k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 12.4k| } _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.4k| { 1718| 12.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 12.4k, False: 0] ------------------ 1719| 12.4k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 11.4k, False: 1.04k] | Branch (1719:9): [True: 12.4k, False: 0] ------------------ 1720| 12.4k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 12.4k| auto child = node_->inner()[offset_hint]; 1722| 12.4k| auto is_leaf = shift_ == BL; 1723| 12.4k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 12.4k| auto next_idx = idx - left_size_hint; 1725| 12.4k| return is_leaf ------------------ | Branch (1725:16): [True: 2.56k, False: 9.91k] ------------------ 1726| 12.4k| ? make_leaf_sub_pos(child, next_size) 1727| 2.56k| .visit(v, next_idx, args...) 1728| 12.4k| : visit_maybe_relaxed_sub( 1729| 9.91k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 12.4k| } _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.56k| { 145| 2.56k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.56k| } _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.91k|{ 1839| 9.91k| assert(node); ------------------ | Branch (1839:5): [True: 9.91k, False: 0] ------------------ 1840| 9.91k| auto relaxed = node->relaxed(); 1841| 9.91k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.36k, False: 5.55k] ------------------ 1842| 4.36k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.36k, False: 0] ------------------ 1843| 4.36k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.36k| .visit(v, std::forward(args)...); 1845| 5.55k| } else { 1846| 5.55k| return make_regular_sub_pos(node, shift, size) 1847| 5.55k| .visit(v, std::forward(args)...); 1848| 5.55k| } 1849| 9.91k|} _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.36k| { 1814| 4.36k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.36k| } _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.55k| { 1037| 5.55k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.55k| } _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.89k| { 1037| 9.89k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 9.89k| } _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.68k] ------------------ 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.68k] | 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.39k, False: 7.32k] ------------------ 1726| 12.7k| ? make_leaf_sub_pos(child, next_size) 1727| 5.39k| .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.39k| { 145| 5.39k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.39k| } _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.33k, False: 2.98k] ------------------ 1842| 4.33k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.33k, False: 0] ------------------ 1843| 4.33k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.33k| .visit(v, std::forward(args)...); 1845| 4.33k| } 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.33k| { 1814| 4.33k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.33k| } _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| 24.0k| { 1654| 24.0k| assert(start > 0); ------------------ | Branch (1654:9): [True: 24.0k, False: 0] ------------------ 1655| 24.0k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 24.0k, False: 0] ------------------ 1656| 24.0k| auto s = relaxed_->d.sizes[start - 1]; 1657| 24.0k| auto p = node_->inner(); 1658| 24.0k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 3.52k, False: 20.4k] ------------------ 1659| 16.5k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 13.0k, False: 3.52k] ------------------ 1660| 13.0k| IMMER_PREFETCH(p + i + 1); 1661| 13.0k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 13.0k| .visit(v, args...); 1663| 13.0k| s = relaxed_->d.sizes[i]; 1664| 13.0k| assert(s); ------------------ | Branch (1664:17): [True: 13.0k, False: 0] ------------------ 1665| 13.0k| } 1666| 20.4k| } else { 1667| 20.4k| auto ss = shift_ - B; 1668| 89.8k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 69.3k, False: 20.4k] ------------------ 1669| 69.3k| visit_maybe_relaxed_sub( 1670| 69.3k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 69.3k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 69.3k, False: 0] ------------------ 1673| 69.3k| } 1674| 20.4k| } 1675| 24.0k| } _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.7k| { 1037| 11.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 11.7k| } _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.68k| { 928| 4.68k| return towards_oh_ch_regular( 929| 4.68k| *this, v, idx, offset_hint, count(), args...); 930| 4.68k| } _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.68k|{ 633| 4.68k| constexpr auto B = bits; 634| 4.68k| constexpr auto BL = bits_leaf; 635| 4.68k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.68k, False: 0] ------------------ 636| 4.68k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.68k, False: 0] ------------------ 637| 4.68k| auto is_leaf = p.shift() == BL; 638| 4.68k| auto child = p.node()->inner()[offset_hint]; 639| 4.68k| auto is_full = offset_hint + 1 != count_hint; 640| 4.68k| return is_full ------------------ | Branch (640:12): [True: 3.98k, False: 703] ------------------ 641| 4.68k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.06k, False: 2.91k] ------------------ 642| 3.98k| : make_full_pos(child, p.shift() - B) 643| 2.91k| .visit(v, idx, args...)) 644| 4.68k| : (is_leaf ------------------ | Branch (644:19): [True: 703, False: 0] ------------------ 645| 703| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 703| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 4.68k|} _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.32k| { 1406| 3.32k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.32k| } _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| 944| { 1337| 944| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 944, False: 0] ------------------ 1338| 944| auto is_leaf = shift_ == BL; 1339| 944| auto child = node_->inner()[offset_hint]; 1340| 944| return is_leaf ------------------ | Branch (1340:16): [True: 541, False: 403] ------------------ 1341| 944| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 944| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 944| } _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| 703| { 113| 703| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 703| } _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| 1.10k| { 145| 1.10k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.10k| } _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| 72.6k|{ 1839| 72.6k| assert(node); ------------------ | Branch (1839:5): [True: 72.6k, False: 0] ------------------ 1840| 72.6k| auto relaxed = node->relaxed(); 1841| 72.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 66.9k, False: 5.73k] ------------------ 1842| 66.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 66.9k, False: 0] ------------------ 1843| 66.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 66.9k| .visit(v, std::forward(args)...); 1845| 66.9k| } else { 1846| 5.73k| return make_regular_sub_pos(node, shift, size) 1847| 5.73k| .visit(v, std::forward(args)...); 1848| 5.73k| } 1849| 72.6k|} _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| 66.9k| { 1814| 66.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 66.9k| } _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.97k| { 1706| 1.97k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 1.97k, False: 0] ------------------ 1707| 1.97k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 1.59k, False: 379] ------------------ 1708| 1.97k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 1.97k| } _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.97k| { 1718| 1.97k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 1.97k, False: 0] ------------------ 1719| 1.97k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 1.59k, False: 379] | Branch (1719:9): [True: 1.97k, False: 0] ------------------ 1720| 1.97k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 1.97k| auto child = node_->inner()[offset_hint]; 1722| 1.97k| auto is_leaf = shift_ == BL; 1723| 1.97k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 1.97k| auto next_idx = idx - left_size_hint; 1725| 1.97k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 1.97k] ------------------ 1726| 1.97k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 1.97k| : visit_maybe_relaxed_sub( 1729| 1.97k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 1.97k| } _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.41k| { 1706| 3.41k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.41k, False: 0] ------------------ 1707| 3.41k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 2.92k, False: 494] ------------------ 1708| 3.41k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.41k| } _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.41k| { 1718| 3.41k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.41k, False: 0] ------------------ 1719| 3.41k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 2.92k, False: 494] | Branch (1719:9): [True: 3.41k, False: 0] ------------------ 1720| 3.41k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.41k| auto child = node_->inner()[offset_hint]; 1722| 3.41k| auto is_leaf = shift_ == BL; 1723| 3.41k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.41k| auto next_idx = idx - left_size_hint; 1725| 3.41k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.41k] ------------------ 1726| 3.41k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.41k| : visit_maybe_relaxed_sub( 1729| 3.41k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.41k| } _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.41k|{ 1839| 3.41k| assert(node); ------------------ | Branch (1839:5): [True: 3.41k, False: 0] ------------------ 1840| 3.41k| auto relaxed = node->relaxed(); 1841| 3.41k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.23k, False: 1.18k] ------------------ 1842| 2.23k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.23k, False: 0] ------------------ 1843| 2.23k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.23k| .visit(v, std::forward(args)...); 1845| 2.23k| } else { 1846| 1.18k| return make_regular_sub_pos(node, shift, size) 1847| 1.18k| .visit(v, std::forward(args)...); 1848| 1.18k| } 1849| 3.41k|} _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.23k| { 1814| 2.23k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.23k| } _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.18k| { 1037| 1.18k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.18k| } _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.48k| { 947| 1.48k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 1.48k| } _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.48k|{ 654| 1.48k| constexpr auto B = bits; 655| 1.48k| constexpr auto BL = bits_leaf; 656| 1.48k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 1.48k, False: 0] ------------------ 657| 1.48k| auto is_leaf = p.shift() == BL; 658| 1.48k| auto child = p.node()->inner()[offset_hint]; 659| 1.48k| auto lsize = offset_hint << p.shift(); 660| 1.48k| auto size = p.this_size(); 661| 1.48k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 1.48k| return is_full ------------------ | Branch (662:12): [True: 621, False: 868] ------------------ 663| 1.48k| ? (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.48k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 868] ------------------ 668| 868| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 868| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 868| .visit(v, idx - lsize, args...)); 672| 1.48k|} _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.52k| { 1349| 1.52k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 1.52k, False: 0] ------------------ 1350| 1.52k| auto is_leaf = shift_ == BL; 1351| 1.52k| auto child = node_->inner()[offset_hint]; 1352| 1.52k| auto lsize = size_t{offset_hint} << shift_; 1353| 1.52k| return is_leaf ------------------ | Branch (1353:16): [True: 951, False: 570] ------------------ 1354| 1.52k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 1.52k| : make_full_pos(child, shift_ - B) 1356| 570| .visit(v, idx - lsize, args...); 1357| 1.52k| } _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.91k| { 208| 2.91k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.91k| } _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.66k| { 1406| 1.66k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.66k| } _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.05k| { 1349| 4.05k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 4.05k, False: 0] ------------------ 1350| 4.05k| auto is_leaf = shift_ == BL; 1351| 4.05k| auto child = node_->inner()[offset_hint]; 1352| 4.05k| auto lsize = size_t{offset_hint} << shift_; 1353| 4.05k| return is_leaf ------------------ | Branch (1353:16): [True: 3.33k, False: 721] ------------------ 1354| 4.05k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 4.05k| : make_full_pos(child, shift_ - B) 1356| 721| .visit(v, idx - lsize, args...); 1357| 4.05k| } _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| 7.35k| { 208| 7.35k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 7.35k| } _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.20k| { 1406| 2.20k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.20k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1316| 1.52k| { 1317| 1.52k| each_i(v, 0, last, args...); 1318| 1.52k| } _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| 868| { 1037| 868| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 868| } _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.03k| { 1037| 2.03k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.03k| } _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.06k| { 947| 3.06k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.06k| } _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.06k|{ 654| 3.06k| constexpr auto B = bits; 655| 3.06k| constexpr auto BL = bits_leaf; 656| 3.06k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.06k, False: 0] ------------------ 657| 3.06k| auto is_leaf = p.shift() == BL; 658| 3.06k| auto child = p.node()->inner()[offset_hint]; 659| 3.06k| auto lsize = offset_hint << p.shift(); 660| 3.06k| auto size = p.this_size(); 661| 3.06k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.06k| return is_full ------------------ | Branch (662:12): [True: 3.06k, False: 0] ------------------ 663| 3.06k| ? (is_leaf ------------------ | Branch (663:19): [True: 1.96k, False: 1.09k] ------------------ 664| 3.06k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.06k| : make_full_pos(child, p.shift() - B) 666| 1.09k| .visit(v, idx - lsize, args...)) 667| 3.06k| : (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.06k|} _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.49k| { 947| 5.49k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 5.49k| } _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.49k|{ 654| 5.49k| constexpr auto B = bits; 655| 5.49k| constexpr auto BL = bits_leaf; 656| 5.49k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 5.49k, False: 0] ------------------ 657| 5.49k| auto is_leaf = p.shift() == BL; 658| 5.49k| auto child = p.node()->inner()[offset_hint]; 659| 5.49k| auto lsize = offset_hint << p.shift(); 660| 5.49k| auto size = p.this_size(); 661| 5.49k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 5.49k| return is_full ------------------ | Branch (662:12): [True: 5.49k, False: 0] ------------------ 663| 5.49k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.01k, False: 1.48k] ------------------ 664| 5.49k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 5.49k| : make_full_pos(child, p.shift() - B) 666| 1.48k| .visit(v, idx - lsize, args...)) 667| 5.49k| : (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.49k|} _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.09k| { 874| 5.09k| return each_left_regular(*this, v, last, args...); 875| 5.09k| } _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.09k|{ 576| 5.09k| constexpr auto B = bits; 577| 5.09k| constexpr auto BL = bits_leaf; 578| 5.09k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 5.09k, False: 0] ------------------ 579| 5.09k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 1.96k, False: 3.12k] ------------------ 580| 1.96k| auto n = p.node()->inner(); 581| 1.96k| auto e = n + last; 582| 5.64k| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.68k, False: 1.96k] ------------------ 583| 3.68k| IMMER_PREFETCH(n + 1); 584| 3.68k| make_full_leaf_pos(*n).visit(v, args...); 585| 3.68k| } 586| 3.12k| } else { 587| 3.12k| auto n = p.node()->inner(); 588| 3.12k| auto e = n + last; 589| 3.12k| auto ss = p.shift() - B; 590| 5.35k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 2.22k, False: 3.12k] ------------------ 591| 2.22k| make_full_pos(*n, ss).visit(v, args...); 592| 3.12k| } 593| 5.09k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 1.97k| { 1814| 1.97k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.97k| } _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| 238k| { 1706| 238k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 238k, False: 0] ------------------ 1707| 238k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 46.8k, False: 191k] ------------------ 1708| 238k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 238k| } _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| 238k| { 1718| 238k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 238k, False: 0] ------------------ 1719| 238k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 46.8k, False: 191k] | Branch (1719:9): [True: 238k, False: 0] ------------------ 1720| 238k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 238k| auto child = node_->inner()[offset_hint]; 1722| 238k| auto is_leaf = shift_ == BL; 1723| 238k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 238k| auto next_idx = idx - left_size_hint; 1725| 238k| return is_leaf ------------------ | Branch (1725:16): [True: 4.44k, False: 234k] ------------------ 1726| 238k| ? make_leaf_sub_pos(child, next_size) 1727| 4.44k| .visit(v, next_idx, args...) 1728| 238k| : visit_maybe_relaxed_sub( 1729| 234k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 238k| } _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.44k| { 145| 4.44k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.44k| } _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| 234k|{ 1839| 234k| assert(node); ------------------ | Branch (1839:5): [True: 234k, False: 0] ------------------ 1840| 234k| auto relaxed = node->relaxed(); 1841| 234k| if (relaxed) { ------------------ | Branch (1841:9): [True: 232k, False: 1.84k] ------------------ 1842| 232k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 232k, False: 0] ------------------ 1843| 232k| return make_relaxed_pos(node, shift, relaxed) 1844| 232k| .visit(v, std::forward(args)...); 1845| 232k| } else { 1846| 1.84k| return make_regular_sub_pos(node, shift, size) 1847| 1.84k| .visit(v, std::forward(args)...); 1848| 1.84k| } 1849| 234k|} _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| 232k| { 1814| 232k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 232k| } _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.84k| { 1037| 1.84k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.84k| } _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| 140k| { 1706| 140k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 140k, False: 0] ------------------ 1707| 140k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 81.8k, False: 58.8k] ------------------ 1708| 140k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 140k| } _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| 140k| { 1718| 140k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 140k, False: 0] ------------------ 1719| 140k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 81.8k, False: 58.8k] | Branch (1719:9): [True: 140k, False: 0] ------------------ 1720| 140k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 140k| auto child = node_->inner()[offset_hint]; 1722| 140k| auto is_leaf = shift_ == BL; 1723| 140k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 140k| auto next_idx = idx - left_size_hint; 1725| 140k| return is_leaf ------------------ | Branch (1725:16): [True: 55.9k, False: 84.8k] ------------------ 1726| 140k| ? make_leaf_sub_pos(child, next_size) 1727| 55.9k| .visit(v, next_idx, args...) 1728| 140k| : visit_maybe_relaxed_sub( 1729| 84.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 140k| } _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.9k| { 145| 55.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 55.9k| } _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| 84.8k|{ 1839| 84.8k| assert(node); ------------------ | Branch (1839:5): [True: 84.8k, False: 0] ------------------ 1840| 84.8k| auto relaxed = node->relaxed(); 1841| 84.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 83.3k, False: 1.49k] ------------------ 1842| 83.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 83.3k, False: 0] ------------------ 1843| 83.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 83.3k| .visit(v, std::forward(args)...); 1845| 83.3k| } else { 1846| 1.49k| return make_regular_sub_pos(node, shift, size) 1847| 1.49k| .visit(v, std::forward(args)...); 1848| 1.49k| } 1849| 84.8k|} _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| 83.3k| { 1814| 83.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 83.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.49k| { 1037| 1.49k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.49k| } _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.73k| { 1037| 5.73k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.73k| } _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.03k| { 947| 2.03k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.03k| } _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.03k|{ 654| 2.03k| constexpr auto B = bits; 655| 2.03k| constexpr auto BL = bits_leaf; 656| 2.03k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.03k, False: 0] ------------------ 657| 2.03k| auto is_leaf = p.shift() == BL; 658| 2.03k| auto child = p.node()->inner()[offset_hint]; 659| 2.03k| auto lsize = offset_hint << p.shift(); 660| 2.03k| auto size = p.this_size(); 661| 2.03k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.03k| return is_full ------------------ | Branch (662:12): [True: 1.08k, False: 945] ------------------ 663| 2.03k| ? (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.03k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 945] ------------------ 668| 945| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 945| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 945| .visit(v, idx - lsize, args...)); 672| 2.03k|} _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| 945| { 1037| 945| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 945| } _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| 21.0k|{ 1839| 21.0k| assert(node); ------------------ | Branch (1839:5): [True: 21.0k, False: 0] ------------------ 1840| 21.0k| auto relaxed = node->relaxed(); 1841| 21.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.9k, False: 10.1k] ------------------ 1842| 10.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 10.9k, False: 0] ------------------ 1843| 10.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 10.9k| .visit(v, std::forward(args)...); 1845| 10.9k| } else { 1846| 10.1k| return make_regular_sub_pos(node, shift, size) 1847| 10.1k| .visit(v, std::forward(args)...); 1848| 10.1k| } 1849| 21.0k|} _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.9k| { 1814| 10.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 10.9k| } _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.9k|{ 1839| 10.9k| assert(node); ------------------ | Branch (1839:5): [True: 10.9k, False: 0] ------------------ 1840| 10.9k| auto relaxed = node->relaxed(); 1841| 10.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.63k, False: 3.27k] ------------------ 1842| 7.63k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.63k, False: 0] ------------------ 1843| 7.63k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.63k| .visit(v, std::forward(args)...); 1845| 7.63k| } else { 1846| 3.27k| return make_regular_sub_pos(node, shift, size) 1847| 3.27k| .visit(v, std::forward(args)...); 1848| 3.27k| } 1849| 10.9k|} _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| 7.63k| { 1814| 7.63k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.63k| } _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| 37.8k| { 1794| 37.8k| auto child = node_->inner()[offset]; 1795| 37.8k| auto child_size = size(offset); 1796| 37.8k| auto is_leaf = shift_ == BL; 1797| 37.8k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 17.0k, False: 20.8k] ------------------ 1798| 37.8k| : visit_maybe_relaxed_sub( 1799| 20.8k| child, shift_ - B, child_size, v, args...); 1800| 37.8k| } _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| 17.5k| { 145| 17.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 17.5k| } _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| 17.5k| { 1805| 17.5k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 17.5k, False: 0] ------------------ 1806| 17.5k| auto child = node_->inner()[offset]; 1807| 17.5k| auto child_size = size(offset); 1808| 17.5k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 17.5k| } _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| 18.3k| { 145| 18.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 18.3k| } _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| 20.8k|{ 1839| 20.8k| assert(node); ------------------ | Branch (1839:5): [True: 20.8k, False: 0] ------------------ 1840| 20.8k| auto relaxed = node->relaxed(); 1841| 20.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 18.2k, False: 2.63k] ------------------ 1842| 18.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 18.2k, False: 0] ------------------ 1843| 18.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 18.2k| .visit(v, std::forward(args)...); 1845| 18.2k| } else { 1846| 2.63k| return make_regular_sub_pos(node, shift, size) 1847| 2.63k| .visit(v, std::forward(args)...); 1848| 2.63k| } 1849| 20.8k|} _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| 18.2k| { 1814| 18.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 18.2k| } _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| 18.2k| { 1794| 18.2k| auto child = node_->inner()[offset]; 1795| 18.2k| auto child_size = size(offset); 1796| 18.2k| auto is_leaf = shift_ == BL; 1797| 18.2k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 18.2k] ------------------ 1798| 18.2k| : visit_maybe_relaxed_sub( 1799| 18.2k| child, shift_ - B, child_size, v, args...); 1800| 18.2k| } _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| 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: 17.8k, False: 324] ------------------ 1842| 17.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 17.8k, False: 0] ------------------ 1843| 17.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 17.8k| .visit(v, std::forward(args)...); 1845| 17.8k| } else { 1846| 324| return make_regular_sub_pos(node, shift, size) 1847| 324| .visit(v, std::forward(args)...); 1848| 324| } 1849| 18.2k|} _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| 17.8k| { 1814| 17.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 17.8k| } _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| 783| { 1037| 783| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 783| } _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.46k| { 1794| 6.46k| auto child = node_->inner()[offset]; 1795| 6.46k| auto child_size = size(offset); 1796| 6.46k| auto is_leaf = shift_ == BL; 1797| 6.46k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 3.83k, False: 2.63k] ------------------ 1798| 6.46k| : visit_maybe_relaxed_sub( 1799| 2.63k| child, shift_ - B, child_size, v, args...); 1800| 6.46k| } _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.83k| { 145| 3.83k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.83k| } _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.83k| { 1026| 3.83k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 3.83k, False: 0] ------------------ 1027| 3.83k| auto child = node_->inner()[idx]; 1028| 3.83k| auto lsize = size(idx); 1029| 3.83k| auto is_full = idx + 1 < count(); 1030| 3.83k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 3.02k, False: 807] ------------------ 1031| 3.83k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 3.83k| } _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.0k| { 208| 10.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.0k| } _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.63k|{ 1839| 2.63k| assert(node); ------------------ | Branch (1839:5): [True: 2.63k, False: 0] ------------------ 1840| 2.63k| auto relaxed = node->relaxed(); 1841| 2.63k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.06k, False: 570] ------------------ 1842| 2.06k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.06k, False: 0] ------------------ 1843| 2.06k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.06k| .visit(v, std::forward(args)...); 1845| 2.06k| } else { 1846| 570| return make_regular_sub_pos(node, shift, size) 1847| 570| .visit(v, std::forward(args)...); 1848| 570| } 1849| 2.63k|} _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.06k| { 1814| 2.06k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.06k| } _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.06k| { 1008| 2.06k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.06k, False: 0] ------------------ 1009| 2.06k| auto is_leaf = shift_ == BL; 1010| 2.06k| auto child = node_->inner()[idx]; 1011| 2.06k| auto lsize = size(idx); 1012| 2.06k| auto is_full = idx + 1 < count(); 1013| 2.06k| return is_full ------------------ | Branch (1013:16): [True: 1.60k, False: 459] ------------------ 1014| 2.06k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.60k] ------------------ 1015| 1.60k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.60k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.06k| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 459] ------------------ 1018| 459| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 459| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 459| .visit(v, args...)); 1021| 2.06k| } _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| 1.98k| { 1406| 1.98k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.98k| } _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.13k| { 1794| 8.13k| auto child = node_->inner()[offset]; 1795| 8.13k| auto child_size = size(offset); 1796| 8.13k| auto is_leaf = shift_ == BL; 1797| 8.13k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 7.03k, False: 1.10k] ------------------ 1798| 8.13k| : visit_maybe_relaxed_sub( 1799| 1.10k| child, shift_ - B, child_size, v, args...); 1800| 8.13k| } _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.03k| { 145| 7.03k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.03k| } _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.03k| { 1397| 7.03k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 7.03k, False: 0] ------------------ 1398| 7.03k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 7.03k, False: 0] ------------------ 1399| 7.03k| auto child = node_->inner()[idx]; 1400| 7.03k| return make_full_leaf_pos(child).visit(v, args...); 1401| 7.03k| } _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.10k|{ 1839| 1.10k| assert(node); ------------------ | Branch (1839:5): [True: 1.10k, False: 0] ------------------ 1840| 1.10k| auto relaxed = node->relaxed(); 1841| 1.10k| if (relaxed) { ------------------ | Branch (1841:9): [True: 385, False: 715] ------------------ 1842| 385| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 385, False: 0] ------------------ 1843| 385| return make_relaxed_pos(node, shift, relaxed) 1844| 385| .visit(v, std::forward(args)...); 1845| 715| } else { 1846| 715| return make_regular_sub_pos(node, shift, size) 1847| 715| .visit(v, std::forward(args)...); 1848| 715| } 1849| 1.10k|} _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| 385| { 1814| 385| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 385| } _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| 385| { 1387| 385| assert(idx < count()); ------------------ | Branch (1387:9): [True: 385, False: 0] ------------------ 1388| 385| auto is_leaf = shift_ == BL; 1389| 385| auto child = node_->inner()[idx]; 1390| 385| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 385] ------------------ 1391| 385| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 385| } _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| 715| { 1037| 715| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 715| } _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| 715| { 1387| 715| assert(idx < count()); ------------------ | Branch (1387:9): [True: 715, False: 0] ------------------ 1388| 715| auto is_leaf = shift_ == BL; 1389| 715| auto child = node_->inner()[idx]; 1390| 715| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 715] ------------------ 1391| 715| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 715| } _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.28k| { 1406| 1.28k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.28k| } _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| 8.06k| { 1223| 8.06k| auto p = node_->inner(); 1224| 8.06k| auto p2 = other->inner(); 1225| 8.06k| auto e = p + branches; 1226| 8.06k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 5.56k, False: 2.50k] ------------------ 1227| 26.4k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 24.2k, False: 2.27k] ------------------ 1228| 24.2k| IMMER_PREFETCH(p + 1); 1229| 24.2k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 3.28k, False: 20.9k] ------------------ 1230| 3.28k| return false; 1231| 24.2k| } 1232| 5.56k| } else { 1233| 2.50k| auto ss = shift_ - B; 1234| 10.1k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 9.25k, False: 900] ------------------ 1235| 9.25k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 1.60k, False: 7.65k] ------------------ 1236| 1.60k| return false; 1237| 2.50k| } 1238| 3.17k| return true; 1239| 8.06k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 30.5k| { 208| 30.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 30.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 20.5k| { 1406| 20.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 20.5k| } _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.40k| { 838| 7.40k| return each_pred_zip_regular(*this, v, other, args...); 839| 7.40k| } _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.40k|{ 393| 7.40k| constexpr auto B = bits; 394| 7.40k| constexpr auto BL = bits_leaf; 395| | 396| 7.40k| auto n = p.node()->inner(); 397| 7.40k| auto n2 = other->inner(); 398| 7.40k| auto last = p.count() - 1; 399| 7.40k| auto e = n + last; 400| 7.40k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.44k, False: 5.95k] ------------------ 401| 3.43k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 2.61k, False: 816] ------------------ 402| 2.61k| IMMER_PREFETCH(n + 1); 403| 2.61k| IMMER_PREFETCH(n2 + 1); 404| 2.61k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 633, False: 1.98k] ------------------ 405| 633| return false; 406| 2.61k| } 407| 816| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 5.95k| } else { 409| 5.95k| auto ss = p.shift() - B; 410| 11.5k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 8.27k, False: 3.27k] ------------------ 411| 8.27k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 2.67k, False: 5.59k] ------------------ 412| 2.67k| return false; 413| 3.27k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 5.95k| } 415| 7.40k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 2.88k| { 113| 2.88k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.88k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 4.34k| { 337| 4.34k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.34k| } _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.60k| { 256| 3.60k| return each_pred_zip_regular(*this, v, other, args...); 257| 3.60k| } _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.60k|{ 393| 3.60k| constexpr auto B = bits; 394| 3.60k| constexpr auto BL = bits_leaf; 395| | 396| 3.60k| auto n = p.node()->inner(); 397| 3.60k| auto n2 = other->inner(); 398| 3.60k| auto last = p.count() - 1; 399| 3.60k| auto e = n + last; 400| 3.60k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.33k, False: 1.27k] ------------------ 401| 5.81k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 3.74k, False: 2.06k] ------------------ 402| 3.74k| IMMER_PREFETCH(n + 1); 403| 3.74k| IMMER_PREFETCH(n2 + 1); 404| 3.74k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 265, False: 3.48k] ------------------ 405| 265| return false; 406| 3.74k| } 407| 2.06k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 2.33k| } else { 409| 1.27k| auto ss = p.shift() - B; 410| 4.10k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 3.04k, False: 1.06k] ------------------ 411| 3.04k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 211, False: 2.83k] ------------------ 412| 211| return false; 413| 1.06k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 1.27k| } 415| 3.60k|} _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.08k| { 1387| 5.08k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 5.08k, False: 0] ------------------ 1388| 5.08k| auto is_leaf = shift_ == BL; 1389| 5.08k| auto child = node_->inner()[idx]; 1390| 5.08k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 4.06k, False: 1.01k] ------------------ 1391| 5.08k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 5.08k| } _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| 248k| { 208| 248k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 248k| } _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.37M|{ 1839| 4.37M| assert(node); ------------------ | Branch (1839:5): [True: 4.37M, False: 0] ------------------ 1840| 4.37M| auto relaxed = node->relaxed(); 1841| 4.37M| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.09M, False: 273k] ------------------ 1842| 4.09M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.09M, False: 0] ------------------ 1843| 4.09M| return make_relaxed_pos(node, shift, relaxed) 1844| 4.09M| .visit(v, std::forward(args)...); 1845| 4.09M| } else { 1846| 273k| return make_regular_sub_pos(node, shift, size) 1847| 273k| .visit(v, std::forward(args)...); 1848| 273k| } 1849| 4.37M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 4.09M| { 1814| 4.09M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.09M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 4.09M| { 1680| 4.09M| return towards_oh(v, idx, subindex(idx), args...); 1681| 4.09M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1686| 4.09M| { 1687| 4.09M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 4.09M, False: 0] ------------------ 1688| 4.09M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 2.93M, False: 1.16M] ------------------ 1689| 4.09M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 4.09M| } _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| 4.09M| { 1699| 4.09M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 4.09M| } _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| 4.09M| { 1718| 4.09M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.09M, False: 0] ------------------ 1719| 4.09M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 2.93M, False: 1.16M] | Branch (1719:9): [True: 4.09M, False: 0] ------------------ 1720| 4.09M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.09M| auto child = node_->inner()[offset_hint]; 1722| 4.09M| auto is_leaf = shift_ == BL; 1723| 4.09M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.09M| auto next_idx = idx - left_size_hint; 1725| 4.09M| return is_leaf ------------------ | Branch (1725:16): [True: 877k, False: 3.22M] ------------------ 1726| 4.09M| ? make_leaf_sub_pos(child, next_size) 1727| 877k| .visit(v, next_idx, args...) 1728| 4.09M| : visit_maybe_relaxed_sub( 1729| 3.22M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.09M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 144| 877k| { 145| 877k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 877k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 273k| { 1037| 273k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 273k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 273k| { 920| 273k| return towards_oh_ch_regular( 921| 273k| *this, v, idx, index(idx), count(), args...); 922| 273k| } _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| 273k|{ 633| 273k| constexpr auto B = bits; 634| 273k| constexpr auto BL = bits_leaf; 635| 273k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 273k, False: 0] ------------------ 636| 273k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 273k, False: 0] ------------------ 637| 273k| auto is_leaf = p.shift() == BL; 638| 273k| auto child = p.node()->inner()[offset_hint]; 639| 273k| auto is_full = offset_hint + 1 != count_hint; 640| 273k| return is_full ------------------ | Branch (640:12): [True: 225k, False: 48.3k] ------------------ 641| 273k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 72.3k, False: 152k] ------------------ 642| 225k| : make_full_pos(child, p.shift() - B) 643| 152k| .visit(v, idx, args...)) 644| 273k| : (is_leaf ------------------ | Branch (644:19): [True: 14.3k, False: 34.0k] ------------------ 645| 48.3k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 48.3k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 34.0k| .visit(v, idx, args...)); 648| 273k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 254k| { 208| 254k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 254k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 309k| { 1406| 309k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 309k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 309k| { 1323| 309k| return towards_oh(v, idx, index(idx), args...); 1324| 309k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 309k| { 1337| 309k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 309k, False: 0] ------------------ 1338| 309k| auto is_leaf = shift_ == BL; 1339| 309k| auto child = node_->inner()[offset_hint]; 1340| 309k| return is_leaf ------------------ | Branch (1340:16): [True: 172k, False: 137k] ------------------ 1341| 309k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 309k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 309k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 18.7k| { 113| 18.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 18.7k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 39.2k| { 337| 39.2k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 39.2k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 39.2k| { 298| 39.2k| return towards_oh_ch_regular( 299| 39.2k| *this, v, idx, index(idx), count(), args...); 300| 39.2k| } _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| 39.2k|{ 633| 39.2k| constexpr auto B = bits; 634| 39.2k| constexpr auto BL = bits_leaf; 635| 39.2k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 39.2k, False: 0] ------------------ 636| 39.2k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 39.2k, False: 0] ------------------ 637| 39.2k| auto is_leaf = p.shift() == BL; 638| 39.2k| auto child = p.node()->inner()[offset_hint]; 639| 39.2k| auto is_full = offset_hint + 1 != count_hint; 640| 39.2k| return is_full ------------------ | Branch (640:12): [True: 29.5k, False: 9.65k] ------------------ 641| 39.2k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 10.1k, False: 19.4k] ------------------ 642| 29.5k| : make_full_pos(child, p.shift() - B) 643| 19.4k| .visit(v, idx, args...)) 644| 39.2k| : (is_leaf ------------------ | Branch (644:19): [True: 4.48k, False: 5.17k] ------------------ 645| 9.65k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 9.65k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 5.17k| .visit(v, idx, args...)); 648| 39.2k|} _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| 23.6k| { 1406| 23.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 23.6k| } _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| 23.6k| { 1203| 23.6k| auto p = node_->inner(); 1204| 23.6k| auto e = p + branches; 1205| 23.6k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 22.0k, False: 1.65k] ------------------ 1206| 194k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 172k, False: 21.2k] ------------------ 1207| 172k| IMMER_PREFETCH(p + 1); 1208| 172k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 752, False: 172k] ------------------ 1209| 752| return false; 1210| 172k| } 1211| 22.0k| } else { 1212| 1.65k| auto ss = shift_ - B; 1213| 13.5k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 12.1k, False: 1.41k] ------------------ 1214| 12.1k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 241, False: 11.9k] ------------------ 1215| 241| return false; 1216| 1.65k| } 1217| 22.6k| return true; 1218| 23.6k| } _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| 570| { 1037| 570| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 570| } _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| 570| { 1008| 570| assert(idx < count()); ------------------ | Branch (1008:9): [True: 570, False: 0] ------------------ 1009| 570| auto is_leaf = shift_ == BL; 1010| 570| auto child = node_->inner()[idx]; 1011| 570| auto lsize = size(idx); 1012| 570| auto is_full = idx + 1 < count(); 1013| 570| return is_full ------------------ | Branch (1013:16): [True: 570, False: 0] ------------------ 1014| 570| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 570] ------------------ 1015| 570| ? make_full_leaf_pos(child).visit(v, args...) 1016| 570| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 570| : (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| 570| } _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| 2.22k| { 1037| 2.22k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.22k| } _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| 2.98k| { 1008| 2.98k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.98k, False: 0] ------------------ 1009| 2.98k| auto is_leaf = shift_ == BL; 1010| 2.98k| auto child = node_->inner()[idx]; 1011| 2.98k| auto lsize = size(idx); 1012| 2.98k| auto is_full = idx + 1 < count(); 1013| 2.98k| return is_full ------------------ | Branch (1013:16): [True: 1.25k, False: 1.72k] ------------------ 1014| 2.98k| ? (is_leaf ------------------ | Branch (1014:23): [True: 839, False: 419] ------------------ 1015| 1.25k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.25k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.98k| : (is_leaf ------------------ | Branch (1017:23): [True: 939, False: 789] ------------------ 1018| 1.72k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 1.72k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 789| .visit(v, args...)); 1021| 2.98k| } _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| 841k| { 145| 841k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 841k| } _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| 13.7k| { 1037| 13.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 13.7k| } _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| 13.7k| { 832| 13.7k| return each_pred_regular(*this, v, args...); 833| 13.7k| } _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| 13.7k|{ 366| 13.7k| constexpr auto B = bits; 367| 13.7k| constexpr auto BL = bits_leaf; 368| 13.7k| auto n = p.node()->inner(); 369| 13.7k| auto last = p.count() - 1; 370| 13.7k| auto e = n + last; 371| 13.7k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 10.0k, False: 3.74k] ------------------ 372| 71.6k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 61.8k, False: 9.81k] ------------------ 373| 61.8k| IMMER_PREFETCH(n + 1); 374| 61.8k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 234, False: 61.6k] ------------------ 375| 234| return false; 376| 61.8k| } 377| 9.81k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 10.0k| } else { 379| 3.74k| auto ss = p.shift() - B; 380| 11.6k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 8.42k, False: 3.22k] ------------------ 381| 8.42k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 521, False: 7.90k] ------------------ 382| 521| return false; 383| 3.22k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 3.74k| } 385| 13.7k|} _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| 12.6k| { 113| 12.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 12.6k| } _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| 4.32k| { 337| 4.32k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.32k| } _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| 4.32k| { 250| 4.32k| return each_pred_regular(*this, v, args...); 251| 4.32k| } _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| 4.32k|{ 366| 4.32k| constexpr auto B = bits; 367| 4.32k| constexpr auto BL = bits_leaf; 368| 4.32k| auto n = p.node()->inner(); 369| 4.32k| auto last = p.count() - 1; 370| 4.32k| auto e = n + last; 371| 4.32k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 3.00k, False: 1.32k] ------------------ 372| 11.7k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 8.95k, False: 2.78k] ------------------ 373| 8.95k| IMMER_PREFETCH(n + 1); 374| 8.95k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 212, False: 8.74k] ------------------ 375| 212| return false; 376| 8.95k| } 377| 2.78k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 3.00k| } else { 379| 1.32k| auto ss = p.shift() - B; 380| 2.76k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 1.66k, False: 1.09k] ------------------ 381| 1.66k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 222, False: 1.44k] ------------------ 382| 222| return false; 383| 1.09k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 1.32k| } 385| 4.32k|} _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.63k| { 1037| 2.63k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.63k| } _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.63k| { 1794| 2.63k| auto child = node_->inner()[offset]; 1795| 2.63k| auto child_size = size(offset); 1796| 2.63k| auto is_leaf = shift_ == BL; 1797| 2.63k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.63k] ------------------ 1798| 2.63k| : visit_maybe_relaxed_sub( 1799| 2.63k| child, shift_ - B, child_size, v, args...); 1800| 2.63k| } _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.63k|{ 1839| 2.63k| assert(node); ------------------ | Branch (1839:5): [True: 2.63k, False: 0] ------------------ 1840| 2.63k| auto relaxed = node->relaxed(); 1841| 2.63k| if (relaxed) { ------------------ | Branch (1841:9): [True: 409, False: 2.22k] ------------------ 1842| 409| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 409, False: 0] ------------------ 1843| 409| return make_relaxed_pos(node, shift, relaxed) 1844| 409| .visit(v, std::forward(args)...); 1845| 2.22k| } else { 1846| 2.22k| return make_regular_sub_pos(node, shift, size) 1847| 2.22k| .visit(v, std::forward(args)...); 1848| 2.22k| } 1849| 2.63k|} _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| 409| { 1814| 409| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 409| } _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| 4.31k| { 1008| 4.31k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 4.31k, False: 0] ------------------ 1009| 4.31k| auto is_leaf = shift_ == BL; 1010| 4.31k| auto child = node_->inner()[idx]; 1011| 4.31k| auto lsize = size(idx); 1012| 4.31k| auto is_full = idx + 1 < count(); 1013| 4.31k| return is_full ------------------ | Branch (1013:16): [True: 3.81k, False: 500] ------------------ 1014| 4.31k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.08k, False: 1.73k] ------------------ 1015| 3.81k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 3.81k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.31k| : (is_leaf ------------------ | Branch (1017:23): [True: 500, False: 0] ------------------ 1018| 500| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 500| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 4.31k| } _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.63k| { 208| 5.63k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.63k| } _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.63k| { 1805| 5.63k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 5.63k, False: 0] ------------------ 1806| 5.63k| auto child = node_->inner()[offset]; 1807| 5.63k| auto child_size = size(offset); 1808| 5.63k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 5.63k| } _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.63k| { 145| 5.63k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.63k| } _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| 2.03k| { 1406| 2.03k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.03k| } _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| 2.03k| { 1794| 2.03k| auto child = node_->inner()[offset]; 1795| 2.03k| auto child_size = size(offset); 1796| 2.03k| auto is_leaf = shift_ == BL; 1797| 2.03k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.03k] ------------------ 1798| 2.03k| : visit_maybe_relaxed_sub( 1799| 2.03k| child, shift_ - B, child_size, v, args...); 1800| 2.03k| } _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| 2.03k|{ 1839| 2.03k| assert(node); ------------------ | Branch (1839:5): [True: 2.03k, False: 0] ------------------ 1840| 2.03k| auto relaxed = node->relaxed(); 1841| 2.03k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.17k, False: 866] ------------------ 1842| 1.17k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.17k, False: 0] ------------------ 1843| 1.17k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.17k| .visit(v, std::forward(args)...); 1845| 1.17k| } else { 1846| 866| return make_regular_sub_pos(node, shift, size) 1847| 866| .visit(v, std::forward(args)...); 1848| 866| } 1849| 2.03k|} _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.17k| { 1814| 1.17k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.17k| } _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.85k| { 1387| 3.85k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 3.85k, False: 0] ------------------ 1388| 3.85k| auto is_leaf = shift_ == BL; 1389| 3.85k| auto child = node_->inner()[idx]; 1390| 3.85k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 3.55k, False: 306] ------------------ 1391| 3.85k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 3.85k| } _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| 866| { 1037| 866| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 866| } _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.7k| { 1794| 43.7k| auto child = node_->inner()[offset]; 1795| 43.7k| auto child_size = size(offset); 1796| 43.7k| auto is_leaf = shift_ == BL; 1797| 43.7k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 19.2k, False: 24.5k] ------------------ 1798| 43.7k| : visit_maybe_relaxed_sub( 1799| 24.5k| child, shift_ - B, child_size, v, args...); 1800| 43.7k| } _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| 139k|{ 1839| 139k| assert(node); ------------------ | Branch (1839:5): [True: 139k, False: 0] ------------------ 1840| 139k| auto relaxed = node->relaxed(); 1841| 139k| if (relaxed) { ------------------ | Branch (1841:9): [True: 126k, False: 13.0k] ------------------ 1842| 126k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 126k, False: 0] ------------------ 1843| 126k| return make_relaxed_pos(node, shift, relaxed) 1844| 126k| .visit(v, std::forward(args)...); 1845| 126k| } else { 1846| 13.0k| return make_regular_sub_pos(node, shift, size) 1847| 13.0k| .visit(v, std::forward(args)...); 1848| 13.0k| } 1849| 139k|} _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| 126k| { 1814| 126k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 126k| } _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| 126k| { 1483| 126k| auto p = node_->inner(); 1484| 126k| auto s = size_t{}; 1485| 126k| auto n = count(); 1486| 126k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 110k, False: 16.0k] ------------------ 1487| 930k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 820k, False: 109k] ------------------ 1488| 820k| IMMER_PREFETCH(p + i + 1); 1489| 820k| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 311, False: 820k] ------------------ 1490| 820k| .visit(v, args...)) 1491| 311| return false; 1492| 820k| s = relaxed_->d.sizes[i]; 1493| 820k| } 1494| 110k| } else { 1495| 16.0k| auto ss = shift_ - B; 1496| 130k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 114k, False: 15.6k] ------------------ 1497| 114k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 378, False: 114k] ------------------ 1498| 114k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 378| return false; 1500| 114k| s = relaxed_->d.sizes[i]; 1501| 114k| } 1502| 16.0k| } 1503| 125k| return true; 1504| 126k| } _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.27k| { 1037| 3.27k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.27k| } _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| 907| { 1784| 907| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 907, False: 0] ------------------ 1785| 907| auto child = node_->inner()[0]; 1786| 907| auto child_size = relaxed_->d.sizes[0]; 1787| 907| return visit_maybe_relaxed_sub( 1788| 907| child, shift_ - B, child_size, v, args...); 1789| 907| } _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| 907|{ 1839| 907| assert(node); ------------------ | Branch (1839:5): [True: 907, False: 0] ------------------ 1840| 907| auto relaxed = node->relaxed(); 1841| 907| if (relaxed) { ------------------ | Branch (1841:9): [True: 907, False: 0] ------------------ 1842| 907| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 907, False: 0] ------------------ 1843| 907| return make_relaxed_pos(node, shift, relaxed) 1844| 907| .visit(v, std::forward(args)...); 1845| 907| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 907|} _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| 907| { 1814| 907| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 907| } _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| 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: 2.09k, False: 8.06k] ------------------ 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| 8.06k| } else { 1846| 8.06k| return make_regular_sub_pos(node, shift, size) 1847| 8.06k| .visit(v, std::forward(args)...); 1848| 8.06k| } 1849| 10.1k|} _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| 8.06k| { 1037| 8.06k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.06k| } _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| 10.1k| { 1037| 10.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.1k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRKPSC_EEEDcT_DpOT0_: 144| 7.01k| { 145| 7.01k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.01k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2Ev: 114| 2.77M| : size{0} 115| 2.77M| , shift{BL} 116| 2.77M| , root{empty_root()} 117| 2.77M| , tail{empty_tail()} 118| 2.77M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 2.77M, False: 0] ------------------ 120| 2.77M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10empty_rootEv: 61| 2.78M| { 62| 2.78M| static const auto empty_ = [] { 63| 2.78M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 2.78M| static std::aligned_storage_t 65| 2.78M| storage; 66| 2.78M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 2.78M| }(); 68| 2.78M| return empty_->inc(); 69| 2.78M| } _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.77M| { 73| 2.77M| static const auto empty_ = [] { 74| 2.77M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 2.77M| static std::aligned_storage_t 76| 2.77M| storage; 77| 2.77M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 2.77M| }(); 79| 2.77M| return empty_->inc(); 80| 2.77M| } _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.81M| { 1373| 5.81M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 5.81M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 1.64k, False: 5.80M] | | ------------------ | | 33| 5.81M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 1.64k|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 5.80M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 5.80M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 5.80M] | | ------------------ | | 33| 5.80M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 5.80M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 5.80M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 5.80M] | | ------------------ | | 33| 5.80M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 5.80M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 5.80M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 5.80M] | | ------------------ | | 33| 5.80M| 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.80M| return true; 1382| 5.80M| } _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.4M, False: 14.4M] | Branch (199:9): [True: 14.4M, 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.4M, False: 14.4M] ------------------ 201| 28.9M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 6.10M, False: 8.34M] ------------------ 202| | /* otherwise */ 203| 14.4M| : 0; 204| 28.9M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9tail_sizeEv: 194| 6.13M| 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.80M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE3decEv: 192| 5.81M| 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.81M| { 209| 5.81M| auto tail_off = tail_offset(); 210| 5.81M| auto tail_size = size - tail_off; 211| | 212| 5.81M| if (tail_off) ------------------ | Branch (212:13): [True: 2.85M, False: 2.96M] ------------------ 213| 2.85M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 2.96M| else 215| 2.96M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 5.81M| if (tail_size) ------------------ | Branch (217:13): [True: 3.03M, False: 2.77M] ------------------ 218| 3.03M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 2.77M| else 220| 2.77M| make_empty_leaf_pos(tail).visit(v, args...); 221| 5.81M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_backEi: 500| 289k| { 501| 289k| auto ts = tail_size(); 502| 289k| if (ts < branches) { ------------------ | Branch (502:13): [True: 244k, False: 44.7k] ------------------ 503| 244k| auto new_tail = 504| 244k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 244k| return {size + 1, shift, root->inc(), new_tail}; 506| 244k| } else { 507| 44.7k| using std::get; 508| 44.7k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 44.7k| auto tail_off = tail_offset(); 510| 44.7k| IMMER_TRY { ------------------ | | 49| 44.7k|#define IMMER_TRY try ------------------ 511| 44.7k| auto new_root = 512| 44.7k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 44.7k| tail->inc(); 514| 44.7k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 44.7k| } 516| 44.7k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 44.7k| } 521| 289k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2EmjPNS1_4nodeIiSA_Lj3ELj3EEESE_: 127| 3.03M| : size{sz} 128| 3.03M| , shift{sh} 129| 3.03M| , root{r} 130| 3.03M| , tail{t} 131| 3.03M| { 132| 3.03M|#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.03M| try { 137| 3.03M| check_tree(); 138| 3.03M| } catch (...) { 139| | // This not fully constructed rrbtree owns the nodes already, have 140| | // to dec them. 141| 1.64k| if (r && t) ------------------ | Branch (141:17): [True: 1.64k, False: 0] | Branch (141:22): [True: 1.64k, False: 0] ------------------ 142| 1.64k| dec(); 143| 1.64k| throw; 144| 1.64k| } 145| |#else 146| | assert(check_tree()); 147| |#endif 148| 3.03M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_tailEPNS1_4nodeIiSA_Lj3ELj3EEEjmSE_j: 369| 1.10M| { 370| 1.10M| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 318k, False: 784k] ------------------ 371| 318k| auto new_root = 372| 318k| make_relaxed_pos(root, shift, r) 373| 318k| .visit(push_tail_visitor{}, tail, tail_size); 374| 318k| if (new_root) ------------------ | Branch (374:17): [True: 316k, False: 2.31k] ------------------ 375| 316k| return std::make_tuple(shift, new_root); 376| 2.31k| else { 377| 2.31k| auto new_root = node_t::make_inner_r_n(2); 378| 2.31k| IMMER_TRY { ------------------ | | 49| 2.31k|#define IMMER_TRY try ------------------ 379| 2.31k| auto new_path = node_t::make_path(shift, tail); 380| 2.31k| new_root->inner()[0] = root->inc(); 381| 2.31k| new_root->inner()[1] = new_path; 382| 2.31k| new_root->relaxed()->d.sizes[0] = size; 383| 2.31k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 2.31k| assert(size); ------------------ | Branch (384:21): [True: 2.31k, False: 0] ------------------ 385| 2.31k| assert(tail_size); ------------------ | Branch (385:21): [True: 2.31k, False: 0] ------------------ 386| 2.31k| new_root->relaxed()->d.count = 2u; 387| 2.31k| } 388| 2.31k| 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.31k| return std::make_tuple(shift + B, new_root); 393| 2.31k| } 394| 784k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 6.62k, False: 777k] ------------------ 395| 6.62k| auto new_root = node_t::make_inner_n(2); 396| 6.62k| IMMER_TRY { ------------------ | | 49| 6.62k|#define IMMER_TRY try ------------------ 397| 6.62k| auto new_path = node_t::make_path(shift, tail); 398| 6.62k| new_root->inner()[0] = root->inc(); 399| 6.62k| new_root->inner()[1] = new_path; 400| 6.62k| } 401| 6.62k| 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.62k| return std::make_tuple(shift + B, new_root); 406| 777k| } else if (size) { ------------------ | Branch (406:20): [True: 755k, False: 21.8k] ------------------ 407| 755k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 755k| .visit(push_tail_visitor{}, tail); 409| 755k| return std::make_tuple(shift, new_root); 410| 755k| } else { 411| 21.8k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 21.8k| } 413| 1.10M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2EOSB_: 157| 2.68M| : rrbtree{} 158| 2.68M| { 159| 2.68M| swap(*this, other); 160| 2.68M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEESC_: 176| 5.14M| { 177| 5.14M| using std::swap; 178| 5.14M| swap(x.size, y.size); 179| 5.14M| swap(x.shift, y.shift); 180| 5.14M| swap(x.root, y.root); 181| 5.14M| swap(x.tail, y.tail); 182| 5.14M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEaSEOSB_: 170| 2.46M| { 171| 2.46M| swap(*this, other); 172| 2.46M| return *this; 173| 2.46M| } 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| 195k| { 581| 195k| auto tail_off = tail_offset(); 582| 195k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 136k, False: 58.4k] ------------------ 583| 136k| auto tail_size = size - tail_off; 584| 136k| auto new_tail = 585| 136k| make_leaf_sub_pos(tail, tail_size) 586| 136k| .visit(update_visitor{}, idx - tail_off, fn); 587| 136k| return {size, shift, root->inc(), new_tail}; 588| 136k| } else { 589| 58.4k| auto new_root = visit_maybe_relaxed_sub( 590| 58.4k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 58.4k| return {size, shift, new_root, tail->inc()}; 592| 58.4k| } 593| 195k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4takeEm: 647| 21.7k| { 648| 21.7k| auto tail_off = tail_offset(); 649| 21.7k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 3.82k, False: 17.8k] ------------------ 650| 3.82k| return {}; 651| 17.8k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 756, False: 17.1k] ------------------ 652| 756| return *this; 653| 17.1k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 2.19k, False: 14.9k] ------------------ 654| 2.19k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 2.19k| return {new_size, shift, root->inc(), new_tail}; 656| 14.9k| } else { 657| 14.9k| using std::get; 658| 14.9k| auto l = new_size - 1; 659| 14.9k| auto v = slice_right_visitor(); 660| 14.9k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 14.9k| auto new_shift = get<0>(r); 662| 14.9k| auto new_root = get<1>(r); 663| 14.9k| auto new_tail = get<3>(r); 664| 14.9k| if (new_root) { ------------------ | Branch (664:17): [True: 11.0k, False: 3.87k] ------------------ 665| 11.0k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 11.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 11.0k, False: 0] ------------------ 666| 11.0k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 11.0k, False: 0] ------------------ 667| 11.0k| return {new_size, new_shift, new_root, new_tail}; 668| 11.0k| } else { 669| 3.87k| return {new_size, BL, empty_root(), new_tail}; 670| 3.87k| } 671| 14.9k| } 672| 21.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2ERKSB_: 151| 13.3k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 13.3k| { 153| 13.3k| inc(); 154| 13.3k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE3incEv: 187| 13.3k| { 188| 13.3k| root->inc(); 189| 13.3k| tail->inc(); 190| 13.3k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4dropEm: 711| 28.5k| { 712| 28.5k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.12k, False: 26.3k] ------------------ 713| 2.12k| return *this; 714| 26.3k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 1.21k, False: 25.1k] ------------------ 715| 1.21k| return {}; 716| 25.1k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 2.20k, False: 22.9k] ------------------ 717| 2.20k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 22.9k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 2.30k, False: 20.6k] ------------------ 719| 2.30k| auto tail_off = tail_offset(); 720| 2.30k| auto new_tail = 721| 2.30k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 2.30k| return {size - elems, BL, empty_root(), new_tail}; 723| 20.6k| } else { 724| 20.6k| using std::get; 725| 20.6k| auto v = slice_left_visitor(); 726| 20.6k| auto r = 727| 20.6k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 20.6k| auto new_root = get<1>(r); 729| 20.6k| auto new_shift = get<0>(r); 730| 20.6k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 20.6k| } 732| 28.5k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8max_sizeEv: 54| 3.59M| { 55| 3.59M| auto S = sizeof(size_t) * 8; 56| 3.59M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 3.59M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 3.59M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6concatERKSB_: 735| 2.12M| { 736| 2.12M| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 2.12M, False: 0] ------------------ 737| 2.12M| using std::get; 738| 2.12M| if (size == 0) ------------------ | Branch (738:13): [True: 4.29k, False: 2.12M] ------------------ 739| 4.29k| return r; 740| 2.12M| else if (r.size == 0) ------------------ | Branch (740:18): [True: 3.77k, False: 2.11M] ------------------ 741| 3.77k| return *this; 742| 2.11M| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 1.09M, False: 1.02M] ------------------ 743| | // just concat the tail, similar to push_back 744| 1.09M| auto tail_offst = tail_offset(); 745| 1.09M| auto tail_size = size - tail_offst; 746| 1.09M| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 161k, False: 934k] ------------------ 747| 161k| auto new_root = 748| 161k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 161k| tail->inc(); 750| 161k| return {size + r.size, 751| 161k| get<0>(new_root), 752| 161k| get<1>(new_root), 753| 161k| r.tail->inc()}; 754| 934k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 39.0k, False: 895k] ------------------ 755| 39.0k| auto new_tail = 756| 39.0k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 39.0k| return {size + r.size, shift, root->inc(), new_tail}; 758| 895k| } else { 759| 895k| auto remaining = branches - tail_size; 760| 895k| auto add_tail = 761| 895k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 895k| IMMER_TRY { ------------------ | | 49| 895k|#define IMMER_TRY try ------------------ 763| 895k| auto new_tail = 764| 895k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 895k| IMMER_TRY { ------------------ | | 49| 895k|#define IMMER_TRY try ------------------ 766| 895k| auto new_root = push_tail( 767| 895k| root, shift, tail_offst, add_tail, branches); 768| 895k| return {size + r.size, 769| 895k| get<0>(new_root), 770| 895k| get<1>(new_root), 771| 895k| new_tail}; 772| 895k| } 773| 895k| 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| 895k| } 778| 895k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 895k| } 783| 1.09M| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 5.74k, False: 1.01M] ------------------ 784| 5.74k| auto tail_offst = tail_offset(); 785| 5.74k| auto tail_size = size - tail_offst; 786| 5.74k| auto concated = 787| 5.74k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 5.74k| auto new_shift = concated.shift(); 789| 5.74k| auto new_root = concated.node(); 790| 5.74k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 5.74k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 5.74k, False: 0] ------------------ 791| 5.74k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 5.74k, False: 0] ------------------ 792| 5.74k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 1.01M| } else { 794| 1.01M| auto tail_offst = tail_offset(); 795| 1.01M| auto tail_size = size - tail_offst; 796| 1.01M| auto concated = concat_trees(root, 797| 1.01M| shift, 798| 1.01M| tail_offst, 799| 1.01M| tail, 800| 1.01M| tail_size, 801| 1.01M| r.root, 802| 1.01M| r.shift, 803| 1.01M| r.tail_offset()); 804| 1.01M| auto new_shift = concated.shift(); 805| 1.01M| auto new_root = concated.node(); 806| 1.01M| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 1.01M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 1.01M, False: 0] ------------------ 807| 1.01M| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 1.01M, False: 0] ------------------ 808| 1.01M| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 1.01M| } 810| 2.12M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 27.4k| { 479| 27.4k| auto ts = tail_size(); 480| 27.4k| if (ts < branches) { ------------------ | Branch (480:13): [True: 20.4k, False: 7.00k] ------------------ 481| 20.4k| ensure_mutable_tail(e, ts); 482| 20.4k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 20.4k| } else { 484| 7.00k| using std::get; 485| 7.00k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 7.00k| auto tail_off = tail_offset(); 487| 7.00k| IMMER_TRY { ------------------ | | 49| 7.00k|#define IMMER_TRY try ------------------ 488| 7.00k| push_tail_mut(e, tail_off, tail, ts); 489| 7.00k| tail = new_tail; 490| 7.00k| } 491| 7.00k| IMMER_CATCH (...) { 492| 0| node_t::delete_leaf(new_tail, 1u); 493| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 494| 0| } 495| 7.00k| } 496| 27.4k| ++size; 497| 27.4k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 320k| { 470| 320k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 7.38k, False: 312k] ------------------ 471| 7.38k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 7.38k| dec_leaf(tail, n); 473| 7.38k| tail = new_tail; 474| 7.38k| } 475| 320k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj3ELj3EEEj: 417| 347k| { 418| 347k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 176k, False: 171k] ------------------ 419| 176k| auto new_root = 420| 176k| make_relaxed_pos(root, shift, r) 421| 176k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 176k| if (new_root) { ------------------ | Branch (422:17): [True: 174k, False: 1.47k] ------------------ 423| 174k| root = new_root; 424| 174k| } else { 425| 1.47k| auto new_root = node_t::make_inner_r_e(e); 426| 1.47k| IMMER_TRY { ------------------ | | 49| 1.47k|#define IMMER_TRY try ------------------ 427| 1.47k| auto new_path = node_t::make_path_e(e, shift, tail); 428| 1.47k| new_root->inner()[0] = root; 429| 1.47k| new_root->inner()[1] = new_path; 430| 1.47k| new_root->relaxed()->d.sizes[0] = tail_off; 431| 1.47k| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 1.47k| assert(tail_off); ------------------ | Branch (432:21): [True: 1.47k, False: 0] ------------------ 433| 1.47k| assert(tail_size); ------------------ | Branch (433:21): [True: 1.47k, False: 0] ------------------ 434| 1.47k| new_root->relaxed()->d.count = 2u; 435| 1.47k| root = new_root; 436| 1.47k| shift += B; 437| 1.47k| } 438| 1.47k| 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.47k| } 443| 176k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 1.76k, False: 169k] ------------------ 444| 1.76k| auto new_root = node_t::make_inner_e(e); 445| 1.76k| IMMER_TRY { ------------------ | | 49| 1.76k|#define IMMER_TRY try ------------------ 446| 1.76k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 1.76k| new_root->inner()[0] = root; 448| 1.76k| new_root->inner()[1] = new_path; 449| 1.76k| root = new_root; 450| 1.76k| shift += B; 451| 1.76k| } 452| 1.76k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 169k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 167k, False: 1.82k] ------------------ 457| 167k| auto new_root = 458| 167k| make_regular_sub_pos(root, shift, tail_off) 459| 167k| .visit(push_tail_mut_visitor{}, e, tail); 460| 167k| root = new_root; 461| 167k| } else { 462| 1.82k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 1.82k| dec_empty_regular(root); 464| 1.82k| root = new_root; 465| 1.82k| } 466| 347k| } 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| 15.7k| { 574| 15.7k| auto& elem = get_mut(e, idx); 575| 15.7k| elem = std::forward(fn)(std::move(elem)); 576| 15.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 15.7k| { 540| 15.7k| auto tail_off = tail_offset(); 541| 15.7k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 751, False: 14.9k] ------------------ 542| 751| ensure_mutable_tail(e, size - tail_off); 543| 751| return tail->leaf()[(idx - tail_off) & mask]; 544| 14.9k| } else { 545| 14.9k| return visit_maybe_relaxed_sub(root, 546| 14.9k| shift, 547| 14.9k| tail_off, 548| 14.9k| get_mut_visitor{}, 549| 14.9k| idx, 550| 14.9k| e, 551| 14.9k| &root); 552| 14.9k| } 553| 15.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 33.7k| { 607| 33.7k| auto tail_off = tail_offset(); 608| 33.7k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 931, False: 32.8k] ------------------ 609| 931| *this = {}; 610| 32.8k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 753, False: 32.0k] ------------------ 611| 753| return; 612| 32.0k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 663, False: 31.4k] ------------------ 613| 663| auto ts = size - tail_off; 614| 663| auto newts = new_size - tail_off; 615| 663| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 349, False: 314] ------------------ 616| 349| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 349| } else { 618| 314| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 314| dec_leaf(tail, ts); 620| 314| tail = new_tail; 621| 314| } 622| 663| size = new_size; 623| 663| return; 624| 31.4k| } else { 625| 31.4k| using std::get; 626| 31.4k| auto l = new_size - 1; 627| 31.4k| auto v = slice_right_mut_visitor(); 628| 31.4k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 31.4k| auto new_shift = get<0>(r); 630| 31.4k| auto new_root = get<1>(r); 631| 31.4k| auto new_tail = get<3>(r); 632| 31.4k| if (new_root) { ------------------ | Branch (632:17): [True: 25.3k, False: 6.04k] ------------------ 633| 25.3k| root = new_root; 634| 25.3k| shift = new_shift; 635| 25.3k| } else { 636| 6.04k| root = empty_root(); 637| 6.04k| shift = BL; 638| 6.04k| } 639| 31.4k| dec_leaf(tail, size - tail_off); 640| 31.4k| size = new_size; 641| 31.4k| tail = new_tail; 642| 31.4k| return; 643| 31.4k| } 644| 33.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 76.6k| { 676| 76.6k| using std::get; 677| 76.6k| auto tail_off = tail_offset(); 678| 76.6k| if (elems == 0) { ------------------ | Branch (678:13): [True: 4.42k, False: 72.2k] ------------------ 679| 4.42k| return; 680| 72.2k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 226, False: 71.9k] ------------------ 681| 226| *this = {}; 682| 71.9k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 216, False: 71.7k] ------------------ 683| 216| dec_inner(root, shift, tail_off); 684| 216| shift = BL; 685| 216| root = empty_root(); 686| 216| size -= elems; 687| 216| return; 688| 71.7k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 1.10k, False: 70.6k] ------------------ 689| 1.10k| auto v = slice_left_mut_visitor(); 690| 1.10k| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 1.10k| .visit(v, elems - tail_off, e)); 692| 1.10k| if (tail_off) { ------------------ | Branch (692:17): [True: 349, False: 755] ------------------ 693| 349| dec_inner(root, shift, tail_off); 694| 349| shift = BL; 695| 349| root = empty_root(); 696| 349| } 697| 1.10k| size -= elems; 698| 1.10k| return; 699| 70.6k| } else { 700| 70.6k| auto v = slice_left_mut_visitor(); 701| 70.6k| auto r = 702| 70.6k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 70.6k| shift = get<0>(r); 704| 70.6k| root = get<1>(r); 705| 70.6k| size -= elems; 706| 70.6k| return; 707| 70.6k| } 708| 76.6k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editERKSB_: 816| 345k| { 817| 345k| assert(&l != &r); ------------------ | Branch (817:9): [True: 345k, False: 0] ------------------ 818| 345k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 345k, False: 0] ------------------ 819| 345k| using std::get; 820| 345k| if (l.size == 0) ------------------ | Branch (820:13): [True: 490, False: 344k] ------------------ 821| 490| l = r; 822| 344k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 877, False: 343k] ------------------ 823| 877| return; 824| 343k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 284k, False: 59.1k] ------------------ 825| | // just concat the tail, similar to push_back 826| 284k| auto tail_offst = l.tail_offset(); 827| 284k| auto tail_size = l.size - tail_offst; 828| 284k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 27.9k, False: 256k] ------------------ 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| 256k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 3.06k, False: 253k] ------------------ 834| 3.06k| l.ensure_mutable_tail(el, tail_size); 835| 3.06k| detail::uninitialized_copy(r.tail->leaf(), 836| 3.06k| r.tail->leaf() + r.size, 837| 3.06k| l.tail->leaf() + tail_size); 838| 3.06k| l.size += r.size; 839| 3.06k| return; 840| 253k| } else { 841| 253k| auto remaining = branches - tail_size; 842| 253k| l.ensure_mutable_tail(el, tail_size); 843| 253k| detail::uninitialized_copy(r.tail->leaf(), 844| 253k| r.tail->leaf() + remaining, 845| 253k| l.tail->leaf() + tail_size); 846| 253k| IMMER_TRY { ------------------ | | 49| 253k|#define IMMER_TRY try ------------------ 847| 253k| auto new_tail = 848| 253k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 253k| IMMER_TRY { ------------------ | | 49| 253k|#define IMMER_TRY try ------------------ 850| 253k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 253k| l.tail = new_tail; 852| 253k| l.size += r.size; 853| 253k| return; 854| 253k| } 855| 253k| 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| 253k| } 860| 253k| 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| 253k| } 865| 284k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 619, False: 58.5k] ------------------ 866| 619| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 619] ------------------ 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| 619| } else { 886| 619| auto tail_offst = l.tail_offset(); 887| 619| auto tail_size = l.size - tail_offst; 888| 619| auto concated = concat_trees( 889| 619| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 619| l = {l.size + r.size, 891| 619| concated.shift(), 892| 619| concated.node(), 893| 619| r.tail->inc()}; 894| 619| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 619, False: 0] ------------------ 895| 619| return; 896| 619| } 897| 58.5k| } else { 898| 58.5k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 58.5k] ------------------ 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| 58.5k| } else { 923| 58.5k| auto tail_offst = l.tail_offset(); 924| 58.5k| auto tail_size = l.size - tail_offst; 925| 58.5k| auto concated = concat_trees(l.root, 926| 58.5k| l.shift, 927| 58.5k| tail_offst, 928| 58.5k| l.tail, 929| 58.5k| tail_size, 930| 58.5k| r.root, 931| 58.5k| r.shift, 932| 58.5k| r.tail_offset()); 933| 58.5k| l = {l.size + r.size, 934| 58.5k| concated.shift(), 935| 58.5k| concated.node(), 936| 58.5k| r.tail->inc()}; 937| 58.5k| } 938| 58.5k| } 939| 345k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEaSERKSB_: 163| 2.38k| { 164| 2.38k| auto next{other}; 165| 2.38k| swap(*this, next); 166| 2.38k| return *this; 167| 2.38k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERSB_NS9_5applyIS6_E4type4editE: 942| 3.25k| { 943| 3.25k| assert(&l != &r); ------------------ | Branch (943:9): [True: 3.25k, False: 0] ------------------ 944| 3.25k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 3.25k, False: 0] ------------------ 945| 3.25k| using std::get; 946| 3.25k| if (r.size == 0) ------------------ | Branch (946:13): [True: 342, False: 2.91k] ------------------ 947| 342| r = std::move(l); 948| 2.91k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 218, False: 2.69k] ------------------ 949| 218| return; 950| 2.69k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 976, False: 1.71k] ------------------ 951| | // just concat the tail, similar to push_back 952| 976| auto tail_offst = l.tail_offset(); 953| 976| auto tail_size = l.size - tail_offst; 954| 976| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 411, False: 565] ------------------ 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| 411| auto res = 959| 411| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 411| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 411| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 411| return; 965| 565| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 327, False: 238] ------------------ 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| 327| auto new_tail = 974| 327| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 327| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 327| return; 977| 327| } else { 978| | // like the immutable version 979| 238| auto remaining = branches - tail_size; 980| 238| auto add_tail = node_t::copy_leaf_e( 981| 238| er, l.tail, tail_size, r.tail, remaining); 982| 238| IMMER_TRY { ------------------ | | 49| 238|#define IMMER_TRY try ------------------ 983| 238| auto new_tail = 984| 238| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 238| IMMER_TRY { ------------------ | | 49| 238|#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| 238| auto new_root = l.push_tail(l.root, 990| 238| l.shift, 991| 238| tail_offst, 992| 238| add_tail, 993| 238| branches); 994| 238| r = {l.size + r.size, 995| 238| get<0>(new_root), 996| 238| get<1>(new_root), 997| 238| new_tail}; 998| 238| return; 999| 238| } 1000| 238| 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| 238| } 1005| 238| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 238| } 1010| 1.71k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 466, False: 1.25k] ------------------ 1011| 466| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 466] ------------------ 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| 466| } else { 1030| 466| auto tail_offst = l.tail_offset(); 1031| 466| auto tail_size = l.size - tail_offst; 1032| 466| auto concated = concat_trees( 1033| 466| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 466| r = {l.size + r.size, 1035| 466| concated.shift(), 1036| 466| concated.node(), 1037| 466| r.tail->inc()}; 1038| 466| return; 1039| 466| } 1040| 1.25k| } else { 1041| 1.25k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.25k] ------------------ 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.25k| } else { 1064| 1.25k| auto tail_offst = l.tail_offset(); 1065| 1.25k| auto tail_size = l.size - tail_offst; 1066| 1.25k| auto concated = concat_trees(l.root, 1067| 1.25k| l.shift, 1068| 1.25k| tail_offst, 1069| 1.25k| l.tail, 1070| 1.25k| tail_size, 1071| 1.25k| r.root, 1072| 1.25k| r.shift, 1073| 1.25k| r.tail_offset()); 1074| 1.25k| r = {l.size + r.size, 1075| 1.25k| concated.shift(), 1076| 1.25k| concated.node(), 1077| 1.25k| r.tail->inc()}; 1078| 1.25k| return; 1079| 1.25k| } 1080| 1.25k| } 1081| 3.25k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 379k| { 1085| 379k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 379k, False: 0] ------------------ 1086| 379k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 379k, False: 0] ------------------ 1087| 379k| using std::get; 1088| 379k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 1.55k, False: 377k] ------------------ 1089| 1.55k| l = r; 1090| 377k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 895, False: 376k] ------------------ 1091| 895| return; 1092| 376k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 61.6k, False: 315k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 61.6k| auto tail_offst = l.tail_offset(); 1095| 61.6k| auto tail_size = l.size - tail_offst; 1096| 61.6k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 19.4k, False: 42.2k] ------------------ 1097| 19.4k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 19.4k| l.tail = r.tail->inc(); 1099| 19.4k| l.size += r.size; 1100| 19.4k| return; 1101| 42.2k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 2.86k, False: 39.3k] ------------------ 1102| 2.86k| l.ensure_mutable_tail(el, tail_size); 1103| 2.86k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 1.17k, False: 1.69k] ------------------ 1104| 1.17k| detail::uninitialized_move(r.tail->leaf(), 1105| 1.17k| r.tail->leaf() + r.size, 1106| 1.17k| l.tail->leaf() + tail_size); 1107| 1.69k| else 1108| 1.69k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.69k| r.tail->leaf() + r.size, 1110| 1.69k| l.tail->leaf() + tail_size); 1111| 2.86k| l.size += r.size; 1112| 2.86k| return; 1113| 39.3k| } else { 1114| 39.3k| auto remaining = branches - tail_size; 1115| 39.3k| l.ensure_mutable_tail(el, tail_size); 1116| 39.3k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 13.2k, False: 26.0k] ------------------ 1117| 13.2k| detail::uninitialized_move(r.tail->leaf(), 1118| 13.2k| r.tail->leaf() + remaining, 1119| 13.2k| l.tail->leaf() + tail_size); 1120| 26.0k| else 1121| 26.0k| detail::uninitialized_copy(r.tail->leaf(), 1122| 26.0k| r.tail->leaf() + remaining, 1123| 26.0k| l.tail->leaf() + tail_size); 1124| 39.3k| IMMER_TRY { ------------------ | | 49| 39.3k|#define IMMER_TRY try ------------------ 1125| 39.3k| auto new_tail = 1126| 39.3k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 39.3k| IMMER_TRY { ------------------ | | 49| 39.3k|#define IMMER_TRY try ------------------ 1128| 39.3k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 39.3k| l.tail = new_tail; 1130| 39.3k| l.size += r.size; 1131| 39.3k| return; 1132| 39.3k| } 1133| 39.3k| 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| 39.3k| } 1138| 39.3k| 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| 39.3k| } 1143| 315k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.23k, False: 312k] ------------------ 1144| 3.23k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.23k] ------------------ 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.23k| } else { 1165| 3.23k| auto tail_offst = l.tail_offset(); 1166| 3.23k| auto tail_size = l.size - tail_offst; 1167| 3.23k| auto concated = concat_trees( 1168| 3.23k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.23k| l = {l.size + r.size, 1170| 3.23k| concated.shift(), 1171| 3.23k| concated.node(), 1172| 3.23k| r.tail->inc()}; 1173| 3.23k| return; 1174| 3.23k| } 1175| 312k| } else { 1176| 312k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 312k] ------------------ 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| 312k| } else { 1200| 312k| auto tail_offst = l.tail_offset(); 1201| 312k| auto tail_size = l.size - tail_offst; 1202| 312k| auto concated = concat_trees(l.root, 1203| 312k| l.shift, 1204| 312k| tail_offst, 1205| 312k| l.tail, 1206| 312k| tail_size, 1207| 312k| r.root, 1208| 312k| r.shift, 1209| 312k| r.tail_offset()); 1210| 312k| l = {l.size + r.size, 1211| 312k| concated.shift(), 1212| 312k| concated.node(), 1213| 312k| r.tail->inc()}; 1214| 312k| return; 1215| 312k| } 1216| 312k| } 1217| 379k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6equalsERKSB_: 315| 31.7k| { 316| 31.7k| using iter_t = rrbtree_iterator; 317| 31.7k| if (size != other.size) ------------------ | Branch (317:13): [True: 9.62k, False: 22.1k] ------------------ 318| 9.62k| return false; 319| 22.1k| if (size == 0) ------------------ | Branch (319:13): [True: 205, False: 21.9k] ------------------ 320| 205| return true; 321| 21.9k| auto tail_off = tail_offset(); 322| 21.9k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 21.9k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 21.2k, False: 671] | Branch (324:29): [True: 21.0k, 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| 21.0k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 20.5k, False: 500] ------------------ 329| 20.5k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 9.96k, False: 10.6k] ------------------ 330| 20.5k| other.shift, 331| 20.5k| tail_off_other, 332| 20.5k| equals_visitor::rrb{}, 333| 20.5k| iter_t{other}, 334| 20.5k| root, 335| 20.5k| shift, 336| 20.5k| tail_off)) 337| 9.96k| return false; 338| 20.5k| } else { 339| 500| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 205, False: 295] ------------------ 340| 500| shift, 341| 500| tail_off, 342| 500| equals_visitor::rrb{}, 343| 500| iter_t{*this}, 344| 500| other.root, 345| 500| other.shift, 346| 500| tail_off_other)) 347| 205| return false; 348| 500| } 349| 21.0k| } 350| 11.7k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 7.01k, False: 4.75k] ------------------ 351| 11.7k| ? make_leaf_sub_pos(tail, tail_size()) 352| 7.01k| .visit(equals_visitor{}, other.tail) 353| 11.7k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 1.75k, False: 2.99k] ------------------ 354| 4.75k| ? std::equal(tail->leaf(), 355| 1.75k| tail->leaf() + (size - tail_off), 356| 1.75k| other.tail->leaf() + 357| 1.75k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 4.75k| : std::equal(tail->leaf(), 360| 2.99k| tail->leaf() + (size - tail_off), 361| 2.99k| iter_t{other} + tail_off); 362| 21.9k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10region_forEm: 524| 1.15M| { 525| 1.15M| using std::get; 526| 1.15M| auto tail_off = tail_offset(); 527| 1.15M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 4.74k, False: 1.15M] ------------------ 528| 4.74k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.15M| } else { 530| 1.15M| auto subs = visit_maybe_relaxed_sub( 531| 1.15M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.15M| auto first = idx - get<1>(subs); 533| 1.15M| auto end = first + get<2>(subs); 534| 1.15M| return std::make_tuple(get<0>(subs), first, end); 535| 1.15M| } 536| 1.15M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11dereferenceEv: 90| 8.37M| { 91| 8.37M| using std::get; 92| 8.37M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 59.0k, False: 8.31M] | Branch (92:35): [True: 1.09M, False: 7.22M] ------------------ 93| 1.15M| curr_ = v_->region_for(i_); 94| 8.37M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 8.37M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7advanceEl: 74| 204k| { 75| 204k| using std::get; 76| 204k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 308, False: 204k] | Branch (76:9): [True: 204k, False: 0] | Branch (76:9): [True: 204k, False: 0] ------------------ 77| 204k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 204k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 204k, False: 0] ------------------ 78| 204k| i_ += n; 79| 204k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9incrementEv: 60| 7.26M| { 61| 7.26M| using std::get; 62| 7.26M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 7.26M, False: 0] ------------------ 63| 7.26M| ++i_; 64| 7.26M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2ERKNS1_7rrbtreeIiSA_Lj3ELj3EEE: 39| 24.0k| : v_{&v} 40| 24.0k| , i_{0} 41| 24.0k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 24.0k| { 43| 24.0k| } _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| 17.2k| { 32| 17.2k| return Deriv::visit_inner(std::forward(args)...); 33| 17.2k| } _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| 66.2k| { 32| 66.2k| return Deriv::visit_inner(std::forward(args)...); 33| 66.2k| } _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| 968| { 38| 968| return Deriv::visit_inner(std::forward(args)...); 39| 968| } _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.06k| { 38| 4.06k| return Deriv::visit_inner(std::forward(args)...); 39| 4.06k| } _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.44k| { 38| 6.44k| return Deriv::visit_inner(std::forward(args)...); 39| 6.44k| } _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| 636| { 38| 636| return Deriv::visit_inner(std::forward(args)...); 39| 636| } _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.95k| { 38| 1.95k| return Deriv::visit_inner(std::forward(args)...); 39| 1.95k| } _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.30k| { 32| 7.30k| return Deriv::visit_inner(std::forward(args)...); 33| 7.30k| } _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.30k| { 44| 7.30k| return Deriv::visit_node(std::forward(args)...); 45| 7.30k| } _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| 12.9M| { 50| 12.9M| return Deriv::visit_node(std::forward(args)...); 51| 12.9M| } _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| 156M| { 32| 156M| return Deriv::visit_inner(std::forward(args)...); 33| 156M| } _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| 156M| { 44| 156M| return Deriv::visit_node(std::forward(args)...); 45| 156M| } _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| 156M| { 32| 156M| return Deriv::visit_inner(std::forward(args)...); 33| 156M| } _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.5k| { 32| 21.5k| return Deriv::visit_inner(std::forward(args)...); 33| 21.5k| } _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| 318| { 38| 318| return Deriv::visit_inner(std::forward(args)...); 39| 318| } _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| 938| { 38| 938| return Deriv::visit_inner(std::forward(args)...); 39| 938| } _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| 5.34M| { 50| 5.34M| return Deriv::visit_node(std::forward(args)...); 51| 5.34M| } _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| 551k| { 38| 551k| return Deriv::visit_inner(std::forward(args)...); 39| 551k| } _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| 551k| { 44| 551k| return Deriv::visit_node(std::forward(args)...); 45| 551k| } _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| 551k| { 38| 551k| return Deriv::visit_inner(std::forward(args)...); 39| 551k| } _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.80M| { 38| 3.80M| return Deriv::visit_inner(std::forward(args)...); 39| 3.80M| } _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.80M| { 44| 3.80M| return Deriv::visit_node(std::forward(args)...); 45| 3.80M| } _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.80M| { 38| 3.80M| return Deriv::visit_inner(std::forward(args)...); 39| 3.80M| } _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.76k| { 38| 2.76k| return Deriv::visit_inner(std::forward(args)...); 39| 2.76k| } _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.76k| { 44| 2.76k| return Deriv::visit_node(std::forward(args)...); 45| 2.76k| } _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.36M| { 32| 1.36M| return Deriv::visit_inner(std::forward(args)...); 33| 1.36M| } _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.36M| { 44| 1.36M| return Deriv::visit_node(std::forward(args)...); 45| 1.36M| } _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.35M| { 32| 1.35M| return Deriv::visit_inner(std::forward(args)...); 33| 1.35M| } _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.35M| { 44| 1.35M| return Deriv::visit_node(std::forward(args)...); 45| 1.35M| } _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.70M| { 32| 3.70M| return Deriv::visit_inner(std::forward(args)...); 33| 3.70M| } _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.76k| { 38| 4.76k| return Deriv::visit_inner(std::forward(args)...); 39| 4.76k| } _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.14M| { 32| 1.14M| return Deriv::visit_inner(std::forward(args)...); 33| 1.14M| } _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| 362k| { 38| 362k| return Deriv::visit_inner(std::forward(args)...); 39| 362k| } _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.82k| { 38| 1.82k| return Deriv::visit_inner(std::forward(args)...); 39| 1.82k| } _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.4k| { 38| 17.4k| return Deriv::visit_inner(std::forward(args)...); 39| 17.4k| } _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.45k| { 38| 7.45k| return Deriv::visit_inner(std::forward(args)...); 39| 7.45k| } _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| 9.02k| { 38| 9.02k| return Deriv::visit_inner(std::forward(args)...); 39| 9.02k| } _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.50M| { 38| 1.50M| return Deriv::visit_inner(std::forward(args)...); 39| 1.50M| } _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.19k| { 38| 1.19k| return Deriv::visit_inner(std::forward(args)...); 39| 1.19k| } _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| 24.4k| { 32| 24.4k| return Deriv::visit_inner(std::forward(args)...); 33| 24.4k| } _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.44k| { 38| 2.44k| return Deriv::visit_inner(std::forward(args)...); 39| 2.44k| } _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.15k| { 32| 1.15k| return Deriv::visit_inner(std::forward(args)...); 33| 1.15k| } _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.3k| { 38| 11.3k| return Deriv::visit_inner(std::forward(args)...); 39| 11.3k| } _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.3k| { 44| 11.3k| return Deriv::visit_node(std::forward(args)...); 45| 11.3k| } _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| 22.7k| { 38| 22.7k| return Deriv::visit_inner(std::forward(args)...); 39| 22.7k| } _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| 22.7k| { 44| 22.7k| return Deriv::visit_node(std::forward(args)...); 45| 22.7k| } _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.00k| { 32| 6.00k| return Deriv::visit_inner(std::forward(args)...); 33| 6.00k| } _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.00k| { 44| 6.00k| return Deriv::visit_node(std::forward(args)...); 45| 6.00k| } _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| 16.7k| { 38| 16.7k| return Deriv::visit_inner(std::forward(args)...); 39| 16.7k| } _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| 16.7k| { 44| 16.7k| return Deriv::visit_node(std::forward(args)...); 45| 16.7k| } _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.9k| { 32| 10.9k| return Deriv::visit_inner(std::forward(args)...); 33| 10.9k| } _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.9k| { 44| 10.9k| return Deriv::visit_node(std::forward(args)...); 45| 10.9k| } _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| 18.2k| { 32| 18.2k| return Deriv::visit_inner(std::forward(args)...); 33| 18.2k| } _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.06k| { 32| 2.06k| return Deriv::visit_inner(std::forward(args)...); 33| 2.06k| } _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| 385| { 32| 385| return Deriv::visit_inner(std::forward(args)...); 33| 385| } _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| 715| { 38| 715| return Deriv::visit_inner(std::forward(args)...); 39| 715| } _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| 4.09M| { 32| 4.09M| return Deriv::visit_inner(std::forward(args)...); 33| 4.09M| } _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| 273k| { 38| 273k| return Deriv::visit_inner(std::forward(args)...); 39| 273k| } _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| 309k| { 38| 309k| return Deriv::visit_inner(std::forward(args)...); 39| 309k| } _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| 39.2k| { 38| 39.2k| return Deriv::visit_inner(std::forward(args)...); 39| 39.2k| } _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| 23.6k| { 38| 23.6k| return Deriv::visit_inner(std::forward(args)...); 39| 23.6k| } _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| 570| { 38| 570| return Deriv::visit_inner(std::forward(args)...); 39| 570| } _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| 13.7k| { 38| 13.7k| return Deriv::visit_inner(std::forward(args)...); 39| 13.7k| } _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| 4.32k| { 38| 4.32k| return Deriv::visit_inner(std::forward(args)...); 39| 4.32k| } _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.63k| { 38| 2.63k| return Deriv::visit_inner(std::forward(args)...); 39| 2.63k| } _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| 2.03k| { 38| 2.03k| return Deriv::visit_inner(std::forward(args)...); 39| 2.03k| } _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| 126k| { 32| 126k| return Deriv::visit_inner(std::forward(args)...); 33| 126k| } _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| 907| { 32| 907| return Deriv::visit_inner(std::forward(args)...); 33| 907| } _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| 907| { 44| 907| return Deriv::visit_node(std::forward(args)...); 45| 907| } _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| 10.1k| { 38| 10.1k| return Deriv::visit_inner(std::forward(args)...); 39| 10.1k| } _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| 10.1k| { 44| 10.1k| return Deriv::visit_node(std::forward(args)...); 45| 10.1k| } _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| 421M| { 114| 421M| check_base(); 115| 421M| auto* base = static_cast(this); 116| 421M| return reinterpret_cast(base + 1); 117| 421M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 421M| { 135| 421M| static_assert(std::is_standard_layout::value && 136| 421M| !std::is_empty::value, 137| 421M| "Please add 'true' if the derived class is emtpy"); 138| 421M| } _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| 2.97M|{ 189| 2.97M| return first + n; 190| 2.97M|} _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.34M|{ 237| 4.34M| return std::copy(first, last, out); 238| 4.34M|} _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| 343k|{ 345| 343k| return std::forward(f2)(empty_t{}); 346| 343k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 75.5M|{ 324| 75.5M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 3.59M, False: 71.9M] ------------------ 325| 75.5M|} _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| 204k|{ 345| 204k| return std::forward(f2)(empty_t{}); 346| 204k|} _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| 167k|{ 330| 167k| std::forward(f)(empty_t{}); 331| 167k|} _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.6k|{ 345| 21.6k| return std::forward(f2)(empty_t{}); 346| 21.6k|} _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| 238k|{ 345| 238k| return std::forward(f2)(empty_t{}); 346| 238k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 14.4k|{ 211| 14.4k| return std::copy(first, last, out); 212| 14.4k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.10M|{ 30| 1.10M| return x; 31| 1.10M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 16.4k|{ 261| 16.4k| auto ptr = Heap::allocate(sizeof(T)); 262| 16.4k| IMMER_TRY { ------------------ | | 49| 16.4k|#define IMMER_TRY try ------------------ 263| 16.4k| return new (ptr) T(std::forward(args)...); 264| 16.4k| } 265| 16.4k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 16.4k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2Ev: 96| 79.5k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_backEi: 246| 289k| { 247| 289k| return impl_.push_back(std::move(value)); 248| 289k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj3ELj3EEE: 536| 2.66M| : impl_(std::move(impl)) 537| 2.66M| { 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.66M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4sizeEv: 181| 4.81M| 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| 195k| { 324| 195k| return impl_.update(index, std::forward(fn)); 325| 195k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4takeEm: 350| 21.7k| { 351| 21.7k| return impl_.take(elems); 352| 21.7k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4dropEm: 376| 28.5k| { 377| 28.5k| return impl_.drop(elems); 378| 28.5k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8max_sizeEv: 90| 1.47M| 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.12M| { 404| 2.12M| return l.impl_.concat(r.impl_); 405| 2.12M| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_backEi: 251| 27.4k| { 252| 27.4k| return push_back_move(move_t{}, std::move(value)); 253| 27.4k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 27.4k| { 548| 27.4k| impl_.push_back_mut({}, std::move(value)); 549| 27.4k| return std::move(*this); 550| 27.4k| } 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| 15.7k| { 330| 15.7k| return update_move(move_t{}, index, std::forward(fn)); 331| 15.7k| } 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| 15.7k| { 569| 15.7k| impl_.update_mut({}, index, std::forward(fn)); 570| 15.7k| return std::move(*this); 571| 15.7k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4takeEm: 355| 33.7k| { 356| 33.7k| return take_move(move_t{}, elems); 357| 33.7k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 33.7k| { 580| 33.7k| impl_.take_mut({}, elems); 581| 33.7k| return std::move(*this); 582| 33.7k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4dropEm: 381| 76.6k| { 382| 76.6k| return drop_move(move_t{}, elems); 383| 76.6k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 76.6k| { 590| 76.6k| impl_.drop_mut({}, elems); 591| 76.6k| return std::move(*this); 592| 76.6k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERKS9_: 409| 345k| { 410| 345k| return concat_move(move_t{}, std::move(l), r); 411| 345k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 345k| { 601| 345k| concat_mut_l(l.impl_, {}, r.impl_); 602| 345k| return std::move(l); 603| 345k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEOS9_: 415| 3.25k| { 416| 3.25k| return concat_move(move_t{}, l, std::move(r)); 417| 3.25k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 3.25k| { 607| 3.25k| concat_mut_r(l.impl_, r.impl_, {}); 608| 3.25k| return std::move(r); 609| 3.25k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEESA_: 421| 379k| { 422| 379k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 379k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 379k| { 613| 379k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 379k| return std::move(l); 615| 379k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEeqERKS9_: 222| 31.7k| { 223| 31.7k| return impl_.equals(other.impl_); 224| 31.7k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5eraseEm: 480| 3.50k| { 481| 3.50k| return take(pos) + drop(pos + 1); 482| 3.50k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6insertEmi: 442| 16.4k| { 443| 16.4k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 16.4k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 101M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 54.9M| { 28| 54.9M| return ::operator new(size); 29| 54.9M| } _ZN5immer8cpp_heap8allocateIJNS_10norefs_tagEEEEPvmDpT_: 27| 46.3M| { 28| 46.3M| return ::operator new(size); 29| 46.3M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 16.4k| { 50| 16.4k| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 16.4k| new (p) std::size_t{size}; 52| 16.4k| return ((char*) p) + extra_size; 53| 16.4k| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 16.4k| { 58| 16.4k| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 16.4k| assert(*p == size); ------------------ | Branch (59:9): [True: 16.4k, False: 0] ------------------ 60| 16.4k| Base::deallocate(size + extra_size, p, tags...); 61| 16.4k| } _ZN5immer15refcount_policyC2Ev: 28| 16.4k| : refcount{1} {}; _ZN5immer15refcount_policy3decEv: 36| 16.4k| 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.40M| 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| 205k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeaSENS6_4editE: 34| 881k| ownee& operator=(edit) { return *this; };