LLVMFuzzerTestOneInput: 24| 10.4k|{ 25| 10.4k| constexpr auto var_count = 8; 26| 10.4k| constexpr auto bits = 3; 27| | 28| 10.4k| using vector_t = immer::flex_vector; 29| 10.4k| using size_t = std::uint8_t; 30| | 31| 10.4k| auto vars = std::array{}; 32| | 33| 10.4k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 34| 10.4k| auto is_valid_var_neq = [](auto other) { 35| 10.4k| return [=](auto idx) { 36| 10.4k| return idx >= 0 && idx < var_count && idx != other; 37| 10.4k| }; 38| 10.4k| }; 39| 10.4k| auto is_valid_index = [](auto& v) { 40| 10.4k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 10.4k| }; 42| 10.4k| auto is_valid_size = [](auto& v) { 43| 10.4k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 10.4k| }; 45| 10.4k| auto can_concat = [](const auto& v1, const auto& v2) { 46| | // First, check max_size 47| 10.4k| if (v1.size() + v2.size() > vector_t::max_size()) { 48| 10.4k| return false; 49| 10.4k| } 50| | 51| | // But just checking max_size is not sufficient, because there are other 52| | // conditions for the validity of the tree, like shift constraints, for 53| | // example. 54| 10.4k| try { 55| | // Try to concat and catch an exception if it fails 56| 10.4k| const auto v3 = v1 + v2; 57| 10.4k| if (v3.size()) { 58| 10.4k| return true; 59| 10.4k| } 60| 10.4k| } catch (const immer::detail::rbts::invalid_tree&) { 61| 10.4k| return false; 62| 10.4k| } 63| 10.4k| return true; 64| 10.4k| }; 65| 10.4k| auto can_compare = [](auto&& v) { 66| | // avoid comparing vectors that are too big, and hence, slow to compare 67| 10.4k| return v.size() < (1 << 15); 68| 10.4k| }; 69| 10.4k| return fuzzer_input{data, size}.run([&](auto& in) { 70| 10.4k| enum ops 71| 10.4k| { 72| 10.4k| op_push_back, 73| 10.4k| op_update, 74| 10.4k| op_take, 75| 10.4k| op_drop, 76| 10.4k| op_concat, 77| 10.4k| op_push_back_move, 78| 10.4k| op_update_move, 79| 10.4k| op_take_move, 80| 10.4k| op_drop_move, 81| 10.4k| op_concat_move_l, 82| 10.4k| op_concat_move_r, 83| 10.4k| op_concat_move_lr, 84| 10.4k| op_insert, 85| 10.4k| op_erase, 86| 10.4k| op_compare, 87| 10.4k| }; 88| 10.4k| auto src = read(in, is_valid_var); 89| 10.4k| auto dst = read(in, is_valid_var); 90| 10.4k| switch (read(in)) { 91| 10.4k| case op_push_back: { 92| 10.4k| vars[dst] = vars[src].push_back(42); 93| 10.4k| break; 94| 10.4k| } 95| 10.4k| case op_update: { 96| 10.4k| auto idx = read(in, is_valid_index(vars[src])); 97| 10.4k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 98| 10.4k| break; 99| 10.4k| } 100| 10.4k| case op_take: { 101| 10.4k| auto idx = read(in, is_valid_size(vars[src])); 102| 10.4k| vars[dst] = vars[src].take(idx); 103| 10.4k| break; 104| 10.4k| } 105| 10.4k| case op_drop: { 106| 10.4k| auto idx = read(in, is_valid_size(vars[src])); 107| 10.4k| vars[dst] = vars[src].drop(idx); 108| 10.4k| break; 109| 10.4k| } 110| 10.4k| case op_concat: { 111| 10.4k| auto src2 = read(in, is_valid_var); 112| 10.4k| if (can_concat(vars[src], vars[src2])) 113| 10.4k| vars[dst] = vars[src] + vars[src2]; 114| 10.4k| break; 115| 10.4k| } 116| 10.4k| case op_push_back_move: { 117| 10.4k| vars[dst] = std::move(vars[src]).push_back(21); 118| 10.4k| break; 119| 10.4k| } 120| 10.4k| case op_update_move: { 121| 10.4k| auto idx = read(in, is_valid_index(vars[src])); 122| 10.4k| vars[dst] = 123| 10.4k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 124| 10.4k| break; 125| 10.4k| } 126| 10.4k| case op_take_move: { 127| 10.4k| auto idx = read(in, is_valid_size(vars[src])); 128| 10.4k| vars[dst] = std::move(vars[src]).take(idx); 129| 10.4k| break; 130| 10.4k| } 131| 10.4k| case op_drop_move: { 132| 10.4k| auto idx = read(in, is_valid_size(vars[src])); 133| 10.4k| vars[dst] = std::move(vars[src]).drop(idx); 134| 10.4k| break; 135| 10.4k| } 136| 10.4k| case op_concat_move_l: { 137| 10.4k| auto src2 = read(in, is_valid_var_neq(src)); 138| 10.4k| if (can_concat(vars[src], vars[src2])) 139| 10.4k| vars[dst] = std::move(vars[src]) + vars[src2]; 140| 10.4k| break; 141| 10.4k| } 142| 10.4k| case op_concat_move_r: { 143| 10.4k| auto src2 = read(in, is_valid_var_neq(src)); 144| 10.4k| if (can_concat(vars[src], vars[src2])) 145| 10.4k| vars[dst] = vars[src] + std::move(vars[src2]); 146| 10.4k| break; 147| 10.4k| } 148| 10.4k| case op_concat_move_lr: { 149| 10.4k| auto src2 = read(in, is_valid_var_neq(src)); 150| 10.4k| if (can_concat(vars[src], vars[src2])) 151| 10.4k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 152| 10.4k| break; 153| 10.4k| } 154| 10.4k| case op_compare: { 155| 10.4k| using std::swap; 156| 10.4k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 157| 10.4k| swap(vars[src], vars[dst]); 158| 10.4k| break; 159| 10.4k| } 160| 10.4k| case op_erase: { 161| 10.4k| auto idx = read(in, is_valid_index(vars[src])); 162| 10.4k| vars[dst] = vars[src].erase(idx); 163| 10.4k| break; 164| 10.4k| } 165| 10.4k| case op_insert: { 166| 10.4k| auto idx = read(in, is_valid_size(vars[src])); 167| 10.4k| vars[dst] = vars[src].insert(idx, immer::box{42}); 168| 10.4k| break; 169| 10.4k| } 170| 10.4k| default: 171| 10.4k| break; 172| 10.4k| }; 173| 10.4k| return true; 174| 10.4k| }); 175| 10.4k|} flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 69| 2.22M| return fuzzer_input{data, size}.run([&](auto& in) { 70| 2.22M| enum ops 71| 2.22M| { 72| 2.22M| op_push_back, 73| 2.22M| op_update, 74| 2.22M| op_take, 75| 2.22M| op_drop, 76| 2.22M| op_concat, 77| 2.22M| op_push_back_move, 78| 2.22M| op_update_move, 79| 2.22M| op_take_move, 80| 2.22M| op_drop_move, 81| 2.22M| op_concat_move_l, 82| 2.22M| op_concat_move_r, 83| 2.22M| op_concat_move_lr, 84| 2.22M| op_insert, 85| 2.22M| op_erase, 86| 2.22M| op_compare, 87| 2.22M| }; 88| 2.22M| auto src = read(in, is_valid_var); 89| 2.22M| auto dst = read(in, is_valid_var); 90| 2.22M| switch (read(in)) { 91| 281k| case op_push_back: { ------------------ | Branch (91:9): [True: 281k, False: 1.94M] ------------------ 92| 281k| vars[dst] = vars[src].push_back(42); 93| 281k| break; 94| 0| } 95| 168k| case op_update: { ------------------ | Branch (95:9): [True: 168k, False: 2.05M] ------------------ 96| 168k| auto idx = read(in, is_valid_index(vars[src])); 97| 168k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 98| 168k| break; 99| 0| } 100| 1.81k| case op_take: { ------------------ | Branch (100:9): [True: 1.81k, False: 2.22M] ------------------ 101| 1.81k| auto idx = read(in, is_valid_size(vars[src])); 102| 1.81k| vars[dst] = vars[src].take(idx); 103| 1.81k| break; 104| 0| } 105| 7.93k| case op_drop: { ------------------ | Branch (105:9): [True: 7.93k, False: 2.21M] ------------------ 106| 7.93k| auto idx = read(in, is_valid_size(vars[src])); 107| 7.93k| vars[dst] = vars[src].drop(idx); 108| 7.93k| break; 109| 0| } 110| 821k| case op_concat: { ------------------ | Branch (110:9): [True: 821k, False: 1.40M] ------------------ 111| 821k| auto src2 = read(in, is_valid_var); 112| 821k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (112:17): [True: 798k, False: 23.7k] ------------------ 113| 798k| vars[dst] = vars[src] + vars[src2]; 114| 821k| break; 115| 0| } 116| 13.2k| case op_push_back_move: { ------------------ | Branch (116:9): [True: 13.2k, False: 2.21M] ------------------ 117| 13.2k| vars[dst] = std::move(vars[src]).push_back(21); 118| 13.2k| break; 119| 0| } 120| 14.7k| case op_update_move: { ------------------ | Branch (120:9): [True: 14.7k, False: 2.20M] ------------------ 121| 14.7k| auto idx = read(in, is_valid_index(vars[src])); 122| 14.7k| vars[dst] = 123| 14.7k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 124| 14.7k| break; 125| 0| } 126| 33.5k| case op_take_move: { ------------------ | Branch (126:9): [True: 33.5k, False: 2.19M] ------------------ 127| 33.5k| auto idx = read(in, is_valid_size(vars[src])); 128| 33.5k| vars[dst] = std::move(vars[src]).take(idx); 129| 33.5k| break; 130| 0| } 131| 71.9k| case op_drop_move: { ------------------ | Branch (131:9): [True: 71.9k, False: 2.15M] ------------------ 132| 71.9k| auto idx = read(in, is_valid_size(vars[src])); 133| 71.9k| vars[dst] = std::move(vars[src]).drop(idx); 134| 71.9k| break; 135| 0| } 136| 331k| case op_concat_move_l: { ------------------ | Branch (136:9): [True: 331k, False: 1.89M] ------------------ 137| 331k| auto src2 = read(in, is_valid_var_neq(src)); 138| 331k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (138:17): [True: 328k, False: 3.30k] ------------------ 139| 328k| vars[dst] = std::move(vars[src]) + vars[src2]; 140| 331k| break; 141| 0| } 142| 7.55k| case op_concat_move_r: { ------------------ | Branch (142:9): [True: 7.55k, False: 2.21M] ------------------ 143| 7.55k| auto src2 = read(in, is_valid_var_neq(src)); 144| 7.55k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (144:17): [True: 4.16k, False: 3.39k] ------------------ 145| 4.16k| vars[dst] = vars[src] + std::move(vars[src2]); 146| 7.55k| break; 147| 0| } 148| 371k| case op_concat_move_lr: { ------------------ | Branch (148:9): [True: 371k, False: 1.85M] ------------------ 149| 371k| auto src2 = read(in, is_valid_var_neq(src)); 150| 371k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (150:17): [True: 366k, False: 4.73k] ------------------ 151| 366k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 152| 371k| break; 153| 0| } 154| 38.4k| case op_compare: { ------------------ | Branch (154:9): [True: 38.4k, False: 2.18M] ------------------ 155| 38.4k| using std::swap; 156| 38.4k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (156:17): [True: 34.6k, False: 3.81k] | Branch (156:43): [True: 6.46k, False: 28.1k] ------------------ 157| 6.46k| swap(vars[src], vars[dst]); 158| 38.4k| break; 159| 0| } 160| 3.75k| case op_erase: { ------------------ | Branch (160:9): [True: 3.75k, False: 2.22M] ------------------ 161| 3.75k| auto idx = read(in, is_valid_index(vars[src])); 162| 3.75k| vars[dst] = vars[src].erase(idx); 163| 3.75k| break; 164| 0| } 165| 15.5k| case op_insert: { ------------------ | Branch (165:9): [True: 15.5k, False: 2.20M] ------------------ 166| 15.5k| auto idx = read(in, is_valid_size(vars[src])); 167| 15.5k| vars[dst] = vars[src].insert(idx, immer::box{42}); 168| 15.5k| break; 169| 0| } 170| 30.9k| default: ------------------ | Branch (170:9): [True: 30.9k, False: 2.19M] ------------------ 171| 30.9k| break; 172| 2.22M| }; 173| 2.21M| return true; 174| 2.22M| }); flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 33| 5.72M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (33:48): [True: 5.51M, False: 210k] | Branch (33:60): [True: 5.25M, False: 264k] ------------------ 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| 193k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (40:39): [True: 193k, False: 0] | Branch (40:51): [True: 186k, False: 6.88k] ------------------ flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaRT_: 39| 186k| auto is_valid_index = [](auto& v) { 40| 186k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 186k| }; flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 97| 168k| 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| 140k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (43:39): [True: 140k, False: 0] | Branch (43:51): [True: 130k, False: 9.82k] ------------------ flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaRT_: 42| 130k| auto is_valid_size = [](auto& v) { 43| 130k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 130k| }; 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.53M| auto can_concat = [](const auto& v1, const auto& v2) { 46| | // First, check max_size 47| 1.53M| if (v1.size() + v2.size() > vector_t::max_size()) { ------------------ | Branch (47:13): [True: 33.4k, False: 1.49M] ------------------ 48| 33.4k| return false; 49| 33.4k| } 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.49M| try { 55| | // Try to concat and catch an exception if it fails 56| 1.49M| const auto v3 = v1 + v2; 57| 1.49M| if (v3.size()) { ------------------ | Branch (57:17): [True: 1.49M, False: 2.71k] ------------------ 58| 1.49M| return true; 59| 1.49M| } 60| 1.49M| } catch (const immer::detail::rbts::invalid_tree&) { 61| 1.40k| return false; 62| 1.40k| } 63| 1.30k| return true; 64| 1.49M| }; flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 123| 14.7k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 35| 786k| return [=](auto idx) { 36| 786k| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (36:20): [True: 767k, False: 18.9k] | Branch (36:32): [True: 737k, False: 29.4k] | Branch (36:51): [True: 710k, False: 27.2k] ------------------ 37| 786k| }; flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 34| 710k| auto is_valid_var_neq = [](auto other) { 35| 710k| return [=](auto idx) { 36| 710k| return idx >= 0 && idx < var_count && idx != other; 37| 710k| }; 38| 710k| }; flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaOT_: 65| 38.4k| auto can_compare = [](auto&& v) { 66| | // avoid comparing vectors that are too big, and hence, slow to compare 67| 38.4k| return v.size() < (1 << 15); 68| 38.4k| }; flex-vector-st.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 10.4k| { 51| 10.4k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 3, False: 10.4k] ------------------ 52| 3| return 0; 53| 10.4k| try { 54| 2.22M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.21M, False: 10.4k] ------------------ 55| 2.21M| continue; 56| 10.4k| } catch (const no_more_input&) { 57| 10.4k| }; 58| 10.4k| return 0; 59| 10.4k| } flex-vector-st.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 5.26M|{ 71| 5.26M| auto x = read(fz); 72| 5.73M| while (!cond(x)) ------------------ | Branch (72:12): [True: 474k, False: 5.26M] ------------------ 73| 474k| x = read(fz); 74| 5.26M| return x; 75| 5.26M|} _Z4readIcERKT_R12fuzzer_input: 64| 8.73M|{ 65| 8.73M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 8.73M|} _ZN12fuzzer_input4nextEmm: 40| 9.07M| { 41| 9.07M| auto& p = const_cast(reinterpret_cast(data_)); 42| 9.07M| auto r = std::align(align, size, p, size_); 43| 9.07M| if (r == nullptr) ------------------ | Branch (43:13): [True: 10.4k, False: 9.06M] ------------------ 44| 10.4k| throw no_more_input{}; 45| 9.06M| return next(size); 46| 9.07M| } _ZN12fuzzer_input4nextEm: 30| 9.06M| { 31| 9.06M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 9.06M] ------------------ 32| 0| throw no_more_input{}; 33| 9.06M| auto r = data_; 34| 9.06M| data_ += size; 35| 9.06M| size_ -= size; 36| 9.06M| return r; 37| 9.06M| } 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| 186k|{ 71| 186k| auto x = read(fz); 72| 193k| while (!cond(x)) ------------------ | Branch (72:12): [True: 6.88k, False: 186k] ------------------ 73| 6.88k| x = read(fz); 74| 186k| return x; 75| 186k|} _Z4readIhERKT_R12fuzzer_input: 64| 334k|{ 65| 334k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 334k|} 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| 130k|{ 71| 130k| auto x = read(fz); 72| 140k| while (!cond(x)) ------------------ | Branch (72:12): [True: 9.82k, False: 130k] ------------------ 73| 9.82k| x = read(fz); 74| 130k| return x; 75| 130k|} flex-vector-st.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 710k|{ 71| 710k| auto x = read(fz); 72| 786k| while (!cond(x)) ------------------ | Branch (72:12): [True: 75.6k, False: 710k] ------------------ 73| 75.6k| x = read(fz); 74| 710k| return x; 75| 710k|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 15.4k| : impl_{detail::make(std::forward(arg))} 86| 15.4k| { 87| 15.4k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 15.4k| : value(std::forward(args)...) 48| 15.4k| { 49| 15.4k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 15.4k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 15.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| 15.4k| { 132| 15.4k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 15.4k, False: 0] | Branch (132:22): [True: 15.4k, False: 0] ------------------ 133| 15.4k| impl_->~holder(); 134| 15.4k| heap::deallocate(sizeof(holder), impl_); 135| 15.4k| } 136| 15.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| 734M| { 171| 734M| return x.get_(type_t{}); 172| 734M| } _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| 734M| { 185| 734M| return n.get_(t); 186| 734M| } _ZNK5immer6detail3csl6memberINS_22unsafe_refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 785M| 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| 51.6M| { 171| 51.6M| return x.get_(type_t{}); 172| 51.6M| } _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| 51.6M| { 185| 51.6M| return n.get_(t); 186| 51.6M| } _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| 51.1M| { 166| 51.1M| return x.get_(type_t{}); 167| 51.1M| } _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| 51.1M| { 180| 51.1M| return n.get_(t); 181| 51.1M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 111M| 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| 60.5M| { 166| 60.5M| return x.get_(type_t{}); 167| 60.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| 60.5M| { 180| 60.5M| return n.get_(t); 181| 60.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| 166k| { 171| 166k| return x.get_(type_t{}); 172| 166k| } _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| 166k| { 185| 166k| return n.get_(t); 186| 166k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 166k| 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| 11.2M| 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| 11.2M| { 23| 11.2M| return x.dereference(); 24| 11.2M| } _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| 11.2M| { 87| 11.2M| static_assert(std::is_base_of::value, 88| 11.2M| "must pass a derived thing"); 89| 11.2M| return *static_cast(this); 90| 11.2M| } _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| 227k| { 152| 227k| access_t::advance(derived(), n); 153| 227k| return derived(); 154| 227k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEElEEDcOT_T0_: 46| 227k| { 47| 227k| return x.advance(d); 48| 227k| } _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| 19.9M| { 93| 19.9M| static_assert(std::is_base_of::value, 94| 19.9M| "must pass a derived thing"); 95| 19.9M| return *static_cast(this); 96| 19.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| 9.75M| { 120| 9.75M| access_t::increment(derived()); 121| 9.75M| return derived(); 122| 9.75M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDcOT_: 28| 9.75M| { 29| 9.75M| return x.increment(); 30| 9.75M| } _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| 71.3k| { 165| 71.3k| auto tmp = derived(); 166| 71.3k| return tmp += n; 167| 71.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE17make_inner_n_intoEPvmj: 213| 5.63M| { 214| 5.63M| assert(n <= branches); ------------------ | Branch (214:9): [True: 5.63M, False: 0] ------------------ 215| 5.63M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 5.63M, False: 0] ------------------ 216| 5.63M| auto p = new (buffer) node_t; 217| 5.63M| p->impl.d.data.inner.relaxed = nullptr; 218| 5.63M|#if IMMER_TAGGED_NODE 219| 5.63M| p->impl.d.kind = node_t::kind_t::inner; 220| 5.63M|#endif 221| 5.63M| return p; 222| 5.63M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14sizeof_inner_nEj: 145| 22.6M| { 146| 22.6M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 22.6M, Folded] ------------------ 147| 22.6M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE3incEv: 956| 185M| { 957| 185M| refs(this).inc(); 958| 185M| return this; 959| 185M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4refsEPKSB_: 203| 734M| { 204| 734M| return auto_const_cast(get(x->impl)); 205| 734M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE16make_leaf_n_intoEPvmj: 330| 2.66M| { 331| 2.66M| assert(n <= branches); ------------------ | Branch (331:9): [True: 2.66M, False: 0] ------------------ 332| 2.66M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 2.66M, False: 0] ------------------ 333| 2.66M| auto p = new (buffer) node_t; 334| 2.66M|#if IMMER_TAGGED_NODE 335| 2.66M| p->impl.d.kind = node_t::kind_t::leaf; 336| 2.66M|#endif 337| 2.66M| return p; 338| 2.66M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13sizeof_leaf_nEj: 160| 11.0M| { 161| 11.0M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 11.0M, Folded] ------------------ 162| 11.0M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7relaxedEv: 172| 1.01G| { 173| 1.01G| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 1.01G|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 1.01G, False: 0] ------------------ 174| 1.01G| return impl.d.data.inner.relaxed; 175| 1.01G| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4kindEv: 168| 1.59G| 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| 395M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5innerEv: 184| 461M| { 185| 461M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 461M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 461M, False: 0] ------------------ 186| 461M| return impl.d.data.inner.get_storage_ptr(); 187| 461M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14delete_inner_rEPSB_j: 832| 51.1M| { 833| 51.1M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 51.1M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 51.1M, False: 0] ------------------ 834| 51.1M| auto r = p->relaxed(); 835| 51.1M| assert(r); ------------------ | Branch (835:9): [True: 51.1M, False: 0] ------------------ 836| 51.1M| static_if([&](auto) { 837| 51.1M| if (node_t::refs(r).dec()) 838| 51.1M| heap::deallocate(node_t::ownee(r).owned() 839| 51.1M| ? node_t::max_sizeof_relaxed 840| 51.1M| : node_t::sizeof_relaxed_n(n), 841| 51.1M| r); 842| 51.1M| }); 843| 51.1M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 51.1M] ------------------ 844| 51.1M| : node_t::sizeof_inner_r_n(n), 845| 51.1M| p); 846| 51.1M| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14delete_inner_rEPSB_jENKUlT_E_clINS0_7empty_tEEEDaSD_: 836| 51.1M| static_if([&](auto) { 837| 51.1M| if (node_t::refs(r).dec()) ------------------ | Branch (837:17): [True: 50.9M, False: 134k] ------------------ 838| 50.9M| heap::deallocate(node_t::ownee(r).owned() ------------------ | Branch (838:34): [True: 0, False: 50.9M] ------------------ 839| 50.9M| ? node_t::max_sizeof_relaxed 840| 50.9M| : node_t::sizeof_relaxed_n(n), 841| 50.9M| r); 842| 51.1M| }); _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| 51.6M| { 197| 51.6M| return auto_const_cast(get(*x)); 198| 51.6M| } _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| 51.1M| 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| 101M| { 156| 101M| return keep_headroom ? max_sizeof_relaxed : sizeof_packed_relaxed_n(n); ------------------ | Branch (156:16): [True: 101M, Folded] ------------------ 157| 101M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5owneeEPSB_: 210| 60.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| 102M| { 151| 102M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 102M, Folded] ------------------ 152| 102M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11delete_leafEPSB_j: 861| 3.04M| { 862| 3.04M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 68| 3.04M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (862:9): [True: 3.04M, False: 0] ------------------ 863| 3.04M| detail::destroy_n(p->leaf(), n); 864| 3.04M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (864:26): [True: 0, False: 3.04M] ------------------ 865| 3.04M| : node_t::sizeof_leaf_n(n), 866| 3.04M| p); 867| 3.04M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4leafEv: 190| 19.7M| { 191| 19.7M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 19.7M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 19.7M, False: 0] ------------------ 192| 19.7M| return impl.d.data.leaf.get_storage_ptr(); 193| 19.7M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12delete_innerEPSB_j: 808| 5.70M| { 809| 5.70M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 5.70M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 5.70M, False: 0] ------------------ 810| 5.70M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 5.70M, False: 0] ------------------ 811| 5.70M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 5.70M] ------------------ 812| 5.70M| : node_t::sizeof_inner_n(n), 813| 5.70M| p); 814| 5.70M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 236k| { 795| 236k| auto dst = copy_leaf_n(n + 1, src, n); 796| 236k| IMMER_TRY { ------------------ | | 49| 236k|#define IMMER_TRY try ------------------ 797| 236k| new (dst->leaf() + n) T(std::forward(x)); 798| 236k| } 799| 236k| IMMER_CATCH (...) { 800| 0| detail::destroy_n(dst->leaf(), n); 801| 0| heap::deallocate(node_t::sizeof_leaf_n(n + 1), dst); 802| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 803| 0| } 804| 236k| return dst; 805| 236k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_nEjPSB_j: 696| 236k| { 697| 236k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 236k, False: 0] ------------------ 698| 236k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 236k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 236k, False: 0] ------------------ 699| 236k| auto dst = make_leaf_n(allocn); 700| 236k| IMMER_TRY { ------------------ | | 49| 236k|#define IMMER_TRY try ------------------ 701| 236k| detail::uninitialized_copy( 702| 236k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 236k| } 704| 236k| IMMER_CATCH (...) { 705| 0| heap::deallocate(node_t::sizeof_leaf_n(allocn), dst); 706| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 707| 0| } 708| 236k| return dst; 709| 236k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_nEj: 341| 2.66M| { 342| 2.66M| assert(n <= branches); ------------------ | Branch (342:9): [True: 2.66M, False: 0] ------------------ 343| 2.66M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 2.66M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 2.66M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_nIiEEPSB_jOT_: 470| 44.2k| { 471| 44.2k| assert(n >= 1); ------------------ | Branch (471:9): [True: 44.2k, False: 0] ------------------ 472| 44.2k| auto p = make_leaf_n(n); 473| 44.2k| IMMER_TRY { ------------------ | | 49| 44.2k|#define IMMER_TRY try ------------------ 474| 44.2k| new (p->leaf()) T(std::forward(x)); 475| 44.2k| } 476| 44.2k| 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.2k| return p; 481| 44.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13do_copy_innerEPSB_SC_j: 558| 5.41M| { 559| 5.41M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 5.41M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 5.41M, False: 0] ------------------ 560| 5.41M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 5.41M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 5.41M, False: 0] ------------------ 561| 5.41M| auto p = src->inner(); 562| 5.41M| inc_nodes(p, n); 563| 5.41M| std::copy(p, p + n, dst->inner()); 564| 5.41M| return dst; 565| 5.41M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9inc_nodesEPPSB_j: 970| 43.2M| { 971| 193M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 150M, False: 43.2M] ------------------ 972| 150M| refs(*i).inc(); 973| 43.2M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14copy_inner_r_nEjPSB_j: 588| 523k| { 589| 523k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 523k, False: 0] ------------------ 590| 523k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 523k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 523k, False: 0] ------------------ 591| 523k| auto dst = make_inner_r_n(allocn); 592| 523k| return do_copy_inner_r(dst, src, n); 593| 523k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE15do_copy_inner_rEPSB_SC_j: 610| 542k| { 611| 542k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 542k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 542k, False: 0] ------------------ 612| 542k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 542k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 542k, False: 0] ------------------ 613| 542k| auto src_r = src->relaxed(); 614| 542k| auto dst_r = dst->relaxed(); 615| 542k| inc_nodes(src->inner(), n); 616| 542k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 542k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 542k| dst_r->d.count = n; 619| 542k| return dst; 620| 542k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14make_inner_r_nEj: 243| 50.7M| { 244| 50.7M| assert(n <= branches); ------------------ | Branch (244:9): [True: 50.7M, False: 0] ------------------ 245| 50.7M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 50.7M| auto mr = static_cast(nullptr); 247| 50.7M| if (embed_relaxed) { ------------------ | Branch (247:13): [Folded, False: 50.7M] ------------------ 248| 0| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 50.7M| } else { 250| 50.7M| IMMER_TRY { ------------------ | | 49| 50.7M|#define IMMER_TRY try ------------------ 251| 50.7M| mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{}); 252| 50.7M| } 253| 50.7M| 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| 50.7M| } 258| 50.7M| auto p = new (mp) node_t; 259| 50.7M| auto r = new (mr) relaxed_t; 260| 50.7M| r->d.count = 0; 261| 50.7M| p->impl.d.data.inner.relaxed = r; 262| 50.7M|#if IMMER_TAGGED_NODE 263| 50.7M| p->impl.d.kind = node_t::kind_t::inner; 264| 50.7M|#endif 265| 50.7M| return p; 266| 50.7M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9make_pathEjPSB_: 498| 1.37M| { 499| 1.37M| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 1.37M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 1.37M, False: 0] ------------------ 500| 1.37M| if (shift == endshift) ------------------ | Branch (500:13): [True: 1.17M, False: 197k] ------------------ 501| 1.17M| return node; 502| 197k| else { 503| 197k| auto n = node_t::make_inner_n(1); 504| 197k| IMMER_TRY { ------------------ | | 49| 197k|#define IMMER_TRY try ------------------ 505| 197k| n->inner()[0] = make_path(shift - B, node); 506| 197k| } 507| 197k| 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| 197k| return n; 512| 197k| } 513| 1.37M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12make_inner_nEj: 224| 5.63M| { 225| 5.63M| assert(n <= branches); ------------------ | Branch (225:9): [True: 5.63M, False: 0] ------------------ 226| 5.63M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 5.63M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 5.63M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9copy_leafEPSB_j: 666| 179k| { 667| 179k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 179k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 179k, False: 0] ------------------ 668| 179k| auto dst = make_leaf_n(n); 669| 179k| IMMER_TRY { ------------------ | | 49| 179k|#define IMMER_TRY try ------------------ 670| 179k| detail::uninitialized_copy( 671| 179k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 179k| } 673| 179k| 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| 179k| return dst; 678| 179k| } _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| 137k| { 270| 137k| return static_if( 271| 137k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 137k| [&](auto) { 273| 137k| auto p = 274| 137k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 137k| assert(r->d.count >= n); 276| 137k| node_t::refs(r).inc(); 277| 137k| p->impl.d.data.inner.relaxed = r; 278| 137k|#if IMMER_TAGGED_NODE 279| 137k| p->impl.d.kind = node_t::kind_t::inner; 280| 137k|#endif 281| 137k| return p; 282| 137k| }); 283| 137k| } _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| 137k| [&](auto) { 273| 137k| auto p = 274| 137k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 137k| assert(r->d.count >= n); ------------------ | Branch (275:17): [True: 137k, False: 0] ------------------ 276| 137k| node_t::refs(r).inc(); 277| 137k| p->impl.d.data.inner.relaxed = r; 278| 137k|#if IMMER_TAGGED_NODE 279| 137k| p->impl.d.kind = node_t::kind_t::inner; 280| 137k|#endif 281| 137k| return p; 282| 137k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE24do_copy_inner_replace_srEPSB_SC_jjSC_: 652| 137k| { 653| 137k| if (embed_relaxed) ------------------ | Branch (653:13): [Folded, False: 137k] ------------------ 654| 0| return do_copy_inner_replace_r(dst, src, n, offset, child); 655| 137k| else { 656| 137k| auto p = src->inner(); 657| 137k| inc_nodes(p, offset); 658| 137k| inc_nodes(p + offset + 1, n - offset - 1); 659| 137k| std::copy(p, p + n, dst->inner()); 660| 137k| dst->inner()[offset] = child; 661| 137k| return dst; 662| 137k| } 663| 137k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 43.0k| { 570| 43.0k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 43.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 43.0k, False: 0] ------------------ 571| 43.0k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 43.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 43.0k, False: 0] ------------------ 572| 43.0k| auto p = src->inner(); 573| 43.0k| inc_nodes(p, offset); 574| 43.0k| inc_nodes(p + offset + 1, n - offset - 1); 575| 43.0k| std::copy(p, p + n, dst->inner()); 576| 43.0k| dst->inner()[offset] = child; 577| 43.0k| return dst; 578| 43.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12copy_inner_nEjPSB_j: 543| 8.94k| { 544| 8.94k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 8.94k, False: 0] ------------------ 545| 8.94k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 8.94k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 8.94k, False: 0] ------------------ 546| 8.94k| auto dst = make_inner_n(allocn); 547| 8.94k| return do_copy_inner(dst, src, n); 548| 8.94k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12copy_inner_rEPSB_j: 581| 2.85k| { 582| 2.85k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 2.85k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 2.85k, False: 0] ------------------ 583| 2.85k| auto dst = make_inner_r_n(n); 584| 2.85k| return do_copy_inner_r(dst, src, n); 585| 2.85k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13compute_shiftEv: 977| 15.2M| { 978| 15.2M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 1.12M, False: 14.1M] ------------------ 979| 1.12M| return endshift; 980| 14.1M| else 981| 14.1M| return B + inner()[0]->compute_shift(); 982| 15.2M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5checkEjm: 986| 1.12M| { 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.12M| return true; 1023| 1.12M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9copy_leafEPSB_jj: 778| 984k| { 779| 984k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 984k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 984k, False: 0] ------------------ 780| 984k| auto dst = make_leaf_n(last - idx); 781| 984k| IMMER_TRY { ------------------ | | 49| 984k|#define IMMER_TRY try ------------------ 782| 984k| detail::uninitialized_copy( 783| 984k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 984k| } 785| 984k| 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| 984k| return dst; 790| 984k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9copy_leafEPSB_jSC_j: 712| 1.00M| { 713| 1.00M| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 1.00M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 1.00M, False: 0] ------------------ 714| 1.00M| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 1.00M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 1.00M, False: 0] ------------------ 715| 1.00M| auto dst = make_leaf_n(n1 + n2); 716| 1.00M| IMMER_TRY { ------------------ | | 49| 1.00M|#define IMMER_TRY try ------------------ 717| 1.00M| detail::uninitialized_copy( 718| 1.00M| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 1.00M| } 720| 1.00M| 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| 1.00M| IMMER_TRY { ------------------ | | 49| 1.00M|#define IMMER_TRY try ------------------ 725| 1.00M| detail::uninitialized_copy( 726| 1.00M| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 1.00M| } 728| 1.00M| 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| 1.00M| return dst; 734| 1.00M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 2.59M| { 871| 2.59M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 2.43M, False: 166k] | Branch (871:39): [True: 0, False: 166k] ------------------ 872| 2.59M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5owneeEPKSB_: 207| 166k| { 208| 166k| return get(x->impl); 209| 166k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 40.3k| { 682| 40.3k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 40.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 40.3k, False: 0] ------------------ 683| 40.3k| auto dst = make_leaf_e(e); 684| 40.3k| IMMER_TRY { ------------------ | | 49| 40.3k|#define IMMER_TRY try ------------------ 685| 40.3k| detail::uninitialized_copy( 686| 40.3k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 40.3k| } 688| 40.3k| 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| 40.3k| return dst; 693| 40.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 380k| { 349| 380k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 380k| ownee(p) = e; 351| 380k|#if IMMER_TAGGED_NODE 352| 380k| p->impl.d.kind = node_t::kind_t::leaf; 353| 380k|#endif 354| 380k| return p; 355| 380k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 6.78k| { 486| 6.78k| auto p = make_leaf_e(e); 487| 6.78k| IMMER_TRY { ------------------ | | 49| 6.78k|#define IMMER_TRY try ------------------ 488| 6.78k| new (p->leaf()) T(std::forward(x)); 489| 6.78k| } 490| 6.78k| IMMER_CATCH (...) { 491| 0| heap::deallocate(node_t::max_sizeof_leaf, p); 492| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 493| 0| } 494| 6.78k| return p; 495| 6.78k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 192k| { 931| 192k| auto src_r = relaxed(); 932| 192k| return static_if( 933| 192k| [&](auto) { return src_r; }, 934| 192k| [&](auto) { 935| 192k| if (node_t::refs(src_r).unique() || 936| 192k| node_t::ownee(src_r).can_mutate(e)) 937| 192k| return src_r; 938| 192k| else { 939| 192k| auto dst_r = 940| 192k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 192k| if (src_r) { 942| 192k| std::copy( 943| 192k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 192k| if (node_t::refs(src_r).dec()) 945| 192k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 192k| src_r); 947| 192k| } 948| 192k| dst_r->d.count = n; 949| 192k| node_t::ownee(dst_r) = e; 950| 192k| return impl.d.data.inner.relaxed = dst_r; 951| 192k| } 952| 192k| }); 953| 192k| } _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| 192k| [&](auto) { 935| 192k| if (node_t::refs(src_r).unique() || ------------------ | Branch (935:21): [True: 188k, False: 4.89k] ------------------ 936| 4.89k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (936:21): [True: 0, False: 4.89k] ------------------ 937| 188k| return src_r; 938| 4.89k| else { 939| 4.89k| auto dst_r = 940| 4.89k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 4.89k| if (src_r) { ------------------ | Branch (941:25): [True: 4.89k, False: 0] ------------------ 942| 4.89k| std::copy( 943| 4.89k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 4.89k| if (node_t::refs(src_r).dec()) ------------------ | Branch (944:29): [True: 0, False: 4.89k] ------------------ 945| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 0| src_r); 947| 4.89k| } 948| 4.89k| dst_r->d.count = n; 949| 4.89k| node_t::ownee(dst_r) = e; 950| 4.89k| return impl.d.data.inner.relaxed = dst_r; 951| 4.89k| } 952| 192k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14copy_inner_r_eENS9_5applyIS6_E4type4editEPSB_j: 596| 15.7k| { 597| 15.7k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 15.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (597:9): [True: 15.7k, False: 0] ------------------ 598| 15.7k| auto dst = make_inner_r_e(e); 599| 15.7k| return do_copy_inner_r(dst, src, n); 600| 15.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 286| 171k| { 287| 171k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 171k| auto mr = static_cast(nullptr); 289| 171k| if (embed_relaxed) { ------------------ | Branch (289:13): [Folded, False: 171k] ------------------ 290| 0| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 171k| } else { 292| 171k| IMMER_TRY { ------------------ | | 49| 171k|#define IMMER_TRY try ------------------ 293| 171k| mr = heap::allocate(max_sizeof_relaxed, norefs_tag{}); 294| 171k| } 295| 171k| IMMER_CATCH (...) { 296| 0| heap::deallocate(max_sizeof_inner_r, mp); 297| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 298| 0| } 299| 171k| } 300| 171k| auto p = new (mp) node_t; 301| 171k| auto r = new (mr) relaxed_t; 302| 171k| ownee(p) = e; 303| 171k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 171k| r->d.count = 0; 305| 171k| p->impl.d.data.inner.relaxed = r; 306| 171k|#if IMMER_TAGGED_NODE 307| 171k| p->impl.d.kind = node_t::kind_t::inner; 308| 171k|#endif 309| 171k| return p; 310| 171k| } _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| 171k| 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| 367k| { 517| 367k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 367k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 367k, False: 0] ------------------ 518| 367k| if (shift == endshift) ------------------ | Branch (518:13): [True: 317k, False: 50.0k] ------------------ 519| 317k| return node; 520| 50.0k| else { 521| 50.0k| auto n = node_t::make_inner_e(e); 522| 50.0k| IMMER_TRY { ------------------ | | 49| 50.0k|#define IMMER_TRY try ------------------ 523| 50.0k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 50.0k| } 525| 50.0k| 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| 50.0k| return n; 530| 50.0k| } 531| 367k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 79.6k| { 232| 79.6k| auto m = heap::allocate(max_sizeof_inner); 233| 79.6k| auto p = new (m) node_t; 234| 79.6k| ownee(p) = e; 235| 79.6k| p->impl.d.data.inner.relaxed = nullptr; 236| 79.6k|#if IMMER_TAGGED_NODE 237| 79.6k| p->impl.d.kind = node_t::kind_t::inner; 238| 79.6k|#endif 239| 79.6k| return p; 240| 79.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 20.5k| { 552| 20.5k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 20.5k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 20.5k, False: 0] ------------------ 553| 20.5k| auto dst = make_inner_e(e); 554| 20.5k| return do_copy_inner(dst, src, n); 555| 20.5k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 19.2k| { 604| 19.2k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 19.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 19.2k, False: 0] ------------------ 605| 19.2k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 19.2k| return do_copy_inner_sr(dst, src, n); 607| 19.2k| } _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| 19.2k| { 314| 19.2k| return static_if( 315| 19.2k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 19.2k| [&](auto) { 317| 19.2k| auto p = 318| 19.2k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 19.2k| node_t::refs(r).inc(); 320| 19.2k| p->impl.d.data.inner.relaxed = r; 321| 19.2k| node_t::ownee(p) = e; 322| 19.2k|#if IMMER_TAGGED_NODE 323| 19.2k| p->impl.d.kind = node_t::kind_t::inner; 324| 19.2k|#endif 325| 19.2k| return p; 326| 19.2k| }); 327| 19.2k| } _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| 19.2k| [&](auto) { 317| 19.2k| auto p = 318| 19.2k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 19.2k| node_t::refs(r).inc(); 320| 19.2k| p->impl.d.data.inner.relaxed = r; 321| 19.2k| node_t::ownee(p) = e; 322| 19.2k|#if IMMER_TAGGED_NODE 323| 19.2k| p->impl.d.kind = node_t::kind_t::inner; 324| 19.2k|#endif 325| 19.2k| return p; 326| 19.2k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE16do_copy_inner_srEPSB_SC_j: 640| 19.2k| { 641| 19.2k| if (embed_relaxed) ------------------ | Branch (641:13): [Folded, False: 19.2k] ------------------ 642| 0| return do_copy_inner_r(dst, src, n); 643| 19.2k| else { 644| 19.2k| inc_nodes(src->inner(), n); 645| 19.2k| std::copy(src->inner(), src->inner() + n, dst->inner()); 646| 19.2k| return dst; 647| 19.2k| } 648| 19.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 333k| { 764| 333k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 333k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 333k, False: 0] ------------------ 765| 333k| auto dst = make_leaf_e(e); 766| 333k| IMMER_TRY { ------------------ | | 49| 333k|#define IMMER_TRY try ------------------ 767| 333k| detail::uninitialized_copy( 768| 333k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 333k| } 770| 333k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 333k| return dst; 775| 333k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 176k| { 878| 176k| auto src_r = relaxed(); 879| 176k| return static_if( 880| 176k| [&](auto) { return src_r; }, 881| 176k| [&](auto) { 882| 176k| if (node_t::refs(src_r).unique() || 883| 176k| node_t::ownee(src_r).can_mutate(e)) 884| 176k| return src_r; 885| 176k| else { 886| 176k| auto dst_r = impl.d.data.inner.relaxed = 887| 176k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 176k| if (src_r) { 889| 176k| auto n = dst_r->d.count = src_r->d.count; 890| 176k| std::copy( 891| 176k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 176k| if (node_t::refs(src_r).dec()) 893| 176k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 176k| src_r); 895| 176k| } 896| 176k| node_t::ownee(dst_r) = e; 897| 176k| return dst_r; 898| 176k| } 899| 176k| }); 900| 176k| } _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| 176k| [&](auto) { 882| 176k| if (node_t::refs(src_r).unique() || ------------------ | Branch (882:21): [True: 159k, False: 17.6k] ------------------ 883| 17.6k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (883:21): [True: 0, False: 17.6k] ------------------ 884| 159k| return src_r; 885| 17.6k| else { 886| 17.6k| auto dst_r = impl.d.data.inner.relaxed = 887| 17.6k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 17.6k| if (src_r) { ------------------ | Branch (888:25): [True: 17.6k, False: 0] ------------------ 889| 17.6k| auto n = dst_r->d.count = src_r->d.count; 890| 17.6k| std::copy( 891| 17.6k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 17.6k| if (node_t::refs(src_r).dec()) ------------------ | Branch (892:29): [True: 0, False: 17.6k] ------------------ 893| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 0| src_r); 895| 17.6k| } 896| 17.6k| node_t::ownee(dst_r) = e; 897| 17.6k| return dst_r; 898| 17.6k| } 899| 176k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j: 738| 242| { 739| 242| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 242|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 242, False: 0] ------------------ 740| 242| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 242|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 242, False: 0] ------------------ 741| 242| auto dst = make_leaf_e(e); 742| 242| IMMER_TRY { ------------------ | | 49| 242|#define IMMER_TRY try ------------------ 743| 242| detail::uninitialized_copy( 744| 242| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 242| } 746| 242| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 242| IMMER_TRY { ------------------ | | 49| 242|#define IMMER_TRY try ------------------ 751| 242| detail::uninitialized_copy( 752| 242| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 242| } 754| 242| 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| 242| return dst; 760| 242| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 523| 259M| { 524| 259M| using node_t = node_type; 525| 259M| auto node = p.node(); 526| 259M| if (node->dec()) { ------------------ | Branch (526:13): [True: 51.0M, False: 208M] ------------------ 527| 51.0M| p.each(this_t{}); 528| 51.0M| node_t::delete_inner_r(node, p.count()); 529| 51.0M| } 530| 259M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 17.0M| { 535| 17.0M| using node_t = node_type; 536| 17.0M| auto node = p.node(); 537| 17.0M| if (node->dec()) { ------------------ | Branch (537:13): [True: 1.20M, False: 15.8M] ------------------ 538| 1.20M| p.each(this_t{}); 539| 1.20M| node_t::delete_inner(node, p.count()); 540| 1.20M| } 541| 17.0M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 4.45M| { 546| 4.45M| using node_t = node_type; 547| 4.45M| auto node = p.node(); 548| 4.45M| if (node->dec()) { ------------------ | Branch (548:13): [True: 629k, False: 3.82M] ------------------ 549| 629k| node_t::delete_leaf(node, p.count()); 550| 629k| } 551| 4.45M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.15M| { 546| 1.15M| using node_t = node_type; 547| 1.15M| auto node = p.node(); 548| 1.15M| if (node->dec()) { ------------------ | Branch (548:13): [True: 639k, False: 518k] ------------------ 549| 639k| node_t::delete_leaf(node, p.count()); 550| 639k| } 551| 1.15M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 10.0M| { 535| 10.0M| using node_t = node_type; 536| 10.0M| auto node = p.node(); 537| 10.0M| if (node->dec()) { ------------------ | Branch (537:13): [True: 106k, False: 9.93M] ------------------ 538| 106k| p.each(this_t{}); 539| 106k| node_t::delete_inner(node, p.count()); 540| 106k| } 541| 10.0M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 4.44M| { 535| 4.44M| using node_t = node_type; 536| 4.44M| auto node = p.node(); 537| 4.44M| if (node->dec()) { ------------------ | Branch (537:13): [True: 4.38M, False: 60.6k] ------------------ 538| 4.38M| p.each(this_t{}); 539| 4.38M| node_t::delete_inner(node, p.count()); 540| 4.38M| } 541| 4.44M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 3.08M| { 535| 3.08M| using node_t = node_type; 536| 3.08M| auto node = p.node(); 537| 3.08M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 3.08M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 3.08M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 92.9M| { 546| 92.9M| using node_t = node_type; 547| 92.9M| auto node = p.node(); 548| 92.9M| if (node->dec()) { ------------------ | Branch (548:13): [True: 1.77M, False: 91.2M] ------------------ 549| 1.77M| node_t::delete_leaf(node, p.count()); 550| 1.77M| } 551| 92.9M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 2.91M| { 546| 2.91M| using node_t = node_type; 547| 2.91M| auto node = p.node(); 548| 2.91M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 2.91M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 2.91M| } _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| 526k| { 792| 526k| auto level = pos.shift(); 793| 526k| auto idx = pos.count() - 1; 794| 526k| auto children = pos.size(idx); 795| 526k| auto new_idx = 796| 526k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 15.3k, False: 511k] | Branch (796:47): [True: 786, False: 510k] ------------------ 797| 526k| auto new_child = static_cast(nullptr); 798| 526k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 4.58k, False: 522k] ------------------ 799| 4.58k| return nullptr; 800| 522k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 510k, False: 11.5k] ------------------ 801| 510k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 510k| if (!new_child) { ------------------ | Branch (802:17): [True: 4.99k, False: 505k] ------------------ 803| 4.99k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 1.88k, False: 3.10k] ------------------ 804| 1.88k| new_child = node_t::make_path(level - B, tail); 805| 3.10k| else 806| 3.10k| return nullptr; 807| 4.99k| } 808| 510k| } else 809| 11.5k| new_child = node_t::make_path(level - B, tail); 810| 519k| IMMER_TRY { ------------------ | | 49| 519k|#define IMMER_TRY try ------------------ 811| 519k| auto count = new_idx + 1; 812| 519k| auto new_parent = 813| 519k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 519k| auto new_relaxed = new_parent->relaxed(); 815| 519k| new_parent->inner()[new_idx] = new_child; 816| 519k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 519k| new_relaxed->d.count = count; 818| 519k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 519k, False: 0] ------------------ 819| 519k| return new_parent; 820| 519k| } 821| 519k| 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| 519k| } _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| 330k| { 835| 330k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 330k, False: 0] ------------------ 836| 330k| auto idx = pos.index(pos.size() - 1); 837| 330k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 330k| auto count = new_idx + 1; 839| 330k| auto new_parent = node_t::make_inner_n(count); 840| 330k| IMMER_TRY { ------------------ | | 49| 330k|#define IMMER_TRY try ------------------ 841| 330k| new_parent->inner()[new_idx] = 842| 330k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 319k, False: 10.9k] ------------------ 843| | /* otherwise */ 844| 330k| : node_t::make_path(pos.shift() - B, tail); 845| 330k| } 846| 330k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 330k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 330k| } _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| 4.24M| { 835| 4.24M| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 4.24M, False: 0] ------------------ 836| 4.24M| auto idx = pos.index(pos.size() - 1); 837| 4.24M| auto new_idx = pos.index(pos.size() + branches - 1); 838| 4.24M| auto count = new_idx + 1; 839| 4.24M| auto new_parent = node_t::make_inner_n(count); 840| 4.24M| IMMER_TRY { ------------------ | | 49| 4.24M|#define IMMER_TRY try ------------------ 841| 4.24M| new_parent->inner()[new_idx] = 842| 4.24M| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 3.17M, False: 1.07M] ------------------ 843| | /* otherwise */ 844| 4.24M| : node_t::make_path(pos.shift() - B, tail); 845| 4.24M| } 846| 4.24M| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 4.24M| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 4.24M| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEvPT_jm: 562| 561|{ 563| 561| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 561|} _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| 796k| { 835| 796k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 796k, False: 0] ------------------ 836| 796k| auto idx = pos.index(pos.size() - 1); 837| 796k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 796k| auto count = new_idx + 1; 839| 796k| auto new_parent = node_t::make_inner_n(count); 840| 796k| IMMER_TRY { ------------------ | | 49| 796k|#define IMMER_TRY try ------------------ 841| 796k| new_parent->inner()[new_idx] = 842| 796k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 751k, False: 45.0k] ------------------ 843| | /* otherwise */ 844| 796k| : node_t::make_path(pos.shift() - B, tail); 845| 796k| } 846| 796k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 796k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 796k| } 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| 141k| { 503| 141k| auto offset = pos.index(idx); 504| 141k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 141k| IMMER_TRY { ------------------ | | 49| 141k|#define IMMER_TRY try ------------------ 506| 141k| node->leaf()[offset] = 507| 141k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 141k| return node; 509| 141k| } 510| 141k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 141k| } 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| 137k| { 467| 137k| auto offset = pos.index(idx); 468| 137k| auto count = pos.count(); 469| 137k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 137k| IMMER_TRY { ------------------ | | 49| 137k|#define IMMER_TRY try ------------------ 471| 137k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 137k| node_t::do_copy_inner_replace_sr( 473| 137k| node, pos.node(), count, offset, child); 474| 137k| return node; 475| 137k| } 476| 137k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 137k| } 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| 26.5k| { 485| 26.5k| auto offset = pos.index(idx); 486| 26.5k| auto count = pos.count(); 487| 26.5k| auto node = node_t::make_inner_n(count); 488| 26.5k| IMMER_TRY { ------------------ | | 49| 26.5k|#define IMMER_TRY try ------------------ 489| 26.5k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 26.5k| node_t::do_copy_inner_replace( 491| 26.5k| node, pos.node(), count, offset, child); 492| 26.5k| return node; 493| 26.5k| } 494| 26.5k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 26.5k| } 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| 14.4k| { 503| 14.4k| auto offset = pos.index(idx); 504| 14.4k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 14.4k| IMMER_TRY { ------------------ | | 49| 14.4k|#define IMMER_TRY try ------------------ 506| 14.4k| node->leaf()[offset] = 507| 14.4k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 14.4k| return node; 509| 14.4k| } 510| 14.4k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 14.4k| } 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.1k| { 485| 14.1k| auto offset = pos.index(idx); 486| 14.1k| auto count = pos.count(); 487| 14.1k| auto node = node_t::make_inner_n(count); 488| 14.1k| IMMER_TRY { ------------------ | | 49| 14.1k|#define IMMER_TRY try ------------------ 489| 14.1k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 14.1k| node_t::do_copy_inner_replace( 491| 14.1k| node, pos.node(), count, offset, child); 492| 14.1k| return node; 493| 14.1k| } 494| 14.1k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 14.1k| } 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| 12.1k| { 503| 12.1k| auto offset = pos.index(idx); 504| 12.1k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 12.1k| IMMER_TRY { ------------------ | | 49| 12.1k|#define IMMER_TRY try ------------------ 506| 12.1k| node->leaf()[offset] = 507| 12.1k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 12.1k| return node; 509| 12.1k| } 510| 12.1k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 12.1k| } 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.29k| { 485| 2.29k| auto offset = pos.index(idx); 486| 2.29k| auto count = pos.count(); 487| 2.29k| auto node = node_t::make_inner_n(count); 488| 2.29k| IMMER_TRY { ------------------ | | 49| 2.29k|#define IMMER_TRY try ------------------ 489| 2.29k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 2.29k| node_t::do_copy_inner_replace( 491| 2.29k| node, pos.node(), count, offset, child); 492| 2.29k| return node; 493| 2.29k| } 494| 2.29k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 2.29k| } _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.8k| { 1097| 29.8k| auto idx = pos.index(last); 1098| 29.8k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 29.8k, Folded] | Branch (1098:25): [True: 23.8k, False: 6.00k] ------------------ 1099| 23.8k| return pos.towards_oh(this_t{}, last, idx); 1100| 23.8k| } else { 1101| 6.00k| using std::get; 1102| 6.00k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 6.00k| auto next = get<1>(subs); 1104| 6.00k| auto ts = get<2>(subs); 1105| 6.00k| auto tail = get<3>(subs); 1106| 6.00k| IMMER_TRY { ------------------ | | 49| 6.00k|#define IMMER_TRY try ------------------ 1107| 6.00k| if (next) { ------------------ | Branch (1107:21): [True: 3.91k, False: 2.08k] ------------------ 1108| 3.91k| auto count = idx + 1; 1109| 3.91k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 3.91k| auto newr = newn->relaxed(); 1111| 3.91k| newn->inner()[idx] = next; 1112| 3.91k| newr->d.sizes[idx] = last + 1 - ts; 1113| 3.91k| newr->d.count = count; 1114| 3.91k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 3.91k, False: 0] ------------------ 1115| 3.91k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 3.91k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 2.08k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 2.08k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 2.08k, Folded] | Branch (1118:40): [True: 1.33k, False: 757] | Branch (1118:52): [True: 1.03k, False: 294] ------------------ 1119| 1.03k| auto newn = pos.node()->inner()[0]; 1120| 1.03k| return std::make_tuple( 1121| 1.03k| pos.shift() - B, newn->inc(), ts, tail); 1122| 1.05k| } else { 1123| 1.05k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.05k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.05k| } 1126| 6.00k| } 1127| 6.00k| 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.00k| } 1138| 29.8k| } _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| 2.02k| { 1182| 2.02k| auto old_tail_size = pos.count(); 1183| 2.02k| auto new_tail_size = pos.index(last) + 1; 1184| 2.02k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 352, False: 1.67k] ------------------ 1185| 2.02k| ? pos.node()->inc() 1186| 2.02k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.02k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.02k| } _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| 3.37k| { 1182| 3.37k| auto old_tail_size = pos.count(); 1183| 3.37k| auto new_tail_size = pos.index(last) + 1; 1184| 3.37k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.17k, False: 2.20k] ------------------ 1185| 3.37k| ? pos.node()->inc() 1186| 3.37k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 3.37k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 3.37k| } _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| 3.69k| { 1097| 3.69k| auto idx = pos.index(last); 1098| 3.69k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 3.69k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 3.69k| } else { 1101| 3.69k| using std::get; 1102| 3.69k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 3.69k| auto next = get<1>(subs); 1104| 3.69k| auto ts = get<2>(subs); 1105| 3.69k| auto tail = get<3>(subs); 1106| 3.69k| IMMER_TRY { ------------------ | | 49| 3.69k|#define IMMER_TRY try ------------------ 1107| 3.69k| if (next) { ------------------ | Branch (1107:21): [True: 862, False: 2.82k] ------------------ 1108| 862| auto count = idx + 1; 1109| 862| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 862| auto newr = newn->relaxed(); 1111| 862| newn->inner()[idx] = next; 1112| 862| newr->d.sizes[idx] = last + 1 - ts; 1113| 862| newr->d.count = count; 1114| 862| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 862, False: 0] ------------------ 1115| 862| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 2.82k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 1.02k, False: 1.80k] ------------------ 1117| 1.02k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 1.80k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 1.80k] | 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| 1.80k| } else { 1123| 1.80k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.80k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.80k| } 1126| 3.69k| } 1127| 3.69k| 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| 3.69k| } 1138| 3.69k| } _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.63k| { 1143| 2.63k| auto idx = pos.index(last); 1144| 2.63k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.63k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.63k| } else { 1147| 2.63k| using std::get; 1148| 2.63k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.63k| auto next = get<1>(subs); 1150| 2.63k| auto ts = get<2>(subs); 1151| 2.63k| auto tail = get<3>(subs); 1152| 2.63k| IMMER_TRY { ------------------ | | 49| 2.63k|#define IMMER_TRY try ------------------ 1153| 2.63k| if (next) { ------------------ | Branch (1153:21): [True: 1.49k, False: 1.13k] ------------------ 1154| 1.49k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.49k| newn->inner()[idx] = next; 1156| 1.49k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.49k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 517, False: 619] ------------------ 1158| 517| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 619| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 619] | 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| 619| } else { 1164| 619| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 619| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 619| } 1167| 2.63k| } 1168| 2.63k| 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.63k| } 1177| 2.63k| } _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.89k| { 1182| 3.89k| auto old_tail_size = pos.count(); 1183| 3.89k| auto new_tail_size = pos.index(last) + 1; 1184| 3.89k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.44k, False: 2.44k] ------------------ 1185| 3.89k| ? pos.node()->inc() 1186| 3.89k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 3.89k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 3.89k| } _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.04k| { 1143| 2.04k| auto idx = pos.index(last); 1144| 2.04k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.04k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.04k| } else { 1147| 2.04k| using std::get; 1148| 2.04k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.04k| auto next = get<1>(subs); 1150| 2.04k| auto ts = get<2>(subs); 1151| 2.04k| auto tail = get<3>(subs); 1152| 2.04k| IMMER_TRY { ------------------ | | 49| 2.04k|#define IMMER_TRY try ------------------ 1153| 2.04k| if (next) { ------------------ | Branch (1153:21): [True: 206, False: 1.83k] ------------------ 1154| 206| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 206| newn->inner()[idx] = next; 1156| 206| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.83k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 525, False: 1.31k] ------------------ 1158| 525| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.31k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.31k] | 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.31k| } else { 1164| 1.31k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.31k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.31k| } 1167| 2.04k| } 1168| 2.04k| 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.04k| } 1177| 2.04k| } _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.92k| { 1182| 2.92k| auto old_tail_size = pos.count(); 1183| 2.92k| auto new_tail_size = pos.index(last) + 1; 1184| 2.92k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.03k, False: 1.88k] ------------------ 1185| 2.92k| ? pos.node()->inc() 1186| 2.92k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.92k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.92k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.97k| { 1143| 2.97k| auto idx = pos.index(last); 1144| 2.97k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.97k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.97k| } else { 1147| 2.97k| using std::get; 1148| 2.97k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.97k| auto next = get<1>(subs); 1150| 2.97k| auto ts = get<2>(subs); 1151| 2.97k| auto tail = get<3>(subs); 1152| 2.97k| IMMER_TRY { ------------------ | | 49| 2.97k|#define IMMER_TRY try ------------------ 1153| 2.97k| if (next) { ------------------ | Branch (1153:21): [True: 903, False: 2.07k] ------------------ 1154| 903| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 903| newn->inner()[idx] = next; 1156| 903| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.07k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 872, False: 1.20k] ------------------ 1158| 872| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.20k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.20k] | 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.20k| } else { 1164| 1.20k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.20k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.20k| } 1167| 2.97k| } 1168| 2.97k| 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.97k| } 1177| 2.97k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEvPT_j: 556| 38.8k|{ 557| 38.8k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 38.8k|} _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.48k| { 1143| 6.48k| auto idx = pos.index(last); 1144| 6.48k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 6.48k, Folded] | Branch (1144:25): [True: 3.60k, False: 2.88k] ------------------ 1145| 3.60k| return pos.towards_oh(this_t{}, last, idx); 1146| 3.60k| } else { 1147| 2.88k| using std::get; 1148| 2.88k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.88k| auto next = get<1>(subs); 1150| 2.88k| auto ts = get<2>(subs); 1151| 2.88k| auto tail = get<3>(subs); 1152| 2.88k| IMMER_TRY { ------------------ | | 49| 2.88k|#define IMMER_TRY try ------------------ 1153| 2.88k| if (next) { ------------------ | Branch (1153:21): [True: 702, False: 2.18k] ------------------ 1154| 702| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 702| newn->inner()[idx] = next; 1156| 702| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.18k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.18k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.18k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.18k, Folded] | Branch (1159:40): [True: 1.84k, False: 340] | Branch (1159:52): [True: 723, False: 1.11k] ------------------ 1160| 723| auto newn = pos.node()->inner()[0]; 1161| 723| return std::make_tuple( 1162| 723| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.45k| } else { 1164| 1.45k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.45k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.45k| } 1167| 2.88k| } 1168| 2.88k| 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.88k| } 1177| 6.48k| } _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.34k| { 1182| 1.34k| auto old_tail_size = pos.count(); 1183| 1.34k| auto new_tail_size = pos.index(last) + 1; 1184| 1.34k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 563, False: 783] ------------------ 1185| 1.34k| ? pos.node()->inc() 1186| 1.34k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.34k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.34k| } _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.22k| { 1143| 2.22k| auto idx = pos.index(last); 1144| 2.22k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 2.22k, Folded] | Branch (1144:25): [True: 922, False: 1.30k] ------------------ 1145| 922| return pos.towards_oh(this_t{}, last, idx); 1146| 1.30k| } else { 1147| 1.30k| using std::get; 1148| 1.30k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 1.30k| auto next = get<1>(subs); 1150| 1.30k| auto ts = get<2>(subs); 1151| 1.30k| auto tail = get<3>(subs); 1152| 1.30k| IMMER_TRY { ------------------ | | 49| 1.30k|#define IMMER_TRY try ------------------ 1153| 1.30k| if (next) { ------------------ | Branch (1153:21): [True: 319, False: 984] ------------------ 1154| 319| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 319| newn->inner()[idx] = next; 1156| 319| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 984| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 984] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 984| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 984, Folded] | Branch (1159:40): [True: 479, False: 505] | Branch (1159:52): [True: 261, False: 218] ------------------ 1160| 261| auto newn = pos.node()->inner()[0]; 1161| 261| return std::make_tuple( 1162| 261| pos.shift() - B, newn->inc(), ts, tail); 1163| 723| } else { 1164| 723| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 723| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 723| } 1167| 1.30k| } 1168| 1.30k| 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.30k| } 1177| 2.22k| } _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| 952| { 1182| 952| auto old_tail_size = pos.count(); 1183| 952| auto new_tail_size = pos.index(last) + 1; 1184| 952| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 532, False: 420] ------------------ 1185| 952| ? pos.node()->inc() 1186| 952| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 952| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 952| } _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| 15.6k| { 1415| 15.6k| auto idx = pos.subindex(first); 1416| 15.6k| auto count = pos.count(); 1417| 15.6k| auto left_size = pos.size_before(idx); 1418| 15.6k| auto child_size = pos.size_sbh(idx, left_size); 1419| 15.6k| auto dropped_size = first; 1420| 15.6k| auto child_dropped_size = dropped_size - left_size; 1421| 15.6k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 15.6k, Folded] | Branch (1421:25): [True: 14.1k, False: 1.58k] | Branch (1421:45): [True: 3.13k, False: 10.9k] ------------------ 1422| 3.13k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 12.5k| } else { 1424| 12.5k| using std::get; 1425| 12.5k| auto n = pos.node(); 1426| 12.5k| auto newc = count - idx; 1427| 12.5k| auto newn = node_t::make_inner_r_n(newc); 1428| 12.5k| IMMER_TRY { ------------------ | | 49| 12.5k|#define IMMER_TRY try ------------------ 1429| 12.5k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 12.5k| auto newr = newn->relaxed(); 1431| 12.5k| newr->d.count = count - idx; 1432| 12.5k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 12.5k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 12.5k, False: 0] ------------------ 1434| 12.5k| pos.copy_sizes(idx + 1, 1435| 12.5k| newr->d.count - 1, 1436| 12.5k| newr->d.sizes[0], 1437| 12.5k| newr->d.sizes + 1); 1438| 12.5k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 12.5k, False: 0] ------------------ 1439| 12.5k| pos.size() - dropped_size); 1440| 12.5k| newn->inner()[0] = get<1>(subs); 1441| 12.5k| std::copy(n->inner() + idx + 1, 1442| 12.5k| n->inner() + count, 1443| 12.5k| newn->inner() + 1); 1444| 12.5k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 12.5k| return std::make_tuple(pos.shift(), newn); 1446| 12.5k| } 1447| 12.5k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 12.5k| } 1452| 15.6k| } _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| 11.7k| { 1457| 11.7k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 11.7k| return std::make_tuple(0, n); 1459| 11.7k| } _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| 54.9k| { 1415| 54.9k| auto idx = pos.subindex(first); 1416| 54.9k| auto count = pos.count(); 1417| 54.9k| auto left_size = pos.size_before(idx); 1418| 54.9k| auto child_size = pos.size_sbh(idx, left_size); 1419| 54.9k| auto dropped_size = first; 1420| 54.9k| auto child_dropped_size = dropped_size - left_size; 1421| 54.9k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 54.9k] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 54.9k| } else { 1424| 54.9k| using std::get; 1425| 54.9k| auto n = pos.node(); 1426| 54.9k| auto newc = count - idx; 1427| 54.9k| auto newn = node_t::make_inner_r_n(newc); 1428| 54.9k| IMMER_TRY { ------------------ | | 49| 54.9k|#define IMMER_TRY try ------------------ 1429| 54.9k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 54.9k| auto newr = newn->relaxed(); 1431| 54.9k| newr->d.count = count - idx; 1432| 54.9k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 54.9k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 54.9k, False: 0] ------------------ 1434| 54.9k| pos.copy_sizes(idx + 1, 1435| 54.9k| newr->d.count - 1, 1436| 54.9k| newr->d.sizes[0], 1437| 54.9k| newr->d.sizes + 1); 1438| 54.9k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 54.9k, False: 0] ------------------ 1439| 54.9k| pos.size() - dropped_size); 1440| 54.9k| newn->inner()[0] = get<1>(subs); 1441| 54.9k| std::copy(n->inner() + idx + 1, 1442| 54.9k| n->inner() + count, 1443| 54.9k| newn->inner() + 1); 1444| 54.9k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 54.9k| return std::make_tuple(pos.shift(), newn); 1446| 54.9k| } 1447| 54.9k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 54.9k| } 1452| 54.9k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 828| { 1415| 828| auto idx = pos.subindex(first); 1416| 828| auto count = pos.count(); 1417| 828| auto left_size = pos.size_before(idx); 1418| 828| auto child_size = pos.size_sbh(idx, left_size); 1419| 828| auto dropped_size = first; 1420| 828| auto child_dropped_size = dropped_size - left_size; 1421| 828| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 828] | 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| 828| } else { 1424| 828| using std::get; 1425| 828| auto n = pos.node(); 1426| 828| auto newc = count - idx; 1427| 828| auto newn = node_t::make_inner_r_n(newc); 1428| 828| IMMER_TRY { ------------------ | | 49| 828|#define IMMER_TRY try ------------------ 1429| 828| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 828| auto newr = newn->relaxed(); 1431| 828| newr->d.count = count - idx; 1432| 828| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 828| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 828, False: 0] ------------------ 1434| 828| pos.copy_sizes(idx + 1, 1435| 828| newr->d.count - 1, 1436| 828| newr->d.sizes[0], 1437| 828| newr->d.sizes + 1); 1438| 828| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 828, False: 0] ------------------ 1439| 828| pos.size() - dropped_size); 1440| 828| newn->inner()[0] = get<1>(subs); 1441| 828| std::copy(n->inner() + idx + 1, 1442| 828| n->inner() + count, 1443| 828| newn->inner() + 1); 1444| 828| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 828| return std::make_tuple(pos.shift(), newn); 1446| 828| } 1447| 828| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 828| } 1452| 828| } _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.76k| { 1457| 7.76k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 7.76k| return std::make_tuple(0, n); 1459| 7.76k| } _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.28k| { 1415| 4.28k| auto idx = pos.subindex(first); 1416| 4.28k| auto count = pos.count(); 1417| 4.28k| auto left_size = pos.size_before(idx); 1418| 4.28k| auto child_size = pos.size_sbh(idx, left_size); 1419| 4.28k| auto dropped_size = first; 1420| 4.28k| auto child_dropped_size = dropped_size - left_size; 1421| 4.28k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 4.28k] | 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.28k| } else { 1424| 4.28k| using std::get; 1425| 4.28k| auto n = pos.node(); 1426| 4.28k| auto newc = count - idx; 1427| 4.28k| auto newn = node_t::make_inner_r_n(newc); 1428| 4.28k| IMMER_TRY { ------------------ | | 49| 4.28k|#define IMMER_TRY try ------------------ 1429| 4.28k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 4.28k| auto newr = newn->relaxed(); 1431| 4.28k| newr->d.count = count - idx; 1432| 4.28k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 4.28k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 4.28k, False: 0] ------------------ 1434| 4.28k| pos.copy_sizes(idx + 1, 1435| 4.28k| newr->d.count - 1, 1436| 4.28k| newr->d.sizes[0], 1437| 4.28k| newr->d.sizes + 1); 1438| 4.28k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 4.28k, False: 0] ------------------ 1439| 4.28k| pos.size() - dropped_size); 1440| 4.28k| newn->inner()[0] = get<1>(subs); 1441| 4.28k| std::copy(n->inner() + idx + 1, 1442| 4.28k| n->inner() + count, 1443| 4.28k| newn->inner() + 1); 1444| 4.28k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 4.28k| return std::make_tuple(pos.shift(), newn); 1446| 4.28k| } 1447| 4.28k| 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.28k| } 1452| 4.28k| } _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.90k| { 1415| 8.90k| auto idx = pos.subindex(first); 1416| 8.90k| auto count = pos.count(); 1417| 8.90k| auto left_size = pos.size_before(idx); 1418| 8.90k| auto child_size = pos.size_sbh(idx, left_size); 1419| 8.90k| auto dropped_size = first; 1420| 8.90k| auto child_dropped_size = dropped_size - left_size; 1421| 8.90k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 8.90k, Folded] | Branch (1421:25): [True: 5.47k, False: 3.42k] | Branch (1421:45): [True: 2.71k, False: 2.76k] ------------------ 1422| 2.71k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 6.19k| } else { 1424| 6.19k| using std::get; 1425| 6.19k| auto n = pos.node(); 1426| 6.19k| auto newc = count - idx; 1427| 6.19k| auto newn = node_t::make_inner_r_n(newc); 1428| 6.19k| IMMER_TRY { ------------------ | | 49| 6.19k|#define IMMER_TRY try ------------------ 1429| 6.19k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 6.19k| auto newr = newn->relaxed(); 1431| 6.19k| newr->d.count = count - idx; 1432| 6.19k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 6.19k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 6.19k, False: 0] ------------------ 1434| 6.19k| pos.copy_sizes(idx + 1, 1435| 6.19k| newr->d.count - 1, 1436| 6.19k| newr->d.sizes[0], 1437| 6.19k| newr->d.sizes + 1); 1438| 6.19k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 6.19k, False: 0] ------------------ 1439| 6.19k| pos.size() - dropped_size); 1440| 6.19k| newn->inner()[0] = get<1>(subs); 1441| 6.19k| std::copy(n->inner() + idx + 1, 1442| 6.19k| n->inner() + count, 1443| 6.19k| newn->inner() + 1); 1444| 6.19k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 6.19k| return std::make_tuple(pos.shift(), newn); 1446| 6.19k| } 1447| 6.19k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 6.19k| } 1452| 8.90k| } _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| 749| { 1415| 749| auto idx = pos.subindex(first); 1416| 749| auto count = pos.count(); 1417| 749| auto left_size = pos.size_before(idx); 1418| 749| auto child_size = pos.size_sbh(idx, left_size); 1419| 749| auto dropped_size = first; 1420| 749| auto child_dropped_size = dropped_size - left_size; 1421| 749| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 749, Folded] | Branch (1421:25): [True: 311, False: 438] | Branch (1421:45): [True: 0, False: 311] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 749| } else { 1424| 749| using std::get; 1425| 749| auto n = pos.node(); 1426| 749| auto newc = count - idx; 1427| 749| auto newn = node_t::make_inner_r_n(newc); 1428| 749| IMMER_TRY { ------------------ | | 49| 749|#define IMMER_TRY try ------------------ 1429| 749| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 749| auto newr = newn->relaxed(); 1431| 749| newr->d.count = count - idx; 1432| 749| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 749| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 749, False: 0] ------------------ 1434| 749| pos.copy_sizes(idx + 1, 1435| 749| newr->d.count - 1, 1436| 749| newr->d.sizes[0], 1437| 749| newr->d.sizes + 1); 1438| 749| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 749, False: 0] ------------------ 1439| 749| pos.size() - dropped_size); 1440| 749| newn->inner()[0] = get<1>(subs); 1441| 749| std::copy(n->inner() + idx + 1, 1442| 749| n->inner() + count, 1443| 749| newn->inner() + 1); 1444| 749| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 749| return std::make_tuple(pos.shift(), newn); 1446| 749| } 1447| 749| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 749| } 1452| 749| } _ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_11relaxed_posIT_EEPSE_jSG_jm: 2001| 11.9k|{ 2002| 11.9k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 11.9k| .visit(concat_trees_left_visitor{}, 2004| 11.9k| empty_leaf_pos{}, 2005| 11.9k| rroot, 2006| 11.9k| rshift, 2007| 11.9k| rsize) 2008| 11.9k| .realize(); 2009| 11.9k|} _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| 11.9k| { 1972| 11.9k| return visit_maybe_relaxed_sub( 1973| 11.9k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 11.9k| } _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| 9.09k| { 1959| 9.09k| return concat_inners(lpos, tpos, rpos); 1960| 9.09k| } _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| 62.3k|{ 1873| 62.3k| auto lshift = lpos.shift(); 1874| 62.3k| auto rshift = rpos.shift(); 1875| 62.3k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 62.3k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 62.3k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 53.5k, False: 8.78k] ------------------ 1879| 53.5k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 53.5k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 53.5k| } else { 1882| 8.78k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 8.78k, False: 0] ------------------ 1883| 8.78k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 8.78k] | Branch (1883:9): [True: 8.78k, False: 0] | Branch (1883:9): [True: 8.78k, False: 0] ------------------ 1884| 8.78k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 8.78k| return concat_rebalance(lpos, cpos, rpos); 1886| 8.78k| } 1887| 62.3k|} _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| 19.0M| { 1513| 19.0M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.51M, False: 17.5M] ------------------ 1514| 1.51M| auto s = size_t{}; 1515| 6.05M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 4.53M, False: 1.51M] ------------------ 1516| 4.53M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 4.53M| s = sizes_[i]; 1518| 4.53M| } 1519| 17.5M| } else { 1520| 48.1M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 30.6M, False: 17.5M] ------------------ 1521| 30.6M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 30.6M| .visit(v, args...); 1523| 17.5M| } 1524| 19.0M| } _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| 14.6M| { 1734| 14.6M| auto count = p.count(); 1735| 14.6M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 14.6M, False: 0] ------------------ 1736| 14.6M| plan.counts[plan.n++] = count; 1737| 14.6M| plan.total += count; 1738| 14.6M| } _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| 171M| { 1734| 171M| auto count = p.count(); 1735| 171M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 171M, False: 0] ------------------ 1736| 171M| plan.counts[plan.n++] = count; 1737| 171M| plan.total += count; 1738| 171M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE7shuffleEj: 1762| 19.0M| { 1763| | // gcc seems to not really understand this code... :( 1764| 19.0M|#if !defined(_MSC_VER) 1765| 19.0M|#pragma GCC diagnostic push 1766| 19.0M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 19.0M|#endif 1768| 19.0M| constexpr count_t rrb_extras = 2; 1769| 19.0M| constexpr count_t rrb_invariant = 1; 1770| 19.0M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 1.51M, False: 17.5M] ------------------ 1771| 19.0M| const auto branches = count_t{1} << bits; 1772| 19.0M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 19.0M| count_t i = 0; 1774| 23.9M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 4.95M, False: 19.0M] ------------------ 1775| | // skip ok nodes 1776| 11.0M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 6.05M, False: 4.95M] ------------------ 1777| 6.05M| i++; 1778| 4.95M| assert(i < n); ------------------ | Branch (1778:13): [True: 4.95M, False: 0] ------------------ 1779| | // short node, redistribute 1780| 4.95M| auto remaining = counts[i]; 1781| 19.0M| do { 1782| 19.0M| auto next = counts[i + 1]; 1783| 19.0M| auto count = std::min(remaining + next, branches); 1784| 19.0M| counts[i] = count; 1785| 19.0M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 19.0M, False: 0] ------------------ 1786| 19.0M| remaining += next - count; 1787| 19.0M| ++i; 1788| 19.0M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 14.1M, False: 4.95M] ------------------ 1789| | // remove node 1790| 4.95M| std::move(counts + i + 1, counts + n, counts + i); 1791| 4.95M| --n; 1792| 4.95M| --i; 1793| 4.95M| } 1794| 19.0M|#if !defined(_MSC_VER) 1795| 19.0M|#pragma GCC diagnostic pop 1796| 19.0M|#endif 1797| 19.0M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 1478| 38.0M| auto shift() const { return shift_; } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEC2EjPjj: 1577| 19.0M| : curr_{counts} 1578| 19.0M| , n_{n} 1579| 19.0M| , result_{ 1580| 19.0M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 19.0M| { 1582| 19.0M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEC2EjPSC_m: 1481| 19.0M| : shift_{s} 1482| 19.0M| , count_{1} 1483| 19.0M| , nodes_{n0} 1484| 19.0M| , sizes_{s0} 1485| 19.0M| { 1486| 19.0M| } _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| 19.0M| { 1513| 19.0M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.51M, False: 17.5M] ------------------ 1514| 1.51M| auto s = size_t{}; 1515| 6.05M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 4.53M, False: 1.51M] ------------------ 1516| 4.53M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 4.53M| s = sizes_[i]; 1518| 4.53M| } 1519| 17.5M| } else { 1520| 48.1M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 30.6M, False: 17.5M] ------------------ 1521| 30.6M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 30.6M| .visit(v, args...); 1523| 17.5M| } 1524| 19.0M| } _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| 14.6M| { 1722| 14.6M| merger.merge_leaf(p); 1723| 14.6M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_: 1614| 14.6M| { 1615| 14.6M| auto from = p.node(); 1616| 14.6M| auto from_size = p.size(); 1617| 14.6M| auto from_count = p.count(); 1618| 14.6M| assert(from_size); ------------------ | Branch (1618:9): [True: 14.6M, False: 0] ------------------ 1619| 14.6M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 14.4M, False: 216k] | Branch (1619:21): [True: 14.3M, False: 107k] ------------------ 1620| 14.3M| add_child(from, from_size); 1621| 14.3M| from->inc(); 1622| 14.3M| } else { 1623| 324k| auto from_offset = count_t{}; 1624| 324k| auto from_data = from->leaf(); 1625| 429k| do { 1626| 429k| if (!to_) { ------------------ | Branch (1626:21): [True: 212k, False: 216k] ------------------ 1627| 212k| to_ = node_t::make_leaf_n(*curr_); 1628| 212k| to_offset_ = 0; 1629| 212k| } 1630| 429k| auto data = to_->leaf(); 1631| 429k| auto to_copy = 1632| 429k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 429k| detail::uninitialized_copy(from_data + from_offset, 1634| 429k| from_data + from_offset + to_copy, 1635| 429k| data + to_offset_); 1636| 429k| to_offset_ += to_copy; 1637| 429k| from_offset += to_copy; 1638| 429k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 212k, False: 216k] ------------------ 1639| 212k| add_child(to_, to_offset_); 1640| 212k| to_ = nullptr; 1641| 212k| } 1642| 429k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 105k, False: 324k] ------------------ 1643| 324k| } 1644| 14.6M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9add_childEPSC_m: 1589| 191M| { 1590| 191M| assert(size); ------------------ | Branch (1590:9): [True: 191M, False: 0] ------------------ 1591| 191M| ++curr_; 1592| 191M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 191M| auto relaxed = parent->relaxed(); 1594| 191M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 13.1M, False: 177M] ------------------ 1595| 13.1M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 13.1M, False: 0] ------------------ 1596| 13.1M| n_ -= branches; 1597| 13.1M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 13.1M| relaxed = parent->relaxed(); 1599| 13.1M| result_.nodes_[result_.count_] = parent; 1600| 13.1M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 13.1M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 13.1M, False: 0] ------------------ 1602| 13.1M| ++result_.count_; 1603| 13.1M| } 1604| 191M| auto idx = relaxed->d.count++; 1605| 191M| result_.sizes_[result_.count_ - 1] += size; 1606| 191M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 191M, False: 0] ------------------ 1607| 191M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 158M, False: 32.2M] ------------------ 1608| 191M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 191M, False: 0] ------------------ 1609| 191M| parent->inner()[idx] = p; 1610| 191M| }; _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| 171M| { 1716| 171M| merger.merge_inner(p); 1717| 171M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 171M| { 1649| 171M| auto from = p.node(); 1650| 171M| auto from_size = p.size(); 1651| 171M| auto from_count = p.count(); 1652| 171M| assert(from_size); ------------------ | Branch (1652:9): [True: 171M, False: 0] ------------------ 1653| 171M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 154M, False: 17.1M] | Branch (1653:21): [True: 150M, False: 3.83M] ------------------ 1654| 150M| add_child(from, from_size); 1655| 150M| from->inc(); 1656| 150M| } else { 1657| 20.9M| auto from_offset = count_t{}; 1658| 20.9M| auto from_data = from->inner(); 1659| 33.2M| do { 1660| 33.2M| if (!to_) { ------------------ | Branch (1660:21): [True: 16.1M, False: 17.1M] ------------------ 1661| 16.1M| to_ = node_t::make_inner_r_n(*curr_); 1662| 16.1M| to_offset_ = 0; 1663| 16.1M| to_size_ = 0; 1664| 16.1M| } 1665| 33.2M| auto data = to_->inner(); 1666| 33.2M| auto to_copy = 1667| 33.2M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 33.2M| std::copy(from_data + from_offset, 1669| 33.2M| from_data + from_offset + to_copy, 1670| 33.2M| data + to_offset_); 1671| 33.2M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 33.2M| auto sizes = to_->relaxed()->d.sizes; 1673| 33.2M| p.copy_sizes( 1674| 33.2M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 33.2M| to_offset_ += to_copy; 1676| 33.2M| from_offset += to_copy; 1677| 33.2M| to_size_ = sizes[to_offset_ - 1]; 1678| 33.2M| assert(to_size_); ------------------ | Branch (1678:17): [True: 33.2M, False: 0] ------------------ 1679| 33.2M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 16.1M, False: 17.1M] ------------------ 1680| 16.1M| to_->relaxed()->d.count = to_offset_; 1681| 16.1M| add_child(to_, to_size_); 1682| 16.1M| to_ = nullptr; 1683| 16.1M| } 1684| 33.2M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 12.2M, False: 20.9M] ------------------ 1685| 20.9M| } 1686| 171M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE6finishEv: 1689| 19.0M| { 1690| 19.0M| assert(!to_); ------------------ | Branch (1690:9): [True: 19.0M, False: 0] ------------------ 1691| 19.0M| return result_; 1692| 19.0M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8each_subINS1_11dec_visitorEJEEEvT_DpOT0_: 1512| 19.0M| { 1513| 19.0M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.51M, False: 17.5M] ------------------ 1514| 1.51M| auto s = size_t{}; 1515| 6.05M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 4.53M, False: 1.51M] ------------------ 1516| 4.53M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 4.53M| s = sizes_[i]; 1518| 4.53M| } 1519| 17.5M| } else { 1520| 48.1M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 30.6M, False: 17.5M] ------------------ 1521| 30.6M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 30.6M| .visit(v, args...); 1523| 17.5M| } 1524| 19.0M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEC2EjPSC_mSE_mSE_m: 1503| 1.50M| : shift_{s} 1504| 1.50M| , count_{3} 1505| 1.50M| , nodes_{n0, n1, n2} 1506| 1.50M| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 1.50M| { 1508| 1.50M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEC2EjPSC_mSE_m: 1489| 11.9k| : shift_{s} 1490| 11.9k| , count_{2} 1491| 11.9k| , nodes_{n0, n1} 1492| 11.9k| , sizes_{s0, s0 + s1} 1493| 11.9k| { 1494| 11.9k| } _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| 53.2k| { 1918| 53.2k| return concat_inners(lpos, tpos, rpos); 1919| 53.2k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 310| { 1918| 310| return concat_inners(lpos, tpos, rpos); 1919| 310| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 3.11k|{ 1873| 3.11k| auto lshift = lpos.shift(); 1874| 3.11k| auto rshift = rpos.shift(); 1875| 3.11k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 3.11k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 3.11k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 620, False: 2.49k] ------------------ 1879| 620| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 620| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.49k| } else { 1882| 2.49k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.49k, False: 0] ------------------ 1883| 2.49k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.49k] | Branch (1883:9): [True: 2.49k, False: 0] | Branch (1883:9): [True: 2.49k, False: 0] ------------------ 1884| 2.49k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.49k| return concat_rebalance(lpos, cpos, rpos); 1886| 2.49k| } 1887| 3.11k|} _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| 927| { 1918| 927| return concat_inners(lpos, tpos, rpos); 1919| 927| } _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| 927|{ 1873| 927| auto lshift = lpos.shift(); 1874| 927| auto rshift = rpos.shift(); 1875| 927| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 927] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 927| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 307, False: 620] ------------------ 1879| 307| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 307| 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| 927|} _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| 753|{ 1824| 753| auto plan = concat_rebalance_plan{}; 1825| 753| plan.fill(lpos, cpos, rpos); 1826| 753| plan.shuffle(cpos.shift()); 1827| 753| IMMER_TRY { ------------------ | | 49| 753|#define IMMER_TRY try ------------------ 1828| 753| return plan.merge(lpos, cpos, rpos); 1829| 753| } 1830| 753| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 753|} _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| 753| { 1753| 753| assert(n == 0u); ------------------ | Branch (1753:9): [True: 753, False: 0] ------------------ 1754| 753| assert(total == 0u); ------------------ | Branch (1754:9): [True: 753, False: 0] ------------------ 1755| 753| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 753| lpos.each_left_sub(visitor_t{}, *this); 1757| 753| cpos.each_sub(visitor_t{}, *this); 1758| 753| rpos.each_right_sub(visitor_t{}, *this); 1759| 753| } _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.44M| { 1734| 5.44M| auto count = p.count(); 1735| 5.44M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 5.44M, False: 0] ------------------ 1736| 5.44M| plan.counts[plan.n++] = count; 1737| 5.44M| plan.total += count; 1738| 5.44M| } _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| 733k| { 1734| 733k| auto count = p.count(); 1735| 733k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 733k, False: 0] ------------------ 1736| 733k| plan.counts[plan.n++] = count; 1737| 733k| plan.total += count; 1738| 733k| } _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| 753| { 1803| 753| using node_t = node_type; 1804| 753| using merger_t = concat_merger; 1805| 753| using visitor_t = concat_merger_visitor; 1806| 753| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 753| IMMER_TRY { ------------------ | | 49| 753|#define IMMER_TRY try ------------------ 1808| 753| lpos.each_left_sub(visitor_t{}, merger); 1809| 753| cpos.each_sub(visitor_t{}, merger); 1810| 753| rpos.each_right_sub(visitor_t{}, merger); 1811| 753| cpos.each_sub(dec_visitor{}); 1812| 753| return merger.finish(); 1813| 753| } 1814| 753| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 753| } _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.44M| { 1722| 5.44M| merger.merge_leaf(p); 1723| 5.44M| } _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.44M| { 1615| 5.44M| auto from = p.node(); 1616| 5.44M| auto from_size = p.size(); 1617| 5.44M| auto from_count = p.count(); 1618| 5.44M| assert(from_size); ------------------ | Branch (1618:9): [True: 5.44M, False: 0] ------------------ 1619| 5.44M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 5.44M, False: 0] | Branch (1619:21): [True: 5.44M, False: 0] ------------------ 1620| 5.44M| add_child(from, from_size); 1621| 5.44M| from->inc(); 1622| 5.44M| } 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.44M| } _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| 733k| { 1716| 733k| merger.merge_inner(p); 1717| 733k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 733k| { 1649| 733k| auto from = p.node(); 1650| 733k| auto from_size = p.size(); 1651| 733k| auto from_count = p.count(); 1652| 733k| assert(from_size); ------------------ | Branch (1652:9): [True: 733k, False: 0] ------------------ 1653| 733k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 733k, False: 0] | Branch (1653:21): [True: 733k, False: 0] ------------------ 1654| 733k| add_child(from, from_size); 1655| 733k| from->inc(); 1656| 733k| } 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| 733k| } _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.11k| { 1925| 3.11k| return concat_leafs(lpos, tpos, rpos); 1926| 3.11k| } _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.11k|{ 1839| 3.11k| static_assert(Node::bits >= 2, ""); 1840| 3.11k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 3.11k, False: 0] ------------------ 1841| 3.11k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 3.11k, False: 0] ------------------ 1842| 3.11k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 3.11k, False: 0] ------------------ 1843| 3.11k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 3.11k] ------------------ 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.11k| else 1854| 3.11k| return { 1855| 3.11k| Node::bits_leaf, 1856| 3.11k| lpos.node()->inc(), 1857| 3.11k| lpos.count(), 1858| 3.11k| rpos.node()->inc(), 1859| 3.11k| rpos.count(), 1860| 3.11k| }; 1861| 3.11k|} _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.82k|{ 1824| 1.82k| auto plan = concat_rebalance_plan{}; 1825| 1.82k| plan.fill(lpos, cpos, rpos); 1826| 1.82k| plan.shuffle(cpos.shift()); 1827| 1.82k| IMMER_TRY { ------------------ | | 49| 1.82k|#define IMMER_TRY try ------------------ 1828| 1.82k| return plan.merge(lpos, cpos, rpos); 1829| 1.82k| } 1830| 1.82k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.82k|} _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.82k| { 1753| 1.82k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.82k, False: 0] ------------------ 1754| 1.82k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.82k, False: 0] ------------------ 1755| 1.82k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.82k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.82k| cpos.each_sub(visitor_t{}, *this); 1758| 1.82k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.82k| } _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.88M| { 1734| 3.88M| auto count = p.count(); 1735| 3.88M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 3.88M, False: 0] ------------------ 1736| 3.88M| plan.counts[plan.n++] = count; 1737| 3.88M| plan.total += count; 1738| 3.88M| } _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.82k| { 1803| 1.82k| using node_t = node_type; 1804| 1.82k| using merger_t = concat_merger; 1805| 1.82k| using visitor_t = concat_merger_visitor; 1806| 1.82k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.82k| IMMER_TRY { ------------------ | | 49| 1.82k|#define IMMER_TRY try ------------------ 1808| 1.82k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.82k| cpos.each_sub(visitor_t{}, merger); 1810| 1.82k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.82k| cpos.each_sub(dec_visitor{}); 1812| 1.82k| return merger.finish(); 1813| 1.82k| } 1814| 1.82k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.82k| } _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.88M| { 1716| 3.88M| merger.merge_inner(p); 1717| 3.88M| } _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.88M| { 1649| 3.88M| auto from = p.node(); 1650| 3.88M| auto from_size = p.size(); 1651| 3.88M| auto from_count = p.count(); 1652| 3.88M| assert(from_size); ------------------ | Branch (1652:9): [True: 3.88M, False: 0] ------------------ 1653| 3.88M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 2.13M, False: 1.75M] | Branch (1653:21): [True: 2.13M, False: 0] ------------------ 1654| 2.13M| add_child(from, from_size); 1655| 2.13M| from->inc(); 1656| 2.13M| } else { 1657| 1.75M| auto from_offset = count_t{}; 1658| 1.75M| auto from_data = from->inner(); 1659| 3.50M| do { 1660| 3.50M| if (!to_) { ------------------ | Branch (1660:21): [True: 1.75M, False: 1.75M] ------------------ 1661| 1.75M| to_ = node_t::make_inner_r_n(*curr_); 1662| 1.75M| to_offset_ = 0; 1663| 1.75M| to_size_ = 0; 1664| 1.75M| } 1665| 3.50M| auto data = to_->inner(); 1666| 3.50M| auto to_copy = 1667| 3.50M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 3.50M| std::copy(from_data + from_offset, 1669| 3.50M| from_data + from_offset + to_copy, 1670| 3.50M| data + to_offset_); 1671| 3.50M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 3.50M| auto sizes = to_->relaxed()->d.sizes; 1673| 3.50M| p.copy_sizes( 1674| 3.50M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 3.50M| to_offset_ += to_copy; 1676| 3.50M| from_offset += to_copy; 1677| 3.50M| to_size_ = sizes[to_offset_ - 1]; 1678| 3.50M| assert(to_size_); ------------------ | Branch (1678:17): [True: 3.50M, False: 0] ------------------ 1679| 3.50M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 1.75M, False: 1.75M] ------------------ 1680| 1.75M| to_->relaxed()->d.count = to_offset_; 1681| 1.75M| add_child(to_, to_size_); 1682| 1.75M| to_ = nullptr; 1683| 1.75M| } 1684| 3.50M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.75M, False: 1.75M] ------------------ 1685| 1.75M| } 1686| 3.88M| } _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.49k| { 1945| 2.49k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 2.49k| } _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| 8.78k| { 1925| 8.78k| return concat_leafs(lpos, tpos, rpos); 1926| 8.78k| } _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| 8.78k|{ 1839| 8.78k| static_assert(Node::bits >= 2, ""); 1840| 8.78k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 8.78k, False: 0] ------------------ 1841| 8.78k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 8.78k, False: 0] ------------------ 1842| 8.78k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 8.78k, False: 0] ------------------ 1843| 8.78k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 8.78k] ------------------ 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| 8.78k| else 1854| 8.78k| return { 1855| 8.78k| Node::bits_leaf, 1856| 8.78k| lpos.node()->inc(), 1857| 8.78k| lpos.count(), 1858| 8.78k| rpos.node()->inc(), 1859| 8.78k| rpos.count(), 1860| 8.78k| }; 1861| 8.78k|} _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.49k|{ 1824| 2.49k| auto plan = concat_rebalance_plan{}; 1825| 2.49k| plan.fill(lpos, cpos, rpos); 1826| 2.49k| plan.shuffle(cpos.shift()); 1827| 2.49k| IMMER_TRY { ------------------ | | 49| 2.49k|#define IMMER_TRY try ------------------ 1828| 2.49k| return plan.merge(lpos, cpos, rpos); 1829| 2.49k| } 1830| 2.49k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.49k|} _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.49k| { 1753| 2.49k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.49k, False: 0] ------------------ 1754| 2.49k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.49k, False: 0] ------------------ 1755| 2.49k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.49k| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.49k| cpos.each_sub(visitor_t{}, *this); 1758| 2.49k| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.49k| } _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.49k| { 1803| 2.49k| using node_t = node_type; 1804| 2.49k| using merger_t = concat_merger; 1805| 2.49k| using visitor_t = concat_merger_visitor; 1806| 2.49k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.49k| IMMER_TRY { ------------------ | | 49| 2.49k|#define IMMER_TRY try ------------------ 1808| 2.49k| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.49k| cpos.each_sub(visitor_t{}, merger); 1810| 2.49k| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.49k| cpos.each_sub(dec_visitor{}); 1812| 2.49k| return merger.finish(); 1813| 2.49k| } 1814| 2.49k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.49k| } _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| 145k|{ 1824| 145k| auto plan = concat_rebalance_plan{}; 1825| 145k| plan.fill(lpos, cpos, rpos); 1826| 145k| plan.shuffle(cpos.shift()); 1827| 145k| IMMER_TRY { ------------------ | | 49| 145k|#define IMMER_TRY try ------------------ 1828| 145k| return plan.merge(lpos, cpos, rpos); 1829| 145k| } 1830| 145k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 145k|} _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| 145k| { 1753| 145k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 145k, False: 0] ------------------ 1754| 145k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 145k, False: 0] ------------------ 1755| 145k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 145k| lpos.each_left_sub(visitor_t{}, *this); 1757| 145k| cpos.each_sub(visitor_t{}, *this); 1758| 145k| rpos.each_right_sub(visitor_t{}, *this); 1759| 145k| } _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| 145k| { 1803| 145k| using node_t = node_type; 1804| 145k| using merger_t = concat_merger; 1805| 145k| using visitor_t = concat_merger_visitor; 1806| 145k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 145k| IMMER_TRY { ------------------ | | 49| 145k|#define IMMER_TRY try ------------------ 1808| 145k| lpos.each_left_sub(visitor_t{}, merger); 1809| 145k| cpos.each_sub(visitor_t{}, merger); 1810| 145k| rpos.each_right_sub(visitor_t{}, merger); 1811| 145k| cpos.each_sub(dec_visitor{}); 1812| 145k| return merger.finish(); 1813| 145k| } 1814| 145k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 145k| } _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| 8.78k| { 1945| 8.78k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 8.78k| } _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| 8.78k|{ 1824| 8.78k| auto plan = concat_rebalance_plan{}; 1825| 8.78k| plan.fill(lpos, cpos, rpos); 1826| 8.78k| plan.shuffle(cpos.shift()); 1827| 8.78k| IMMER_TRY { ------------------ | | 49| 8.78k|#define IMMER_TRY try ------------------ 1828| 8.78k| return plan.merge(lpos, cpos, rpos); 1829| 8.78k| } 1830| 8.78k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 8.78k|} _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| 8.78k| { 1753| 8.78k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 8.78k, False: 0] ------------------ 1754| 8.78k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 8.78k, False: 0] ------------------ 1755| 8.78k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 8.78k| lpos.each_left_sub(visitor_t{}, *this); 1757| 8.78k| cpos.each_sub(visitor_t{}, *this); 1758| 8.78k| rpos.each_right_sub(visitor_t{}, *this); 1759| 8.78k| } _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| 8.78k| { 1803| 8.78k| using node_t = node_type; 1804| 8.78k| using merger_t = concat_merger; 1805| 8.78k| using visitor_t = concat_merger_visitor; 1806| 8.78k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 8.78k| IMMER_TRY { ------------------ | | 49| 8.78k|#define IMMER_TRY try ------------------ 1808| 8.78k| lpos.each_left_sub(visitor_t{}, merger); 1809| 8.78k| cpos.each_sub(visitor_t{}, merger); 1810| 8.78k| rpos.each_right_sub(visitor_t{}, merger); 1811| 8.78k| cpos.each_sub(dec_visitor{}); 1812| 8.78k| return merger.finish(); 1813| 8.78k| } 1814| 8.78k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 8.78k| } _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.80k| { 1959| 2.80k| return concat_inners(lpos, tpos, rpos); 1960| 2.80k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7realizeEv: 1527| 1.51M| { 1528| 1.51M| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 84.2k, False: 1.43M] ------------------ 1529| 84.2k| IMMER_TRY { ------------------ | | 49| 84.2k|#define IMMER_TRY try ------------------ 1530| 84.2k| auto result = node_t::make_inner_r_n(count_); 1531| 84.2k| auto r = result->relaxed(); 1532| 84.2k| r->d.count = count_; 1533| 84.2k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 84.2k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 84.2k| return {result, shift_, r}; 1536| 84.2k| } 1537| 84.2k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 1.43M| } else { 1542| 1.43M| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 1.43M, False: 0] ------------------ 1543| 1.43M| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 1.43M| } 1545| 1.51M| } _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.50M|{ 1987| 1.50M| return visit_maybe_relaxed_sub(lroot, 1988| 1.50M| lshift, 1989| 1.50M| lsize, 1990| 1.50M| concat_trees_left_visitor{}, 1991| 1.50M| make_leaf_pos(ltail, ltcount), 1992| 1.50M| rroot, 1993| 1.50M| rshift, 1994| 1.50M| rsize) 1995| 1.50M| .realize(); 1996| 1.50M|} _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.48M| { 1972| 1.48M| return visit_maybe_relaxed_sub( 1973| 1.48M| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 1.48M| } _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.46M| { 1959| 1.46M| return concat_inners(lpos, tpos, rpos); 1960| 1.46M| } _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| 17.2M|{ 1873| 17.2M| auto lshift = lpos.shift(); 1874| 17.2M| auto rshift = rpos.shift(); 1875| 17.2M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 4.14M, False: 13.1M] ------------------ 1876| 4.14M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 4.14M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 13.1M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 85.0k, False: 13.0M] ------------------ 1879| 85.0k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 85.0k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 13.0M| } else { 1882| 13.0M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 13.0M, False: 0] ------------------ 1883| 13.0M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 13.0M] | Branch (1883:9): [True: 13.0M, False: 0] | Branch (1883:9): [True: 13.0M, False: 0] ------------------ 1884| 13.0M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 13.0M| return concat_rebalance(lpos, cpos, rpos); 1886| 13.0M| } 1887| 17.2M|} _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| 4.14M| { 1898| 4.14M| return concat_inners(lpos, tpos, rpos); 1899| 4.14M| } _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| 5.12k| { 1898| 5.12k| return concat_inners(lpos, tpos, rpos); 1899| 5.12k| } _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.19M|{ 1873| 1.19M| auto lshift = lpos.shift(); 1874| 1.19M| auto rshift = rpos.shift(); 1875| 1.19M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.83k, False: 1.18M] ------------------ 1876| 2.83k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.83k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.18M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 6.90k, False: 1.18M] ------------------ 1879| 6.90k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 6.90k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.18M| } else { 1882| 1.18M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.18M, False: 0] ------------------ 1883| 1.18M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.18M] | Branch (1883:9): [True: 1.18M, False: 0] | Branch (1883:9): [True: 1.18M, False: 0] ------------------ 1884| 1.18M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.18M| return concat_rebalance(lpos, cpos, rpos); 1886| 1.18M| } 1887| 1.19M|} _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| 4.79k|{ 1824| 4.79k| auto plan = concat_rebalance_plan{}; 1825| 4.79k| plan.fill(lpos, cpos, rpos); 1826| 4.79k| plan.shuffle(cpos.shift()); 1827| 4.79k| IMMER_TRY { ------------------ | | 49| 4.79k|#define IMMER_TRY try ------------------ 1828| 4.79k| return plan.merge(lpos, cpos, rpos); 1829| 4.79k| } 1830| 4.79k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.79k|} _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| 4.79k| { 1753| 4.79k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.79k, False: 0] ------------------ 1754| 4.79k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.79k, False: 0] ------------------ 1755| 4.79k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.79k| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.79k| cpos.each_sub(visitor_t{}, *this); 1758| 4.79k| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.79k| } _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| 4.79k| { 1803| 4.79k| using node_t = node_type; 1804| 4.79k| using merger_t = concat_merger; 1805| 4.79k| using visitor_t = concat_merger_visitor; 1806| 4.79k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.79k| IMMER_TRY { ------------------ | | 49| 4.79k|#define IMMER_TRY try ------------------ 1808| 4.79k| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.79k| cpos.each_sub(visitor_t{}, merger); 1810| 4.79k| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.79k| cpos.each_sub(dec_visitor{}); 1812| 4.79k| return merger.finish(); 1813| 4.79k| } 1814| 4.79k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.79k| } _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.17M| { 1918| 1.17M| return concat_inners(lpos, tpos, rpos); 1919| 1.17M| } _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| 366k| { 1918| 366k| return concat_inners(lpos, tpos, rpos); 1919| 366k| } _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| 387k|{ 1873| 387k| auto lshift = lpos.shift(); 1874| 387k| auto rshift = rpos.shift(); 1875| 387k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 1.95k, False: 385k] ------------------ 1876| 1.95k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 1.95k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 385k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 745, False: 384k] ------------------ 1879| 745| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 745| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 384k| } else { 1882| 384k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 384k, False: 0] ------------------ 1883| 384k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 384k] | Branch (1883:9): [True: 384k, False: 0] | Branch (1883:9): [True: 384k, False: 0] ------------------ 1884| 384k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 384k| return concat_rebalance(lpos, cpos, rpos); 1886| 384k| } 1887| 387k|} _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| 2.73k| { 1898| 2.73k| return concat_inners(lpos, tpos, rpos); 1899| 2.73k| } _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| 37.3k| { 1918| 37.3k| return concat_inners(lpos, tpos, rpos); 1919| 37.3k| } _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| 37.3k|{ 1873| 37.3k| auto lshift = lpos.shift(); 1874| 37.3k| auto rshift = rpos.shift(); 1875| 37.3k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 37.3k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 37.3k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 246, False: 37.0k] ------------------ 1879| 246| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 246| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 37.0k| } else { 1882| 37.0k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 37.0k, False: 0] ------------------ 1883| 37.0k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 37.0k] | Branch (1883:9): [True: 37.0k, False: 0] | Branch (1883:9): [True: 37.0k, False: 0] ------------------ 1884| 37.0k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 37.0k| return concat_rebalance(lpos, cpos, rpos); 1886| 37.0k| } 1887| 37.3k|} _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| 17.6k| { 1945| 17.6k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 17.6k| } _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| 406k| { 1925| 406k| return concat_leafs(lpos, tpos, rpos); 1926| 406k| } _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| 406k|{ 1839| 406k| static_assert(Node::bits >= 2, ""); 1840| 406k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 406k, False: 0] ------------------ 1841| 406k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 406k, False: 0] ------------------ 1842| 406k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 406k, False: 0] ------------------ 1843| 406k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 406k, False: 0] ------------------ 1844| 406k| return { 1845| 406k| Node::bits_leaf, 1846| 406k| lpos.node()->inc(), 1847| 406k| lpos.count(), 1848| 406k| tpos.node()->inc(), 1849| 406k| tpos.count(), 1850| 406k| rpos.node()->inc(), 1851| 406k| rpos.count(), 1852| 406k| }; 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| 406k|} _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| 22.2k| { 1938| 22.2k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 22.2k| } _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| 37.0k|{ 1824| 37.0k| auto plan = concat_rebalance_plan{}; 1825| 37.0k| plan.fill(lpos, cpos, rpos); 1826| 37.0k| plan.shuffle(cpos.shift()); 1827| 37.0k| IMMER_TRY { ------------------ | | 49| 37.0k|#define IMMER_TRY try ------------------ 1828| 37.0k| return plan.merge(lpos, cpos, rpos); 1829| 37.0k| } 1830| 37.0k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 37.0k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 37.0k| { 1753| 37.0k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 37.0k, False: 0] ------------------ 1754| 37.0k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 37.0k, False: 0] ------------------ 1755| 37.0k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 37.0k| lpos.each_left_sub(visitor_t{}, *this); 1757| 37.0k| cpos.each_sub(visitor_t{}, *this); 1758| 37.0k| rpos.each_right_sub(visitor_t{}, *this); 1759| 37.0k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 37.0k| { 1803| 37.0k| using node_t = node_type; 1804| 37.0k| using merger_t = concat_merger; 1805| 37.0k| using visitor_t = concat_merger_visitor; 1806| 37.0k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 37.0k| IMMER_TRY { ------------------ | | 49| 37.0k|#define IMMER_TRY try ------------------ 1808| 37.0k| lpos.each_left_sub(visitor_t{}, merger); 1809| 37.0k| cpos.each_sub(visitor_t{}, merger); 1810| 37.0k| rpos.each_right_sub(visitor_t{}, merger); 1811| 37.0k| cpos.each_sub(dec_visitor{}); 1812| 37.0k| return merger.finish(); 1813| 37.0k| } 1814| 37.0k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 37.0k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 388k| { 1945| 388k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 388k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 1.09M| { 1925| 1.09M| return concat_leafs(lpos, tpos, rpos); 1926| 1.09M| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 1.09M|{ 1839| 1.09M| static_assert(Node::bits >= 2, ""); 1840| 1.09M| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 1.09M, False: 0] ------------------ 1841| 1.09M| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 1.09M, False: 0] ------------------ 1842| 1.09M| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 1.09M, False: 0] ------------------ 1843| 1.09M| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 1.09M, False: 0] ------------------ 1844| 1.09M| return { 1845| 1.09M| Node::bits_leaf, 1846| 1.09M| lpos.node()->inc(), 1847| 1.09M| lpos.count(), 1848| 1.09M| tpos.node()->inc(), 1849| 1.09M| tpos.count(), 1850| 1.09M| rpos.node()->inc(), 1851| 1.09M| rpos.count(), 1852| 1.09M| }; 1853| 0| else 1854| 0| return { 1855| 0| Node::bits_leaf, 1856| 0| lpos.node()->inc(), 1857| 0| lpos.count(), 1858| 0| rpos.node()->inc(), 1859| 0| rpos.count(), 1860| 0| }; 1861| 1.09M|} _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| 14.0k| { 1938| 14.0k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 14.0k| } _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| 384k|{ 1824| 384k| auto plan = concat_rebalance_plan{}; 1825| 384k| plan.fill(lpos, cpos, rpos); 1826| 384k| plan.shuffle(cpos.shift()); 1827| 384k| IMMER_TRY { ------------------ | | 49| 384k|#define IMMER_TRY try ------------------ 1828| 384k| return plan.merge(lpos, cpos, rpos); 1829| 384k| } 1830| 384k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 384k|} _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| 384k| { 1753| 384k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 384k, False: 0] ------------------ 1754| 384k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 384k, False: 0] ------------------ 1755| 384k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 384k| lpos.each_left_sub(visitor_t{}, *this); 1757| 384k| cpos.each_sub(visitor_t{}, *this); 1758| 384k| rpos.each_right_sub(visitor_t{}, *this); 1759| 384k| } _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| 384k| { 1803| 384k| using node_t = node_type; 1804| 384k| using merger_t = concat_merger; 1805| 384k| using visitor_t = concat_merger_visitor; 1806| 384k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 384k| IMMER_TRY { ------------------ | | 49| 384k|#define IMMER_TRY try ------------------ 1808| 384k| lpos.each_left_sub(visitor_t{}, merger); 1809| 384k| cpos.each_sub(visitor_t{}, merger); 1810| 384k| rpos.each_right_sub(visitor_t{}, merger); 1811| 384k| cpos.each_sub(dec_visitor{}); 1812| 384k| return merger.finish(); 1813| 384k| } 1814| 384k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 384k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 1.09M| { 1945| 1.09M| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 1.09M| } _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.53M| { 1938| 1.53M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.53M| } _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.18M|{ 1824| 1.18M| auto plan = concat_rebalance_plan{}; 1825| 1.18M| plan.fill(lpos, cpos, rpos); 1826| 1.18M| plan.shuffle(cpos.shift()); 1827| 1.18M| IMMER_TRY { ------------------ | | 49| 1.18M|#define IMMER_TRY try ------------------ 1828| 1.18M| return plan.merge(lpos, cpos, rpos); 1829| 1.18M| } 1830| 1.18M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.18M|} _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.18M| { 1753| 1.18M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.18M, False: 0] ------------------ 1754| 1.18M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.18M, False: 0] ------------------ 1755| 1.18M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.18M| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.18M| cpos.each_sub(visitor_t{}, *this); 1758| 1.18M| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.18M| } _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.18M| { 1803| 1.18M| using node_t = node_type; 1804| 1.18M| using merger_t = concat_merger; 1805| 1.18M| using visitor_t = concat_merger_visitor; 1806| 1.18M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.18M| IMMER_TRY { ------------------ | | 49| 1.18M|#define IMMER_TRY try ------------------ 1808| 1.18M| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.18M| cpos.each_sub(visitor_t{}, merger); 1810| 1.18M| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.18M| cpos.each_sub(dec_visitor{}); 1812| 1.18M| return merger.finish(); 1813| 1.18M| } 1814| 1.18M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.18M| } _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| 4.21M|{ 1824| 4.21M| auto plan = concat_rebalance_plan{}; 1825| 4.21M| plan.fill(lpos, cpos, rpos); 1826| 4.21M| plan.shuffle(cpos.shift()); 1827| 4.21M| IMMER_TRY { ------------------ | | 49| 4.21M|#define IMMER_TRY try ------------------ 1828| 4.21M| return plan.merge(lpos, cpos, rpos); 1829| 4.21M| } 1830| 4.21M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.21M|} _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| 4.21M| { 1753| 4.21M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.21M, False: 0] ------------------ 1754| 4.21M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.21M, False: 0] ------------------ 1755| 4.21M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.21M| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.21M| cpos.each_sub(visitor_t{}, *this); 1758| 4.21M| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.21M| } _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| 4.21M| { 1803| 4.21M| using node_t = node_type; 1804| 4.21M| using merger_t = concat_merger; 1805| 4.21M| using visitor_t = concat_merger_visitor; 1806| 4.21M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.21M| IMMER_TRY { ------------------ | | 49| 4.21M|#define IMMER_TRY try ------------------ 1808| 4.21M| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.21M| cpos.each_sub(visitor_t{}, merger); 1810| 4.21M| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.21M| cpos.each_sub(dec_visitor{}); 1812| 4.21M| return merger.finish(); 1813| 4.21M| } 1814| 4.21M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.21M| } _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| 11.6M| { 1918| 11.6M| return concat_inners(lpos, tpos, rpos); 1919| 11.6M| } _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| 2.60k| { 1918| 2.60k| return concat_inners(lpos, tpos, rpos); 1919| 2.60k| } _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| 85.7k|{ 1873| 85.7k| auto lshift = lpos.shift(); 1874| 85.7k| auto rshift = rpos.shift(); 1875| 85.7k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 64.2k, False: 21.4k] ------------------ 1876| 64.2k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 64.2k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 64.2k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 464, False: 21.0k] ------------------ 1879| 464| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 464| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 21.0k| } else { 1882| 21.0k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 21.0k, False: 0] ------------------ 1883| 21.0k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 21.0k] | Branch (1883:9): [True: 21.0k, False: 0] | Branch (1883:9): [True: 21.0k, False: 0] ------------------ 1884| 21.0k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 21.0k| return concat_rebalance(lpos, cpos, rpos); 1886| 21.0k| } 1887| 85.7k|} _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| 63.5k| { 1898| 63.5k| return concat_inners(lpos, tpos, rpos); 1899| 63.5k| } _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| 3.37k| { 1918| 3.37k| return concat_inners(lpos, tpos, rpos); 1919| 3.37k| } _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| 3.37k|{ 1873| 3.37k| auto lshift = lpos.shift(); 1874| 3.37k| auto rshift = rpos.shift(); 1875| 3.37k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 3.37k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 3.37k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 200, False: 3.17k] ------------------ 1879| 200| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 200| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 3.17k| } else { 1882| 3.17k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 3.17k, False: 0] ------------------ 1883| 3.17k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 3.17k] | Branch (1883:9): [True: 3.17k, False: 0] | Branch (1883:9): [True: 3.17k, False: 0] ------------------ 1884| 3.17k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 3.17k| return concat_rebalance(lpos, cpos, rpos); 1886| 3.17k| } 1887| 3.37k|} _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| 312| { 1938| 312| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 312| } _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| 3.17k|{ 1824| 3.17k| auto plan = concat_rebalance_plan{}; 1825| 3.17k| plan.fill(lpos, cpos, rpos); 1826| 3.17k| plan.shuffle(cpos.shift()); 1827| 3.17k| IMMER_TRY { ------------------ | | 49| 3.17k|#define IMMER_TRY try ------------------ 1828| 3.17k| return plan.merge(lpos, cpos, rpos); 1829| 3.17k| } 1830| 3.17k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.17k|} _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| 3.17k| { 1753| 3.17k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.17k, False: 0] ------------------ 1754| 3.17k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.17k, False: 0] ------------------ 1755| 3.17k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.17k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.17k| cpos.each_sub(visitor_t{}, *this); 1758| 3.17k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.17k| } _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| 3.17k| { 1803| 3.17k| using node_t = node_type; 1804| 3.17k| using merger_t = concat_merger; 1805| 3.17k| using visitor_t = concat_merger_visitor; 1806| 3.17k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.17k| IMMER_TRY { ------------------ | | 49| 3.17k|#define IMMER_TRY try ------------------ 1808| 3.17k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.17k| cpos.each_sub(visitor_t{}, merger); 1810| 3.17k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.17k| cpos.each_sub(dec_visitor{}); 1812| 3.17k| return merger.finish(); 1813| 3.17k| } 1814| 3.17k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.17k| } _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| 2.40k| { 1938| 2.40k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 2.40k| } _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| 21.0k|{ 1824| 21.0k| auto plan = concat_rebalance_plan{}; 1825| 21.0k| plan.fill(lpos, cpos, rpos); 1826| 21.0k| plan.shuffle(cpos.shift()); 1827| 21.0k| IMMER_TRY { ------------------ | | 49| 21.0k|#define IMMER_TRY try ------------------ 1828| 21.0k| return plan.merge(lpos, cpos, rpos); 1829| 21.0k| } 1830| 21.0k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 21.0k|} _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| 21.0k| { 1753| 21.0k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 21.0k, False: 0] ------------------ 1754| 21.0k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 21.0k, False: 0] ------------------ 1755| 21.0k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 21.0k| lpos.each_left_sub(visitor_t{}, *this); 1757| 21.0k| cpos.each_sub(visitor_t{}, *this); 1758| 21.0k| rpos.each_right_sub(visitor_t{}, *this); 1759| 21.0k| } _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| 21.0k| { 1803| 21.0k| using node_t = node_type; 1804| 21.0k| using merger_t = concat_merger; 1805| 21.0k| using visitor_t = concat_merger_visitor; 1806| 21.0k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 21.0k| IMMER_TRY { ------------------ | | 49| 21.0k|#define IMMER_TRY try ------------------ 1808| 21.0k| lpos.each_left_sub(visitor_t{}, merger); 1809| 21.0k| cpos.each_sub(visitor_t{}, merger); 1810| 21.0k| rpos.each_right_sub(visitor_t{}, merger); 1811| 21.0k| cpos.each_sub(dec_visitor{}); 1812| 21.0k| return merger.finish(); 1813| 21.0k| } 1814| 21.0k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 21.0k| } _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| 11.5M| { 1938| 11.5M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 11.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| 13.0M|{ 1824| 13.0M| auto plan = concat_rebalance_plan{}; 1825| 13.0M| plan.fill(lpos, cpos, rpos); 1826| 13.0M| plan.shuffle(cpos.shift()); 1827| 13.0M| IMMER_TRY { ------------------ | | 49| 13.0M|#define IMMER_TRY try ------------------ 1828| 13.0M| return plan.merge(lpos, cpos, rpos); 1829| 13.0M| } 1830| 13.0M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 13.0M|} _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| 13.0M| { 1753| 13.0M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 13.0M, False: 0] ------------------ 1754| 13.0M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 13.0M, False: 0] ------------------ 1755| 13.0M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 13.0M| lpos.each_left_sub(visitor_t{}, *this); 1757| 13.0M| cpos.each_sub(visitor_t{}, *this); 1758| 13.0M| rpos.each_right_sub(visitor_t{}, *this); 1759| 13.0M| } _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| 13.0M| { 1803| 13.0M| using node_t = node_type; 1804| 13.0M| using merger_t = concat_merger; 1805| 13.0M| using visitor_t = concat_merger_visitor; 1806| 13.0M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 13.0M| IMMER_TRY { ------------------ | | 49| 13.0M|#define IMMER_TRY try ------------------ 1808| 13.0M| lpos.each_left_sub(visitor_t{}, merger); 1809| 13.0M| cpos.each_sub(visitor_t{}, merger); 1810| 13.0M| rpos.each_right_sub(visitor_t{}, merger); 1811| 13.0M| cpos.each_sub(dec_visitor{}); 1812| 13.0M| return merger.finish(); 1813| 13.0M| } 1814| 13.0M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 13.0M| } _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| 19.6k| { 1959| 19.6k| return concat_inners(lpos, tpos, rpos); 1960| 19.6k| } _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| 24.0k| { 1972| 24.0k| return visit_maybe_relaxed_sub( 1973| 24.0k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 24.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_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 6.26k| { 1959| 6.26k| return concat_inners(lpos, tpos, rpos); 1960| 6.26k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 17.7k| { 1959| 17.7k| return concat_inners(lpos, tpos, rpos); 1960| 17.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| 188k| { 681| 188k| auto node = pos.node(); 682| 188k| auto level = pos.shift(); 683| 188k| auto idx = pos.count() - 1; 684| 188k| auto children = pos.size(idx); 685| 188k| auto new_idx = 686| 188k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 4.08k, False: 184k] | Branch (686:47): [True: 278, False: 184k] ------------------ 687| 188k| auto new_child = static_cast(nullptr); 688| 188k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 188k, Folded] | Branch (688:38): [True: 185k, False: 2.67k] ------------------ 689| | 690| 188k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 1.87k, False: 186k] ------------------ 691| 1.87k| return nullptr; 692| 186k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 184k, False: 2.49k] ------------------ 693| 184k| new_child = 694| 184k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 182k, False: 1.85k] ------------------ 695| 184k| : pos.last_oh_csh( 696| 1.85k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 184k| if (!new_child) { ------------------ | Branch (697:17): [True: 2.15k, False: 182k] ------------------ 698| 2.15k| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 625, False: 1.52k] ------------------ 699| 625| new_child = node_t::make_path_e(e, level - B, tail); 700| 1.52k| else 701| 1.52k| return nullptr; 702| 2.15k| } 703| 184k| } else 704| 2.49k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 185k| if (mutate) { ------------------ | Branch (706:13): [True: 183k, False: 1.95k] ------------------ 707| 183k| auto count = new_idx + 1; 708| 183k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 183k| node->inner()[new_idx] = new_child; 710| 183k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 183k| relaxed->d.count = count; 712| 183k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 183k, False: 0] ------------------ 713| 183k| return node; 714| 183k| } else { 715| 1.95k| IMMER_TRY { ------------------ | | 49| 1.95k|#define IMMER_TRY try ------------------ 716| 1.95k| auto count = new_idx + 1; 717| 1.95k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 1.95k| auto relaxed = new_node->relaxed(); 719| 1.95k| new_node->inner()[new_idx] = new_child; 720| 1.95k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 1.95k| relaxed->d.count = count; 722| 1.95k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 1.95k, False: 0] ------------------ 723| 1.95k| if (Mutating) ------------------ | Branch (723:21): [True: 1.95k, Folded] ------------------ 724| 1.95k| pos.visit(dec_visitor{}); 725| 1.95k| return new_node; 726| 1.95k| } 727| 1.95k| 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.95k| } 737| 185k| } _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| 152k| { 742| 152k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 152k, False: 0] ------------------ 743| 152k| auto node = pos.node(); 744| 152k| auto idx = pos.index(pos.size() - 1); 745| 152k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 152k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 152k, Folded] | Branch (746:36): [True: 151k, False: 611] ------------------ 747| 152k| if (mutate) { ------------------ | Branch (747:13): [True: 151k, False: 611] ------------------ 748| 151k| node->inner()[new_idx] = 749| 151k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 149k, False: 2.64k] ------------------ 750| | /* otherwise */ 751| 151k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 151k| return node; 753| 151k| } else { 754| 611| auto new_parent = node_t::make_inner_e(e); 755| 611| IMMER_TRY { ------------------ | | 49| 611|#define IMMER_TRY try ------------------ 756| 611| new_parent->inner()[new_idx] = 757| 611| idx == new_idx ------------------ | Branch (757:21): [True: 300, False: 311] ------------------ 758| 611| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 611| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 611| node_t::do_copy_inner(new_parent, node, new_idx); 762| 611| if (Mutating) ------------------ | Branch (762:21): [True: 611, Folded] ------------------ 763| 611| pos.visit(dec_visitor{}); 764| 611| return new_parent; 765| 611| } 766| 611| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 611| } 771| 152k| } _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.35M| { 742| 1.35M| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.35M, False: 0] ------------------ 743| 1.35M| auto node = pos.node(); 744| 1.35M| auto idx = pos.index(pos.size() - 1); 745| 1.35M| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.35M| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 1.35M, Folded] | Branch (746:36): [True: 1.35M, False: 1.98k] ------------------ 747| 1.35M| if (mutate) { ------------------ | Branch (747:13): [True: 1.35M, False: 1.98k] ------------------ 748| 1.35M| node->inner()[new_idx] = 749| 1.35M| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 1.06M, False: 294k] ------------------ 750| | /* otherwise */ 751| 1.35M| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 1.35M| return node; 753| 1.35M| } else { 754| 1.98k| auto new_parent = node_t::make_inner_e(e); 755| 1.98k| IMMER_TRY { ------------------ | | 49| 1.98k|#define IMMER_TRY try ------------------ 756| 1.98k| new_parent->inner()[new_idx] = 757| 1.98k| idx == new_idx ------------------ | Branch (757:21): [True: 1.18k, False: 803] ------------------ 758| 1.98k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.98k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.98k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.98k| if (Mutating) ------------------ | Branch (762:21): [True: 1.98k, Folded] ------------------ 763| 1.98k| pos.visit(dec_visitor{}); 764| 1.98k| return new_parent; 765| 1.98k| } 766| 1.98k| 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.98k| } 771| 1.35M| } _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.31k| { 742| 3.31k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 3.31k, False: 0] ------------------ 743| 3.31k| auto node = pos.node(); 744| 3.31k| auto idx = pos.index(pos.size() - 1); 745| 3.31k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 3.31k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 3.31k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 3.31k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 3.31k] ------------------ 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.31k| } else { 754| 3.31k| auto new_parent = node_t::make_inner_e(e); 755| 3.31k| IMMER_TRY { ------------------ | | 49| 3.31k|#define IMMER_TRY try ------------------ 756| 3.31k| new_parent->inner()[new_idx] = 757| 3.31k| idx == new_idx ------------------ | Branch (757:21): [True: 992, False: 2.32k] ------------------ 758| 3.31k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 3.31k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 3.31k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 3.31k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 3.31k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 3.31k| return new_parent; 765| 3.31k| } 766| 3.31k| 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.31k| } 771| 3.31k| } _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.64k| { 681| 4.64k| auto node = pos.node(); 682| 4.64k| auto level = pos.shift(); 683| 4.64k| auto idx = pos.count() - 1; 684| 4.64k| auto children = pos.size(idx); 685| 4.64k| auto new_idx = 686| 4.64k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 938, False: 3.71k] | Branch (686:47): [True: 195, False: 3.51k] ------------------ 687| 4.64k| auto new_child = static_cast(nullptr); 688| 4.64k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 4.64k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 4.64k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 350, False: 4.29k] ------------------ 691| 350| return nullptr; 692| 4.29k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 3.51k, False: 783] ------------------ 693| 3.51k| new_child = 694| 3.51k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 3.51k] ------------------ 695| 3.51k| : pos.last_oh_csh( 696| 3.51k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 3.51k| if (!new_child) { ------------------ | Branch (697:17): [True: 650, False: 2.86k] ------------------ 698| 650| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 211, False: 439] ------------------ 699| 211| new_child = node_t::make_path_e(e, level - B, tail); 700| 439| else 701| 439| return nullptr; 702| 650| } 703| 3.51k| } else 704| 783| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 3.86k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 3.86k] ------------------ 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.86k| } else { 715| 3.86k| IMMER_TRY { ------------------ | | 49| 3.86k|#define IMMER_TRY try ------------------ 716| 3.86k| auto count = new_idx + 1; 717| 3.86k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 3.86k| auto relaxed = new_node->relaxed(); 719| 3.86k| new_node->inner()[new_idx] = new_child; 720| 3.86k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 3.86k| relaxed->d.count = count; 722| 3.86k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 3.86k, False: 0] ------------------ 723| 3.86k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 3.86k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 3.86k| return new_node; 726| 3.86k| } 727| 3.86k| 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.86k| } 737| 3.86k| } _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| 723| { 742| 723| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 723, False: 0] ------------------ 743| 723| auto node = pos.node(); 744| 723| auto idx = pos.index(pos.size() - 1); 745| 723| auto new_idx = pos.index(pos.size() + branches - 1); 746| 723| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 723] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 723| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 723] ------------------ 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| 723| } else { 754| 723| auto new_parent = node_t::make_inner_e(e); 755| 723| IMMER_TRY { ------------------ | | 49| 723|#define IMMER_TRY try ------------------ 756| 723| new_parent->inner()[new_idx] = 757| 723| idx == new_idx ------------------ | Branch (757:21): [True: 459, False: 264] ------------------ 758| 723| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 723| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 723| node_t::do_copy_inner(new_parent, node, new_idx); 762| 723| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 723] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 723| return new_parent; 765| 723| } 766| 723| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 723| } 771| 723| } _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| 155k| { 742| 155k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 155k, False: 0] ------------------ 743| 155k| auto node = pos.node(); 744| 155k| auto idx = pos.index(pos.size() - 1); 745| 155k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 155k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 155k, Folded] | Branch (746:36): [True: 155k, False: 671] ------------------ 747| 155k| if (mutate) { ------------------ | Branch (747:13): [True: 155k, False: 671] ------------------ 748| 155k| node->inner()[new_idx] = 749| 155k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 147k, False: 7.63k] ------------------ 750| | /* otherwise */ 751| 155k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 155k| return node; 753| 155k| } else { 754| 671| auto new_parent = node_t::make_inner_e(e); 755| 671| IMMER_TRY { ------------------ | | 49| 671|#define IMMER_TRY try ------------------ 756| 671| new_parent->inner()[new_idx] = 757| 671| idx == new_idx ------------------ | Branch (757:21): [True: 380, False: 291] ------------------ 758| 671| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 671| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 671| node_t::do_copy_inner(new_parent, node, new_idx); 762| 671| if (Mutating) ------------------ | Branch (762:21): [True: 671, Folded] ------------------ 763| 671| pos.visit(dec_visitor{}); 764| 671| return new_parent; 765| 671| } 766| 671| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 671| } 771| 155k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEvPT_: 580| 1.91k|{ 581| 1.91k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 1.91k|} _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| 59.6k| { 596| 59.6k| auto offset = pos.index(idx); 597| 59.6k| auto count = pos.count(); 598| 59.6k| auto node = pos.node(); 599| 59.6k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 40.3k, False: 19.2k] ------------------ 600| 40.3k| return pos.towards_oh( 601| 40.3k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 40.3k| } else { 603| 19.2k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 19.2k| IMMER_TRY { ------------------ | | 49| 19.2k|#define IMMER_TRY try ------------------ 605| 19.2k| auto& res = pos.towards_oh( 606| 19.2k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 19.2k| pos.visit(dec_visitor{}); 608| 19.2k| *location = new_node; 609| 19.2k| return res; 610| 19.2k| } 611| 19.2k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 19.2k| } 616| 59.6k| } _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| 9.55k| { 653| 9.55k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 9.55k, False: 0] ------------------ 654| 9.55k| auto node = pos.node(); 655| 9.55k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 737, False: 8.82k] ------------------ 656| 737| return node->leaf()[pos.index(idx)]; 657| 8.82k| } else { 658| 8.82k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 8.82k| pos.visit(dec_visitor{}); 660| 8.82k| *location = new_node; 661| 8.82k| return new_node->leaf()[pos.index(idx)]; 662| 8.82k| } 663| 9.55k| } _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.43k| { 622| 4.43k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 4.43k, False: 0] ------------------ 623| 4.43k| auto offset = pos.index(idx); 624| 4.43k| auto count = pos.count(); 625| 4.43k| auto node = pos.node(); 626| 4.43k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 2.35k, False: 2.08k] ------------------ 627| 2.35k| return pos.towards_oh_ch( 628| 2.35k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 2.35k| } else { 630| 2.08k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 2.08k| IMMER_TRY { ------------------ | | 49| 2.08k|#define IMMER_TRY try ------------------ 632| 2.08k| auto& res = pos.towards_oh_ch(this_t{}, 633| 2.08k| idx, 634| 2.08k| offset, 635| 2.08k| count, 636| 2.08k| e, 637| 2.08k| &new_node->inner()[offset]); 638| 2.08k| pos.visit(dec_visitor{}); 639| 2.08k| *location = new_node; 640| 2.08k| return res; 641| 2.08k| } 642| 2.08k| 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| 2.08k| } 647| 4.43k| } _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.61k| { 653| 3.61k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 3.61k, False: 0] ------------------ 654| 3.61k| auto node = pos.node(); 655| 3.61k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.36k, False: 2.25k] ------------------ 656| 1.36k| return node->leaf()[pos.index(idx)]; 657| 2.25k| } else { 658| 2.25k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 2.25k| pos.visit(dec_visitor{}); 660| 2.25k| *location = new_node; 661| 2.25k| return new_node->leaf()[pos.index(idx)]; 662| 2.25k| } 663| 3.61k| } _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.92k| { 622| 2.92k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.92k, False: 0] ------------------ 623| 2.92k| auto offset = pos.index(idx); 624| 2.92k| auto count = pos.count(); 625| 2.92k| auto node = pos.node(); 626| 2.92k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.12k, False: 1.80k] ------------------ 627| 1.12k| return pos.towards_oh_ch( 628| 1.12k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.80k| } else { 630| 1.80k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.80k| IMMER_TRY { ------------------ | | 49| 1.80k|#define IMMER_TRY try ------------------ 632| 1.80k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.80k| idx, 634| 1.80k| offset, 635| 1.80k| count, 636| 1.80k| e, 637| 1.80k| &new_node->inner()[offset]); 638| 1.80k| pos.visit(dec_visitor{}); 639| 1.80k| *location = new_node; 640| 1.80k| return res; 641| 1.80k| } 642| 1.80k| 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.80k| } 647| 2.92k| } _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| 819| { 653| 819| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 819, False: 0] ------------------ 654| 819| auto node = pos.node(); 655| 819| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 617, False: 202] ------------------ 656| 617| return node->leaf()[pos.index(idx)]; 657| 617| } else { 658| 202| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 202| pos.visit(dec_visitor{}); 660| 202| *location = new_node; 661| 202| return new_node->leaf()[pos.index(idx)]; 662| 202| } 663| 819| } _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.47k| { 622| 2.47k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.47k, False: 0] ------------------ 623| 2.47k| auto offset = pos.index(idx); 624| 2.47k| auto count = pos.count(); 625| 2.47k| auto node = pos.node(); 626| 2.47k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.31k, False: 1.16k] ------------------ 627| 1.31k| return pos.towards_oh_ch( 628| 1.31k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.31k| } else { 630| 1.16k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.16k| IMMER_TRY { ------------------ | | 49| 1.16k|#define IMMER_TRY try ------------------ 632| 1.16k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.16k| idx, 634| 1.16k| offset, 635| 1.16k| count, 636| 1.16k| e, 637| 1.16k| &new_node->inner()[offset]); 638| 1.16k| pos.visit(dec_visitor{}); 639| 1.16k| *location = new_node; 640| 1.16k| return res; 641| 1.16k| } 642| 1.16k| 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.16k| } 647| 2.47k| } _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| 29.7k| { 914| 29.7k| auto idx = pos.index(last); 915| 29.7k| auto node = pos.node(); 916| 29.7k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 29.7k, Folded] | Branch (916:35): [True: 21.0k, False: 8.74k] ------------------ 917| 29.7k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 29.7k, Folded] | Branch (917:25): [True: 16.4k, False: 13.3k] ------------------ 918| 16.4k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 11.7k, False: 4.68k] ------------------ 919| 16.4k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 16.4k| if (Mutating) ------------------ | Branch (920:17): [True: 16.4k, Folded] ------------------ 921| 16.4k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 16.4k| return res; 923| 16.4k| } else { 924| 13.3k| using std::get; 925| 13.3k| auto subs = 926| 13.3k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 9.27k, False: 4.05k] ------------------ 927| 13.3k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 13.3k| auto next = get<1>(subs); 929| 13.3k| auto ts = get<2>(subs); 930| 13.3k| auto tail = get<3>(subs); 931| 13.3k| IMMER_TRY { ------------------ | | 49| 13.3k|#define IMMER_TRY try ------------------ 932| 13.3k| if (next) { ------------------ | Branch (932:21): [True: 8.81k, False: 4.51k] ------------------ 933| 8.81k| if (mutate) { ------------------ | Branch (933:25): [True: 5.96k, False: 2.85k] ------------------ 934| 5.96k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 5.96k| pos.each_right(dec_visitor{}, idx + 1); 936| 5.96k| node->inner()[idx] = next; 937| 5.96k| nodr->d.sizes[idx] = last + 1 - ts; 938| 5.96k| nodr->d.count = idx + 1; 939| 5.96k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 5.96k, False: 0] ------------------ 940| 5.96k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 5.96k| } else { 942| 2.85k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 2.85k| auto newr = newn->relaxed(); 944| 2.85k| newn->inner()[idx] = next; 945| 2.85k| newr->d.sizes[idx] = last + 1 - ts; 946| 2.85k| newr->d.count = idx + 1; 947| 2.85k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 2.85k, False: 0] ------------------ 948| 2.85k| if (Mutating) ------------------ | Branch (948:29): [True: 2.85k, Folded] ------------------ 949| 2.85k| pos.visit(dec_visitor{}); 950| 2.85k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 2.85k| } 952| 8.81k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 4.51k] ------------------ 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.51k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 4.51k, Folded] | Branch (956:40): [True: 3.77k, False: 741] | Branch (956:52): [True: 2.59k, False: 1.18k] ------------------ 957| 2.59k| auto newn = pos.node()->inner()[0]; 958| 2.59k| if (!mutate) ------------------ | Branch (958:25): [True: 774, False: 1.82k] ------------------ 959| 774| newn->inc(); 960| 2.59k| if (Mutating) ------------------ | Branch (960:25): [True: 2.59k, Folded] ------------------ 961| 2.59k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 2.59k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.59k| } else { 964| 1.92k| if (mutate) { ------------------ | Branch (964:25): [True: 1.49k, False: 433] ------------------ 965| 1.49k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.49k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.49k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.49k| } else { 969| 433| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 433| if (Mutating) ------------------ | Branch (970:29): [True: 433, Folded] ------------------ 971| 433| pos.visit(dec_visitor{}); 972| 433| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 433| } 974| 1.92k| } 975| 13.3k| } 976| 13.3k| 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.3k| } 987| 29.7k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.03k| { 1060| 1.03k| auto old_tail_size = pos.count(); 1061| 1.03k| auto new_tail_size = pos.index(last) + 1; 1062| 1.03k| auto node = pos.node(); 1063| 1.03k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.03k, Folded] | Branch (1063:42): [True: 274, False: 763] ------------------ 1064| 1.03k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 226, False: 811] ------------------ 1065| 226| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 226] ------------------ 1066| 0| node->inc(); 1067| 226| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 811| } else if (mutate) { ------------------ | Branch (1068:20): [True: 268, False: 543] ------------------ 1069| 268| detail::destroy_n(node->leaf() + new_tail_size, 1070| 268| old_tail_size - new_tail_size); 1071| 268| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 543| } else { 1073| 543| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 543| if (Mutating) ------------------ | Branch (1074:17): [True: 543, Folded] ------------------ 1075| 543| pos.visit(dec_visitor{}); 1076| 543| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 543| } 1078| 1.03k| } _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| 995| { 1060| 995| auto old_tail_size = pos.count(); 1061| 995| auto new_tail_size = pos.index(last) + 1; 1062| 995| auto node = pos.node(); 1063| 995| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 995] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 995| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 573, False: 422] ------------------ 1065| 573| if (!Mutating) ------------------ | Branch (1065:17): [True: 573, Folded] ------------------ 1066| 573| node->inc(); 1067| 573| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 573| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 422] ------------------ 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| 422| } else { 1073| 422| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 422| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 422] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 422| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 422| } 1078| 995| } _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| 19.5k| { 914| 19.5k| auto idx = pos.index(last); 915| 19.5k| auto node = pos.node(); 916| 19.5k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 19.5k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 19.5k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 19.5k, Folded] | Branch (917:25): [True: 16.9k, False: 2.58k] ------------------ 918| 16.9k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 16.9k] ------------------ 919| 16.9k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 16.9k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 16.9k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 16.9k| return res; 923| 16.9k| } else { 924| 2.58k| using std::get; 925| 2.58k| auto subs = 926| 2.58k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 2.58k] ------------------ 927| 2.58k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 2.58k| auto next = get<1>(subs); 929| 2.58k| auto ts = get<2>(subs); 930| 2.58k| auto tail = get<3>(subs); 931| 2.58k| IMMER_TRY { ------------------ | | 49| 2.58k|#define IMMER_TRY try ------------------ 932| 2.58k| if (next) { ------------------ | Branch (932:21): [True: 1.42k, False: 1.15k] ------------------ 933| 1.42k| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 1.42k] ------------------ 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.42k| } else { 942| 1.42k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.42k| auto newr = newn->relaxed(); 944| 1.42k| newn->inner()[idx] = next; 945| 1.42k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.42k| newr->d.count = idx + 1; 947| 1.42k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.42k, False: 0] ------------------ 948| 1.42k| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 1.42k] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 1.42k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.42k| } 952| 1.42k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 1.15k] ------------------ 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.15k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 1.15k, Folded] | Branch (956:40): [True: 560, False: 597] | Branch (956:52): [True: 244, False: 316] ------------------ 957| 244| auto newn = pos.node()->inner()[0]; 958| 244| if (!mutate) ------------------ | Branch (958:25): [True: 244, False: 0] ------------------ 959| 244| newn->inc(); 960| 244| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 244] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 244| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 913| } else { 964| 913| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 913] ------------------ 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| 913| } else { 969| 913| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 913| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 913] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 913| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 913| } 974| 913| } 975| 2.58k| } 976| 2.58k| 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.58k| } 987| 19.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.10k| { 992| 1.10k| auto idx = pos.index(last); 993| 1.10k| auto node = pos.node(); 994| 1.10k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.10k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.10k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.10k, Folded] | Branch (995:25): [True: 211, False: 895] ------------------ 996| 211| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 211] ------------------ 997| 211| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 211| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 211] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 211| return res; 1001| 895| } else { 1002| 895| using std::get; 1003| 895| auto subs = 1004| 895| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 895] ------------------ 1005| 895| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 895| auto next = get<1>(subs); 1007| 895| auto ts = get<2>(subs); 1008| 895| auto tail = get<3>(subs); 1009| 895| IMMER_TRY { ------------------ | | 49| 895|#define IMMER_TRY try ------------------ 1010| 895| if (next) { ------------------ | Branch (1010:21): [True: 263, False: 632] ------------------ 1011| 263| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 263] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 263| } else { 1016| 263| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 263| newn->inner()[idx] = next; 1018| 263| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 263] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 263| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 263| } 1022| 632| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 632] ------------------ 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| 632| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 632, Folded] | Branch (1026:40): [True: 389, False: 243] | Branch (1026:52): [True: 194, False: 195] ------------------ 1027| 194| auto newn = pos.node()->inner()[0]; 1028| 194| if (!mutate) ------------------ | Branch (1028:25): [True: 194, False: 0] ------------------ 1029| 194| newn->inc(); 1030| 194| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 194] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 194| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 438| } else { 1034| 438| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 438] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 438| } else { 1038| 438| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 438| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 438] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 438| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 438| } 1043| 438| } 1044| 895| } 1045| 895| 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| 895| } 1055| 1.10k| } _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.76k| { 1060| 1.76k| auto old_tail_size = pos.count(); 1061| 1.76k| auto new_tail_size = pos.index(last) + 1; 1062| 1.76k| auto node = pos.node(); 1063| 1.76k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.76k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.76k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 561, False: 1.20k] ------------------ 1065| 561| if (!Mutating) ------------------ | Branch (1065:17): [True: 561, Folded] ------------------ 1066| 561| node->inc(); 1067| 561| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.20k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 1.20k] ------------------ 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.20k| } else { 1073| 1.20k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.20k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 1.20k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 1.20k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.20k| } 1078| 1.76k| } _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.79k| { 992| 1.79k| auto idx = pos.index(last); 993| 1.79k| auto node = pos.node(); 994| 1.79k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.79k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.79k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.79k, Folded] | Branch (995:25): [True: 876, False: 921] ------------------ 996| 876| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 876] ------------------ 997| 876| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 876| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 876] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 876| return res; 1001| 921| } else { 1002| 921| using std::get; 1003| 921| auto subs = 1004| 921| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 921] ------------------ 1005| 921| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 921| auto next = get<1>(subs); 1007| 921| auto ts = get<2>(subs); 1008| 921| auto tail = get<3>(subs); 1009| 921| IMMER_TRY { ------------------ | | 49| 921|#define IMMER_TRY try ------------------ 1010| 921| if (next) { ------------------ | Branch (1010:21): [True: 276, False: 645] ------------------ 1011| 276| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 276] ------------------ 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| 276| } else { 1016| 276| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 276| newn->inner()[idx] = next; 1018| 276| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 276] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 276| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 276| } 1022| 645| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 645] ------------------ 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| 645| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 645, Folded] | Branch (1026:40): [True: 309, False: 336] | Branch (1026:52): [True: 72, False: 237] ------------------ 1027| 72| auto newn = pos.node()->inner()[0]; 1028| 72| if (!mutate) ------------------ | Branch (1028:25): [True: 72, False: 0] ------------------ 1029| 72| newn->inc(); 1030| 72| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 72] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 72| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 573| } else { 1034| 573| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 573] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 573| } else { 1038| 573| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 573| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 573] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 573| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 573| } 1043| 573| } 1044| 921| } 1045| 921| 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| 921| } 1055| 1.79k| } _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.06k| { 1060| 3.06k| auto old_tail_size = pos.count(); 1061| 3.06k| auto new_tail_size = pos.index(last) + 1; 1062| 3.06k| auto node = pos.node(); 1063| 3.06k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 3.06k, Folded] | Branch (1063:42): [True: 650, False: 2.41k] ------------------ 1064| 3.06k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.31k, False: 1.74k] ------------------ 1065| 1.31k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.31k] ------------------ 1066| 0| node->inc(); 1067| 1.31k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.74k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 551, False: 1.19k] ------------------ 1069| 551| detail::destroy_n(node->leaf() + new_tail_size, 1070| 551| old_tail_size - new_tail_size); 1071| 551| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.19k| } else { 1073| 1.19k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.19k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.19k, Folded] ------------------ 1075| 1.19k| pos.visit(dec_visitor{}); 1076| 1.19k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.19k| } 1078| 3.06k| } _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.08k| { 992| 3.08k| auto idx = pos.index(last); 993| 3.08k| auto node = pos.node(); 994| 3.08k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.08k, Folded] | Branch (994:35): [True: 1.25k, False: 1.83k] ------------------ 995| 3.08k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.08k] | 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.08k| } else { 1002| 3.08k| using std::get; 1003| 3.08k| auto subs = 1004| 3.08k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 1.25k, False: 1.83k] ------------------ 1005| 3.08k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.08k| auto next = get<1>(subs); 1007| 3.08k| auto ts = get<2>(subs); 1008| 3.08k| auto tail = get<3>(subs); 1009| 3.08k| IMMER_TRY { ------------------ | | 49| 3.08k|#define IMMER_TRY try ------------------ 1010| 3.08k| if (next) { ------------------ | Branch (1010:21): [True: 859, False: 2.22k] ------------------ 1011| 859| if (mutate) { ------------------ | Branch (1011:25): [True: 343, False: 516] ------------------ 1012| 343| node->inner()[idx] = next; 1013| 343| pos.each_right(dec_visitor{}, idx + 1); 1014| 343| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 516| } else { 1016| 516| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 516| newn->inner()[idx] = next; 1018| 516| if (Mutating) ------------------ | Branch (1018:29): [True: 516, Folded] ------------------ 1019| 516| pos.visit(dec_visitor{}); 1020| 516| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 516| } 1022| 2.22k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 813, False: 1.41k] ------------------ 1023| 813| if (Mutating) ------------------ | Branch (1023:25): [True: 813, Folded] ------------------ 1024| 813| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 813| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.41k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.41k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [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.41k| } else { 1034| 1.41k| if (mutate) { ------------------ | Branch (1034:25): [True: 541, False: 872] ------------------ 1035| 541| pos.each_right(dec_visitor{}, idx + 1); 1036| 541| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 872| } else { 1038| 872| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 872| if (Mutating) ------------------ | Branch (1039:29): [True: 872, Folded] ------------------ 1040| 872| pos.visit(dec_visitor{}); 1041| 872| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 872| } 1043| 1.41k| } 1044| 3.08k| } 1045| 3.08k| 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.08k| } 1055| 3.08k| } _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.87k| { 879| 2.87k| using node_t = node_type; 880| 2.87k| auto node = p.node(); 881| 2.87k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.52k, False: 1.35k] ------------------ 882| 1.52k| p.each_right(dec_t{}, idx); 883| 1.52k| node_t::delete_inner(node, p.count()); 884| 1.52k| } 885| 2.87k| } _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| 9.22k| { 1060| 9.22k| auto old_tail_size = pos.count(); 1061| 9.22k| auto new_tail_size = pos.index(last) + 1; 1062| 9.22k| auto node = pos.node(); 1063| 9.22k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 9.22k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 9.22k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.50k, False: 7.72k] ------------------ 1065| 1.50k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.50k, Folded] ------------------ 1066| 1.50k| node->inc(); 1067| 1.50k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 7.72k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 7.72k] ------------------ 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| 7.72k| } else { 1073| 7.72k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 7.72k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 7.72k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 7.72k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 7.72k| } 1078| 9.22k| } _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| 5.11k| { 992| 5.11k| auto idx = pos.index(last); 993| 5.11k| auto node = pos.node(); 994| 5.11k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 5.11k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 5.11k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 5.11k] | 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| 5.11k| } else { 1002| 5.11k| using std::get; 1003| 5.11k| auto subs = 1004| 5.11k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 5.11k] ------------------ 1005| 5.11k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.11k| auto next = get<1>(subs); 1007| 5.11k| auto ts = get<2>(subs); 1008| 5.11k| auto tail = get<3>(subs); 1009| 5.11k| IMMER_TRY { ------------------ | | 49| 5.11k|#define IMMER_TRY try ------------------ 1010| 5.11k| if (next) { ------------------ | Branch (1010:21): [True: 587, False: 4.52k] ------------------ 1011| 587| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 587] ------------------ 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| 587| } else { 1016| 587| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 587| newn->inner()[idx] = next; 1018| 587| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 587] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 587| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 587| } 1022| 4.52k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.09k, False: 3.43k] ------------------ 1023| 1.09k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.09k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.09k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.43k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 3.43k] | 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| 3.43k| } else { 1034| 3.43k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 3.43k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 3.43k| } else { 1038| 3.43k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 3.43k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 3.43k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 3.43k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 3.43k| } 1043| 3.43k| } 1044| 5.11k| } 1045| 5.11k| 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.11k| } 1055| 5.11k| } _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| 414| { 1060| 414| auto old_tail_size = pos.count(); 1061| 414| auto new_tail_size = pos.index(last) + 1; 1062| 414| auto node = pos.node(); 1063| 414| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 414] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 414| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 195, False: 219] ------------------ 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| 219| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 219] ------------------ 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| 219| } else { 1073| 219| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 219| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 219] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 219| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 219| } 1078| 414| } _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.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: 202, False: 1.41k] ------------------ 1064| 1.61k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 352, False: 1.26k] ------------------ 1065| 352| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 352] ------------------ 1066| 0| node->inc(); 1067| 352| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.26k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 200, False: 1.06k] ------------------ 1069| 200| detail::destroy_n(node->leaf() + new_tail_size, 1070| 200| old_tail_size - new_tail_size); 1071| 200| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.06k| } else { 1073| 1.06k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.06k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.06k, Folded] ------------------ 1075| 1.06k| pos.visit(dec_visitor{}); 1076| 1.06k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.06k| } 1078| 1.61k| } _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| 3.97k| { 992| 3.97k| auto idx = pos.index(last); 993| 3.97k| auto node = pos.node(); 994| 3.97k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.97k, Folded] | Branch (994:35): [True: 2.95k, False: 1.02k] ------------------ 995| 3.97k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.97k] | 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.97k| } else { 1002| 3.97k| using std::get; 1003| 3.97k| auto subs = 1004| 3.97k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.95k, False: 1.02k] ------------------ 1005| 3.97k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.97k| auto next = get<1>(subs); 1007| 3.97k| auto ts = get<2>(subs); 1008| 3.97k| auto tail = get<3>(subs); 1009| 3.97k| IMMER_TRY { ------------------ | | 49| 3.97k|#define IMMER_TRY try ------------------ 1010| 3.97k| if (next) { ------------------ | Branch (1010:21): [True: 1.62k, False: 2.34k] ------------------ 1011| 1.62k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.05k, False: 569] ------------------ 1012| 1.05k| node->inner()[idx] = next; 1013| 1.05k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.05k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.05k| } else { 1016| 569| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 569| newn->inner()[idx] = next; 1018| 569| if (Mutating) ------------------ | Branch (1018:29): [True: 569, Folded] ------------------ 1019| 569| pos.visit(dec_visitor{}); 1020| 569| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 569| } 1022| 2.34k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.61k, False: 733] ------------------ 1023| 1.61k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.61k, Folded] ------------------ 1024| 1.61k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.61k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.61k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 733] | 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| 733| } else { 1034| 733| if (mutate) { ------------------ | Branch (1034:25): [True: 505, False: 228] ------------------ 1035| 505| pos.each_right(dec_visitor{}, idx + 1); 1036| 505| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 505| } else { 1038| 228| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 228| if (Mutating) ------------------ | Branch (1039:29): [True: 228, Folded] ------------------ 1040| 228| pos.visit(dec_visitor{}); 1041| 228| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 228| } 1043| 733| } 1044| 3.97k| } 1045| 3.97k| 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.97k| } 1055| 3.97k| } _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.61k| { 879| 1.61k| using node_t = node_type; 880| 1.61k| auto node = p.node(); 881| 1.61k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.39k, False: 223] ------------------ 882| 1.39k| p.each_right(dec_t{}, idx); 883| 1.39k| node_t::delete_inner(node, p.count()); 884| 1.39k| } 885| 1.61k| } _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.46k| { 1060| 2.46k| auto old_tail_size = pos.count(); 1061| 2.46k| auto new_tail_size = pos.index(last) + 1; 1062| 2.46k| auto node = pos.node(); 1063| 2.46k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.46k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.46k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 338, False: 2.12k] ------------------ 1065| 338| if (!Mutating) ------------------ | Branch (1065:17): [True: 338, Folded] ------------------ 1066| 338| node->inc(); 1067| 338| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.12k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 2.12k] ------------------ 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.12k| } else { 1073| 2.12k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 2.12k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 2.12k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 2.12k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 2.12k| } 1078| 2.46k| } _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.27k| { 992| 3.27k| auto idx = pos.index(last); 993| 3.27k| auto node = pos.node(); 994| 3.27k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.27k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.27k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.27k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.27k| } else { 1002| 3.27k| using std::get; 1003| 3.27k| auto subs = 1004| 3.27k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.27k] ------------------ 1005| 3.27k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.27k| auto next = get<1>(subs); 1007| 3.27k| auto ts = get<2>(subs); 1008| 3.27k| auto tail = get<3>(subs); 1009| 3.27k| IMMER_TRY { ------------------ | | 49| 3.27k|#define IMMER_TRY try ------------------ 1010| 3.27k| if (next) { ------------------ | Branch (1010:21): [True: 917, False: 2.35k] ------------------ 1011| 917| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 917] ------------------ 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| 917| } else { 1016| 917| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 917| newn->inner()[idx] = next; 1018| 917| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 917] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 917| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 917| } 1022| 2.35k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 690, False: 1.66k] ------------------ 1023| 690| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 690] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 690| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.66k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.66k] | 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.66k| } else { 1034| 1.66k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.66k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.66k| } else { 1038| 1.66k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.66k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.66k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.66k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.66k| } 1043| 1.66k| } 1044| 3.27k| } 1045| 3.27k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.27k| } 1055| 3.27k| } _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.2k| { 868| 20.2k| using node_t = node_type; 869| 20.2k| auto node = p.node(); 870| 20.2k| if (node->dec()) { ------------------ | Branch (870:13): [True: 14.3k, False: 5.95k] ------------------ 871| 14.3k| p.each_right(dec_t{}, idx); 872| 14.3k| node_t::delete_inner_r(node, p.count()); 873| 14.3k| } 874| 20.2k| } _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| 3.03k| { 1060| 3.03k| auto old_tail_size = pos.count(); 1061| 3.03k| auto new_tail_size = pos.index(last) + 1; 1062| 3.03k| auto node = pos.node(); 1063| 3.03k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 3.03k, Folded] | Branch (1063:42): [True: 276, False: 2.75k] ------------------ 1064| 3.03k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.10k, False: 1.93k] ------------------ 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| 1.93k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 223, False: 1.70k] ------------------ 1069| 223| detail::destroy_n(node->leaf() + new_tail_size, 1070| 223| old_tail_size - new_tail_size); 1071| 223| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.70k| } else { 1073| 1.70k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.70k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.70k, Folded] ------------------ 1075| 1.70k| pos.visit(dec_visitor{}); 1076| 1.70k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.70k| } 1078| 3.03k| } _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.67k| { 914| 4.67k| auto idx = pos.index(last); 915| 4.67k| auto node = pos.node(); 916| 4.67k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 4.67k, Folded] | Branch (916:35): [True: 3.11k, False: 1.55k] ------------------ 917| 4.67k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 4.67k] | 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.67k| } else { 924| 4.67k| using std::get; 925| 4.67k| auto subs = 926| 4.67k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 3.11k, False: 1.55k] ------------------ 927| 4.67k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 4.67k| auto next = get<1>(subs); 929| 4.67k| auto ts = get<2>(subs); 930| 4.67k| auto tail = get<3>(subs); 931| 4.67k| IMMER_TRY { ------------------ | | 49| 4.67k|#define IMMER_TRY try ------------------ 932| 4.67k| if (next) { ------------------ | Branch (932:21): [True: 1.61k, False: 3.06k] ------------------ 933| 1.61k| if (mutate) { ------------------ | Branch (933:25): [True: 1.30k, False: 305] ------------------ 934| 1.30k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 1.30k| pos.each_right(dec_visitor{}, idx + 1); 936| 1.30k| node->inner()[idx] = next; 937| 1.30k| nodr->d.sizes[idx] = last + 1 - ts; 938| 1.30k| nodr->d.count = idx + 1; 939| 1.30k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 1.30k, False: 0] ------------------ 940| 1.30k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 1.30k| } else { 942| 305| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 305| auto newr = newn->relaxed(); 944| 305| newn->inner()[idx] = next; 945| 305| newr->d.sizes[idx] = last + 1 - ts; 946| 305| newr->d.count = idx + 1; 947| 305| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 305, False: 0] ------------------ 948| 305| if (Mutating) ------------------ | Branch (948:29): [True: 305, Folded] ------------------ 949| 305| pos.visit(dec_visitor{}); 950| 305| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 305| } 952| 3.06k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 1.24k, False: 1.81k] ------------------ 953| 1.24k| if (Mutating) ------------------ | Branch (953:25): [True: 1.24k, Folded] ------------------ 954| 1.24k| pos.visit(dec_right_visitor{}, count_t{1}); 955| 1.24k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.81k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.81k] | 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.81k| } else { 964| 1.81k| if (mutate) { ------------------ | Branch (964:25): [True: 1.06k, False: 754] ------------------ 965| 1.06k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.06k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.06k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.06k| } else { 969| 754| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 754| if (Mutating) ------------------ | Branch (970:29): [True: 754, Folded] ------------------ 971| 754| pos.visit(dec_visitor{}); 972| 754| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 754| } 974| 1.81k| } 975| 4.67k| } 976| 4.67k| 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.67k| } 987| 4.67k| } _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| 4.68k| { 992| 4.68k| auto idx = pos.index(last); 993| 4.68k| auto node = pos.node(); 994| 4.68k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.68k, Folded] | Branch (994:35): [True: 3.47k, False: 1.21k] ------------------ 995| 4.68k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.68k] | 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.68k| } else { 1002| 4.68k| using std::get; 1003| 4.68k| auto subs = 1004| 4.68k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.47k, False: 1.21k] ------------------ 1005| 4.68k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.68k| auto next = get<1>(subs); 1007| 4.68k| auto ts = get<2>(subs); 1008| 4.68k| auto tail = get<3>(subs); 1009| 4.68k| IMMER_TRY { ------------------ | | 49| 4.68k|#define IMMER_TRY try ------------------ 1010| 4.68k| if (next) { ------------------ | Branch (1010:21): [True: 3.17k, False: 1.51k] ------------------ 1011| 3.17k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.65k, False: 513] ------------------ 1012| 2.65k| node->inner()[idx] = next; 1013| 2.65k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.65k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.65k| } else { 1016| 513| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 513| newn->inner()[idx] = next; 1018| 513| if (Mutating) ------------------ | Branch (1018:29): [True: 513, Folded] ------------------ 1019| 513| pos.visit(dec_visitor{}); 1020| 513| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 513| } 1022| 3.17k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 849, False: 667] ------------------ 1023| 849| if (Mutating) ------------------ | Branch (1023:25): [True: 849, Folded] ------------------ 1024| 849| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 849| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 849| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 667] | 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| 667| } else { 1034| 667| if (mutate) { ------------------ | Branch (1034:25): [True: 222, False: 445] ------------------ 1035| 222| pos.each_right(dec_visitor{}, idx + 1); 1036| 222| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 445| } else { 1038| 445| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 445| if (Mutating) ------------------ | Branch (1039:29): [True: 445, Folded] ------------------ 1040| 445| pos.visit(dec_visitor{}); 1041| 445| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 445| } 1043| 667| } 1044| 4.68k| } 1045| 4.68k| 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.68k| } 1055| 4.68k| } _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.98k| { 879| 9.98k| using node_t = node_type; 880| 9.98k| auto node = p.node(); 881| 9.98k| if (node->dec()) { ------------------ | Branch (881:13): [True: 6.71k, False: 3.26k] ------------------ 882| 6.71k| p.each_right(dec_t{}, idx); 883| 6.71k| node_t::delete_inner(node, p.count()); 884| 6.71k| } 885| 9.98k| } _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.18k| { 1060| 5.18k| auto old_tail_size = pos.count(); 1061| 5.18k| auto new_tail_size = pos.index(last) + 1; 1062| 5.18k| auto node = pos.node(); 1063| 5.18k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 5.18k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 5.18k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.03k, False: 4.14k] ------------------ 1065| 1.03k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.03k, Folded] ------------------ 1066| 1.03k| node->inc(); 1067| 1.03k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 4.14k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 4.14k] ------------------ 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.14k| } else { 1073| 4.14k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 4.14k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 4.14k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 4.14k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 4.14k| } 1078| 5.18k| } _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.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): [Folded, False: 4.36k] | Branch (916:35): [True: 0, False: 0] ------------------ 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): [Folded, False: 0] ------------------ 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: 0, False: 4.36k] ------------------ 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.14k, False: 3.21k] ------------------ 933| 1.14k| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 1.14k] ------------------ 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.14k| } else { 942| 1.14k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.14k| auto newr = newn->relaxed(); 944| 1.14k| newn->inner()[idx] = next; 945| 1.14k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.14k| newr->d.count = idx + 1; 947| 1.14k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.14k, False: 0] ------------------ 948| 1.14k| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 1.14k] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 1.14k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.14k| } 952| 3.21k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 1.08k, False: 2.13k] ------------------ 953| 1.08k| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 1.08k] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 1.08k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 2.13k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 2.13k] | 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.13k| } else { 964| 2.13k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 2.13k] ------------------ 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.13k| } else { 969| 2.13k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 2.13k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 2.13k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 2.13k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 2.13k| } 974| 2.13k| } 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_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.01k| { 992| 3.01k| auto idx = pos.index(last); 993| 3.01k| auto node = pos.node(); 994| 3.01k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.01k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.01k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.01k] | 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.01k| } else { 1002| 3.01k| using std::get; 1003| 3.01k| auto subs = 1004| 3.01k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.01k] ------------------ 1005| 3.01k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.01k| auto next = get<1>(subs); 1007| 3.01k| auto ts = get<2>(subs); 1008| 3.01k| auto tail = get<3>(subs); 1009| 3.01k| IMMER_TRY { ------------------ | | 49| 3.01k|#define IMMER_TRY try ------------------ 1010| 3.01k| if (next) { ------------------ | Branch (1010:21): [True: 2.12k, False: 885] ------------------ 1011| 2.12k| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 2.12k] ------------------ 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.12k| } else { 1016| 2.12k| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 2.12k| newn->inner()[idx] = next; 1018| 2.12k| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 2.12k] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 2.12k| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 2.12k| } 1022| 2.12k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 562, False: 323] ------------------ 1023| 562| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 562] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 562| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 562| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 323] | 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| 323| } else { 1034| 323| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 323] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 323| } else { 1038| 323| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 323| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 323] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 323| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 323| } 1043| 323| } 1044| 3.01k| } 1045| 3.01k| 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.01k| } 1055| 3.01k| } _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| 12.0k| { 992| 12.0k| auto idx = pos.index(last); 993| 12.0k| auto node = pos.node(); 994| 12.0k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 12.0k, Folded] | Branch (994:35): [True: 7.91k, False: 4.14k] ------------------ 995| 12.0k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 12.0k, Folded] | Branch (995:25): [True: 6.87k, False: 5.19k] ------------------ 996| 6.87k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 4.51k, False: 2.35k] ------------------ 997| 6.87k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 6.87k| if (Mutating) ------------------ | Branch (998:17): [True: 6.87k, Folded] ------------------ 999| 6.87k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 6.87k| return res; 1001| 6.87k| } else { 1002| 5.19k| using std::get; 1003| 5.19k| auto subs = 1004| 5.19k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.40k, False: 1.79k] ------------------ 1005| 5.19k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.19k| auto next = get<1>(subs); 1007| 5.19k| auto ts = get<2>(subs); 1008| 5.19k| auto tail = get<3>(subs); 1009| 5.19k| IMMER_TRY { ------------------ | | 49| 5.19k|#define IMMER_TRY try ------------------ 1010| 5.19k| if (next) { ------------------ | Branch (1010:21): [True: 1.04k, False: 4.15k] ------------------ 1011| 1.04k| if (mutate) { ------------------ | Branch (1011:25): [True: 497, False: 547] ------------------ 1012| 497| node->inner()[idx] = next; 1013| 497| pos.each_right(dec_visitor{}, idx + 1); 1014| 497| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 547| } else { 1016| 547| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 547| newn->inner()[idx] = next; 1018| 547| if (Mutating) ------------------ | Branch (1018:29): [True: 547, Folded] ------------------ 1019| 547| pos.visit(dec_visitor{}); 1020| 547| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 547| } 1022| 4.15k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 4.15k] ------------------ 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.15k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 4.15k, Folded] | Branch (1026:40): [True: 3.72k, False: 424] | Branch (1026:52): [True: 2.26k, False: 1.46k] ------------------ 1027| 2.26k| auto newn = pos.node()->inner()[0]; 1028| 2.26k| if (!mutate) ------------------ | Branch (1028:25): [True: 657, False: 1.60k] ------------------ 1029| 657| newn->inc(); 1030| 2.26k| if (Mutating) ------------------ | Branch (1030:25): [True: 2.26k, Folded] ------------------ 1031| 2.26k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 2.26k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 2.26k| } else { 1034| 1.89k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.30k, False: 588] ------------------ 1035| 1.30k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.30k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.30k| } else { 1038| 588| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 588| if (Mutating) ------------------ | Branch (1039:29): [True: 588, Folded] ------------------ 1040| 588| pos.visit(dec_visitor{}); 1041| 588| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 588| } 1043| 1.89k| } 1044| 5.19k| } 1045| 5.19k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 5.19k| } 1055| 12.0k| } _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.62k| { 1060| 1.62k| auto old_tail_size = pos.count(); 1061| 1.62k| auto new_tail_size = pos.index(last) + 1; 1062| 1.62k| auto node = pos.node(); 1063| 1.62k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.62k, Folded] | Branch (1063:42): [True: 581, False: 1.04k] ------------------ 1064| 1.62k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 398, False: 1.22k] ------------------ 1065| 398| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 398] ------------------ 1066| 0| node->inc(); 1067| 398| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.22k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 581, False: 646] ------------------ 1069| 581| detail::destroy_n(node->leaf() + new_tail_size, 1070| 581| old_tail_size - new_tail_size); 1071| 581| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 646| } else { 1073| 646| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 646| if (Mutating) ------------------ | Branch (1074:17): [True: 646, Folded] ------------------ 1075| 646| pos.visit(dec_visitor{}); 1076| 646| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 646| } 1078| 1.62k| } _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.13k| { 992| 3.13k| auto idx = pos.index(last); 993| 3.13k| auto node = pos.node(); 994| 3.13k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.13k, Folded] | Branch (994:35): [True: 1.58k, False: 1.54k] ------------------ 995| 3.13k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.13k, Folded] | Branch (995:25): [True: 1.47k, False: 1.66k] ------------------ 996| 1.47k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 937, False: 534] ------------------ 997| 1.47k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 1.47k| if (Mutating) ------------------ | Branch (998:17): [True: 1.47k, Folded] ------------------ 999| 1.47k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 1.47k| return res; 1001| 1.66k| } else { 1002| 1.66k| using std::get; 1003| 1.66k| auto subs = 1004| 1.66k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 651, False: 1.01k] ------------------ 1005| 1.66k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.66k| auto next = get<1>(subs); 1007| 1.66k| auto ts = get<2>(subs); 1008| 1.66k| auto tail = get<3>(subs); 1009| 1.66k| IMMER_TRY { ------------------ | | 49| 1.66k|#define IMMER_TRY try ------------------ 1010| 1.66k| if (next) { ------------------ | Branch (1010:21): [True: 368, False: 1.29k] ------------------ 1011| 368| if (mutate) { ------------------ | Branch (1011:25): [True: 77, False: 291] ------------------ 1012| 77| node->inner()[idx] = next; 1013| 77| pos.each_right(dec_visitor{}, idx + 1); 1014| 77| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 291| } else { 1016| 291| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 291| newn->inner()[idx] = next; 1018| 291| if (Mutating) ------------------ | Branch (1018:29): [True: 291, Folded] ------------------ 1019| 291| pos.visit(dec_visitor{}); 1020| 291| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 291| } 1022| 1.29k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.29k] ------------------ 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.29k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.29k, Folded] | Branch (1026:40): [True: 995, False: 299] | Branch (1026:52): [True: 591, False: 404] ------------------ 1027| 591| auto newn = pos.node()->inner()[0]; 1028| 591| if (!mutate) ------------------ | Branch (1028:25): [True: 377, False: 214] ------------------ 1029| 377| newn->inc(); 1030| 591| if (Mutating) ------------------ | Branch (1030:25): [True: 591, Folded] ------------------ 1031| 591| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 591| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 703| } else { 1034| 703| if (mutate) { ------------------ | Branch (1034:25): [True: 360, False: 343] ------------------ 1035| 360| pos.each_right(dec_visitor{}, idx + 1); 1036| 360| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 360| } else { 1038| 343| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 343| if (Mutating) ------------------ | Branch (1039:29): [True: 343, Folded] ------------------ 1040| 343| pos.visit(dec_visitor{}); 1041| 343| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 343| } 1043| 703| } 1044| 1.66k| } 1045| 1.66k| 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.66k| } 1055| 3.13k| } _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| 694| { 1060| 694| auto old_tail_size = pos.count(); 1061| 694| auto new_tail_size = pos.index(last) + 1; 1062| 694| auto node = pos.node(); 1063| 694| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 694, Folded] | Branch (1063:42): [True: 267, False: 427] ------------------ 1064| 694| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 236, False: 458] ------------------ 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| 458| } else if (mutate) { ------------------ | Branch (1068:20): [True: 200, False: 258] ------------------ 1069| 200| detail::destroy_n(node->leaf() + new_tail_size, 1070| 200| old_tail_size - new_tail_size); 1071| 200| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 258| } else { 1073| 258| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 258| if (Mutating) ------------------ | Branch (1074:17): [True: 258, Folded] ------------------ 1075| 258| pos.visit(dec_visitor{}); 1076| 258| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 258| } 1078| 694| } _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| 909| { 1378| 909| auto node = pos.node(); 1379| 909| auto idx = pos.index(first); 1380| 909| auto count = pos.count(); 1381| 909| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 909| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 651, False: 258] ------------------ 1384| 909| if (mutate) { ------------------ | Branch (1384:13): [True: 651, False: 258] ------------------ 1385| 651| auto data = node->leaf(); 1386| 651| auto newcount = count - idx; 1387| 651| std::move(data + idx, data + count, data); 1388| 651| detail::destroy_n(data + newcount, idx); 1389| 651| return std::make_tuple(0, node); 1390| 651| } else { 1391| 258| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 258| if (Mutating) ------------------ | Branch (1392:17): [True: 258, Folded] ------------------ 1393| 258| pos.visit(dec_visitor{}); 1394| 258| return std::make_tuple(0, newn); 1395| 258| } 1396| 909| } _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| 61.8k| { 1247| 61.8k| auto idx = pos.subindex(first); 1248| 61.8k| auto count = pos.count(); 1249| 61.8k| auto node = pos.node(); 1250| 61.8k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 61.8k, Folded] | Branch (1250:47): [True: 46.5k, False: 15.3k] ------------------ 1251| 61.8k| auto left_size = pos.size_before(idx); 1252| 61.8k| auto child_size = pos.size_sbh(idx, left_size); 1253| 61.8k| auto dropped_size = first; 1254| 61.8k| auto child_dropped_size = dropped_size - left_size; 1255| 61.8k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 61.8k, Folded] | Branch (1255:25): [True: 60.1k, False: 1.77k] | Branch (1255:45): [True: 4.96k, False: 55.1k] ------------------ 1256| 4.96k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 2.12k, False: 2.83k] ------------------ 1257| 4.96k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 4.96k| if (mutate) ------------------ | Branch (1258:17): [True: 2.12k, False: 2.83k] ------------------ 1259| 2.12k| pos.visit(dec_left_visitor{}, idx); 1260| 2.83k| else if (Mutating) ------------------ | Branch (1260:22): [True: 2.83k, Folded] ------------------ 1261| 2.83k| pos.visit(dec_visitor{}); 1262| 4.96k| return r; 1263| 56.9k| } else { 1264| 56.9k| using std::get; 1265| 56.9k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 44.4k, False: 12.4k] ------------------ 1266| 56.9k| : node_t::make_inner_r_e(e); 1267| 56.9k| auto newr = newn->relaxed(); 1268| 56.9k| auto newcount = count - idx; 1269| 56.9k| auto new_child_size = child_size - child_dropped_size; 1270| 56.9k| IMMER_TRY { ------------------ | | 49| 56.9k|#define IMMER_TRY try ------------------ 1271| 56.9k| auto subs = 1272| 56.9k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 44.4k, False: 12.4k] ------------------ 1273| 56.9k| : pos.towards_sub_oh( 1274| 12.4k| no_collapse_no_mut_t{}, first, idx, e); 1275| 56.9k| if (mutate) ------------------ | Branch (1275:21): [True: 44.4k, False: 12.4k] ------------------ 1276| 44.4k| pos.each_left(dec_visitor{}, idx); 1277| 56.9k| pos.copy_sizes( 1278| 56.9k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 56.9k| std::copy(node->inner() + idx + 1, 1280| 56.9k| node->inner() + count, 1281| 56.9k| newn->inner() + 1); 1282| 56.9k| newn->inner()[0] = get<1>(subs); 1283| 56.9k| newr->d.sizes[0] = new_child_size; 1284| 56.9k| newr->d.count = newcount; 1285| 56.9k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 56.9k, False: 0] ------------------ 1286| 56.9k| if (!mutate) { ------------------ | Branch (1286:21): [True: 12.4k, False: 44.4k] ------------------ 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| 56.9k| return std::make_tuple(pos.shift(), newn); 1292| 56.9k| } 1293| 56.9k| 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| 56.9k| } 1299| 61.8k| } _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.30k| { 1247| 2.30k| auto idx = pos.subindex(first); 1248| 2.30k| auto count = pos.count(); 1249| 2.30k| auto node = pos.node(); 1250| 2.30k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.30k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.30k| auto left_size = pos.size_before(idx); 1252| 2.30k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.30k| auto dropped_size = first; 1254| 2.30k| auto child_dropped_size = dropped_size - left_size; 1255| 2.30k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.30k, Folded] | Branch (1255:25): [True: 916, False: 1.38k] | Branch (1255:45): [True: 638, False: 278] ------------------ 1256| 638| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 638] ------------------ 1257| 638| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 638| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 638] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 638| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 638] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 638| return r; 1263| 1.66k| } else { 1264| 1.66k| using std::get; 1265| 1.66k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.66k] ------------------ 1266| 1.66k| : node_t::make_inner_r_e(e); 1267| 1.66k| auto newr = newn->relaxed(); 1268| 1.66k| auto newcount = count - idx; 1269| 1.66k| auto new_child_size = child_size - child_dropped_size; 1270| 1.66k| IMMER_TRY { ------------------ | | 49| 1.66k|#define IMMER_TRY try ------------------ 1271| 1.66k| auto subs = 1272| 1.66k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.66k] ------------------ 1273| 1.66k| : pos.towards_sub_oh( 1274| 1.66k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.66k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.66k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.66k| pos.copy_sizes( 1278| 1.66k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.66k| std::copy(node->inner() + idx + 1, 1280| 1.66k| node->inner() + count, 1281| 1.66k| newn->inner() + 1); 1282| 1.66k| newn->inner()[0] = get<1>(subs); 1283| 1.66k| newr->d.sizes[0] = new_child_size; 1284| 1.66k| newr->d.count = newcount; 1285| 1.66k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.66k, False: 0] ------------------ 1286| 1.66k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.66k, False: 0] ------------------ 1287| 1.66k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.66k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.66k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.66k| } 1291| 1.66k| return std::make_tuple(pos.shift(), newn); 1292| 1.66k| } 1293| 1.66k| 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.66k| } 1299| 2.30k| } _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| 1.95k| { 1304| 1.95k| auto idx = pos.subindex(first); 1305| 1.95k| auto count = pos.count(); 1306| 1.95k| auto node = pos.node(); 1307| 1.95k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.95k] ------------------ 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.95k| auto left_size = pos.size_before(idx); 1313| 1.95k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.95k| auto dropped_size = first; 1315| 1.95k| auto child_dropped_size = dropped_size - left_size; 1316| 1.95k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 1.95k, Folded] | Branch (1316:25): [True: 935, False: 1.01k] | Branch (1316:45): [True: 692, False: 243] ------------------ 1317| 692| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 692] ------------------ 1318| 692| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 692| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 692] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 692| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 692] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 692| return r; 1324| 1.25k| } else { 1325| 1.25k| 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.25k| auto newcount = count - idx; 1330| 1.25k| auto newn = 1331| 1.25k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.25k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.25k| : node_t::make_inner_r_e(e); 1336| 1.25k| auto newr = newn->relaxed(); 1337| 1.25k| IMMER_TRY { ------------------ | | 49| 1.25k|#define IMMER_TRY try ------------------ 1338| 1.25k| auto subs = 1339| 1.25k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.25k] ------------------ 1340| 1.25k| : pos.towards_sub_oh( 1341| 1.25k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.25k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.25k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.25k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.25k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.25k, False: 0] ------------------ 1346| 1.25k| pos.copy_sizes( 1347| 1.25k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.25k| newr->d.count = newcount; 1349| 1.25k| newn->inner()[0] = get<1>(subs); 1350| 1.25k| std::copy(node->inner() + idx + 1, 1351| 1.25k| node->inner() + count, 1352| 1.25k| newn->inner() + 1); 1353| 1.25k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.25k, False: 0] ------------------ 1354| 1.25k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.25k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.25k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.25k| } 1358| 1.25k| return std::make_tuple(pos.shift(), newn); 1359| 1.25k| } 1360| 1.25k| 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.25k| } 1373| 1.95k| } _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| 685| { 1304| 685| auto idx = pos.subindex(first); 1305| 685| auto count = pos.count(); 1306| 685| auto node = pos.node(); 1307| 685| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 685] ------------------ 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| 685| auto left_size = pos.size_before(idx); 1313| 685| auto child_size = pos.size_sbh(idx, left_size); 1314| 685| auto dropped_size = first; 1315| 685| auto child_dropped_size = dropped_size - left_size; 1316| 685| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 685, Folded] | Branch (1316:25): [True: 200, False: 485] | Branch (1316:45): [True: 0, False: 200] ------------------ 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| 685| } else { 1325| 685| 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| 685| auto newcount = count - idx; 1330| 685| auto newn = 1331| 685| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 685] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 685| : node_t::make_inner_r_e(e); 1336| 685| auto newr = newn->relaxed(); 1337| 685| IMMER_TRY { ------------------ | | 49| 685|#define IMMER_TRY try ------------------ 1338| 685| auto subs = 1339| 685| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 685] ------------------ 1340| 685| : pos.towards_sub_oh( 1341| 685| no_collapse_no_mut_t{}, first, idx, e); 1342| 685| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 685] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 685| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 685| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 685, False: 0] ------------------ 1346| 685| pos.copy_sizes( 1347| 685| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 685| newr->d.count = newcount; 1349| 685| newn->inner()[0] = get<1>(subs); 1350| 685| std::copy(node->inner() + idx + 1, 1351| 685| node->inner() + count, 1352| 685| newn->inner() + 1); 1353| 685| if (!mutate) { ------------------ | Branch (1353:21): [True: 685, False: 0] ------------------ 1354| 685| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 685| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 685] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 685| } 1358| 685| return std::make_tuple(pos.shift(), newn); 1359| 685| } 1360| 685| 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| 685| } 1373| 685| } _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.81k| { 1378| 2.81k| auto node = pos.node(); 1379| 2.81k| auto idx = pos.index(first); 1380| 2.81k| auto count = pos.count(); 1381| 2.81k| 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.81k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 650, False: 2.16k] ------------------ 1384| 2.81k| if (mutate) { ------------------ | Branch (1384:13): [True: 650, False: 2.16k] ------------------ 1385| 650| auto data = node->leaf(); 1386| 650| auto newcount = count - idx; 1387| 650| std::move(data + idx, data + count, data); 1388| 650| detail::destroy_n(data + newcount, idx); 1389| 650| return std::make_tuple(0, node); 1390| 2.16k| } else { 1391| 2.16k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.16k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.16k, Folded] ------------------ 1393| 2.16k| pos.visit(dec_visitor{}); 1394| 2.16k| return std::make_tuple(0, newn); 1395| 2.16k| } 1396| 2.81k| } _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.50k| { 1304| 1.50k| auto idx = pos.subindex(first); 1305| 1.50k| auto count = pos.count(); 1306| 1.50k| auto node = pos.node(); 1307| 1.50k| 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.50k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 603, False: 904] ------------------ 1312| 1.50k| auto left_size = pos.size_before(idx); 1313| 1.50k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.50k| auto dropped_size = first; 1315| 1.50k| auto child_dropped_size = dropped_size - left_size; 1316| 1.50k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.50k] | 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.50k| } else { 1325| 1.50k| 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.50k| auto newcount = count - idx; 1330| 1.50k| auto newn = 1331| 1.50k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 603, False: 904] ------------------ 1332| 603| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 603| norefs_tag{})) relaxed_t, 1334| 603| node) 1335| 1.50k| : node_t::make_inner_r_e(e); 1336| 1.50k| auto newr = newn->relaxed(); 1337| 1.50k| IMMER_TRY { ------------------ | | 49| 1.50k|#define IMMER_TRY try ------------------ 1338| 1.50k| auto subs = 1339| 1.50k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 603, False: 904] ------------------ 1340| 1.50k| : pos.towards_sub_oh( 1341| 904| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.50k| if (mutate) ------------------ | Branch (1342:21): [True: 603, False: 904] ------------------ 1343| 603| pos.each_left(dec_visitor{}, idx); 1344| 1.50k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.50k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.50k, False: 0] ------------------ 1346| 1.50k| pos.copy_sizes( 1347| 1.50k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.50k| newr->d.count = newcount; 1349| 1.50k| newn->inner()[0] = get<1>(subs); 1350| 1.50k| std::copy(node->inner() + idx + 1, 1351| 1.50k| node->inner() + count, 1352| 1.50k| newn->inner() + 1); 1353| 1.50k| if (!mutate) { ------------------ | Branch (1353:21): [True: 904, False: 603] ------------------ 1354| 904| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 904| if (Mutating) ------------------ | Branch (1355:25): [True: 904, Folded] ------------------ 1356| 904| pos.visit(dec_visitor{}); 1357| 904| } 1358| 1.50k| return std::make_tuple(pos.shift(), newn); 1359| 1.50k| } 1360| 1.50k| 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.50k| } 1373| 1.50k| } _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.18k| { 1378| 7.18k| auto node = pos.node(); 1379| 7.18k| auto idx = pos.index(first); 1380| 7.18k| auto count = pos.count(); 1381| 7.18k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 7.18k] ------------------ 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.18k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 7.18k] ------------------ 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.18k| } else { 1391| 7.18k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 7.18k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 7.18k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 7.18k| return std::make_tuple(0, newn); 1395| 7.18k| } 1396| 7.18k| } _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| 1.93k| { 1304| 1.93k| auto idx = pos.subindex(first); 1305| 1.93k| auto count = pos.count(); 1306| 1.93k| auto node = pos.node(); 1307| 1.93k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.93k] ------------------ 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.93k| auto left_size = pos.size_before(idx); 1313| 1.93k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.93k| auto dropped_size = first; 1315| 1.93k| auto child_dropped_size = dropped_size - left_size; 1316| 1.93k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.93k] | 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.93k| } else { 1325| 1.93k| 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.93k| auto newcount = count - idx; 1330| 1.93k| auto newn = 1331| 1.93k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.93k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.93k| : node_t::make_inner_r_e(e); 1336| 1.93k| auto newr = newn->relaxed(); 1337| 1.93k| IMMER_TRY { ------------------ | | 49| 1.93k|#define IMMER_TRY try ------------------ 1338| 1.93k| auto subs = 1339| 1.93k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.93k] ------------------ 1340| 1.93k| : pos.towards_sub_oh( 1341| 1.93k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.93k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.93k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.93k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.93k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.93k, False: 0] ------------------ 1346| 1.93k| pos.copy_sizes( 1347| 1.93k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.93k| newr->d.count = newcount; 1349| 1.93k| newn->inner()[0] = get<1>(subs); 1350| 1.93k| std::copy(node->inner() + idx + 1, 1351| 1.93k| node->inner() + count, 1352| 1.93k| newn->inner() + 1); 1353| 1.93k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.93k, False: 0] ------------------ 1354| 1.93k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.93k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.93k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.93k| } 1358| 1.93k| return std::make_tuple(pos.shift(), newn); 1359| 1.93k| } 1360| 1.93k| 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.93k| } 1373| 1.93k| } _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.22k| { 1210| 2.22k| using node_t = node_type; 1211| 2.22k| auto node = p.node(); 1212| 2.22k| if (node->dec()) { ------------------ | Branch (1212:13): [True: 2.22k, False: 0] ------------------ 1213| 2.22k| p.each_left(dec_t{}, idx); 1214| 2.22k| node_t::delete_inner(node, p.count()); 1215| 2.22k| } 1216| 2.22k| } _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| 3.86k| { 1378| 3.86k| auto node = pos.node(); 1379| 3.86k| auto idx = pos.index(first); 1380| 3.86k| auto count = pos.count(); 1381| 3.86k| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 3.86k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 1.43k, False: 2.42k] ------------------ 1384| 3.86k| if (mutate) { ------------------ | Branch (1384:13): [True: 1.43k, False: 2.42k] ------------------ 1385| 1.43k| auto data = node->leaf(); 1386| 1.43k| auto newcount = count - idx; 1387| 1.43k| std::move(data + idx, data + count, data); 1388| 1.43k| detail::destroy_n(data + newcount, idx); 1389| 1.43k| return std::make_tuple(0, node); 1390| 2.42k| } else { 1391| 2.42k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.42k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.42k, Folded] ------------------ 1393| 2.42k| pos.visit(dec_visitor{}); 1394| 2.42k| return std::make_tuple(0, newn); 1395| 2.42k| } 1396| 3.86k| } _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.70k| { 1304| 1.70k| auto idx = pos.subindex(first); 1305| 1.70k| auto count = pos.count(); 1306| 1.70k| auto node = pos.node(); 1307| 1.70k| 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.70k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 384, False: 1.31k] ------------------ 1312| 1.70k| auto left_size = pos.size_before(idx); 1313| 1.70k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.70k| auto dropped_size = first; 1315| 1.70k| auto child_dropped_size = dropped_size - left_size; 1316| 1.70k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.70k] | 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.70k| } else { 1325| 1.70k| 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.70k| auto newcount = count - idx; 1330| 1.70k| auto newn = 1331| 1.70k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 384, False: 1.31k] ------------------ 1332| 384| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 384| norefs_tag{})) relaxed_t, 1334| 384| node) 1335| 1.70k| : node_t::make_inner_r_e(e); 1336| 1.70k| auto newr = newn->relaxed(); 1337| 1.70k| IMMER_TRY { ------------------ | | 49| 1.70k|#define IMMER_TRY try ------------------ 1338| 1.70k| auto subs = 1339| 1.70k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 384, False: 1.31k] ------------------ 1340| 1.70k| : pos.towards_sub_oh( 1341| 1.31k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.70k| if (mutate) ------------------ | Branch (1342:21): [True: 384, False: 1.31k] ------------------ 1343| 384| pos.each_left(dec_visitor{}, idx); 1344| 1.70k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.70k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.70k, False: 0] ------------------ 1346| 1.70k| pos.copy_sizes( 1347| 1.70k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.70k| newr->d.count = newcount; 1349| 1.70k| newn->inner()[0] = get<1>(subs); 1350| 1.70k| std::copy(node->inner() + idx + 1, 1351| 1.70k| node->inner() + count, 1352| 1.70k| newn->inner() + 1); 1353| 1.70k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.31k, False: 384] ------------------ 1354| 1.31k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.31k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.31k, Folded] ------------------ 1356| 1.31k| pos.visit(dec_visitor{}); 1357| 1.31k| } 1358| 1.70k| return std::make_tuple(pos.shift(), newn); 1359| 1.70k| } 1360| 1.70k| 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.70k| } 1373| 1.70k| } _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| 51.9k| { 1378| 51.9k| auto node = pos.node(); 1379| 51.9k| auto idx = pos.index(first); 1380| 51.9k| auto count = pos.count(); 1381| 51.9k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 51.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| 51.9k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 51.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| 51.9k| } else { 1391| 51.9k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 51.9k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 51.9k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 51.9k| return std::make_tuple(0, newn); 1395| 51.9k| } 1396| 51.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.13k| { 1304| 1.13k| auto idx = pos.subindex(first); 1305| 1.13k| auto count = pos.count(); 1306| 1.13k| auto node = pos.node(); 1307| 1.13k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.13k] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 1.13k| auto left_size = pos.size_before(idx); 1313| 1.13k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.13k| auto dropped_size = first; 1315| 1.13k| auto child_dropped_size = dropped_size - left_size; 1316| 1.13k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.13k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 1.13k| } else { 1325| 1.13k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.13k| auto newcount = count - idx; 1330| 1.13k| auto newn = 1331| 1.13k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.13k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.13k| : node_t::make_inner_r_e(e); 1336| 1.13k| auto newr = newn->relaxed(); 1337| 1.13k| IMMER_TRY { ------------------ | | 49| 1.13k|#define IMMER_TRY try ------------------ 1338| 1.13k| auto subs = 1339| 1.13k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.13k] ------------------ 1340| 1.13k| : pos.towards_sub_oh( 1341| 1.13k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.13k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.13k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.13k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.13k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.13k, False: 0] ------------------ 1346| 1.13k| pos.copy_sizes( 1347| 1.13k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.13k| newr->d.count = newcount; 1349| 1.13k| newn->inner()[0] = get<1>(subs); 1350| 1.13k| std::copy(node->inner() + idx + 1, 1351| 1.13k| node->inner() + count, 1352| 1.13k| newn->inner() + 1); 1353| 1.13k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.13k, False: 0] ------------------ 1354| 1.13k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.13k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.13k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.13k| } 1358| 1.13k| return std::make_tuple(pos.shift(), newn); 1359| 1.13k| } 1360| 1.13k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.13k| } 1373| 1.13k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_j: 1198| 2.12k| { 1199| 2.12k| using node_t = node_type; 1200| 2.12k| auto node = p.node(); 1201| 2.12k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 2.12k, False: 0] ------------------ 1202| 2.12k| p.each_left(dec_t{}, idx); 1203| 2.12k| node_t::delete_inner_r(node, p.count()); 1204| 2.12k| } 1205| 2.12k| } _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| 171k| { 1247| 171k| auto idx = pos.subindex(first); 1248| 171k| auto count = pos.count(); 1249| 171k| auto node = pos.node(); 1250| 171k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 171k, Folded] | Branch (1250:47): [True: 132k, False: 38.8k] ------------------ 1251| 171k| auto left_size = pos.size_before(idx); 1252| 171k| auto child_size = pos.size_sbh(idx, left_size); 1253| 171k| auto dropped_size = first; 1254| 171k| auto child_dropped_size = dropped_size - left_size; 1255| 171k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 171k] | 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| 171k| } else { 1264| 171k| using std::get; 1265| 171k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 132k, False: 38.8k] ------------------ 1266| 171k| : node_t::make_inner_r_e(e); 1267| 171k| auto newr = newn->relaxed(); 1268| 171k| auto newcount = count - idx; 1269| 171k| auto new_child_size = child_size - child_dropped_size; 1270| 171k| IMMER_TRY { ------------------ | | 49| 171k|#define IMMER_TRY try ------------------ 1271| 171k| auto subs = 1272| 171k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 132k, False: 38.8k] ------------------ 1273| 171k| : pos.towards_sub_oh( 1274| 38.8k| no_collapse_no_mut_t{}, first, idx, e); 1275| 171k| if (mutate) ------------------ | Branch (1275:21): [True: 132k, False: 38.8k] ------------------ 1276| 132k| pos.each_left(dec_visitor{}, idx); 1277| 171k| pos.copy_sizes( 1278| 171k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 171k| std::copy(node->inner() + idx + 1, 1280| 171k| node->inner() + count, 1281| 171k| newn->inner() + 1); 1282| 171k| newn->inner()[0] = get<1>(subs); 1283| 171k| newr->d.sizes[0] = new_child_size; 1284| 171k| newr->d.count = newcount; 1285| 171k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 171k, False: 0] ------------------ 1286| 171k| if (!mutate) { ------------------ | Branch (1286:21): [True: 38.8k, False: 132k] ------------------ 1287| 38.8k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 38.8k| if (Mutating) ------------------ | Branch (1288:25): [True: 38.8k, Folded] ------------------ 1289| 38.8k| pos.visit(dec_visitor{}); 1290| 38.8k| } 1291| 171k| return std::make_tuple(pos.shift(), newn); 1292| 171k| } 1293| 171k| 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| 171k| } 1299| 171k| } _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| 92.4k| { 1247| 92.4k| auto idx = pos.subindex(first); 1248| 92.4k| auto count = pos.count(); 1249| 92.4k| auto node = pos.node(); 1250| 92.4k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 92.4k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 92.4k| auto left_size = pos.size_before(idx); 1252| 92.4k| auto child_size = pos.size_sbh(idx, left_size); 1253| 92.4k| auto dropped_size = first; 1254| 92.4k| auto child_dropped_size = dropped_size - left_size; 1255| 92.4k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 92.4k] | 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| 92.4k| } else { 1264| 92.4k| using std::get; 1265| 92.4k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 92.4k] ------------------ 1266| 92.4k| : node_t::make_inner_r_e(e); 1267| 92.4k| auto newr = newn->relaxed(); 1268| 92.4k| auto newcount = count - idx; 1269| 92.4k| auto new_child_size = child_size - child_dropped_size; 1270| 92.4k| IMMER_TRY { ------------------ | | 49| 92.4k|#define IMMER_TRY try ------------------ 1271| 92.4k| auto subs = 1272| 92.4k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 92.4k] ------------------ 1273| 92.4k| : pos.towards_sub_oh( 1274| 92.4k| no_collapse_no_mut_t{}, first, idx, e); 1275| 92.4k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 92.4k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 92.4k| pos.copy_sizes( 1278| 92.4k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 92.4k| std::copy(node->inner() + idx + 1, 1280| 92.4k| node->inner() + count, 1281| 92.4k| newn->inner() + 1); 1282| 92.4k| newn->inner()[0] = get<1>(subs); 1283| 92.4k| newr->d.sizes[0] = new_child_size; 1284| 92.4k| newr->d.count = newcount; 1285| 92.4k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 92.4k, False: 0] ------------------ 1286| 92.4k| if (!mutate) { ------------------ | Branch (1286:21): [True: 92.4k, False: 0] ------------------ 1287| 92.4k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 92.4k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 92.4k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 92.4k| } 1291| 92.4k| return std::make_tuple(pos.shift(), newn); 1292| 92.4k| } 1293| 92.4k| 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| 92.4k| } 1299| 92.4k| } _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| 7.02k| { 1304| 7.02k| auto idx = pos.subindex(first); 1305| 7.02k| auto count = pos.count(); 1306| 7.02k| auto node = pos.node(); 1307| 7.02k| 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| 7.02k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 4.77k, False: 2.24k] ------------------ 1312| 7.02k| auto left_size = pos.size_before(idx); 1313| 7.02k| auto child_size = pos.size_sbh(idx, left_size); 1314| 7.02k| auto dropped_size = first; 1315| 7.02k| auto child_dropped_size = dropped_size - left_size; 1316| 7.02k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 7.02k, Folded] | Branch (1316:25): [True: 4.68k, False: 2.33k] | Branch (1316:45): [True: 2.99k, False: 1.69k] ------------------ 1317| 2.99k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 2.22k, False: 773] ------------------ 1318| 2.99k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 2.99k| if (mutate) ------------------ | Branch (1319:17): [True: 2.22k, False: 773] ------------------ 1320| 2.22k| pos.visit(dec_left_visitor{}, idx); 1321| 773| else if (Mutating) ------------------ | Branch (1321:22): [True: 773, Folded] ------------------ 1322| 773| pos.visit(dec_visitor{}); 1323| 2.99k| return r; 1324| 4.02k| } else { 1325| 4.02k| 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| 4.02k| auto newcount = count - idx; 1330| 4.02k| auto newn = 1331| 4.02k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 2.55k, False: 1.46k] ------------------ 1332| 2.55k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 2.55k| norefs_tag{})) relaxed_t, 1334| 2.55k| node) 1335| 4.02k| : node_t::make_inner_r_e(e); 1336| 4.02k| auto newr = newn->relaxed(); 1337| 4.02k| IMMER_TRY { ------------------ | | 49| 4.02k|#define IMMER_TRY try ------------------ 1338| 4.02k| auto subs = 1339| 4.02k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 2.55k, False: 1.46k] ------------------ 1340| 4.02k| : pos.towards_sub_oh( 1341| 1.46k| no_collapse_no_mut_t{}, first, idx, e); 1342| 4.02k| if (mutate) ------------------ | Branch (1342:21): [True: 2.55k, False: 1.46k] ------------------ 1343| 2.55k| pos.each_left(dec_visitor{}, idx); 1344| 4.02k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 4.02k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 4.02k, False: 0] ------------------ 1346| 4.02k| pos.copy_sizes( 1347| 4.02k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 4.02k| newr->d.count = newcount; 1349| 4.02k| newn->inner()[0] = get<1>(subs); 1350| 4.02k| std::copy(node->inner() + idx + 1, 1351| 4.02k| node->inner() + count, 1352| 4.02k| newn->inner() + 1); 1353| 4.02k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.46k, False: 2.55k] ------------------ 1354| 1.46k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.46k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.46k, Folded] ------------------ 1356| 1.46k| pos.visit(dec_visitor{}); 1357| 1.46k| } 1358| 4.02k| return std::make_tuple(pos.shift(), newn); 1359| 4.02k| } 1360| 4.02k| 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| 4.02k| } 1373| 7.02k| } _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.19k| { 1304| 1.19k| auto idx = pos.subindex(first); 1305| 1.19k| auto count = pos.count(); 1306| 1.19k| auto node = pos.node(); 1307| 1.19k| 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.19k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 778, False: 418] ------------------ 1312| 1.19k| auto left_size = pos.size_before(idx); 1313| 1.19k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.19k| auto dropped_size = first; 1315| 1.19k| auto child_dropped_size = dropped_size - left_size; 1316| 1.19k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 1.19k, Folded] | Branch (1316:25): [True: 205, False: 991] | Branch (1316:45): [True: 0, False: 205] ------------------ 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.19k| } else { 1325| 1.19k| 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.19k| auto newcount = count - idx; 1330| 1.19k| auto newn = 1331| 1.19k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 778, False: 418] ------------------ 1332| 778| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 778| norefs_tag{})) relaxed_t, 1334| 778| node) 1335| 1.19k| : node_t::make_inner_r_e(e); 1336| 1.19k| auto newr = newn->relaxed(); 1337| 1.19k| IMMER_TRY { ------------------ | | 49| 1.19k|#define IMMER_TRY try ------------------ 1338| 1.19k| auto subs = 1339| 1.19k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 778, False: 418] ------------------ 1340| 1.19k| : pos.towards_sub_oh( 1341| 418| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.19k| if (mutate) ------------------ | Branch (1342:21): [True: 778, False: 418] ------------------ 1343| 778| pos.each_left(dec_visitor{}, idx); 1344| 1.19k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.19k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.19k, False: 0] ------------------ 1346| 1.19k| pos.copy_sizes( 1347| 1.19k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.19k| newr->d.count = newcount; 1349| 1.19k| newn->inner()[0] = get<1>(subs); 1350| 1.19k| std::copy(node->inner() + idx + 1, 1351| 1.19k| node->inner() + count, 1352| 1.19k| newn->inner() + 1); 1353| 1.19k| if (!mutate) { ------------------ | Branch (1353:21): [True: 418, False: 778] ------------------ 1354| 418| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 418| if (Mutating) ------------------ | Branch (1355:25): [True: 418, Folded] ------------------ 1356| 418| pos.visit(dec_visitor{}); 1357| 418| } 1358| 1.19k| return std::make_tuple(pos.shift(), newn); 1359| 1.19k| } 1360| 1.19k| 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.19k| } 1373| 1.19k| } _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: 803] ------------------ 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| 803| 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| 28.0k| { 383| 28.0k| auto nl = posl.node(); 384| 28.0k| auto nr = posr.node(); 385| 28.0k| if (nl == nr) ------------------ | Branch (385:13): [True: 10.0k, False: 18.0k] ------------------ 386| 10.0k| return true; 387| 18.0k| auto cl = posl.count(); 388| 18.0k| auto cr = posr.count(); 389| 18.0k| assert(cr > 0); ------------------ | Branch (389:9): [True: 18.0k, False: 0] ------------------ 390| 18.0k| auto sbr = size_t{}; 391| 18.0k| auto i = count_t{}; 392| 18.0k| auto j = count_t{}; 393| 96.5k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 84.6k, False: 11.8k] ------------------ 394| 84.6k| auto sbl = posl.size_before(i); 395| 151k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 132k, False: 18.3k] | Branch (395:34): [True: 66.4k, False: 66.2k] ------------------ 396| 66.4k| ; 397| 84.6k| auto res = 398| 84.6k| sbl == sbr ------------------ | Branch (398:17): [True: 40.7k, False: 43.8k] ------------------ 399| 84.6k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 84.6k| : posl.nth_sub(i, 401| 43.8k| for_each_chunk_p_visitor{}, 402| 43.8k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 84.6k| if (!res) ------------------ | Branch (403:17): [True: 6.15k, False: 78.5k] ------------------ 404| 6.15k| return false; 405| 84.6k| } 406| 11.8k| return true; 407| 18.0k| } _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| 18.5k| { 337| 18.5k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 18.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| 19.3k| { 428| 19.3k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 12.6k, False: 6.70k] ------------------ 429| 12.6k| return true; 430| 6.70k| auto cl = posl.count(); 431| 6.70k| auto cr = posr.count(); 432| 6.70k| auto mp = std::min(cl, cr); 433| 6.70k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 5.43k, False: 1.26k] ------------------ 434| 6.70k| posl.node()->leaf() + mp, 435| 6.70k| posr.node()->leaf()) && 436| 5.43k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 5.21k, False: 227] ------------------ 437| 5.43k| posl.node()->leaf() + posl.count(), 438| 5.43k| first + (idx + mp)); 439| 19.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| 20.8k| { 330| 20.8k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 20.8k| } _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.13k| { 413| 4.13k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.13k| } _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.13k| { 383| 4.13k| auto nl = posl.node(); 384| 4.13k| auto nr = posr.node(); 385| 4.13k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.13k] ------------------ 386| 0| return true; 387| 4.13k| auto cl = posl.count(); 388| 4.13k| auto cr = posr.count(); 389| 4.13k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.13k, False: 0] ------------------ 390| 4.13k| auto sbr = size_t{}; 391| 4.13k| auto i = count_t{}; 392| 4.13k| auto j = count_t{}; 393| 12.3k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 9.85k, False: 2.45k] ------------------ 394| 9.85k| auto sbl = posl.size_before(i); 395| 15.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 13.0k, False: 2.70k] | Branch (395:34): [True: 5.88k, False: 7.14k] ------------------ 396| 5.88k| ; 397| 9.85k| auto res = 398| 9.85k| sbl == sbr ------------------ | Branch (398:17): [True: 6.66k, False: 3.18k] ------------------ 399| 9.85k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 9.85k| : posl.nth_sub(i, 401| 3.18k| for_each_chunk_p_visitor{}, 402| 3.18k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 9.85k| if (!res) ------------------ | Branch (403:17): [True: 1.68k, False: 8.16k] ------------------ 404| 1.68k| return false; 405| 9.85k| } 406| 2.45k| return true; 407| 4.13k| } _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.92k| { 337| 3.92k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 3.92k| } _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| 11.0k| { 428| 11.0k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 8.71k, False: 2.34k] ------------------ 429| 8.71k| 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.91k, False: 426] ------------------ 434| 2.34k| posl.node()->leaf() + mp, 435| 2.34k| posr.node()->leaf()) && 436| 1.91k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 1.69k, False: 220] ------------------ 437| 1.91k| posl.node()->leaf() + posl.count(), 438| 1.91k| first + (idx + mp)); 439| 11.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.19k| { 330| 2.19k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.19k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIX12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 412| 2.25k| { 413| 2.25k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.25k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 2.25k| { 383| 2.25k| auto nl = posl.node(); 384| 2.25k| auto nr = posr.node(); 385| 2.25k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.25k] ------------------ 386| 0| return true; 387| 2.25k| auto cl = posl.count(); 388| 2.25k| auto cr = posr.count(); 389| 2.25k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.25k, False: 0] ------------------ 390| 2.25k| auto sbr = size_t{}; 391| 2.25k| auto i = count_t{}; 392| 2.25k| auto j = count_t{}; 393| 17.2k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 15.4k, False: 1.84k] ------------------ 394| 15.4k| auto sbl = posl.size_before(i); 395| 26.1k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 21.2k, False: 4.92k] | Branch (395:34): [True: 10.7k, False: 10.4k] ------------------ 396| 10.7k| ; 397| 15.4k| auto res = 398| 15.4k| sbl == sbr ------------------ | Branch (398:17): [True: 9.29k, False: 6.10k] ------------------ 399| 15.4k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 15.4k| : posl.nth_sub(i, 401| 6.10k| for_each_chunk_p_visitor{}, 402| 6.10k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 15.4k| if (!res) ------------------ | Branch (403:17): [True: 411, False: 14.9k] ------------------ 404| 411| return false; 405| 15.4k| } 406| 1.84k| return true; 407| 2.25k| } _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.93k| { 337| 7.93k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 7.93k| } _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| 517| { 330| 517| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 517| } _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| 843| { 330| 843| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 843| } _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.38k| { 420| 1.38k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.38k, False: 0] ------------------ 421| 1.38k| ? this_t::visit_regular(posl, posr.node()) 422| 1.38k| : this_t::visit_regular(posr, posl.node()); 423| 1.38k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 25.7k| { 444| 25.7k| auto node = pos.node(); 445| 25.7k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 17.0k, False: 8.69k] | Branch (445:33): [True: 3.33k, False: 5.35k] ------------------ 446| 25.7k| } _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| 31.4k| { 451| 31.4k| auto node = pos.node(); 452| 31.4k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 21.6k, False: 9.84k] | Branch (452:33): [True: 5.31k, False: 4.53k] ------------------ 453| 9.84k| node->leaf() + pos.count(), 454| 9.84k| other->leaf()); 455| 31.4k| } _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.7k| { 444| 11.7k| auto node = pos.node(); 445| 11.7k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 3.60k, False: 8.12k] | Branch (445:33): [True: 3.20k, False: 4.92k] ------------------ 446| 11.7k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 3.10k| { 451| 3.10k| auto node = pos.node(); 452| 3.10k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.73k, False: 1.37k] | Branch (452:33): [True: 598, False: 778] ------------------ 453| 1.37k| node->leaf() + pos.count(), 454| 1.37k| other->leaf()); 455| 3.10k| } _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.79k| { 444| 4.79k| auto node = pos.node(); 445| 4.79k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 872, False: 3.92k] | Branch (445:33): [True: 2.84k, False: 1.08k] ------------------ 446| 4.79k| } _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| 327k| { 113| 327k| auto data = as_const(pos.node()->leaf()); 114| 327k| return fn(data, data + pos.count()); 115| 327k| } _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.45M| return [iter](auto f, auto e) mutable { 368| 1.45M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 156k, False: 1.29M] ------------------ 369| 156k| iter += e - f; 370| 156k| return true; 371| 156k| } 372| 11.0M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 9.72M, False: 1.29M] ------------------ 373| 9.72M| if (*f != *iter) ------------------ | Branch (373:21): [True: 2.66k, False: 9.72M] ------------------ 374| 2.66k| return false; 375| 1.29M| return true; 376| 1.29M| }; _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| 5.46M| { 54| 5.46M| return pos.towards(this_t{}, idx); 55| 5.46M| } _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| 1.15M| { 60| 1.15M| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 1.15M| } _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| 354k| { 54| 354k| return pos.towards(this_t{}, idx); 55| 354k| } _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| 335k| { 60| 335k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 335k| } _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| 493k| { 54| 493k| return pos.towards(this_t{}, idx); 55| 493k| } _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| 55.6k| { 54| 55.6k| return pos.towards(this_t{}, idx); 55| 55.6k| } _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| 34.8k| { 107| 34.8k| return pos.each_pred(this_t{}, fn); 108| 34.8k| } _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| 546| { 330| 546| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 546| } _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.8k| { 420| 10.8k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 10.8k, False: 0] ------------------ 421| 10.8k| ? this_t::visit_regular(posl, posr.node()) 422| 10.8k| : this_t::visit_regular(posr, posl.node()); 423| 10.8k| } _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| 1.11M| { 113| 1.11M| auto data = as_const(pos.node()->leaf()); 114| 1.11M| return fn(data, data + pos.count()); 115| 1.11M| } _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.6k| { 107| 13.6k| return pos.each_pred(this_t{}, fn); 108| 13.6k| } _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.3k| { 113| 12.3k| auto data = as_const(pos.node()->leaf()); 114| 12.3k| return fn(data, data + pos.count()); 115| 12.3k| } _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| 5.02k| { 107| 5.02k| return pos.each_pred(this_t{}, fn); 108| 5.02k| } _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| 1.94k| { 330| 1.94k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 1.94k| } _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.40k| { 383| 2.40k| auto nl = posl.node(); 384| 2.40k| auto nr = posr.node(); 385| 2.40k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.40k] ------------------ 386| 0| return true; 387| 2.40k| auto cl = posl.count(); 388| 2.40k| auto cr = posr.count(); 389| 2.40k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.40k, False: 0] ------------------ 390| 2.40k| auto sbr = size_t{}; 391| 2.40k| auto i = count_t{}; 392| 2.40k| auto j = count_t{}; 393| 8.88k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 7.66k, False: 1.21k] ------------------ 394| 7.66k| auto sbl = posl.size_before(i); 395| 12.2k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 9.86k, False: 2.34k] | Branch (395:34): [True: 4.54k, False: 5.31k] ------------------ 396| 4.54k| ; 397| 7.66k| auto res = 398| 7.66k| sbl == sbr ------------------ | Branch (398:17): [True: 4.52k, False: 3.14k] ------------------ 399| 7.66k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 7.66k| : posl.nth_sub(i, 401| 3.14k| for_each_chunk_p_visitor{}, 402| 3.14k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 7.66k| if (!res) ------------------ | Branch (403:17): [True: 1.18k, False: 6.47k] ------------------ 404| 1.18k| return false; 405| 7.66k| } 406| 1.21k| return true; 407| 2.40k| } _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| 6.18k| { 337| 6.18k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 6.18k| } _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| 6.18k| { 428| 6.18k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 4.68k, False: 1.50k] ------------------ 429| 4.68k| return true; 430| 1.50k| auto cl = posl.count(); 431| 1.50k| auto cr = posr.count(); 432| 1.50k| auto mp = std::min(cl, cr); 433| 1.50k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 1.17k, False: 328] ------------------ 434| 1.50k| posl.node()->leaf() + mp, 435| 1.50k| posr.node()->leaf()) && 436| 1.17k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 1.17k, False: 0] ------------------ 437| 1.17k| posl.node()->leaf() + posl.count(), 438| 1.17k| first + (idx + mp)); 439| 6.18k| } _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.16k| { 330| 2.16k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.16k| } _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.26k| { 383| 1.26k| auto nl = posl.node(); 384| 1.26k| auto nr = posr.node(); 385| 1.26k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.26k] ------------------ 386| 0| return true; 387| 1.26k| auto cl = posl.count(); 388| 1.26k| auto cr = posr.count(); 389| 1.26k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.26k, False: 0] ------------------ 390| 1.26k| auto sbr = size_t{}; 391| 1.26k| auto i = count_t{}; 392| 1.26k| auto j = count_t{}; 393| 8.80k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 7.81k, False: 988] ------------------ 394| 7.81k| auto sbl = posl.size_before(i); 395| 14.3k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 13.4k, False: 829] | Branch (395:34): [True: 6.50k, False: 6.98k] ------------------ 396| 6.50k| ; 397| 7.81k| auto res = 398| 7.81k| sbl == sbr ------------------ | Branch (398:17): [True: 4.33k, False: 3.47k] ------------------ 399| 7.81k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 7.81k| : posl.nth_sub(i, 401| 3.47k| for_each_chunk_p_visitor{}, 402| 3.47k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 7.81k| if (!res) ------------------ | Branch (403:17): [True: 277, False: 7.53k] ------------------ 404| 277| return false; 405| 7.81k| } 406| 988| return true; 407| 1.26k| } _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| 896| { 420| 896| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 896, False: 0] ------------------ 421| 896| ? this_t::visit_regular(posl, posr.node()) 422| 896| : this_t::visit_regular(posr, posl.node()); 423| 896| } _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| 166k| { 107| 166k| return pos.each_pred(this_t{}, fn); 108| 166k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaOT_: 366| 59.7k| { 367| 59.7k| return [iter](auto f, auto e) mutable { 368| 59.7k| if (f == &*iter) { 369| 59.7k| iter += e - f; 370| 59.7k| return true; 371| 59.7k| } 372| 59.7k| for (; f != e; ++f, ++iter) 373| 59.7k| if (*f != *iter) 374| 59.7k| return false; 375| 59.7k| return true; 376| 59.7k| }; 377| 59.7k| } _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| 1.06k| { 350| 1.06k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 1.06k, False: 0] ------------------ 351| 1.06k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 803, False: 261] ------------------ 352| 1.06k| ? visit_maybe_relaxed_sub(rootl, 353| 803| shiftl, 354| 803| sizel, 355| 803| this_t{}, 356| 803| posr, 357| 803| first, 358| 803| size_t{}) 359| 1.06k| : posr.first_sub_inner( 360| 261| rrb{}, first, rootl, shiftl, sizel); 361| 1.06k| } _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| 11.2k| { 350| 11.2k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 11.2k, False: 0] ------------------ 351| 11.2k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 11.2k, False: 0] ------------------ 352| 11.2k| ? visit_maybe_relaxed_sub(rootl, 353| 11.2k| shiftl, 354| 11.2k| sizel, 355| 11.2k| this_t{}, 356| 11.2k| posr, 357| 11.2k| first, 358| 11.2k| size_t{}) 359| 11.2k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 11.2k| } _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.89k| { 451| 7.89k| auto node = pos.node(); 452| 7.89k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.60k, False: 6.28k] | Branch (452:33): [True: 1.86k, False: 4.42k] ------------------ 453| 6.28k| node->leaf() + pos.count(), 454| 6.28k| other->leaf()); 455| 7.89k| } _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| 245M|{ 1839| 245M| assert(node); ------------------ | Branch (1839:5): [True: 245M, False: 0] ------------------ 1840| 245M| auto relaxed = node->relaxed(); 1841| 245M| if (relaxed) { ------------------ | Branch (1841:9): [True: 228M, False: 17.0M] ------------------ 1842| 228M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 228M, False: 0] ------------------ 1843| 228M| return make_relaxed_pos(node, shift, relaxed) 1844| 228M| .visit(v, std::forward(args)...); 1845| 228M| } else { 1846| 17.0M| return make_regular_sub_pos(node, shift, size) 1847| 17.0M| .visit(v, std::forward(args)...); 1848| 17.0M| } 1849| 245M|} _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| 640M|{ 1829| 640M| assert(node); ------------------ | Branch (1829:5): [True: 640M, False: 0] ------------------ 1830| 640M| assert(relaxed); ------------------ | Branch (1830:5): [True: 640M, False: 0] ------------------ 1831| 640M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 640M, False: 0] ------------------ 1832| 640M| return {node, shift, relaxed}; 1833| 640M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 259M| { 1814| 259M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 259M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 1431| 433M| 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| 51.0M| { 1477| 51.0M| each_left(v, relaxed_->d.count, args...); 1478| 51.0M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 51.2M| { 1624| 51.2M| auto p = node_->inner(); 1625| 51.2M| auto s = size_t{}; 1626| 51.2M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 11.8M, False: 39.3M] ------------------ 1627| 97.0M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 85.2M, False: 11.8M] ------------------ 1628| 85.2M| IMMER_PREFETCH(p + i + 1); 1629| 85.2M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 85.2M| .visit(v, args...); 1631| 85.2M| s = relaxed_->d.sizes[i]; 1632| 85.2M| assert(s); ------------------ | Branch (1632:17): [True: 85.2M, False: 0] ------------------ 1633| 85.2M| } 1634| 39.3M| } else { 1635| 39.3M| auto ss = shift_ - B; 1636| 282M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 242M, False: 39.3M] ------------------ 1637| 242M| visit_maybe_relaxed_sub( 1638| 242M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 242M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 242M, False: 0] ------------------ 1641| 242M| } 1642| 39.3M| } 1643| 51.2M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 1430| 395M| 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.7M|{ 1045| 28.7M| assert(node); ------------------ | Branch (1045:5): [True: 28.7M, False: 0] ------------------ 1046| 28.7M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 28.7M, False: 0] ------------------ 1047| 28.7M| assert(size > 0); ------------------ | Branch (1047:5): [True: 28.7M, False: 0] ------------------ 1048| 28.7M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 28.7M, False: 0] ------------------ 1049| 28.7M| return {node, shift, size}; 1050| 28.7M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1036| 17.0M| { 1037| 17.0M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 17.0M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 785| 30.3M| 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.20M| { 826| 1.20M| return each_regular(*this, v, args...); 827| 1.20M| } _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.20M|{ 344| 1.20M| constexpr auto B = bits; 345| 1.20M| constexpr auto BL = bits_leaf; 346| 1.20M| auto n = p.node()->inner(); 347| 1.20M| auto last = p.count() - 1; 348| 1.20M| auto e = n + last; 349| 1.20M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 93.7k, False: 1.11M] ------------------ 350| 291k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 197k, False: 93.7k] ------------------ 351| 197k| IMMER_PREFETCH(n + 1); 352| 197k| make_full_leaf_pos(*n).visit(v, args...); 353| 197k| } 354| 93.7k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 1.11M| } else { 356| 1.11M| auto ss = p.shift() - B; 357| 3.67M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 2.55M, False: 1.11M] ------------------ 358| 2.55M| make_full_pos(*n, ss).visit(v, args...); 359| 1.11M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 1.11M| } 361| 1.20M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 787| 13.7M| shift_t shift() const { return shift_; } _ZN5immer6detail4rbts18make_full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_13full_leaf_posIT_EEPSE_: 214| 16.5M|{ 215| 16.5M| assert(node); ------------------ | Branch (215:5): [True: 16.5M, False: 0] ------------------ 216| 16.5M| return {node}; 217| 16.5M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 4.45M| { 208| 4.45M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 4.45M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 199| 11.0M| 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.6M| 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.71M|{ 120| 2.71M| assert(node); ------------------ | Branch (120:5): [True: 2.71M, False: 0] ------------------ 121| 2.71M| assert(size > 0); ------------------ | Branch (121:5): [True: 2.71M, False: 0] ------------------ 122| 2.71M| return {node, size}; 123| 2.71M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 786| 10.8M| 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.15M| { 113| 1.15M| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.15M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 104| 2.71M| 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.70M| 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.74M| 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| 12.1M|{ 1413| 12.1M| assert(node); ------------------ | Branch (1413:5): [True: 12.1M, False: 0] ------------------ 1414| 12.1M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 12.1M, False: 0] ------------------ 1415| 12.1M| return {node, shift}; 1416| 12.1M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 10.0M| { 1406| 10.0M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 10.0M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 1159| 10.8M| 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| 106k| { 1186| 106k| auto p = node_->inner(); 1187| 106k| auto e = p + branches; 1188| 106k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 92.4k, False: 13.8k] ------------------ 1189| 832k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 739k, False: 92.4k] ------------------ 1190| 739k| IMMER_PREFETCH(p + 1); 1191| 739k| make_full_leaf_pos(*p).visit(v, args...); 1192| 739k| } 1193| 92.4k| } else { 1194| 13.8k| auto ss = shift_ - B; 1195| 124k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 110k, False: 13.8k] ------------------ 1196| 110k| make_full_pos(*p, ss).visit(v, args...); 1197| 13.8k| } 1198| 106k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 1158| 1.62M| 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| 10.1M|{ 691| 10.1M| assert(node); ------------------ | Branch (691:5): [True: 10.1M, False: 0] ------------------ 692| 10.1M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 10.1M, False: 0] ------------------ 693| 10.1M| assert(size > 0); ------------------ | Branch (693:5): [True: 10.1M, False: 0] ------------------ 694| 10.1M| return {node, shift, size}; 695| 10.1M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 4.44M| { 337| 4.44M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.44M| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 231| 18.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.38M| { 244| 4.38M| return each_regular(*this, v, args...); 245| 4.38M| } _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.38M|{ 344| 4.38M| constexpr auto B = bits; 345| 4.38M| constexpr auto BL = bits_leaf; 346| 4.38M| auto n = p.node()->inner(); 347| 4.38M| auto last = p.count() - 1; 348| 4.38M| auto e = n + last; 349| 4.38M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 1.06M, False: 3.32M] ------------------ 350| 4.55M| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 3.49M, False: 1.06M] ------------------ 351| 3.49M| IMMER_PREFETCH(n + 1); 352| 3.49M| make_full_leaf_pos(*n).visit(v, args...); 353| 3.49M| } 354| 1.06M| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 3.32M| } else { 356| 3.32M| auto ss = p.shift() - B; 357| 10.6M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 7.35M, False: 3.32M] ------------------ 358| 7.35M| make_full_pos(*n, ss).visit(v, args...); 359| 3.32M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 3.32M| } 361| 4.38M|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 233| 17.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| 25.4M| 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| 13.1M| 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| 24.5M| 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| 22.1M| 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| 25.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| 3.08M|{ 65| 3.08M| return {node}; 66| 3.08M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 3.08M| { 58| 3.08M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 3.08M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 41| 3.08M| 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| 127M|{ 152| 127M| assert(node); ------------------ | Branch (152:5): [True: 127M, False: 0] ------------------ 153| 127M| assert(count <= branches); ------------------ | Branch (153:5): [True: 127M, False: 0] ------------------ 154| 127M| return {node, count}; 155| 127M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 92.9M| { 145| 92.9M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 92.9M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 136| 112M| 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| 36.2M| 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.91M|{ 89| 2.91M| assert(node); ------------------ | Branch (89:5): [True: 2.91M, False: 0] ------------------ 90| 2.91M| return {node}; 91| 2.91M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 2.91M| { 82| 2.91M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 2.91M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 75| 2.91M| 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| 11.9k| 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| 526k| { 1814| 526k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 526k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 1433| 38.6M| 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| 18.8M| { 1444| 18.8M| return size_sbh(offset, size_before(offset)); 1445| 18.8M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8size_sbhEjm: 1448| 19.2M| { 1449| 19.2M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 19.2M, False: 0] ------------------ 1450| 19.2M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 19.2M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11size_beforeEj: 1438| 72.3M| { 1439| 72.3M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 46.2M, False: 26.1M] ------------------ 1440| 72.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| 510k| { 1738| 510k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 510k, False: 0] ------------------ 1739| 510k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 510k, False: 0] ------------------ 1740| 510k| auto child = node_->inner()[offset_hint]; 1741| 510k| auto is_leaf = shift_ == BL; 1742| 510k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 510k] ------------------ 1743| 510k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 510k| : visit_maybe_relaxed_sub( 1745| 510k| child, shift_ - B, child_size_hint, v, args...); 1746| 510k| } _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| 510k|{ 1839| 510k| assert(node); ------------------ | Branch (1839:5): [True: 510k, False: 0] ------------------ 1840| 510k| auto relaxed = node->relaxed(); 1841| 510k| if (relaxed) { ------------------ | Branch (1841:9): [True: 179k, False: 330k] ------------------ 1842| 179k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 179k, False: 0] ------------------ 1843| 179k| return make_relaxed_pos(node, shift, relaxed) 1844| 179k| .visit(v, std::forward(args)...); 1845| 330k| } else { 1846| 330k| return make_regular_sub_pos(node, shift, size) 1847| 330k| .visit(v, std::forward(args)...); 1848| 330k| } 1849| 510k|} _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| 330k| { 1037| 330k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 330k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 788| 3.72M| 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.07M| { 953| 1.07M| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.07M| } _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.07M|{ 678| 1.07M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.07M, False: 0] ------------------ 679| 1.07M| constexpr auto B = bits; 680| 1.07M| constexpr auto BL = bits_leaf; 681| 1.07M| auto child = p.node()->inner()[offset_hint]; 682| 1.07M| auto is_leaf = p.shift() == BL; 683| 1.07M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.07M] ------------------ 684| 1.07M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.07M| .visit(v, args...); 686| 1.07M|} _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| 4.24M| { 337| 4.24M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.24M| } _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| 3.17M| { 331| 3.17M| return last_oh_regular(*this, v, offset_hint, args...); 332| 3.17M| } _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| 3.17M|{ 678| 3.17M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 3.17M, False: 0] ------------------ 679| 3.17M| constexpr auto B = bits; 680| 3.17M| constexpr auto BL = bits_leaf; 681| 3.17M| auto child = p.node()->inner()[offset_hint]; 682| 3.17M| auto is_leaf = p.shift() == BL; 683| 3.17M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 3.17M] ------------------ 684| 3.17M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 3.17M| .visit(v, args...); 686| 3.17M|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 1432| 172M| 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| 796k| { 1037| 796k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 796k| } 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| 121k| { 145| 121k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 121k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 139| 1.39M| 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| 164k|{ 1839| 164k| assert(node); ------------------ | Branch (1839:5): [True: 164k, False: 0] ------------------ 1840| 164k| auto relaxed = node->relaxed(); 1841| 164k| if (relaxed) { ------------------ | Branch (1841:9): [True: 137k, False: 26.5k] ------------------ 1842| 137k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 137k, False: 0] ------------------ 1843| 137k| return make_relaxed_pos(node, shift, relaxed) 1844| 137k| .visit(v, std::forward(args)...); 1845| 137k| } else { 1846| 26.5k| return make_regular_sub_pos(node, shift, size) 1847| 26.5k| .visit(v, std::forward(args)...); 1848| 26.5k| } 1849| 164k|} 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| 137k| { 1814| 137k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 137k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 1454| 18.4M| { 1455| 18.4M| auto offset = idx >> shift_; 1456| 27.2M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 8.78M, False: 18.4M] ------------------ 1457| 8.78M| ++offset; 1458| 18.4M| return offset; 1459| 18.4M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7relaxedEv: 1435| 137k| 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| 137k| { 1687| 137k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 137k, False: 0] ------------------ 1688| 137k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 18.0k, False: 119k] ------------------ 1689| 137k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 137k| } 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| 137k| { 1699| 137k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 137k| } 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| 137k| { 1718| 137k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 137k, False: 0] ------------------ 1719| 137k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 18.0k, False: 119k] | Branch (1719:9): [True: 137k, False: 0] ------------------ 1720| 137k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 137k| auto child = node_->inner()[offset_hint]; 1722| 137k| auto is_leaf = shift_ == BL; 1723| 137k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 137k| auto next_idx = idx - left_size_hint; 1725| 137k| return is_leaf ------------------ | Branch (1725:16): [True: 20.6k, False: 117k] ------------------ 1726| 137k| ? make_leaf_sub_pos(child, next_size) 1727| 20.6k| .visit(v, next_idx, args...) 1728| 137k| : visit_maybe_relaxed_sub( 1729| 117k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 137k| } 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| 20.6k| { 145| 20.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 20.6k| } flex-vector-st.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1036| 26.5k| { 1037| 26.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 26.5k| } 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| 26.5k| { 939| 26.5k| return towards_oh_ch_regular( 940| 26.5k| *this, v, idx, offset_hint, count(), args...); 941| 26.5k| } 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| 26.5k|{ 633| 26.5k| constexpr auto B = bits; 634| 26.5k| constexpr auto BL = bits_leaf; 635| 26.5k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 26.5k, False: 0] ------------------ 636| 26.5k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 26.5k, False: 0] ------------------ 637| 26.5k| auto is_leaf = p.shift() == BL; 638| 26.5k| auto child = p.node()->inner()[offset_hint]; 639| 26.5k| auto is_full = offset_hint + 1 != count_hint; 640| 26.5k| return is_full ------------------ | Branch (640:12): [True: 13.3k, False: 13.1k] ------------------ 641| 26.5k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 4.43k, False: 8.93k] ------------------ 642| 13.3k| : make_full_pos(child, p.shift() - B) 643| 8.93k| .visit(v, idx, args...)) 644| 26.5k| : (is_leaf ------------------ | Branch (644:19): [True: 11.1k, False: 2.03k] ------------------ 645| 13.1k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 13.1k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.03k| .visit(v, idx, args...)); 648| 26.5k|} 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| 14.4k| { 208| 14.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 14.4k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 202| 392k| 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.1k| { 1406| 14.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 14.1k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 1162| 1.06M| 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.1k| { 1330| 14.1k| return towards_oh(v, idx, offset_hint, args...); 1331| 14.1k| } 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.1k| { 1337| 14.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 14.1k, False: 0] ------------------ 1338| 14.1k| auto is_leaf = shift_ == BL; 1339| 14.1k| auto child = node_->inner()[offset_hint]; 1340| 14.1k| return is_leaf ------------------ | Branch (1340:16): [True: 9.62k, False: 4.54k] ------------------ 1341| 14.1k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 14.1k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 14.1k| } 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| 12.1k| { 113| 12.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 12.1k| } 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.29k| { 337| 2.29k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.29k| } 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.29k| { 317| 2.29k| return towards_oh_ch_regular( 318| 2.29k| *this, v, idx, offset_hint, count(), args...); 319| 2.29k| } 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.29k|{ 633| 2.29k| constexpr auto B = bits; 634| 2.29k| constexpr auto BL = bits_leaf; 635| 2.29k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.29k, False: 0] ------------------ 636| 2.29k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.29k, False: 0] ------------------ 637| 2.29k| auto is_leaf = p.shift() == BL; 638| 2.29k| auto child = p.node()->inner()[offset_hint]; 639| 2.29k| auto is_full = offset_hint + 1 != count_hint; 640| 2.29k| return is_full ------------------ | Branch (640:12): [True: 1.05k, False: 1.23k] ------------------ 641| 2.29k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 364, False: 691] ------------------ 642| 1.05k| : make_full_pos(child, p.shift() - B) 643| 691| .visit(v, idx, args...)) 644| 2.29k| : (is_leaf ------------------ | Branch (644:19): [True: 975, False: 260] ------------------ 645| 1.23k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.23k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 260| .visit(v, idx, args...)); 648| 2.29k|} _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 36.3k|{ 1839| 36.3k| assert(node); ------------------ | Branch (1839:5): [True: 36.3k, False: 0] ------------------ 1840| 36.3k| auto relaxed = node->relaxed(); 1841| 36.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 29.8k, False: 6.48k] ------------------ 1842| 29.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 29.8k, False: 0] ------------------ 1843| 29.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 29.8k| .visit(v, std::forward(args)...); 1845| 29.8k| } else { 1846| 6.48k| return make_regular_sub_pos(node, shift, size) 1847| 6.48k| .visit(v, std::forward(args)...); 1848| 6.48k| } 1849| 36.3k|} _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.8k| { 1814| 29.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 29.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1686| 23.8k| { 1687| 23.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 23.8k, False: 0] ------------------ 1688| 23.8k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 23.8k] ------------------ 1689| 23.8k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 23.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1698| 23.8k| { 1699| 23.8k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 23.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 23.8k| { 1718| 23.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 23.8k, False: 0] ------------------ 1719| 23.8k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 23.8k] | Branch (1719:9): [True: 23.8k, False: 0] ------------------ 1720| 23.8k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 23.8k| auto child = node_->inner()[offset_hint]; 1722| 23.8k| auto is_leaf = shift_ == BL; 1723| 23.8k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 23.8k| auto next_idx = idx - left_size_hint; 1725| 23.8k| return is_leaf ------------------ | Branch (1725:16): [True: 2.02k, False: 21.8k] ------------------ 1726| 23.8k| ? make_leaf_sub_pos(child, next_size) 1727| 2.02k| .visit(v, next_idx, args...) 1728| 23.8k| : visit_maybe_relaxed_sub( 1729| 21.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 23.8k| } _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| 2.02k| { 145| 2.02k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.02k| } _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| 9.69k| { 1687| 9.69k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 9.69k, False: 0] ------------------ 1688| 9.69k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 8.37k, False: 1.32k] ------------------ 1689| 9.69k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 9.69k| } _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| 9.69k| { 1699| 9.69k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 9.69k| } _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| 9.69k| { 1718| 9.69k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 9.69k, False: 0] ------------------ 1719| 9.69k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 8.37k, False: 1.32k] | Branch (1719:9): [True: 9.69k, False: 0] ------------------ 1720| 9.69k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 9.69k| auto child = node_->inner()[offset_hint]; 1722| 9.69k| auto is_leaf = shift_ == BL; 1723| 9.69k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 9.69k| auto next_idx = idx - left_size_hint; 1725| 9.69k| return is_leaf ------------------ | Branch (1725:16): [True: 3.37k, False: 6.32k] ------------------ 1726| 9.69k| ? make_leaf_sub_pos(child, next_size) 1727| 3.37k| .visit(v, next_idx, args...) 1728| 9.69k| : visit_maybe_relaxed_sub( 1729| 6.32k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 9.69k| } _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| 3.37k| { 145| 3.37k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.37k| } _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| 6.32k|{ 1839| 6.32k| assert(node); ------------------ | Branch (1839:5): [True: 6.32k, False: 0] ------------------ 1840| 6.32k| auto relaxed = node->relaxed(); 1841| 6.32k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.69k, False: 2.63k] ------------------ 1842| 3.69k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.69k, False: 0] ------------------ 1843| 3.69k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.69k| .visit(v, std::forward(args)...); 1845| 3.69k| } else { 1846| 2.63k| return make_regular_sub_pos(node, shift, size) 1847| 2.63k| .visit(v, std::forward(args)...); 1848| 2.63k| } 1849| 6.32k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 3.69k| { 1814| 3.69k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.69k| } _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.63k| { 1037| 2.63k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.63k| } _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.51k| { 928| 5.51k| return towards_oh_ch_regular( 929| 5.51k| *this, v, idx, offset_hint, count(), args...); 930| 5.51k| } _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.51k|{ 633| 5.51k| constexpr auto B = bits; 634| 5.51k| constexpr auto BL = bits_leaf; 635| 5.51k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.51k, False: 0] ------------------ 636| 5.51k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.51k, False: 0] ------------------ 637| 5.51k| auto is_leaf = p.shift() == BL; 638| 5.51k| auto child = p.node()->inner()[offset_hint]; 639| 5.51k| auto is_full = offset_hint + 1 != count_hint; 640| 5.51k| return is_full ------------------ | Branch (640:12): [True: 1.51k, False: 3.99k] ------------------ 641| 5.51k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 857, False: 659] ------------------ 642| 1.51k| : make_full_pos(child, p.shift() - B) 643| 659| .visit(v, idx, args...)) 644| 5.51k| : (is_leaf ------------------ | Branch (644:19): [True: 1.54k, False: 2.44k] ------------------ 645| 3.99k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.99k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.44k| .visit(v, idx, args...)); 648| 5.51k|} _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.89k| { 208| 3.89k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.89k| } _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.04k| { 1406| 2.04k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.04k| } _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.34k| { 1337| 3.34k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 3.34k, False: 0] ------------------ 1338| 3.34k| auto is_leaf = shift_ == BL; 1339| 3.34k| auto child = node_->inner()[offset_hint]; 1340| 3.34k| return is_leaf ------------------ | Branch (1340:16): [True: 2.55k, False: 795] ------------------ 1341| 3.34k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 3.34k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 3.34k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 1161| 70.5k| 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.92k| { 113| 2.92k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.92k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 336| 2.97k| { 337| 2.97k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.97k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 305| 2.97k| { 306| 2.97k| return towards_oh_ch_regular( 307| 2.97k| *this, v, idx, offset_hint, count(), args...); 308| 2.97k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 2.97k|{ 633| 2.97k| constexpr auto B = bits; 634| 2.97k| constexpr auto BL = bits_leaf; 635| 2.97k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.97k, False: 0] ------------------ 636| 2.97k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.97k, False: 0] ------------------ 637| 2.97k| auto is_leaf = p.shift() == BL; 638| 2.97k| auto child = p.node()->inner()[offset_hint]; 639| 2.97k| auto is_full = offset_hint + 1 != count_hint; 640| 2.97k| return is_full ------------------ | Branch (640:12): [True: 1.07k, False: 1.90k] ------------------ 641| 2.97k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 486, False: 591] ------------------ 642| 1.07k| : make_full_pos(child, p.shift() - B) 643| 591| .visit(v, idx, args...)) 644| 2.97k| : (is_leaf ------------------ | Branch (644:19): [True: 1.37k, False: 528] ------------------ 645| 1.90k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.90k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 528| .visit(v, idx, args...)); 648| 2.97k|} _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.48k| { 1037| 6.48k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.48k| } _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.60k| { 928| 3.60k| return towards_oh_ch_regular( 929| 3.60k| *this, v, idx, offset_hint, count(), args...); 930| 3.60k| } _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.60k|{ 633| 3.60k| constexpr auto B = bits; 634| 3.60k| constexpr auto BL = bits_leaf; 635| 3.60k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.60k, False: 0] ------------------ 636| 3.60k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.60k, False: 0] ------------------ 637| 3.60k| auto is_leaf = p.shift() == BL; 638| 3.60k| auto child = p.node()->inner()[offset_hint]; 639| 3.60k| auto is_full = offset_hint + 1 != count_hint; 640| 3.60k| return is_full ------------------ | Branch (640:12): [True: 2.64k, False: 952] ------------------ 641| 3.60k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 719, False: 1.93k] ------------------ 642| 2.64k| : make_full_pos(child, p.shift() - B) 643| 1.93k| .visit(v, idx, args...)) 644| 3.60k| : (is_leaf ------------------ | Branch (644:19): [True: 952, False: 0] ------------------ 645| 952| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 952| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 3.60k|} _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.34k| { 208| 1.34k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.34k| } _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.22k| { 1406| 2.22k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.22k| } _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| 922| { 1337| 922| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 922, False: 0] ------------------ 1338| 922| auto is_leaf = shift_ == BL; 1339| 922| auto child = node_->inner()[offset_hint]; 1340| 922| return is_leaf ------------------ | Branch (1340:16): [True: 627, False: 295] ------------------ 1341| 922| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 922| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 922| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 952| { 113| 952| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 952| } _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| 22.6k|{ 1839| 22.6k| assert(node); ------------------ | Branch (1839:5): [True: 22.6k, False: 0] ------------------ 1840| 22.6k| auto relaxed = node->relaxed(); 1841| 22.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 15.6k, False: 6.93k] ------------------ 1842| 15.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 15.6k, False: 0] ------------------ 1843| 15.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 15.6k| .visit(v, std::forward(args)...); 1845| 15.6k| } else { 1846| 6.93k| return make_regular_sub_pos(node, shift, size) 1847| 6.93k| .visit(v, std::forward(args)...); 1848| 6.93k| } 1849| 22.6k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 15.6k| { 1814| 15.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 15.6k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8subindexEm: 1434| 5.86M| 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.13k| { 1706| 3.13k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.13k, False: 0] ------------------ 1707| 3.13k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 2.77k, False: 352] ------------------ 1708| 3.13k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.13k| } _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.13k| { 1718| 3.13k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.13k, False: 0] ------------------ 1719| 3.13k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 2.77k, False: 352] | Branch (1719:9): [True: 3.13k, False: 0] ------------------ 1720| 3.13k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.13k| auto child = node_->inner()[offset_hint]; 1722| 3.13k| auto is_leaf = shift_ == BL; 1723| 3.13k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.13k| auto next_idx = idx - left_size_hint; 1725| 3.13k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.13k] ------------------ 1726| 3.13k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.13k| : visit_maybe_relaxed_sub( 1729| 3.13k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.13k| } _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| 67.5k| { 1706| 67.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 67.5k, False: 0] ------------------ 1707| 67.5k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 19.8k, False: 47.6k] ------------------ 1708| 67.5k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 67.5k| } _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| 67.5k| { 1718| 67.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 67.5k, False: 0] ------------------ 1719| 67.5k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 19.8k, False: 47.6k] | Branch (1719:9): [True: 67.5k, False: 0] ------------------ 1720| 67.5k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 67.5k| auto child = node_->inner()[offset_hint]; 1722| 67.5k| auto is_leaf = shift_ == BL; 1723| 67.5k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 67.5k| auto next_idx = idx - left_size_hint; 1725| 67.5k| return is_leaf ------------------ | Branch (1725:16): [True: 11.7k, False: 55.7k] ------------------ 1726| 67.5k| ? make_leaf_sub_pos(child, next_size) 1727| 11.7k| .visit(v, next_idx, args...) 1728| 67.5k| : visit_maybe_relaxed_sub( 1729| 55.7k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 67.5k| } _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| 11.7k| { 145| 11.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 11.7k| } _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| 55.7k|{ 1839| 55.7k| assert(node); ------------------ | Branch (1839:5): [True: 55.7k, False: 0] ------------------ 1840| 55.7k| auto relaxed = node->relaxed(); 1841| 55.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 54.9k, False: 828] ------------------ 1842| 54.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 54.9k, False: 0] ------------------ 1843| 54.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 54.9k| .visit(v, std::forward(args)...); 1845| 54.9k| } else { 1846| 828| return make_regular_sub_pos(node, shift, size) 1847| 828| .visit(v, std::forward(args)...); 1848| 828| } 1849| 55.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 54.9k| { 1814| 54.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 54.9k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 828| { 1037| 828| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 828| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11size_beforeEj: 791| 1.82M| { 792| 1.82M| return size_t{offset} << shift_; 793| 1.82M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8size_sbhEjm: 803| 21.5k| { 804| 21.5k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 21.5k, False: 0] ------------------ 805| 21.5k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 11.9k, False: 9.60k] ------------------ 806| 21.5k| : size_t{1} << shift_; 807| 21.5k| } _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| 7.01k| { 947| 7.01k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 7.01k| } _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| 7.01k|{ 654| 7.01k| constexpr auto B = bits; 655| 7.01k| constexpr auto BL = bits_leaf; 656| 7.01k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 7.01k, False: 0] ------------------ 657| 7.01k| auto is_leaf = p.shift() == BL; 658| 7.01k| auto child = p.node()->inner()[offset_hint]; 659| 7.01k| auto lsize = offset_hint << p.shift(); 660| 7.01k| auto size = p.this_size(); 661| 7.01k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 7.01k| return is_full ------------------ | Branch (662:12): [True: 7.01k, False: 0] ------------------ 663| 7.01k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.17k, False: 2.84k] ------------------ 664| 7.01k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 7.01k| : make_full_pos(child, p.shift() - B) 666| 2.84k| .visit(v, idx - lsize, args...)) 667| 7.01k| : (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| 7.01k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9this_sizeEv: 794| 21.5k| 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.76k| { 208| 7.76k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 7.76k| } _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.28k| { 1406| 4.28k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.28k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8subindexEm: 1163| 10.3k| count_t subindex(size_t idx) const { return idx >> shift_; } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11size_beforeEj: 1170| 39.2k| { 1171| 39.2k| return size_t{offset} << shift_; 1172| 39.2k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8size_sbhEjm: 1166| 10.3k| { 1167| 10.3k| return size_t{1} << shift_; 1168| 10.3k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1348| 5.03k| { 1349| 5.03k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 5.03k, False: 0] ------------------ 1350| 5.03k| auto is_leaf = shift_ == BL; 1351| 5.03k| auto child = node_->inner()[offset_hint]; 1352| 5.03k| auto lsize = size_t{offset_hint} << shift_; 1353| 5.03k| return is_leaf ------------------ | Branch (1353:16): [True: 3.59k, False: 1.44k] ------------------ 1354| 5.03k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 5.03k| : make_full_pos(child, shift_ - B) 1356| 1.44k| .visit(v, idx - lsize, args...); 1357| 5.03k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1175| 10.3k| { 1176| 10.3k| auto e = sizes + n; 1177| 55.3k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 44.9k, False: 10.3k] ------------------ 1178| 44.9k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 44.9k, False: 0] ------------------ 1180| 44.9k| } 1181| 10.3k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 1160| 738k| 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.51M| { 811| 3.51M| if (n) { ------------------ | Branch (811:13): [True: 3.50M, False: 5.53k] ------------------ 812| 3.50M| auto last = offset + n - 1; 813| 3.50M| auto e = sizes + n - 1; 814| 14.0M| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 10.5M, False: 3.50M] ------------------ 815| 10.5M| init = *sizes = init + (size_t{1} << shift_); 816| 10.5M| assert(init); ------------------ | Branch (816:17): [True: 10.5M, False: 0] ------------------ 817| 10.5M| } 818| 3.50M| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 3.50M, False: 0] ------------------ 820| 3.50M| } 821| 3.51M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEj: 797| 3.52M| { 798| 3.52M| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 1.76M, False: 1.76M] ------------------ 799| 3.52M| : size_t{1} << shift_; 800| 3.52M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1462| 33.6M| { 1463| 33.6M| auto e = sizes + n; 1464| 33.6M| auto prev = size_before(offset); 1465| 33.6M| auto these = relaxed_->d.sizes + offset; 1466| 153M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 120M, False: 33.6M] ------------------ 1467| 120M| auto this_size = *these; 1468| 120M| init = *sizes = init + (this_size - prev); 1469| 120M| assert(init); ------------------ | Branch (1469:13): [True: 120M, False: 0] ------------------ 1470| 120M| prev = this_size; 1471| 120M| } 1472| 33.6M| } _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.93k| { 1037| 6.93k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.93k| } _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.71k| { 947| 2.71k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.71k| } _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.71k|{ 654| 2.71k| constexpr auto B = bits; 655| 2.71k| constexpr auto BL = bits_leaf; 656| 2.71k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.71k, False: 0] ------------------ 657| 2.71k| auto is_leaf = p.shift() == BL; 658| 2.71k| auto child = p.node()->inner()[offset_hint]; 659| 2.71k| auto lsize = offset_hint << p.shift(); 660| 2.71k| auto size = p.this_size(); 661| 2.71k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.71k| return is_full ------------------ | Branch (662:12): [True: 749, False: 1.96k] ------------------ 663| 2.71k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 749] ------------------ 664| 749| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 749| : make_full_pos(child, p.shift() - B) 666| 749| .visit(v, idx - lsize, args...)) 667| 2.71k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.96k] ------------------ 668| 1.96k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.96k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.96k| .visit(v, idx - lsize, args...)); 672| 2.71k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1405| 749| { 1406| 749| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 749| } _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.96k| { 1037| 1.96k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.96k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaPT_j: 766| 11.9k|{ 767| 11.9k| assert(leaf); ------------------ | Branch (767:5): [True: 11.9k, False: 0] ------------------ 768| 11.9k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 11.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 11.9k, False: 0] ------------------ 769| 11.9k| assert(count > 0); ------------------ | Branch (769:5): [True: 11.9k, False: 0] ------------------ 770| 11.9k| return singleton_regular_sub_pos{leaf, count}; 771| 11.9k|} _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| 11.9k| { 760| 11.9k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 11.9k| } _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| 11.9k|{ 1839| 11.9k| assert(node); ------------------ | Branch (1839:5): [True: 11.9k, False: 0] ------------------ 1840| 11.9k| auto relaxed = node->relaxed(); 1841| 11.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.09k, False: 2.80k] ------------------ 1842| 9.09k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.09k, False: 0] ------------------ 1843| 9.09k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.09k| .visit(v, std::forward(args)...); 1845| 9.09k| } else { 1846| 2.80k| return make_regular_sub_pos(node, shift, size) 1847| 2.80k| .visit(v, std::forward(args)...); 1848| 2.80k| } 1849| 11.9k|} _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| 9.09k| { 1814| 9.09k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 9.09k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 735| 66.3k| 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| 11.9k| { 745| 11.9k| } _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| 14.6M| { 145| 14.6M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 14.6M| } _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| 171M| { 1814| 171M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 171M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 707| 4.21M| { 708| 4.21M| } _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| 11.9k| { 745| 11.9k| } _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| 14.6M| { 145| 14.6M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 14.6M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 137| 14.6M| 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| 171M| { 1814| 171M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 171M| } _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| 4.21M| { 708| 4.21M| } _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| 53.5k| { 1763| 53.5k| auto child = node_->inner()[0]; 1764| 53.5k| auto child_size = relaxed_->d.sizes[0]; 1765| 53.5k| auto is_leaf = shift_ == BL; 1766| 53.5k| assert(child_size); ------------------ | Branch (1766:9): [True: 53.5k, False: 0] ------------------ 1767| 53.5k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 53.5k] ------------------ 1768| 53.5k| : visit_maybe_relaxed_sub( 1769| 53.5k| child, shift_ - B, child_size, v, args...); 1770| 53.5k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 76| 11.9k| 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.65M| 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| 53.5k|{ 1839| 53.5k| assert(node); ------------------ | Branch (1839:5): [True: 53.5k, False: 0] ------------------ 1840| 53.5k| auto relaxed = node->relaxed(); 1841| 53.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 53.2k, False: 310] ------------------ 1842| 53.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 53.2k, False: 0] ------------------ 1843| 53.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 53.2k| .visit(v, std::forward(args)...); 1845| 53.2k| } else { 1846| 310| return make_regular_sub_pos(node, shift, size) 1847| 310| .visit(v, std::forward(args)...); 1848| 310| } 1849| 53.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1813| 53.2k| { 1814| 53.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 53.2k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1036| 310| { 1037| 310| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 310| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 970| 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| 409k| 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| 927| { 1406| 927| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 927| } _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| 307| { 1362| 307| auto is_leaf = shift_ == BL; 1363| 307| auto child = node_->inner()[0]; 1364| 307| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 307] ------------------ 1365| 307| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 307| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 711| 148k| { 712| 148k| } _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| 41.6k| { 1305| 41.6k| each_i(v, 1, branches, args...); 1306| 41.6k| } _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| 41.6k| { 1264| 41.6k| auto p = node_->inner() + i; 1265| 41.6k| auto e = node_->inner() + n; 1266| 41.6k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 18.2k, False: 23.3k] ------------------ 1267| 146k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 127k, False: 18.2k] ------------------ 1268| 127k| IMMER_PREFETCH(p + 1); 1269| 127k| make_full_leaf_pos(*p).visit(v, args...); 1270| 127k| } 1271| 23.3k| } else { 1272| 23.3k| auto ss = shift_ - B; 1273| 186k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 163k, False: 23.3k] ------------------ 1274| 163k| make_full_pos(*p, ss).visit(v, args...); 1275| 23.3k| } 1276| 41.6k| } _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.44M| { 208| 5.44M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.44M| } _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| 733k| { 1406| 733k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 733k| } _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| 148k| { 712| 148k| } _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| 41.6k| { 1305| 41.6k| each_i(v, 1, branches, args...); 1306| 41.6k| } _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| 41.6k| { 1264| 41.6k| auto p = node_->inner() + i; 1265| 41.6k| auto e = node_->inner() + n; 1266| 41.6k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 18.2k, False: 23.3k] ------------------ 1267| 146k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 127k, False: 18.2k] ------------------ 1268| 127k| IMMER_PREFETCH(p + 1); 1269| 127k| make_full_leaf_pos(*p).visit(v, args...); 1270| 127k| } 1271| 23.3k| } else { 1272| 23.3k| auto ss = shift_ - B; 1273| 186k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 163k, False: 23.3k] ------------------ 1274| 163k| make_full_pos(*p, ss).visit(v, args...); 1275| 23.3k| } 1276| 41.6k| } _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.44M| { 208| 5.44M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.44M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 200| 5.44M| 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| 733k| { 1406| 733k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 733k| } _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.11k| { 208| 3.11k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.11k| } _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| 409k| { 907| 409k| if (count() > 1) ------------------ | Branch (907:13): [True: 386k, False: 23.0k] ------------------ 908| 386k| each_right_sub_(v, 1, args...); 909| 409k| } _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| 386k| { 880| 386k| auto last = count() - 1; 881| 386k| auto lsize = size_ - (last << shift_); 882| 386k| auto n = node()->inner() + i; 883| 386k| auto e = node()->inner() + last; 884| 386k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 368k, False: 18.2k] ------------------ 885| 2.55M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.19M, False: 368k] ------------------ 886| 2.19M| IMMER_PREFETCH(n + 1); 887| 2.19M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.19M| } 889| 368k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 368k| } else { 891| 18.2k| auto ss = shift_ - B; 892| 56.1k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 37.8k, False: 18.2k] ------------------ 893| 37.8k| make_full_pos(*n, ss).visit(v, args...); 894| 18.2k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 18.2k| } 896| 386k| } _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.88M| { 1037| 3.88M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.88M| } _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| 409k| { 907| 409k| if (count() > 1) ------------------ | Branch (907:13): [True: 386k, False: 23.0k] ------------------ 908| 386k| each_right_sub_(v, 1, args...); 909| 409k| } _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| 386k| { 880| 386k| auto last = count() - 1; 881| 386k| auto lsize = size_ - (last << shift_); 882| 386k| auto n = node()->inner() + i; 883| 386k| auto e = node()->inner() + last; 884| 386k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 368k, False: 18.2k] ------------------ 885| 2.55M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.19M, False: 368k] ------------------ 886| 2.19M| IMMER_PREFETCH(n + 1); 887| 2.19M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.19M| } 889| 368k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 368k| } else { 891| 18.2k| auto ss = shift_ - B; 892| 56.1k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 37.8k, False: 18.2k] ------------------ 893| 37.8k| make_full_pos(*n, ss).visit(v, args...); 894| 18.2k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 18.2k| } 896| 386k| } _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.88M| { 1037| 3.88M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.88M| } _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.49k| { 754| 2.49k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 2.49k| } _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.49k| { 145| 2.49k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.49k| } _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.49k| { 987| 2.49k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 2.49k, False: 0] ------------------ 988| 2.49k| auto child = node_->inner()[0]; 989| 2.49k| auto is_full = size_ >= branches; 990| 2.49k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 2.49k, False: 0] ------------------ 991| 2.49k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 2.49k| } _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| 8.78k| { 145| 8.78k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.78k| } _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| 14.3M| { 1648| 14.3M| each_right(v, 1, std::forward(args)...); 1649| 14.3M| } _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| 14.3M| { 1654| 14.3M| assert(start > 0); ------------------ | Branch (1654:9): [True: 14.3M, False: 0] ------------------ 1655| 14.3M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 14.3M, False: 0] ------------------ 1656| 14.3M| auto s = relaxed_->d.sizes[start - 1]; 1657| 14.3M| auto p = node_->inner(); 1658| 14.3M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 1.10M, False: 13.2M] ------------------ 1659| 6.62M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 5.51M, False: 1.10M] ------------------ 1660| 5.51M| IMMER_PREFETCH(p + i + 1); 1661| 5.51M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 5.51M| .visit(v, args...); 1663| 5.51M| s = relaxed_->d.sizes[i]; 1664| 5.51M| assert(s); ------------------ | Branch (1664:17): [True: 5.51M, False: 0] ------------------ 1665| 5.51M| } 1666| 13.2M| } else { 1667| 13.2M| auto ss = shift_ - B; 1668| 96.9M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 83.7M, False: 13.2M] ------------------ 1669| 83.7M| visit_maybe_relaxed_sub( 1670| 83.7M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 83.7M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 83.7M, False: 0] ------------------ 1673| 83.7M| } 1674| 13.2M| } 1675| 14.3M| } _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| 144M|{ 1839| 144M| assert(node); ------------------ | Branch (1839:5): [True: 144M, False: 0] ------------------ 1840| 144M| auto relaxed = node->relaxed(); 1841| 144M| if (relaxed) { ------------------ | Branch (1841:9): [True: 140M, False: 3.86M] ------------------ 1842| 140M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 140M, False: 0] ------------------ 1843| 140M| return make_relaxed_pos(node, shift, relaxed) 1844| 140M| .visit(v, std::forward(args)...); 1845| 140M| } else { 1846| 3.86M| return make_regular_sub_pos(node, shift, size) 1847| 3.86M| .visit(v, std::forward(args)...); 1848| 3.86M| } 1849| 144M|} _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| 14.3M| { 1648| 14.3M| each_right(v, 1, std::forward(args)...); 1649| 14.3M| } _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| 14.3M| { 1654| 14.3M| assert(start > 0); ------------------ | Branch (1654:9): [True: 14.3M, False: 0] ------------------ 1655| 14.3M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 14.3M, False: 0] ------------------ 1656| 14.3M| auto s = relaxed_->d.sizes[start - 1]; 1657| 14.3M| auto p = node_->inner(); 1658| 14.3M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 1.10M, False: 13.2M] ------------------ 1659| 6.62M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 5.51M, False: 1.10M] ------------------ 1660| 5.51M| IMMER_PREFETCH(p + i + 1); 1661| 5.51M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 5.51M| .visit(v, args...); 1663| 5.51M| s = relaxed_->d.sizes[i]; 1664| 5.51M| assert(s); ------------------ | Branch (1664:17): [True: 5.51M, False: 0] ------------------ 1665| 5.51M| } 1666| 13.2M| } else { 1667| 13.2M| auto ss = shift_ - B; 1668| 96.9M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 83.7M, False: 13.2M] ------------------ 1669| 83.7M| visit_maybe_relaxed_sub( 1670| 83.7M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 83.7M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 83.7M, False: 0] ------------------ 1673| 83.7M| } 1674| 13.2M| } 1675| 14.3M| } _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| 144M|{ 1839| 144M| assert(node); ------------------ | Branch (1839:5): [True: 144M, False: 0] ------------------ 1840| 144M| auto relaxed = node->relaxed(); 1841| 144M| if (relaxed) { ------------------ | Branch (1841:9): [True: 140M, False: 3.86M] ------------------ 1842| 140M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 140M, False: 0] ------------------ 1843| 140M| return make_relaxed_pos(node, shift, relaxed) 1844| 140M| .visit(v, std::forward(args)...); 1845| 140M| } else { 1846| 3.86M| return make_regular_sub_pos(node, shift, size) 1847| 3.86M| .visit(v, std::forward(args)...); 1848| 3.86M| } 1849| 144M|} _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| 8.78k| { 754| 8.78k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 8.78k| } _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| 8.78k| { 145| 8.78k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.78k| } _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| 8.78k| { 1775| 8.78k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 8.78k, False: 0] ------------------ 1776| 8.78k| auto child = node_->inner()[0]; 1777| 8.78k| auto child_size = relaxed_->d.sizes[0]; 1778| 8.78k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 8.78k| } _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.80k| { 1037| 2.80k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.80k| } _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.50M|{ 1839| 1.50M| assert(node); ------------------ | Branch (1839:5): [True: 1.50M, False: 0] ------------------ 1840| 1.50M| auto relaxed = node->relaxed(); 1841| 1.50M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.48M, False: 24.0k] ------------------ 1842| 1.48M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.48M, False: 0] ------------------ 1843| 1.48M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.48M| .visit(v, std::forward(args)...); 1845| 1.48M| } else { 1846| 24.0k| return make_regular_sub_pos(node, shift, size) 1847| 24.0k| .visit(v, std::forward(args)...); 1848| 24.0k| } 1849| 1.50M|} _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.48M| { 1814| 1.48M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.48M| } _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.48M|{ 1839| 1.48M| assert(node); ------------------ | Branch (1839:5): [True: 1.48M, False: 0] ------------------ 1840| 1.48M| auto relaxed = node->relaxed(); 1841| 1.48M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.46M, False: 19.6k] ------------------ 1842| 1.46M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.46M, False: 0] ------------------ 1843| 1.46M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.46M| .visit(v, std::forward(args)...); 1845| 1.46M| } else { 1846| 19.6k| return make_regular_sub_pos(node, shift, size) 1847| 19.6k| .visit(v, std::forward(args)...); 1848| 19.6k| } 1849| 1.48M|} _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.46M| { 1814| 1.46M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.46M| } _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| 4.14M| { 1751| 4.14M| auto offset = relaxed_->d.count - 1; 1752| 4.14M| auto child = node_->inner()[offset]; 1753| 4.14M| auto child_size = size(offset); 1754| 4.14M| auto is_leaf = shift_ == BL; 1755| 4.14M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 4.14M] ------------------ 1756| 4.14M| : visit_maybe_relaxed_sub( 1757| 4.14M| child, shift_ - B, child_size, v, args...); 1758| 4.14M| } _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| 4.14M|{ 1839| 4.14M| assert(node); ------------------ | Branch (1839:5): [True: 4.14M, False: 0] ------------------ 1840| 4.14M| auto relaxed = node->relaxed(); 1841| 4.14M| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.14M, False: 2.29k] ------------------ 1842| 4.14M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.14M, False: 0] ------------------ 1843| 4.14M| return make_relaxed_pos(node, shift, relaxed) 1844| 4.14M| .visit(v, std::forward(args)...); 1845| 4.14M| } else { 1846| 2.29k| return make_regular_sub_pos(node, shift, size) 1847| 2.29k| .visit(v, std::forward(args)...); 1848| 2.29k| } 1849| 4.14M|} _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| 4.14M| { 1814| 4.14M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.14M| } _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| 5.12k| { 1037| 5.12k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.12k| } _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.83k| { 959| 2.83k| auto offset = count() - 1; 960| 2.83k| auto child = node_->inner()[offset]; 961| 2.83k| auto is_leaf = shift_ == BL; 962| 2.83k| auto lsize = size_ - (size_t{offset} << shift_); 963| 2.83k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 2.83k] ------------------ 964| 2.83k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 2.83k| .visit(v, args...); 966| 2.83k| } _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.60M| { 914| 1.60M| each_left(v, count() - 1, args...); 915| 1.60M| } _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.60M| { 874| 1.60M| return each_left_regular(*this, v, last, args...); 875| 1.60M| } _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.60M|{ 576| 1.60M| constexpr auto B = bits; 577| 1.60M| constexpr auto BL = bits_leaf; 578| 1.60M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.60M, False: 0] ------------------ 579| 1.60M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 822k, False: 785k] ------------------ 580| 822k| auto n = p.node()->inner(); 581| 822k| auto e = n + last; 582| 3.94M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.12M, False: 822k] ------------------ 583| 3.12M| IMMER_PREFETCH(n + 1); 584| 3.12M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.12M| } 586| 822k| } else { 587| 785k| auto n = p.node()->inner(); 588| 785k| auto e = n + last; 589| 785k| auto ss = p.shift() - B; 590| 1.31M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 532k, False: 785k] ------------------ 591| 532k| make_full_pos(*n, ss).visit(v, args...); 592| 785k| } 593| 1.60M|} _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.60M| { 914| 1.60M| each_left(v, count() - 1, args...); 915| 1.60M| } _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.60M| { 874| 1.60M| return each_left_regular(*this, v, last, args...); 875| 1.60M| } _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.60M|{ 576| 1.60M| constexpr auto B = bits; 577| 1.60M| constexpr auto BL = bits_leaf; 578| 1.60M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.60M, False: 0] ------------------ 579| 1.60M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 822k, False: 785k] ------------------ 580| 822k| auto n = p.node()->inner(); 581| 822k| auto e = n + last; 582| 3.94M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.12M, False: 822k] ------------------ 583| 3.12M| IMMER_PREFETCH(n + 1); 584| 3.12M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.12M| } 586| 822k| } else { 587| 785k| auto n = p.node()->inner(); 588| 785k| auto e = n + last; 589| 785k| auto ss = p.shift() - B; 590| 1.31M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 532k, False: 785k] ------------------ 591| 532k| make_full_pos(*n, ss).visit(v, args...); 592| 785k| } 593| 1.60M|} _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.54M| { 1763| 1.54M| auto child = node_->inner()[0]; 1764| 1.54M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.54M| auto is_leaf = shift_ == BL; 1766| 1.54M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.54M, False: 0] ------------------ 1767| 1.54M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.54M] ------------------ 1768| 1.54M| : visit_maybe_relaxed_sub( 1769| 1.54M| child, shift_ - B, child_size, v, args...); 1770| 1.54M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 106| 1.50M| 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.54M|{ 1839| 1.54M| assert(node); ------------------ | Branch (1839:5): [True: 1.54M, False: 0] ------------------ 1840| 1.54M| auto relaxed = node->relaxed(); 1841| 1.54M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.17M, False: 366k] ------------------ 1842| 1.17M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.17M, False: 0] ------------------ 1843| 1.17M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.17M| .visit(v, std::forward(args)...); 1845| 1.17M| } else { 1846| 366k| return make_regular_sub_pos(node, shift, size) 1847| 366k| .visit(v, std::forward(args)...); 1848| 366k| } 1849| 1.54M|} _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.17M| { 1814| 1.17M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.17M| } _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| 366k| { 1037| 366k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 366k| } _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.95k| { 959| 1.95k| auto offset = count() - 1; 960| 1.95k| auto child = node_->inner()[offset]; 961| 1.95k| auto is_leaf = shift_ == BL; 962| 1.95k| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.95k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 1.95k] ------------------ 964| 1.95k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 1.95k| .visit(v, args...); 966| 1.95k| } _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| 2.73k| { 1037| 2.73k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.73k| } _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| 14.7k| { 971| 14.7k| auto is_leaf = shift_ == BL; 972| 14.7k| auto child = node_->inner()[0]; 973| 14.7k| auto is_full = size_ >= (size_t{1} << shift_); 974| 14.7k| return is_full ------------------ | Branch (974:16): [True: 14.7k, False: 0] ------------------ 975| 14.7k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 14.7k] ------------------ 976| 14.7k| ? make_full_leaf_pos(child).visit(v, args...) 977| 14.7k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 14.7k| : (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| 14.7k| } _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| 37.3k| { 1406| 37.3k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 37.3k| } _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| 22.5k| { 1362| 22.5k| auto is_leaf = shift_ == BL; 1363| 22.5k| auto child = node_->inner()[0]; 1364| 22.5k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 22.5k] ------------------ 1365| 22.5k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 22.5k| } _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| 37.0k| { 959| 37.0k| auto offset = count() - 1; 960| 37.0k| auto child = node_->inner()[offset]; 961| 37.0k| auto is_leaf = shift_ == BL; 962| 37.0k| auto lsize = size_ - (size_t{offset} << shift_); 963| 37.0k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 15.0k, False: 22.0k] ------------------ 964| 37.0k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 22.0k| .visit(v, args...); 966| 37.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 144| 17.6k| { 145| 17.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 17.6k| } _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| 17.6k| { 1371| 17.6k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 17.6k, False: 0] ------------------ 1372| 17.6k| auto child = node_->inner()[0]; 1373| 17.6k| return make_full_leaf_pos(child).visit(v, args...); 1374| 17.6k| } _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| 406k| { 208| 406k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 406k| } _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| 22.2k| { 1037| 22.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 22.2k| } _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| 384k| { 959| 384k| auto offset = count() - 1; 960| 384k| auto child = node_->inner()[offset]; 961| 384k| auto is_leaf = shift_ == BL; 962| 384k| auto lsize = size_ - (size_t{offset} << shift_); 963| 384k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 378k, False: 5.50k] ------------------ 964| 384k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 5.50k| .visit(v, args...); 966| 384k| } _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| 388k| { 145| 388k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 388k| } _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| 388k| { 987| 388k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 388k, False: 0] ------------------ 988| 388k| auto child = node_->inner()[0]; 989| 388k| auto is_full = size_ >= branches; 990| 388k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 388k, False: 0] ------------------ 991| 388k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 388k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 144| 1.09M| { 145| 1.09M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.09M| } _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| 14.0k| { 1037| 14.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 14.0k| } _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.18M| { 959| 1.18M| auto offset = count() - 1; 960| 1.18M| auto child = node_->inner()[offset]; 961| 1.18M| auto is_leaf = shift_ == BL; 962| 1.18M| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.18M| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 428k, False: 753k] ------------------ 964| 1.18M| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 753k| .visit(v, args...); 966| 1.18M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 144| 1.09M| { 145| 1.09M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.09M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1774| 1.09M| { 1775| 1.09M| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 1.09M, False: 0] ------------------ 1776| 1.09M| auto child = node_->inner()[0]; 1777| 1.09M| auto child_size = relaxed_->d.sizes[0]; 1778| 1.09M| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 1.09M| } _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.53M| { 1037| 1.53M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.53M| } _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| 17.2M| { 1618| 17.2M| each_left(v, relaxed_->d.count - 1, args...); 1619| 17.2M| } _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| 17.2M| { 1624| 17.2M| auto p = node_->inner(); 1625| 17.2M| auto s = size_t{}; 1626| 17.2M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 682k, False: 16.5M] ------------------ 1627| 4.93M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 4.24M, False: 682k] ------------------ 1628| 4.24M| IMMER_PREFETCH(p + i + 1); 1629| 4.24M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 4.24M| .visit(v, args...); 1631| 4.24M| s = relaxed_->d.sizes[i]; 1632| 4.24M| assert(s); ------------------ | Branch (1632:17): [True: 4.24M, False: 0] ------------------ 1633| 4.24M| } 1634| 16.5M| } else { 1635| 16.5M| auto ss = shift_ - B; 1636| 77.3M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 60.7M, False: 16.5M] ------------------ 1637| 60.7M| visit_maybe_relaxed_sub( 1638| 60.7M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 60.7M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 60.7M, False: 0] ------------------ 1641| 60.7M| } 1642| 16.5M| } 1643| 17.2M| } _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| 17.2M| { 1618| 17.2M| each_left(v, relaxed_->d.count - 1, args...); 1619| 17.2M| } _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| 17.2M| { 1624| 17.2M| auto p = node_->inner(); 1625| 17.2M| auto s = size_t{}; 1626| 17.2M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 682k, False: 16.5M] ------------------ 1627| 4.93M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 4.24M, False: 682k] ------------------ 1628| 4.24M| IMMER_PREFETCH(p + i + 1); 1629| 4.24M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 4.24M| .visit(v, args...); 1631| 4.24M| s = relaxed_->d.sizes[i]; 1632| 4.24M| assert(s); ------------------ | Branch (1632:17): [True: 4.24M, False: 0] ------------------ 1633| 4.24M| } 1634| 16.5M| } else { 1635| 16.5M| auto ss = shift_ - B; 1636| 77.3M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 60.7M, False: 16.5M] ------------------ 1637| 60.7M| visit_maybe_relaxed_sub( 1638| 60.7M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 60.7M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 60.7M, False: 0] ------------------ 1641| 60.7M| } 1642| 16.5M| } 1643| 17.2M| } _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| 11.6M| { 1763| 11.6M| auto child = node_->inner()[0]; 1764| 11.6M| auto child_size = relaxed_->d.sizes[0]; 1765| 11.6M| auto is_leaf = shift_ == BL; 1766| 11.6M| assert(child_size); ------------------ | Branch (1766:9): [True: 11.6M, False: 0] ------------------ 1767| 11.6M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 11.6M] ------------------ 1768| 11.6M| : visit_maybe_relaxed_sub( 1769| 11.6M| child, shift_ - B, child_size, v, args...); 1770| 11.6M| } _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| 11.6M|{ 1839| 11.6M| assert(node); ------------------ | Branch (1839:5): [True: 11.6M, False: 0] ------------------ 1840| 11.6M| auto relaxed = node->relaxed(); 1841| 11.6M| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.6M, False: 2.60k] ------------------ 1842| 11.6M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.6M, False: 0] ------------------ 1843| 11.6M| return make_relaxed_pos(node, shift, relaxed) 1844| 11.6M| .visit(v, std::forward(args)...); 1845| 11.6M| } else { 1846| 2.60k| return make_regular_sub_pos(node, shift, size) 1847| 2.60k| .visit(v, std::forward(args)...); 1848| 2.60k| } 1849| 11.6M|} _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| 11.6M| { 1814| 11.6M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.6M| } _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| 2.60k| { 1037| 2.60k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.60k| } _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| 64.2k| { 1751| 64.2k| auto offset = relaxed_->d.count - 1; 1752| 64.2k| auto child = node_->inner()[offset]; 1753| 64.2k| auto child_size = size(offset); 1754| 64.2k| auto is_leaf = shift_ == BL; 1755| 64.2k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 64.2k] ------------------ 1756| 64.2k| : visit_maybe_relaxed_sub( 1757| 64.2k| child, shift_ - B, child_size, v, args...); 1758| 64.2k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 64.2k|{ 1839| 64.2k| assert(node); ------------------ | Branch (1839:5): [True: 64.2k, False: 0] ------------------ 1840| 64.2k| auto relaxed = node->relaxed(); 1841| 64.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 63.5k, False: 778] ------------------ 1842| 63.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 63.5k, False: 0] ------------------ 1843| 63.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 63.5k| .visit(v, std::forward(args)...); 1845| 63.5k| } else { 1846| 778| return make_regular_sub_pos(node, shift, size) 1847| 778| .visit(v, std::forward(args)...); 1848| 778| } 1849| 64.2k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1813| 63.5k| { 1814| 63.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 63.5k| } _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| 2.86k| { 971| 2.86k| auto is_leaf = shift_ == BL; 972| 2.86k| auto child = node_->inner()[0]; 973| 2.86k| auto is_full = size_ >= (size_t{1} << shift_); 974| 2.86k| return is_full ------------------ | Branch (974:16): [True: 2.86k, False: 0] ------------------ 975| 2.86k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 2.86k] ------------------ 976| 2.86k| ? make_full_leaf_pos(child).visit(v, args...) 977| 2.86k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 2.86k| : (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| 2.86k| } _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| 3.37k| { 1406| 3.37k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.37k| } _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| 512| { 1362| 512| auto is_leaf = shift_ == BL; 1363| 512| auto child = node_->inner()[0]; 1364| 512| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 512] ------------------ 1365| 512| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 512| } _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| 3.17k| { 1751| 3.17k| auto offset = relaxed_->d.count - 1; 1752| 3.17k| auto child = node_->inner()[offset]; 1753| 3.17k| auto child_size = size(offset); 1754| 3.17k| auto is_leaf = shift_ == BL; 1755| 3.17k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 2.66k, False: 518] ------------------ 1756| 3.17k| : visit_maybe_relaxed_sub( 1757| 518| child, shift_ - B, child_size, v, args...); 1758| 3.17k| } _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| 518|{ 1839| 518| assert(node); ------------------ | Branch (1839:5): [True: 518, False: 0] ------------------ 1840| 518| auto relaxed = node->relaxed(); 1841| 518| if (relaxed) { ------------------ | Branch (1841:9): [True: 312, False: 206] ------------------ 1842| 312| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 312, False: 0] ------------------ 1843| 312| return make_relaxed_pos(node, shift, relaxed) 1844| 312| .visit(v, std::forward(args)...); 1845| 312| } else { 1846| 206| return make_regular_sub_pos(node, shift, size) 1847| 206| .visit(v, std::forward(args)...); 1848| 206| } 1849| 518|} _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| 312| { 1814| 312| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 312| } _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| 21.0k| { 1751| 21.0k| auto offset = relaxed_->d.count - 1; 1752| 21.0k| auto child = node_->inner()[offset]; 1753| 21.0k| auto child_size = size(offset); 1754| 21.0k| auto is_leaf = shift_ == BL; 1755| 21.0k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 10.0k, False: 10.9k] ------------------ 1756| 21.0k| : visit_maybe_relaxed_sub( 1757| 10.9k| child, shift_ - B, child_size, v, args...); 1758| 21.0k| } _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| 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: 2.40k, False: 8.54k] ------------------ 1842| 2.40k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.40k, False: 0] ------------------ 1843| 2.40k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.40k| .visit(v, std::forward(args)...); 1845| 8.54k| } else { 1846| 8.54k| return make_regular_sub_pos(node, shift, size) 1847| 8.54k| .visit(v, std::forward(args)...); 1848| 8.54k| } 1849| 10.9k|} _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| 2.40k| { 1814| 2.40k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.40k| } _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| 13.0M| { 1751| 13.0M| auto offset = relaxed_->d.count - 1; 1752| 13.0M| auto child = node_->inner()[offset]; 1753| 13.0M| auto child_size = size(offset); 1754| 13.0M| auto is_leaf = shift_ == BL; 1755| 13.0M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 669k, False: 12.3M] ------------------ 1756| 13.0M| : visit_maybe_relaxed_sub( 1757| 12.3M| child, shift_ - B, child_size, v, args...); 1758| 13.0M| } _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| 12.3M|{ 1839| 12.3M| assert(node); ------------------ | Branch (1839:5): [True: 12.3M, False: 0] ------------------ 1840| 12.3M| auto relaxed = node->relaxed(); 1841| 12.3M| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.5M, False: 786k] ------------------ 1842| 11.5M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.5M, False: 0] ------------------ 1843| 11.5M| return make_relaxed_pos(node, shift, relaxed) 1844| 11.5M| .visit(v, std::forward(args)...); 1845| 11.5M| } else { 1846| 786k| return make_regular_sub_pos(node, shift, size) 1847| 786k| .visit(v, std::forward(args)...); 1848| 786k| } 1849| 12.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| 11.5M| { 1814| 11.5M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.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| 19.6k| { 1037| 19.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 19.6k| } _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| 24.0k| { 1037| 24.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 24.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_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 24.0k|{ 1839| 24.0k| assert(node); ------------------ | Branch (1839:5): [True: 24.0k, False: 0] ------------------ 1840| 24.0k| auto relaxed = node->relaxed(); 1841| 24.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.26k, False: 17.7k] ------------------ 1842| 6.26k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.26k, False: 0] ------------------ 1843| 6.26k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.26k| .visit(v, std::forward(args)...); 1845| 17.7k| } else { 1846| 17.7k| return make_regular_sub_pos(node, shift, size) 1847| 17.7k| .visit(v, std::forward(args)...); 1848| 17.7k| } 1849| 24.0k|} _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.26k| { 1814| 6.26k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.26k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 17.7k| { 1037| 17.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 17.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| 188k| { 1814| 188k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 188k| } _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| 182k| { 1738| 182k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 182k, False: 0] ------------------ 1739| 182k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 182k, False: 0] ------------------ 1740| 182k| auto child = node_->inner()[offset_hint]; 1741| 182k| auto is_leaf = shift_ == BL; 1742| 182k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 182k] ------------------ 1743| 182k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 182k| : visit_maybe_relaxed_sub( 1745| 182k| child, shift_ - B, child_size_hint, v, args...); 1746| 182k| } _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| 182k|{ 1839| 182k| assert(node); ------------------ | Branch (1839:5): [True: 182k, False: 0] ------------------ 1840| 182k| auto relaxed = node->relaxed(); 1841| 182k| if (relaxed) { ------------------ | Branch (1841:9): [True: 29.8k, False: 152k] ------------------ 1842| 29.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 29.8k, False: 0] ------------------ 1843| 29.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 29.8k| .visit(v, std::forward(args)...); 1845| 152k| } else { 1846| 152k| return make_regular_sub_pos(node, shift, size) 1847| 152k| .visit(v, std::forward(args)...); 1848| 152k| } 1849| 182k|} _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| 152k| { 1037| 152k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 152k| } _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| 296k| { 953| 296k| return last_oh_regular(*this, v, offset_hint, args...); 954| 296k| } _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| 296k|{ 678| 296k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 296k, False: 0] ------------------ 679| 296k| constexpr auto B = bits; 680| 296k| constexpr auto BL = bits_leaf; 681| 296k| auto child = p.node()->inner()[offset_hint]; 682| 296k| auto is_leaf = p.shift() == BL; 683| 296k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 296k] ------------------ 684| 296k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 296k| .visit(v, args...); 686| 296k|} _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.35M| { 337| 1.35M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.35M| } _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.06M| { 331| 1.06M| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.06M| } _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.06M|{ 678| 1.06M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.06M, False: 0] ------------------ 679| 1.06M| constexpr auto B = bits; 680| 1.06M| constexpr auto BL = bits_leaf; 681| 1.06M| auto child = p.node()->inner()[offset_hint]; 682| 1.06M| auto is_leaf = p.shift() == BL; 683| 1.06M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.06M] ------------------ 684| 1.06M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.06M| .visit(v, args...); 686| 1.06M|} _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.17k| { 331| 2.17k| return last_oh_regular(*this, v, offset_hint, args...); 332| 2.17k| } _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.17k|{ 678| 2.17k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 2.17k, False: 0] ------------------ 679| 2.17k| constexpr auto B = bits; 680| 2.17k| constexpr auto BL = bits_leaf; 681| 2.17k| auto child = p.node()->inner()[offset_hint]; 682| 2.17k| auto is_leaf = p.shift() == BL; 683| 2.17k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 2.17k] ------------------ 684| 2.17k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 2.17k| .visit(v, args...); 686| 2.17k|} _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.31k| { 337| 3.31k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.31k| } _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.37k| { 1738| 5.37k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 5.37k, False: 0] ------------------ 1739| 5.37k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 5.37k, False: 0] ------------------ 1740| 5.37k| auto child = node_->inner()[offset_hint]; 1741| 5.37k| auto is_leaf = shift_ == BL; 1742| 5.37k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 5.37k] ------------------ 1743| 5.37k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 5.37k| : visit_maybe_relaxed_sub( 1745| 5.37k| child, shift_ - B, child_size_hint, v, args...); 1746| 5.37k| } _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.37k|{ 1839| 5.37k| assert(node); ------------------ | Branch (1839:5): [True: 5.37k, False: 0] ------------------ 1840| 5.37k| auto relaxed = node->relaxed(); 1841| 5.37k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.64k, False: 723] ------------------ 1842| 4.64k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.64k, False: 0] ------------------ 1843| 4.64k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.64k| .visit(v, std::forward(args)...); 1845| 4.64k| } else { 1846| 723| return make_regular_sub_pos(node, shift, size) 1847| 723| .visit(v, std::forward(args)...); 1848| 723| } 1849| 5.37k|} _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.64k| { 1814| 4.64k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.64k| } _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| 723| { 1037| 723| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 723| } _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| 155k| { 1037| 155k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 155k| } _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| 13.9k|{ 1839| 13.9k| assert(node); ------------------ | Branch (1839:5): [True: 13.9k, False: 0] ------------------ 1840| 13.9k| auto relaxed = node->relaxed(); 1841| 13.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.8k, False: 2.17k] ------------------ 1842| 11.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.8k, False: 0] ------------------ 1843| 11.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.8k| .visit(v, std::forward(args)...); 1845| 11.8k| } else { 1846| 2.17k| return make_regular_sub_pos(node, shift, size) 1847| 2.17k| .visit(v, std::forward(args)...); 1848| 2.17k| } 1849| 13.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| 11.8k| { 1814| 11.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.8k| } _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| 59.6k| { 1687| 59.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 59.6k, False: 0] ------------------ 1688| 59.6k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 15.3k, False: 44.2k] ------------------ 1689| 59.6k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 59.6k| } _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| 59.6k| { 1699| 59.6k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 59.6k| } _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| 59.6k| { 1718| 59.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 59.6k, False: 0] ------------------ 1719| 59.6k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 15.3k, False: 44.2k] | Branch (1719:9): [True: 59.6k, False: 0] ------------------ 1720| 59.6k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 59.6k| auto child = node_->inner()[offset_hint]; 1722| 59.6k| auto is_leaf = shift_ == BL; 1723| 59.6k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 59.6k| auto next_idx = idx - left_size_hint; 1725| 59.6k| return is_leaf ------------------ | Branch (1725:16): [True: 9.55k, False: 50.0k] ------------------ 1726| 59.6k| ? make_leaf_sub_pos(child, next_size) 1727| 9.55k| .visit(v, next_idx, args...) 1728| 59.6k| : visit_maybe_relaxed_sub( 1729| 50.0k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 59.6k| } _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| 9.55k| { 145| 9.55k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.55k| } _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| 50.0k|{ 1839| 50.0k| assert(node); ------------------ | Branch (1839:5): [True: 50.0k, False: 0] ------------------ 1840| 50.0k| auto relaxed = node->relaxed(); 1841| 50.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 47.8k, False: 2.26k] ------------------ 1842| 47.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 47.8k, False: 0] ------------------ 1843| 47.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 47.8k| .visit(v, std::forward(args)...); 1845| 47.8k| } else { 1846| 2.26k| return make_regular_sub_pos(node, shift, size) 1847| 2.26k| .visit(v, std::forward(args)...); 1848| 2.26k| } 1849| 50.0k|} _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| 47.8k| { 1814| 47.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 47.8k| } _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.26k| { 1037| 2.26k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.26k| } _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.43k| { 939| 4.43k| return towards_oh_ch_regular( 940| 4.43k| *this, v, idx, offset_hint, count(), args...); 941| 4.43k| } _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.43k|{ 633| 4.43k| constexpr auto B = bits; 634| 4.43k| constexpr auto BL = bits_leaf; 635| 4.43k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.43k, False: 0] ------------------ 636| 4.43k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.43k, False: 0] ------------------ 637| 4.43k| auto is_leaf = p.shift() == BL; 638| 4.43k| auto child = p.node()->inner()[offset_hint]; 639| 4.43k| auto is_full = offset_hint + 1 != count_hint; 640| 4.43k| return is_full ------------------ | Branch (640:12): [True: 2.11k, False: 2.32k] ------------------ 641| 4.43k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.06k, False: 1.05k] ------------------ 642| 2.11k| : make_full_pos(child, p.shift() - B) 643| 1.05k| .visit(v, idx, args...)) 644| 4.43k| : (is_leaf ------------------ | Branch (644:19): [True: 425, False: 1.89k] ------------------ 645| 2.32k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.32k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.89k| .visit(v, idx, args...)); 648| 4.43k|} _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.61k| { 208| 3.61k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.61k| } _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.92k| { 1406| 2.92k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.92k| } _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.92k| { 1330| 2.92k| return towards_oh(v, idx, offset_hint, args...); 1331| 2.92k| } _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.92k| { 1337| 2.92k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.92k, False: 0] ------------------ 1338| 2.92k| auto is_leaf = shift_ == BL; 1339| 2.92k| auto child = node_->inner()[offset_hint]; 1340| 2.92k| return is_leaf ------------------ | Branch (1340:16): [True: 2.16k, False: 767] ------------------ 1341| 2.92k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.92k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.92k| } _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| 819| { 113| 819| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 819| } _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.47k| { 337| 2.47k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.47k| } _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.47k| { 317| 2.47k| return towards_oh_ch_regular( 318| 2.47k| *this, v, idx, offset_hint, count(), args...); 319| 2.47k| } _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.47k|{ 633| 2.47k| constexpr auto B = bits; 634| 2.47k| constexpr auto BL = bits_leaf; 635| 2.47k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.47k, False: 0] ------------------ 636| 2.47k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.47k, False: 0] ------------------ 637| 2.47k| auto is_leaf = p.shift() == BL; 638| 2.47k| auto child = p.node()->inner()[offset_hint]; 639| 2.47k| auto is_full = offset_hint + 1 != count_hint; 640| 2.47k| return is_full ------------------ | Branch (640:12): [True: 1.50k, False: 977] ------------------ 641| 2.47k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 395, False: 1.10k] ------------------ 642| 1.50k| : make_full_pos(child, p.shift() - B) 643| 1.10k| .visit(v, idx, args...)) 644| 2.47k| : (is_leaf ------------------ | Branch (644:19): [True: 394, False: 583] ------------------ 645| 977| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 977| : make_regular_pos(child, p.shift() - B, p.size()) 647| 583| .visit(v, idx, args...)); 648| 2.47k|} _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.17k| { 1037| 2.17k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.17k| } _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.8k|{ 1839| 41.8k| assert(node); ------------------ | Branch (1839:5): [True: 41.8k, False: 0] ------------------ 1840| 41.8k| auto relaxed = node->relaxed(); 1841| 41.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 29.7k, False: 12.0k] ------------------ 1842| 29.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 29.7k, False: 0] ------------------ 1843| 29.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 29.7k| .visit(v, std::forward(args)...); 1845| 29.7k| } else { 1846| 12.0k| return make_regular_sub_pos(node, shift, size) 1847| 12.0k| .visit(v, std::forward(args)...); 1848| 12.0k| } 1849| 41.8k|} _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| 29.7k| { 1814| 29.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 29.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 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: 0, False: 11.7k] ------------------ 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_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_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_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_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: 0, False: 11.7k] | 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: 1.03k, False: 10.7k] ------------------ 1726| 11.7k| ? make_leaf_sub_pos(child, next_size) 1727| 1.03k| .visit(v, next_idx, args...) 1728| 11.7k| : visit_maybe_relaxed_sub( 1729| 10.7k| 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_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 1.03k| { 145| 1.03k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.03k| } _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| 21.6k| { 1687| 21.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 21.6k, False: 0] ------------------ 1688| 21.6k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 21.6k] ------------------ 1689| 21.6k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 21.6k| } _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| 21.6k| { 1699| 21.6k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 21.6k| } _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| 21.6k| { 1718| 21.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 21.6k, False: 0] ------------------ 1719| 21.6k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 21.6k] | Branch (1719:9): [True: 21.6k, False: 0] ------------------ 1720| 21.6k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 21.6k| auto child = node_->inner()[offset_hint]; 1722| 21.6k| auto is_leaf = shift_ == BL; 1723| 21.6k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 21.6k| auto next_idx = idx - left_size_hint; 1725| 21.6k| return is_leaf ------------------ | Branch (1725:16): [True: 995, False: 20.6k] ------------------ 1726| 21.6k| ? make_leaf_sub_pos(child, next_size) 1727| 995| .visit(v, next_idx, args...) 1728| 21.6k| : visit_maybe_relaxed_sub( 1729| 20.6k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 21.6k| } _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| 995| { 145| 995| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 995| } _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| 20.6k|{ 1839| 20.6k| assert(node); ------------------ | Branch (1839:5): [True: 20.6k, False: 0] ------------------ 1840| 20.6k| auto relaxed = node->relaxed(); 1841| 20.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 19.5k, False: 1.10k] ------------------ 1842| 19.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 19.5k, False: 0] ------------------ 1843| 19.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 19.5k| .visit(v, std::forward(args)...); 1845| 19.5k| } else { 1846| 1.10k| return make_regular_sub_pos(node, shift, size) 1847| 1.10k| .visit(v, std::forward(args)...); 1848| 1.10k| } 1849| 20.6k|} _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| 19.5k| { 1814| 19.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 19.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.10k| { 1037| 1.10k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.10k| } _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.56k| { 928| 2.56k| return towards_oh_ch_regular( 929| 2.56k| *this, v, idx, offset_hint, count(), args...); 930| 2.56k| } _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.56k|{ 633| 2.56k| constexpr auto B = bits; 634| 2.56k| constexpr auto BL = bits_leaf; 635| 2.56k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.56k, False: 0] ------------------ 636| 2.56k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.56k, False: 0] ------------------ 637| 2.56k| auto is_leaf = p.shift() == BL; 638| 2.56k| auto child = p.node()->inner()[offset_hint]; 639| 2.56k| auto is_full = offset_hint + 1 != count_hint; 640| 2.56k| return is_full ------------------ | Branch (640:12): [True: 2.15k, False: 414] ------------------ 641| 2.56k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 668, False: 1.48k] ------------------ 642| 2.15k| : make_full_pos(child, p.shift() - B) 643| 1.48k| .visit(v, idx, args...)) 644| 2.56k| : (is_leaf ------------------ | Branch (644:19): [True: 414, False: 0] ------------------ 645| 414| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 414| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.56k|} _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.76k| { 208| 1.76k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.76k| } _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.79k| { 1406| 1.79k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.79k| } _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.41k| { 1337| 1.41k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.41k, False: 0] ------------------ 1338| 1.41k| auto is_leaf = shift_ == BL; 1339| 1.41k| auto child = node_->inner()[offset_hint]; 1340| 1.41k| return is_leaf ------------------ | Branch (1340:16): [True: 1.09k, False: 311] ------------------ 1341| 1.41k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.41k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.41k| } _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| 1.90k| { 1337| 1.90k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.90k, False: 0] ------------------ 1338| 1.90k| auto is_leaf = shift_ == BL; 1339| 1.90k| auto child = node_->inner()[offset_hint]; 1340| 1.90k| return is_leaf ------------------ | Branch (1340:16): [True: 1.26k, False: 637] ------------------ 1341| 1.90k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.90k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.90k| } _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.06k| { 208| 3.06k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.06k| } _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.08k| { 1406| 3.08k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.08k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 2.87k| { 1406| 2.87k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.87k| } _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| 8.87k| { 1337| 8.87k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 8.87k, False: 0] ------------------ 1338| 8.87k| auto is_leaf = shift_ == BL; 1339| 8.87k| auto child = node_->inner()[offset_hint]; 1340| 8.87k| return is_leaf ------------------ | Branch (1340:16): [True: 6.65k, False: 2.22k] ------------------ 1341| 8.87k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 8.87k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 8.87k| } _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| 9.22k| { 208| 9.22k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.22k| } _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| 5.11k| { 1406| 5.11k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.11k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 2.84k| { 1311| 2.84k| each_i(v, start, branches, args...); 1312| 2.84k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 4.22k| { 1264| 4.22k| auto p = node_->inner() + i; 1265| 4.22k| auto e = node_->inner() + n; 1266| 4.22k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 2.60k, False: 1.61k] ------------------ 1267| 14.5k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 11.9k, False: 2.60k] ------------------ 1268| 11.9k| IMMER_PREFETCH(p + 1); 1269| 11.9k| make_full_leaf_pos(*p).visit(v, args...); 1270| 11.9k| } 1271| 2.60k| } else { 1272| 1.61k| auto ss = shift_ - B; 1273| 8.73k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 7.12k, False: 1.61k] ------------------ 1274| 7.12k| make_full_pos(*p, ss).visit(v, args...); 1275| 1.61k| } 1276| 4.22k| } _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| 414| { 113| 414| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 414| } _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| 2.95k| { 306| 2.95k| return towards_oh_ch_regular( 307| 2.95k| *this, v, idx, offset_hint, count(), args...); 308| 2.95k| } _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| 2.95k|{ 633| 2.95k| constexpr auto B = bits; 634| 2.95k| constexpr auto BL = bits_leaf; 635| 2.95k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.95k, False: 0] ------------------ 636| 2.95k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.95k, False: 0] ------------------ 637| 2.95k| auto is_leaf = p.shift() == BL; 638| 2.95k| auto child = p.node()->inner()[offset_hint]; 639| 2.95k| auto is_full = offset_hint + 1 != count_hint; 640| 2.95k| return is_full ------------------ | Branch (640:12): [True: 1.91k, False: 1.03k] ------------------ 641| 2.95k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 956, False: 961] ------------------ 642| 1.91k| : make_full_pos(child, p.shift() - B) 643| 961| .visit(v, idx, args...)) 644| 2.95k| : (is_leaf ------------------ | Branch (644:19): [True: 690, False: 349] ------------------ 645| 1.03k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.03k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 349| .visit(v, idx, args...)); 648| 2.95k|} _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.61k| { 113| 1.61k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.61k| } _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| 3.97k| { 337| 3.97k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.97k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 1.61k| { 337| 1.61k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.61k| } _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.29k| { 306| 4.29k| return towards_oh_ch_regular( 307| 4.29k| *this, v, idx, offset_hint, count(), args...); 308| 4.29k| } _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.29k|{ 633| 4.29k| constexpr auto B = bits; 634| 4.29k| constexpr auto BL = bits_leaf; 635| 4.29k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.29k, False: 0] ------------------ 636| 4.29k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.29k, False: 0] ------------------ 637| 4.29k| auto is_leaf = p.shift() == BL; 638| 4.29k| auto child = p.node()->inner()[offset_hint]; 639| 4.29k| auto is_full = offset_hint + 1 != count_hint; 640| 4.29k| return is_full ------------------ | Branch (640:12): [True: 1.87k, False: 2.42k] ------------------ 641| 4.29k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 911, False: 961] ------------------ 642| 1.87k| : make_full_pos(child, p.shift() - B) 643| 961| .visit(v, idx, args...)) 644| 4.29k| : (is_leaf ------------------ | Branch (644:19): [True: 1.75k, False: 662] ------------------ 645| 2.42k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.42k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 662| .visit(v, idx, args...)); 648| 4.29k|} _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.46k| { 113| 2.46k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.46k| } _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.27k| { 337| 3.27k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.27k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 2.95k| { 286| 2.95k| return each_right_regular(*this, v, start, args...); 287| 2.95k| } _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| 2.95k|{ 598| 2.95k| constexpr auto B = bits; 599| 2.95k| constexpr auto BL = bits_leaf; 600| | 601| 2.95k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 1.64k, False: 1.31k] ------------------ 602| 1.64k| auto n = p.node()->inner() + start; 603| 1.64k| auto last = p.count() - 1; 604| 1.64k| auto e = p.node()->inner() + last; 605| 1.64k| if (n <= e) { ------------------ | Branch (605:13): [True: 956, False: 690] ------------------ 606| 3.53k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 2.58k, False: 956] ------------------ 607| 2.58k| IMMER_PREFETCH(n + 1); 608| 2.58k| make_full_leaf_pos(*n).visit(v, args...); 609| 2.58k| } 610| 956| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 956| } 612| 1.64k| } else { 613| 1.31k| auto n = p.node()->inner() + start; 614| 1.31k| auto last = p.count() - 1; 615| 1.31k| auto e = p.node()->inner() + last; 616| 1.31k| auto ss = p.shift() - B; 617| 1.31k| if (n <= e) { ------------------ | Branch (617:13): [True: 961, False: 349] ------------------ 618| 2.17k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.21k, False: 961] ------------------ 619| 1.21k| make_full_pos(*n, ss).visit(v, args...); 620| 961| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 961| } 622| 1.31k| } 623| 2.95k|} _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| 6.87k| { 928| 6.87k| return towards_oh_ch_regular( 929| 6.87k| *this, v, idx, offset_hint, count(), args...); 930| 6.87k| } _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| 6.87k|{ 633| 6.87k| constexpr auto B = bits; 634| 6.87k| constexpr auto BL = bits_leaf; 635| 6.87k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.87k, False: 0] ------------------ 636| 6.87k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.87k, False: 0] ------------------ 637| 6.87k| auto is_leaf = p.shift() == BL; 638| 6.87k| auto child = p.node()->inner()[offset_hint]; 639| 6.87k| auto is_full = offset_hint + 1 != count_hint; 640| 6.87k| return is_full ------------------ | Branch (640:12): [True: 2.32k, False: 4.55k] ------------------ 641| 6.87k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 841, False: 1.48k] ------------------ 642| 2.32k| : make_full_pos(child, p.shift() - B) 643| 1.48k| .visit(v, idx, args...)) 644| 6.87k| : (is_leaf ------------------ | Branch (644:19): [True: 923, False: 3.62k] ------------------ 645| 4.55k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.55k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.62k| .visit(v, idx, args...)); 648| 6.87k|} _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| 6.90k| { 928| 6.90k| return towards_oh_ch_regular( 929| 6.90k| *this, v, idx, offset_hint, count(), args...); 930| 6.90k| } _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| 6.90k|{ 633| 6.90k| constexpr auto B = bits; 634| 6.90k| constexpr auto BL = bits_leaf; 635| 6.90k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.90k, False: 0] ------------------ 636| 6.90k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.90k, False: 0] ------------------ 637| 6.90k| auto is_leaf = p.shift() == BL; 638| 6.90k| auto child = p.node()->inner()[offset_hint]; 639| 6.90k| auto is_full = offset_hint + 1 != count_hint; 640| 6.90k| return is_full ------------------ | Branch (640:12): [True: 3.59k, False: 3.31k] ------------------ 641| 6.90k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.66k, False: 1.93k] ------------------ 642| 3.59k| : make_full_pos(child, p.shift() - B) 643| 1.93k| .visit(v, idx, args...)) 644| 6.90k| : (is_leaf ------------------ | Branch (644:19): [True: 706, False: 2.61k] ------------------ 645| 3.31k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.31k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.61k| .visit(v, idx, args...)); 648| 6.90k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 867| 11.3k| { 868| 11.3k| return each_right_regular(*this, v, start, args...); 869| 11.3k| } _ZN5immer6detail4rbts18each_right_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 597| 11.3k|{ 598| 11.3k| constexpr auto B = bits; 599| 11.3k| constexpr auto BL = bits_leaf; 600| | 601| 11.3k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 3.54k, False: 7.84k] ------------------ 602| 3.54k| auto n = p.node()->inner() + start; 603| 3.54k| auto last = p.count() - 1; 604| 3.54k| auto e = p.node()->inner() + last; 605| 3.54k| if (n <= e) { ------------------ | Branch (605:13): [True: 1.92k, False: 1.61k] ------------------ 606| 3.36k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.43k, False: 1.92k] ------------------ 607| 1.43k| IMMER_PREFETCH(n + 1); 608| 1.43k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.43k| } 610| 1.92k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 1.92k| } 612| 7.84k| } else { 613| 7.84k| auto n = p.node()->inner() + start; 614| 7.84k| auto last = p.count() - 1; 615| 7.84k| auto e = p.node()->inner() + last; 616| 7.84k| auto ss = p.shift() - B; 617| 7.84k| if (n <= e) { ------------------ | Branch (617:13): [True: 4.22k, False: 3.62k] ------------------ 618| 5.28k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.06k, False: 4.22k] ------------------ 619| 1.06k| make_full_pos(*n, ss).visit(v, args...); 620| 4.22k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 4.22k| } 622| 7.84k| } 623| 11.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 20.2k| { 1814| 20.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 20.2k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 12.3k| { 1687| 12.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 12.3k, False: 0] ------------------ 1688| 12.3k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 10.9k, False: 1.41k] ------------------ 1689| 12.3k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 12.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 12.3k| { 1699| 12.3k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 12.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 12.3k| { 1718| 12.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 12.3k, False: 0] ------------------ 1719| 12.3k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 10.9k, False: 1.41k] | Branch (1719:9): [True: 12.3k, False: 0] ------------------ 1720| 12.3k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 12.3k| auto child = node_->inner()[offset_hint]; 1722| 12.3k| auto is_leaf = shift_ == BL; 1723| 12.3k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 12.3k| auto next_idx = idx - left_size_hint; 1725| 12.3k| return is_leaf ------------------ | Branch (1725:16): [True: 3.03k, False: 9.35k] ------------------ 1726| 12.3k| ? make_leaf_sub_pos(child, next_size) 1727| 3.03k| .visit(v, next_idx, args...) 1728| 12.3k| : visit_maybe_relaxed_sub( 1729| 9.35k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 12.3k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 3.03k| { 145| 3.03k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.03k| } _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.35k|{ 1839| 9.35k| assert(node); ------------------ | Branch (1839:5): [True: 9.35k, False: 0] ------------------ 1840| 9.35k| auto relaxed = node->relaxed(); 1841| 9.35k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.67k, False: 4.68k] ------------------ 1842| 4.67k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.67k, False: 0] ------------------ 1843| 4.67k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.67k| .visit(v, std::forward(args)...); 1845| 4.68k| } else { 1846| 4.68k| return make_regular_sub_pos(node, shift, size) 1847| 4.68k| .visit(v, std::forward(args)...); 1848| 4.68k| } 1849| 9.35k|} _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.67k| { 1814| 4.67k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.67k| } _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| 4.68k| { 1037| 4.68k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.68k| } _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.98k| { 1037| 9.98k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 9.98k| } _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.5k| { 1687| 12.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 12.5k, False: 0] ------------------ 1688| 12.5k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 10.1k, False: 2.41k] ------------------ 1689| 12.5k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 12.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_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 12.5k| { 1699| 12.5k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 12.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_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 12.5k| { 1718| 12.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 12.5k, False: 0] ------------------ 1719| 12.5k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 10.1k, False: 2.41k] | Branch (1719:9): [True: 12.5k, False: 0] ------------------ 1720| 12.5k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 12.5k| auto child = node_->inner()[offset_hint]; 1722| 12.5k| auto is_leaf = shift_ == BL; 1723| 12.5k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 12.5k| auto next_idx = idx - left_size_hint; 1725| 12.5k| return is_leaf ------------------ | Branch (1725:16): [True: 5.18k, False: 7.37k] ------------------ 1726| 12.5k| ? make_leaf_sub_pos(child, next_size) 1727| 5.18k| .visit(v, next_idx, args...) 1728| 12.5k| : visit_maybe_relaxed_sub( 1729| 7.37k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 12.5k| } _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.18k| { 145| 5.18k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.18k| } _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.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.36k, False: 3.01k] ------------------ 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| 4.36k| } else { 1846| 3.01k| return make_regular_sub_pos(node, shift, size) 1847| 3.01k| .visit(v, std::forward(args)...); 1848| 3.01k| } 1849| 7.37k|} _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.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_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 3.01k| { 1037| 3.01k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.01k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 24.1k| { 1654| 24.1k| assert(start > 0); ------------------ | Branch (1654:9): [True: 24.1k, False: 0] ------------------ 1655| 24.1k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 24.1k, False: 0] ------------------ 1656| 24.1k| auto s = relaxed_->d.sizes[start - 1]; 1657| 24.1k| auto p = node_->inner(); 1658| 24.1k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 4.07k, False: 20.0k] ------------------ 1659| 18.8k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 14.8k, False: 4.07k] ------------------ 1660| 14.8k| IMMER_PREFETCH(p + i + 1); 1661| 14.8k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 14.8k| .visit(v, args...); 1663| 14.8k| s = relaxed_->d.sizes[i]; 1664| 14.8k| assert(s); ------------------ | Branch (1664:17): [True: 14.8k, False: 0] ------------------ 1665| 14.8k| } 1666| 20.0k| } else { 1667| 20.0k| auto ss = shift_ - B; 1668| 93.6k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 73.5k, False: 20.0k] ------------------ 1669| 73.5k| visit_maybe_relaxed_sub( 1670| 73.5k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 73.5k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 73.5k, False: 0] ------------------ 1673| 73.5k| } 1674| 20.0k| } 1675| 24.1k| } _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| 12.0k| { 1037| 12.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 12.0k| } _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.51k| { 928| 4.51k| return towards_oh_ch_regular( 929| 4.51k| *this, v, idx, offset_hint, count(), args...); 930| 4.51k| } _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.51k|{ 633| 4.51k| constexpr auto B = bits; 634| 4.51k| constexpr auto BL = bits_leaf; 635| 4.51k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.51k, False: 0] ------------------ 636| 4.51k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.51k, False: 0] ------------------ 637| 4.51k| auto is_leaf = p.shift() == BL; 638| 4.51k| auto child = p.node()->inner()[offset_hint]; 639| 4.51k| auto is_full = offset_hint + 1 != count_hint; 640| 4.51k| return is_full ------------------ | Branch (640:12): [True: 3.82k, False: 694] ------------------ 641| 4.51k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.08k, False: 2.73k] ------------------ 642| 3.82k| : make_full_pos(child, p.shift() - B) 643| 2.73k| .visit(v, idx, args...)) 644| 4.51k| : (is_leaf ------------------ | Branch (644:19): [True: 694, False: 0] ------------------ 645| 694| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 694| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 4.51k|} _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.62k| { 208| 1.62k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.62k| } _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.13k| { 1406| 3.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.13k| } _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| 937| { 1337| 937| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 937, False: 0] ------------------ 1338| 937| auto is_leaf = shift_ == BL; 1339| 937| auto child = node_->inner()[offset_hint]; 1340| 937| return is_leaf ------------------ | Branch (1340:16): [True: 537, False: 400] ------------------ 1341| 937| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 937| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 937| } _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| 694| { 113| 694| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 694| } _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| 909| { 145| 909| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 909| } _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| 67.8k|{ 1839| 67.8k| assert(node); ------------------ | Branch (1839:5): [True: 67.8k, False: 0] ------------------ 1840| 67.8k| auto relaxed = node->relaxed(); 1841| 67.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 61.8k, False: 5.99k] ------------------ 1842| 61.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 61.8k, False: 0] ------------------ 1843| 61.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 61.8k| .visit(v, std::forward(args)...); 1845| 61.8k| } else { 1846| 5.99k| return make_regular_sub_pos(node, shift, size) 1847| 5.99k| .visit(v, std::forward(args)...); 1848| 5.99k| } 1849| 67.8k|} _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| 61.8k| { 1814| 61.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 61.8k| } _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| 2.12k| { 1706| 2.12k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 2.12k, False: 0] ------------------ 1707| 2.12k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 1.75k, False: 371] ------------------ 1708| 2.12k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 2.12k| } _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| 2.12k| { 1718| 2.12k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 2.12k, False: 0] ------------------ 1719| 2.12k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 1.75k, False: 371] | Branch (1719:9): [True: 2.12k, False: 0] ------------------ 1720| 2.12k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 2.12k| auto child = node_->inner()[offset_hint]; 1722| 2.12k| auto is_leaf = shift_ == BL; 1723| 2.12k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 2.12k| auto next_idx = idx - left_size_hint; 1725| 2.12k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 2.12k] ------------------ 1726| 2.12k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 2.12k| : visit_maybe_relaxed_sub( 1729| 2.12k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 2.12k| } _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.47k| { 1706| 3.47k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.47k, False: 0] ------------------ 1707| 3.47k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 2.97k, False: 502] ------------------ 1708| 3.47k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.47k| } _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.47k| { 1718| 3.47k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.47k, False: 0] ------------------ 1719| 3.47k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 2.97k, False: 502] | Branch (1719:9): [True: 3.47k, False: 0] ------------------ 1720| 3.47k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.47k| auto child = node_->inner()[offset_hint]; 1722| 3.47k| auto is_leaf = shift_ == BL; 1723| 3.47k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.47k| auto next_idx = idx - left_size_hint; 1725| 3.47k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.47k] ------------------ 1726| 3.47k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.47k| : visit_maybe_relaxed_sub( 1729| 3.47k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.47k| } _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.47k|{ 1839| 3.47k| assert(node); ------------------ | Branch (1839:5): [True: 3.47k, False: 0] ------------------ 1840| 3.47k| auto relaxed = node->relaxed(); 1841| 3.47k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.30k, False: 1.17k] ------------------ 1842| 2.30k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.30k, False: 0] ------------------ 1843| 2.30k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.30k| .visit(v, std::forward(args)...); 1845| 2.30k| } else { 1846| 1.17k| return make_regular_sub_pos(node, shift, size) 1847| 1.17k| .visit(v, std::forward(args)...); 1848| 1.17k| } 1849| 3.47k|} _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.30k| { 1814| 2.30k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.30k| } _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.17k| { 1037| 1.17k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.17k| } _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.46k| { 947| 1.46k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 1.46k| } _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.46k|{ 654| 1.46k| constexpr auto B = bits; 655| 1.46k| constexpr auto BL = bits_leaf; 656| 1.46k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 1.46k, False: 0] ------------------ 657| 1.46k| auto is_leaf = p.shift() == BL; 658| 1.46k| auto child = p.node()->inner()[offset_hint]; 659| 1.46k| auto lsize = offset_hint << p.shift(); 660| 1.46k| auto size = p.this_size(); 661| 1.46k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 1.46k| return is_full ------------------ | Branch (662:12): [True: 685, False: 780] ------------------ 663| 1.46k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 685] ------------------ 664| 685| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 685| : make_full_pos(child, p.shift() - B) 666| 685| .visit(v, idx - lsize, args...)) 667| 1.46k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 780] ------------------ 668| 780| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 780| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 780| .visit(v, idx - lsize, args...)); 672| 1.46k|} _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| 685| { 1406| 685| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 685| } _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.38k| { 1349| 1.38k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 1.38k, False: 0] ------------------ 1350| 1.38k| auto is_leaf = shift_ == BL; 1351| 1.38k| auto child = node_->inner()[offset_hint]; 1352| 1.38k| auto lsize = size_t{offset_hint} << shift_; 1353| 1.38k| return is_leaf ------------------ | Branch (1353:16): [True: 804, False: 577] ------------------ 1354| 1.38k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 1.38k| : make_full_pos(child, shift_ - B) 1356| 577| .visit(v, idx - lsize, args...); 1357| 1.38k| } _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.81k| { 208| 2.81k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.81k| } _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.50k| { 1406| 1.50k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.50k| } _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| 3.94k| { 1349| 3.94k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 3.94k, False: 0] ------------------ 1350| 3.94k| auto is_leaf = shift_ == BL; 1351| 3.94k| auto child = node_->inner()[offset_hint]; 1352| 3.94k| auto lsize = size_t{offset_hint} << shift_; 1353| 3.94k| return is_leaf ------------------ | Branch (1353:16): [True: 3.31k, False: 627] ------------------ 1354| 3.94k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 3.94k| : make_full_pos(child, shift_ - B) 1356| 627| .visit(v, idx - lsize, args...); 1357| 3.94k| } _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.18k| { 208| 7.18k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 7.18k| } _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| 1.93k| { 1406| 1.93k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.93k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1316| 1.38k| { 1317| 1.38k| each_i(v, 0, last, args...); 1318| 1.38k| } _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| 780| { 1037| 780| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 780| } _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.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_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 2.94k| { 947| 2.94k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.94k| } _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| 2.94k|{ 654| 2.94k| constexpr auto B = bits; 655| 2.94k| constexpr auto BL = bits_leaf; 656| 2.94k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.94k, False: 0] ------------------ 657| 2.94k| auto is_leaf = p.shift() == BL; 658| 2.94k| auto child = p.node()->inner()[offset_hint]; 659| 2.94k| auto lsize = offset_hint << p.shift(); 660| 2.94k| auto size = p.this_size(); 661| 2.94k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.94k| return is_full ------------------ | Branch (662:12): [True: 2.94k, False: 0] ------------------ 663| 2.94k| ? (is_leaf ------------------ | Branch (663:19): [True: 2.01k, False: 930] ------------------ 664| 2.94k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 2.94k| : make_full_pos(child, p.shift() - B) 666| 930| .visit(v, idx - lsize, args...)) 667| 2.94k| : (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| 2.94k|} _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.17k| { 947| 5.17k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 5.17k| } _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.17k|{ 654| 5.17k| constexpr auto B = bits; 655| 5.17k| constexpr auto BL = bits_leaf; 656| 5.17k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 5.17k, False: 0] ------------------ 657| 5.17k| auto is_leaf = p.shift() == BL; 658| 5.17k| auto child = p.node()->inner()[offset_hint]; 659| 5.17k| auto lsize = offset_hint << p.shift(); 660| 5.17k| auto size = p.this_size(); 661| 5.17k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 5.17k| return is_full ------------------ | Branch (662:12): [True: 5.17k, False: 0] ------------------ 663| 5.17k| ? (is_leaf ------------------ | Branch (663:19): [True: 3.87k, False: 1.30k] ------------------ 664| 5.17k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 5.17k| : make_full_pos(child, p.shift() - B) 666| 1.30k| .visit(v, idx - lsize, args...)) 667| 5.17k| : (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.17k|} _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.16k| { 874| 5.16k| return each_left_regular(*this, v, last, args...); 875| 5.16k| } _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.16k|{ 576| 5.16k| constexpr auto B = bits; 577| 5.16k| constexpr auto BL = bits_leaf; 578| 5.16k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 5.16k, False: 0] ------------------ 579| 5.16k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 2.01k, False: 3.15k] ------------------ 580| 2.01k| auto n = p.node()->inner(); 581| 2.01k| auto e = n + last; 582| 5.35k| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.34k, False: 2.01k] ------------------ 583| 3.34k| IMMER_PREFETCH(n + 1); 584| 3.34k| make_full_leaf_pos(*n).visit(v, args...); 585| 3.34k| } 586| 3.15k| } else { 587| 3.15k| auto n = p.node()->inner(); 588| 3.15k| auto e = n + last; 589| 3.15k| auto ss = p.shift() - B; 590| 5.39k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 2.24k, False: 3.15k] ------------------ 591| 2.24k| make_full_pos(*n, ss).visit(v, args...); 592| 3.15k| } 593| 5.16k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 2.12k| { 1814| 2.12k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.12k| } _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| 176k| { 1706| 176k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 176k, False: 0] ------------------ 1707| 176k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 41.7k, False: 135k] ------------------ 1708| 176k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 176k| } _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| 176k| { 1718| 176k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 176k, False: 0] ------------------ 1719| 176k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 41.7k, False: 135k] | Branch (1719:9): [True: 176k, False: 0] ------------------ 1720| 176k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 176k| auto child = node_->inner()[offset_hint]; 1722| 176k| auto is_leaf = shift_ == BL; 1723| 176k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 176k| auto next_idx = idx - left_size_hint; 1725| 176k| return is_leaf ------------------ | Branch (1725:16): [True: 3.86k, False: 172k] ------------------ 1726| 176k| ? make_leaf_sub_pos(child, next_size) 1727| 3.86k| .visit(v, next_idx, args...) 1728| 176k| : visit_maybe_relaxed_sub( 1729| 172k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 176k| } _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| 3.86k| { 145| 3.86k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.86k| } _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| 172k|{ 1839| 172k| assert(node); ------------------ | Branch (1839:5): [True: 172k, False: 0] ------------------ 1840| 172k| auto relaxed = node->relaxed(); 1841| 172k| if (relaxed) { ------------------ | Branch (1841:9): [True: 171k, False: 1.70k] ------------------ 1842| 171k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 171k, False: 0] ------------------ 1843| 171k| return make_relaxed_pos(node, shift, relaxed) 1844| 171k| .visit(v, std::forward(args)...); 1845| 171k| } else { 1846| 1.70k| return make_regular_sub_pos(node, shift, size) 1847| 1.70k| .visit(v, std::forward(args)...); 1848| 1.70k| } 1849| 172k|} _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| 171k| { 1814| 171k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 171k| } _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.70k| { 1037| 1.70k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.70k| } _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| 145k| { 1706| 145k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 145k, False: 0] ------------------ 1707| 145k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 76.7k, False: 68.7k] ------------------ 1708| 145k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 145k| } _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| 145k| { 1718| 145k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 145k, False: 0] ------------------ 1719| 145k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 76.7k, False: 68.7k] | Branch (1719:9): [True: 145k, False: 0] ------------------ 1720| 145k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 145k| auto child = node_->inner()[offset_hint]; 1722| 145k| auto is_leaf = shift_ == BL; 1723| 145k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 145k| auto next_idx = idx - left_size_hint; 1725| 145k| return is_leaf ------------------ | Branch (1725:16): [True: 51.9k, False: 93.5k] ------------------ 1726| 145k| ? make_leaf_sub_pos(child, next_size) 1727| 51.9k| .visit(v, next_idx, args...) 1728| 145k| : visit_maybe_relaxed_sub( 1729| 93.5k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 145k| } _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| 51.9k| { 145| 51.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 51.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| 93.5k|{ 1839| 93.5k| assert(node); ------------------ | Branch (1839:5): [True: 93.5k, False: 0] ------------------ 1840| 93.5k| auto relaxed = node->relaxed(); 1841| 93.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 92.4k, False: 1.13k] ------------------ 1842| 92.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 92.4k, False: 0] ------------------ 1843| 92.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 92.4k| .visit(v, std::forward(args)...); 1845| 92.4k| } else { 1846| 1.13k| return make_regular_sub_pos(node, shift, size) 1847| 1.13k| .visit(v, std::forward(args)...); 1848| 1.13k| } 1849| 93.5k|} _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| 92.4k| { 1814| 92.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 92.4k| } _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.13k| { 1037| 1.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.13k| } _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.99k| { 1037| 5.99k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.99k| } _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.22k| { 947| 2.22k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.22k| } _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.22k|{ 654| 2.22k| constexpr auto B = bits; 655| 2.22k| constexpr auto BL = bits_leaf; 656| 2.22k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.22k, False: 0] ------------------ 657| 2.22k| auto is_leaf = p.shift() == BL; 658| 2.22k| auto child = p.node()->inner()[offset_hint]; 659| 2.22k| auto lsize = offset_hint << p.shift(); 660| 2.22k| auto size = p.this_size(); 661| 2.22k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.22k| return is_full ------------------ | Branch (662:12): [True: 1.19k, False: 1.02k] ------------------ 663| 2.22k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.19k] ------------------ 664| 1.19k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.19k| : make_full_pos(child, p.shift() - B) 666| 1.19k| .visit(v, idx - lsize, args...)) 667| 2.22k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.02k] ------------------ 668| 1.02k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.02k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.02k| .visit(v, idx - lsize, args...)); 672| 2.22k|} _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.19k| { 1406| 1.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.19k| } _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| 1.02k| { 1037| 1.02k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.02k| } _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| 22.1k|{ 1839| 22.1k| assert(node); ------------------ | Branch (1839:5): [True: 22.1k, False: 0] ------------------ 1840| 22.1k| auto relaxed = node->relaxed(); 1841| 22.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.9k, False: 11.2k] ------------------ 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| 11.2k| } else { 1846| 11.2k| return make_regular_sub_pos(node, shift, size) 1847| 11.2k| .visit(v, std::forward(args)...); 1848| 11.2k| } 1849| 22.1k|} _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.56k, False: 3.34k] ------------------ 1842| 7.56k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.56k, False: 0] ------------------ 1843| 7.56k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.56k| .visit(v, std::forward(args)...); 1845| 7.56k| } else { 1846| 3.34k| return make_regular_sub_pos(node, shift, size) 1847| 3.34k| .visit(v, std::forward(args)...); 1848| 3.34k| } 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.56k| { 1814| 7.56k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.56k| } _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| 40.7k| { 1794| 40.7k| auto child = node_->inner()[offset]; 1795| 40.7k| auto child_size = size(offset); 1796| 40.7k| auto is_leaf = shift_ == BL; 1797| 40.7k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 18.0k, False: 22.7k] ------------------ 1798| 40.7k| : visit_maybe_relaxed_sub( 1799| 22.7k| child, shift_ - B, child_size, v, args...); 1800| 40.7k| } _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| 18.5k| { 145| 18.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 18.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| 18.5k| { 1805| 18.5k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 18.5k, False: 0] ------------------ 1806| 18.5k| auto child = node_->inner()[offset]; 1807| 18.5k| auto child_size = size(offset); 1808| 18.5k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 18.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| 19.3k| { 145| 19.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 19.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| 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: 20.8k, False: 1.94k] ------------------ 1842| 20.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 20.8k, False: 0] ------------------ 1843| 20.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 20.8k| .visit(v, std::forward(args)...); 1845| 20.8k| } else { 1846| 1.94k| return make_regular_sub_pos(node, shift, size) 1847| 1.94k| .visit(v, std::forward(args)...); 1848| 1.94k| } 1849| 22.7k|} _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| 20.8k| { 1814| 20.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 20.8k| } _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| 20.8k| { 1794| 20.8k| auto child = node_->inner()[offset]; 1795| 20.8k| auto child_size = size(offset); 1796| 20.8k| auto is_leaf = shift_ == BL; 1797| 20.8k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 20.8k] ------------------ 1798| 20.8k| : visit_maybe_relaxed_sub( 1799| 20.8k| child, shift_ - B, child_size, v, args...); 1800| 20.8k| } _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| 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: 20.4k, False: 327] ------------------ 1842| 20.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 20.4k, False: 0] ------------------ 1843| 20.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 20.4k| .visit(v, std::forward(args)...); 1845| 20.4k| } else { 1846| 327| return make_regular_sub_pos(node, shift, size) 1847| 327| .visit(v, std::forward(args)...); 1848| 327| } 1849| 20.8k|} _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| 20.4k| { 1814| 20.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 20.4k| } _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| 788| { 1037| 788| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 788| } _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.66k| { 1794| 6.66k| auto child = node_->inner()[offset]; 1795| 6.66k| auto child_size = size(offset); 1796| 6.66k| auto is_leaf = shift_ == BL; 1797| 6.66k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 3.92k, False: 2.74k] ------------------ 1798| 6.66k| : visit_maybe_relaxed_sub( 1799| 2.74k| child, shift_ - B, child_size, v, args...); 1800| 6.66k| } _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.92k| { 145| 3.92k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.92k| } _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.92k| { 1026| 3.92k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 3.92k, False: 0] ------------------ 1027| 3.92k| auto child = node_->inner()[idx]; 1028| 3.92k| auto lsize = size(idx); 1029| 3.92k| auto is_full = idx + 1 < count(); 1030| 3.92k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 3.12k, False: 800] ------------------ 1031| 3.92k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 3.92k| } _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| 11.0k| { 208| 11.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 11.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.74k|{ 1839| 2.74k| assert(node); ------------------ | Branch (1839:5): [True: 2.74k, False: 0] ------------------ 1840| 2.74k| auto relaxed = node->relaxed(); 1841| 2.74k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.19k, False: 546] ------------------ 1842| 2.19k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.19k, False: 0] ------------------ 1843| 2.19k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.19k| .visit(v, std::forward(args)...); 1845| 2.19k| } else { 1846| 546| return make_regular_sub_pos(node, shift, size) 1847| 546| .visit(v, std::forward(args)...); 1848| 546| } 1849| 2.74k|} _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.19k| { 1814| 2.19k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.19k| } _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.19k| { 1008| 2.19k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.19k, False: 0] ------------------ 1009| 2.19k| auto is_leaf = shift_ == BL; 1010| 2.19k| auto child = node_->inner()[idx]; 1011| 2.19k| auto lsize = size(idx); 1012| 2.19k| auto is_full = idx + 1 < count(); 1013| 2.19k| return is_full ------------------ | Branch (1013:16): [True: 1.73k, False: 461] ------------------ 1014| 2.19k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.73k] ------------------ 1015| 1.73k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.73k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.19k| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 461] ------------------ 1018| 461| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 461| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 461| .visit(v, args...)); 1021| 2.19k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1405| 2.25k| { 1406| 2.25k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.25k| } _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| 9.29k| { 1794| 9.29k| auto child = node_->inner()[offset]; 1795| 9.29k| auto child_size = size(offset); 1796| 9.29k| auto is_leaf = shift_ == BL; 1797| 9.29k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 7.93k, False: 1.36k] ------------------ 1798| 9.29k| : visit_maybe_relaxed_sub( 1799| 1.36k| child, shift_ - B, child_size, v, args...); 1800| 9.29k| } _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.93k| { 145| 7.93k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.93k| } _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.93k| { 1397| 7.93k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 7.93k, False: 0] ------------------ 1398| 7.93k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 7.93k, False: 0] ------------------ 1399| 7.93k| auto child = node_->inner()[idx]; 1400| 7.93k| return make_full_leaf_pos(child).visit(v, args...); 1401| 7.93k| } _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.36k|{ 1839| 1.36k| assert(node); ------------------ | Branch (1839:5): [True: 1.36k, False: 0] ------------------ 1840| 1.36k| auto relaxed = node->relaxed(); 1841| 1.36k| if (relaxed) { ------------------ | Branch (1841:9): [True: 517, False: 843] ------------------ 1842| 517| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 517, False: 0] ------------------ 1843| 517| return make_relaxed_pos(node, shift, relaxed) 1844| 517| .visit(v, std::forward(args)...); 1845| 843| } else { 1846| 843| return make_regular_sub_pos(node, shift, size) 1847| 843| .visit(v, std::forward(args)...); 1848| 843| } 1849| 1.36k|} _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| 517| { 1814| 517| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 517| } _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| 517| { 1387| 517| assert(idx < count()); ------------------ | Branch (1387:9): [True: 517, False: 0] ------------------ 1388| 517| auto is_leaf = shift_ == BL; 1389| 517| auto child = node_->inner()[idx]; 1390| 517| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 517] ------------------ 1391| 517| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 517| } _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| 843| { 1037| 843| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 843| } _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| 843| { 1387| 843| assert(idx < count()); ------------------ | Branch (1387:9): [True: 843, False: 0] ------------------ 1388| 843| auto is_leaf = shift_ == BL; 1389| 843| auto child = node_->inner()[idx]; 1390| 843| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 843] ------------------ 1391| 843| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 843| } _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.38k| { 1406| 1.38k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.38k| } _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.69k| { 1223| 8.69k| auto p = node_->inner(); 1224| 8.69k| auto p2 = other->inner(); 1225| 8.69k| auto e = p + branches; 1226| 8.69k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 5.81k, False: 2.87k] ------------------ 1227| 26.7k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 24.4k, False: 2.30k] ------------------ 1228| 24.4k| IMMER_PREFETCH(p + 1); 1229| 24.4k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 3.51k, False: 20.9k] ------------------ 1230| 3.51k| return false; 1231| 24.4k| } 1232| 5.81k| } else { 1233| 2.87k| auto ss = shift_ - B; 1234| 11.6k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 10.6k, False: 1.02k] ------------------ 1235| 10.6k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 1.84k, False: 8.80k] ------------------ 1236| 1.84k| return false; 1237| 2.87k| } 1238| 3.33k| return true; 1239| 8.69k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 31.4k| { 208| 31.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 31.4k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 24.3k| { 1406| 24.3k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 24.3k| } _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| 8.12k| { 838| 8.12k| return each_pred_zip_regular(*this, v, other, args...); 839| 8.12k| } _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| 8.12k|{ 393| 8.12k| constexpr auto B = bits; 394| 8.12k| constexpr auto BL = bits_leaf; 395| | 396| 8.12k| auto n = p.node()->inner(); 397| 8.12k| auto n2 = other->inner(); 398| 8.12k| auto last = p.count() - 1; 399| 8.12k| auto e = n + last; 400| 8.12k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.58k, False: 6.53k] ------------------ 401| 3.53k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 2.74k, False: 785] ------------------ 402| 2.74k| IMMER_PREFETCH(n + 1); 403| 2.74k| IMMER_PREFETCH(n2 + 1); 404| 2.74k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 803, False: 1.94k] ------------------ 405| 803| return false; 406| 2.74k| } 407| 785| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 6.53k| } else { 409| 6.53k| auto ss = p.shift() - B; 410| 14.1k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 10.5k, False: 3.62k] ------------------ 411| 10.5k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 2.91k, False: 7.61k] ------------------ 412| 2.91k| return false; 413| 3.62k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 6.53k| } 415| 8.12k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 3.10k| { 113| 3.10k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 3.10k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 4.79k| { 337| 4.79k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.79k| } _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.92k| { 256| 3.92k| return each_pred_zip_regular(*this, v, other, args...); 257| 3.92k| } _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.92k|{ 393| 3.92k| constexpr auto B = bits; 394| 3.92k| constexpr auto BL = bits_leaf; 395| | 396| 3.92k| auto n = p.node()->inner(); 397| 3.92k| auto n2 = other->inner(); 398| 3.92k| auto last = p.count() - 1; 399| 3.92k| auto e = n + last; 400| 3.92k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.53k, False: 1.38k] ------------------ 401| 6.58k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 4.26k, False: 2.32k] ------------------ 402| 4.26k| IMMER_PREFETCH(n + 1); 403| 4.26k| IMMER_PREFETCH(n2 + 1); 404| 4.26k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 216, False: 4.04k] ------------------ 405| 216| return false; 406| 4.26k| } 407| 2.32k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 2.53k| } else { 409| 1.38k| auto ss = p.shift() - B; 410| 4.33k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 3.16k, False: 1.17k] ------------------ 411| 3.16k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 210, False: 2.95k] ------------------ 412| 210| return false; 413| 1.17k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 1.38k| } 415| 3.92k|} _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| 6.10k| { 1387| 6.10k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 6.10k, False: 0] ------------------ 1388| 6.10k| auto is_leaf = shift_ == BL; 1389| 6.10k| auto child = node_->inner()[idx]; 1390| 6.10k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 4.92k, False: 1.18k] ------------------ 1391| 6.10k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 6.10k| } _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| 327k| { 208| 327k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 327k| } _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| 5.82M|{ 1839| 5.82M| assert(node); ------------------ | Branch (1839:5): [True: 5.82M, False: 0] ------------------ 1840| 5.82M| auto relaxed = node->relaxed(); 1841| 5.82M| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.46M, False: 354k] ------------------ 1842| 5.46M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.46M, False: 0] ------------------ 1843| 5.46M| return make_relaxed_pos(node, shift, relaxed) 1844| 5.46M| .visit(v, std::forward(args)...); 1845| 5.46M| } else { 1846| 354k| return make_regular_sub_pos(node, shift, size) 1847| 354k| .visit(v, std::forward(args)...); 1848| 354k| } 1849| 5.82M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 5.46M| { 1814| 5.46M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.46M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 5.46M| { 1680| 5.46M| return towards_oh(v, idx, subindex(idx), args...); 1681| 5.46M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1686| 5.46M| { 1687| 5.46M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 5.46M, False: 0] ------------------ 1688| 5.46M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 3.88M, False: 1.57M] ------------------ 1689| 5.46M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 5.46M| } _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| 5.46M| { 1699| 5.46M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 5.46M| } _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| 5.46M| { 1718| 5.46M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 5.46M, False: 0] ------------------ 1719| 5.46M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.88M, False: 1.57M] | Branch (1719:9): [True: 5.46M, False: 0] ------------------ 1720| 5.46M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 5.46M| auto child = node_->inner()[offset_hint]; 1722| 5.46M| auto is_leaf = shift_ == BL; 1723| 5.46M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 5.46M| auto next_idx = idx - left_size_hint; 1725| 5.46M| return is_leaf ------------------ | Branch (1725:16): [True: 1.15M, False: 4.30M] ------------------ 1726| 5.46M| ? make_leaf_sub_pos(child, next_size) 1727| 1.15M| .visit(v, next_idx, args...) 1728| 5.46M| : visit_maybe_relaxed_sub( 1729| 4.30M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 5.46M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 144| 1.15M| { 145| 1.15M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.15M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 354k| { 1037| 354k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 354k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 354k| { 920| 354k| return towards_oh_ch_regular( 921| 354k| *this, v, idx, index(idx), count(), args...); 922| 354k| } _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| 354k|{ 633| 354k| constexpr auto B = bits; 634| 354k| constexpr auto BL = bits_leaf; 635| 354k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 354k, False: 0] ------------------ 636| 354k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 354k, False: 0] ------------------ 637| 354k| auto is_leaf = p.shift() == BL; 638| 354k| auto child = p.node()->inner()[offset_hint]; 639| 354k| auto is_full = offset_hint + 1 != count_hint; 640| 354k| return is_full ------------------ | Branch (640:12): [True: 291k, False: 62.7k] ------------------ 641| 354k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 68.7k, False: 222k] ------------------ 642| 291k| : make_full_pos(child, p.shift() - B) 643| 222k| .visit(v, idx, args...)) 644| 354k| : (is_leaf ------------------ | Branch (644:19): [True: 13.8k, False: 48.8k] ------------------ 645| 62.7k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 62.7k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 48.8k| .visit(v, idx, args...)); 648| 354k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 335k| { 208| 335k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 335k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 493k| { 1406| 493k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 493k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 493k| { 1323| 493k| return towards_oh(v, idx, index(idx), args...); 1324| 493k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 493k| { 1337| 493k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 493k, False: 0] ------------------ 1338| 493k| auto is_leaf = shift_ == BL; 1339| 493k| auto child = node_->inner()[offset_hint]; 1340| 493k| return is_leaf ------------------ | Branch (1340:16): [True: 254k, False: 238k] ------------------ 1341| 493k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 493k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 493k| } _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| 55.6k| { 337| 55.6k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 55.6k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 55.6k| { 298| 55.6k| return towards_oh_ch_regular( 299| 55.6k| *this, v, idx, index(idx), count(), args...); 300| 55.6k| } _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| 55.6k|{ 633| 55.6k| constexpr auto B = bits; 634| 55.6k| constexpr auto BL = bits_leaf; 635| 55.6k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 55.6k, False: 0] ------------------ 636| 55.6k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 55.6k, False: 0] ------------------ 637| 55.6k| auto is_leaf = p.shift() == BL; 638| 55.6k| auto child = p.node()->inner()[offset_hint]; 639| 55.6k| auto is_full = offset_hint + 1 != count_hint; 640| 55.6k| return is_full ------------------ | Branch (640:12): [True: 43.9k, False: 11.6k] ------------------ 641| 55.6k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 11.7k, False: 32.2k] ------------------ 642| 43.9k| : make_full_pos(child, p.shift() - B) 643| 32.2k| .visit(v, idx, args...)) 644| 55.6k| : (is_leaf ------------------ | Branch (644:19): [True: 4.88k, False: 6.76k] ------------------ 645| 11.6k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 11.6k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 6.76k| .visit(v, idx, args...)); 648| 55.6k|} _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| 34.8k| { 1406| 34.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 34.8k| } _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| 34.8k| { 1203| 34.8k| auto p = node_->inner(); 1204| 34.8k| auto e = p + branches; 1205| 34.8k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 32.1k, False: 2.67k] ------------------ 1206| 284k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 253k, False: 31.2k] ------------------ 1207| 253k| IMMER_PREFETCH(p + 1); 1208| 253k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 888, False: 252k] ------------------ 1209| 888| return false; 1210| 253k| } 1211| 32.1k| } else { 1212| 2.67k| auto ss = shift_ - B; 1213| 21.7k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 19.4k, False: 2.32k] ------------------ 1214| 19.4k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 347, False: 19.1k] ------------------ 1215| 347| return false; 1216| 2.67k| } 1217| 33.6k| return true; 1218| 34.8k| } _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| 546| { 1037| 546| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 546| } _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| 546| { 1008| 546| assert(idx < count()); ------------------ | Branch (1008:9): [True: 546, False: 0] ------------------ 1009| 546| auto is_leaf = shift_ == BL; 1010| 546| auto child = node_->inner()[idx]; 1011| 546| auto lsize = size(idx); 1012| 546| auto is_full = idx + 1 < count(); 1013| 546| return is_full ------------------ | Branch (1013:16): [True: 546, False: 0] ------------------ 1014| 546| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 546] ------------------ 1015| 546| ? make_full_leaf_pos(child).visit(v, args...) 1016| 546| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 546| : (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| 546| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 1.67k| { 1037| 1.67k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.67k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1007| 3.18k| { 1008| 3.18k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 3.18k, False: 0] ------------------ 1009| 3.18k| auto is_leaf = shift_ == BL; 1010| 3.18k| auto child = node_->inner()[idx]; 1011| 3.18k| auto lsize = size(idx); 1012| 3.18k| auto is_full = idx + 1 < count(); 1013| 3.18k| return is_full ------------------ | Branch (1013:16): [True: 1.41k, False: 1.76k] ------------------ 1014| 3.18k| ? (is_leaf ------------------ | Branch (1014:23): [True: 897, False: 519] ------------------ 1015| 1.41k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.41k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 3.18k| : (is_leaf ------------------ | Branch (1017:23): [True: 934, False: 835] ------------------ 1018| 1.76k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 1.76k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 835| .visit(v, args...)); 1021| 3.18k| } _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| 1.11M| { 145| 1.11M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.11M| } _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.6k| { 1037| 13.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 13.6k| } _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.6k| { 832| 13.6k| return each_pred_regular(*this, v, args...); 833| 13.6k| } _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.6k|{ 366| 13.6k| constexpr auto B = bits; 367| 13.6k| constexpr auto BL = bits_leaf; 368| 13.6k| auto n = p.node()->inner(); 369| 13.6k| auto last = p.count() - 1; 370| 13.6k| auto e = n + last; 371| 13.6k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 9.30k, False: 4.32k] ------------------ 372| 65.4k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 56.4k, False: 9.07k] ------------------ 373| 56.4k| IMMER_PREFETCH(n + 1); 374| 56.4k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 232, False: 56.1k] ------------------ 375| 232| return false; 376| 56.4k| } 377| 9.07k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 9.30k| } else { 379| 4.32k| auto ss = p.shift() - B; 380| 15.0k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 11.3k, False: 3.72k] ------------------ 381| 11.3k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 601, False: 10.7k] ------------------ 382| 601| return false; 383| 3.72k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 4.32k| } 385| 13.6k|} _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.3k| { 113| 12.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 12.3k| } _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| 5.02k| { 337| 5.02k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 5.02k| } _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| 5.02k| { 250| 5.02k| return each_pred_regular(*this, v, args...); 251| 5.02k| } _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| 5.02k|{ 366| 5.02k| constexpr auto B = bits; 367| 5.02k| constexpr auto BL = bits_leaf; 368| 5.02k| auto n = p.node()->inner(); 369| 5.02k| auto last = p.count() - 1; 370| 5.02k| auto e = n + last; 371| 5.02k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 3.49k, False: 1.53k] ------------------ 372| 14.8k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 11.5k, False: 3.30k] ------------------ 373| 11.5k| IMMER_PREFETCH(n + 1); 374| 11.5k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 195, False: 11.3k] ------------------ 375| 195| return false; 376| 11.5k| } 377| 3.30k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 3.49k| } else { 379| 1.53k| auto ss = p.shift() - B; 380| 3.62k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 2.31k, False: 1.30k] ------------------ 381| 2.31k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 225, False: 2.09k] ------------------ 382| 225| return false; 383| 1.30k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 1.53k| } 385| 5.02k|} _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| 1.94k| { 1037| 1.94k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.94k| } _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| 1.94k| { 1794| 1.94k| auto child = node_->inner()[offset]; 1795| 1.94k| auto child_size = size(offset); 1796| 1.94k| auto is_leaf = shift_ == BL; 1797| 1.94k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 1.94k] ------------------ 1798| 1.94k| : visit_maybe_relaxed_sub( 1799| 1.94k| child, shift_ - B, child_size, v, args...); 1800| 1.94k| } _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| 1.94k|{ 1839| 1.94k| assert(node); ------------------ | Branch (1839:5): [True: 1.94k, False: 0] ------------------ 1840| 1.94k| auto relaxed = node->relaxed(); 1841| 1.94k| if (relaxed) { ------------------ | Branch (1841:9): [True: 269, False: 1.67k] ------------------ 1842| 269| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 269, False: 0] ------------------ 1843| 269| return make_relaxed_pos(node, shift, relaxed) 1844| 269| .visit(v, std::forward(args)...); 1845| 1.67k| } else { 1846| 1.67k| return make_regular_sub_pos(node, shift, size) 1847| 1.67k| .visit(v, std::forward(args)...); 1848| 1.67k| } 1849| 1.94k|} _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| 269| { 1814| 269| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 269| } _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.52k| { 1008| 4.52k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 4.52k, False: 0] ------------------ 1009| 4.52k| auto is_leaf = shift_ == BL; 1010| 4.52k| auto child = node_->inner()[idx]; 1011| 4.52k| auto lsize = size(idx); 1012| 4.52k| auto is_full = idx + 1 < count(); 1013| 4.52k| return is_full ------------------ | Branch (1013:16): [True: 4.00k, False: 511] ------------------ 1014| 4.52k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.31k, False: 1.69k] ------------------ 1015| 4.00k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 4.00k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.52k| : (is_leaf ------------------ | Branch (1017:23): [True: 511, False: 0] ------------------ 1018| 511| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 511| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 4.52k| } _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| 6.18k| { 208| 6.18k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.18k| } _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| 6.18k| { 1805| 6.18k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 6.18k, False: 0] ------------------ 1806| 6.18k| auto child = node_->inner()[offset]; 1807| 6.18k| auto child_size = size(offset); 1808| 6.18k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 6.18k| } _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| 6.18k| { 145| 6.18k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.18k| } _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.16k| { 1406| 2.16k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.16k| } _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.16k| { 1794| 2.16k| auto child = node_->inner()[offset]; 1795| 2.16k| auto child_size = size(offset); 1796| 2.16k| auto is_leaf = shift_ == BL; 1797| 2.16k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.16k] ------------------ 1798| 2.16k| : visit_maybe_relaxed_sub( 1799| 2.16k| child, shift_ - B, child_size, v, args...); 1800| 2.16k| } _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.16k|{ 1839| 2.16k| assert(node); ------------------ | Branch (1839:5): [True: 2.16k, False: 0] ------------------ 1840| 2.16k| auto relaxed = node->relaxed(); 1841| 2.16k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.26k, False: 896] ------------------ 1842| 1.26k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.26k, False: 0] ------------------ 1843| 1.26k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.26k| .visit(v, std::forward(args)...); 1845| 1.26k| } else { 1846| 896| return make_regular_sub_pos(node, shift, size) 1847| 896| .visit(v, std::forward(args)...); 1848| 896| } 1849| 2.16k|} _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.26k| { 1814| 1.26k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.26k| } _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| 4.33k| { 1387| 4.33k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 4.33k, False: 0] ------------------ 1388| 4.33k| auto is_leaf = shift_ == BL; 1389| 4.33k| auto child = node_->inner()[idx]; 1390| 4.33k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 3.87k, False: 462] ------------------ 1391| 4.33k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 4.33k| } _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| 896| { 1037| 896| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 896| } _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| 50.5k| { 1794| 50.5k| auto child = node_->inner()[offset]; 1795| 50.5k| auto child_size = size(offset); 1796| 50.5k| auto is_leaf = shift_ == BL; 1797| 50.5k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 21.6k, False: 28.8k] ------------------ 1798| 50.5k| : visit_maybe_relaxed_sub( 1799| 28.8k| child, shift_ - B, child_size, v, args...); 1800| 50.5k| } _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| 179k|{ 1839| 179k| assert(node); ------------------ | Branch (1839:5): [True: 179k, False: 0] ------------------ 1840| 179k| auto relaxed = node->relaxed(); 1841| 179k| if (relaxed) { ------------------ | Branch (1841:9): [True: 166k, False: 12.7k] ------------------ 1842| 166k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 166k, False: 0] ------------------ 1843| 166k| return make_relaxed_pos(node, shift, relaxed) 1844| 166k| .visit(v, std::forward(args)...); 1845| 166k| } else { 1846| 12.7k| return make_regular_sub_pos(node, shift, size) 1847| 12.7k| .visit(v, std::forward(args)...); 1848| 12.7k| } 1849| 179k|} _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| 166k| { 1814| 166k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 166k| } _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| 166k| { 1483| 166k| auto p = node_->inner(); 1484| 166k| auto s = size_t{}; 1485| 166k| auto n = count(); 1486| 166k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 145k, False: 20.9k] ------------------ 1487| 1.23M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 1.09M, False: 145k] ------------------ 1488| 1.09M| IMMER_PREFETCH(p + i + 1); 1489| 1.09M| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 289, False: 1.09M] ------------------ 1490| 1.09M| .visit(v, args...)) 1491| 289| return false; 1492| 1.09M| s = relaxed_->d.sizes[i]; 1493| 1.09M| } 1494| 145k| } else { 1495| 20.9k| auto ss = shift_ - B; 1496| 171k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 150k, False: 20.6k] ------------------ 1497| 150k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 388, False: 150k] ------------------ 1498| 150k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 388| return false; 1500| 150k| s = relaxed_->d.sizes[i]; 1501| 150k| } 1502| 20.9k| } 1503| 166k| return true; 1504| 166k| } _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.34k| { 1037| 3.34k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.34k| } _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| 1.06k| { 1784| 1.06k| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 1.06k, False: 0] ------------------ 1785| 1.06k| auto child = node_->inner()[0]; 1786| 1.06k| auto child_size = relaxed_->d.sizes[0]; 1787| 1.06k| return visit_maybe_relaxed_sub( 1788| 1.06k| child, shift_ - B, child_size, v, args...); 1789| 1.06k| } _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| 1.06k|{ 1839| 1.06k| assert(node); ------------------ | Branch (1839:5): [True: 1.06k, False: 0] ------------------ 1840| 1.06k| auto relaxed = node->relaxed(); 1841| 1.06k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.06k, False: 0] ------------------ 1842| 1.06k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.06k, False: 0] ------------------ 1843| 1.06k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.06k| .visit(v, std::forward(args)...); 1845| 1.06k| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 1.06k|} _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| 1.06k| { 1814| 1.06k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.06k| } _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| 11.2k|{ 1839| 11.2k| assert(node); ------------------ | Branch (1839:5): [True: 11.2k, False: 0] ------------------ 1840| 11.2k| auto relaxed = node->relaxed(); 1841| 11.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.13k, False: 9.15k] ------------------ 1842| 2.13k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.13k, False: 0] ------------------ 1843| 2.13k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.13k| .visit(v, std::forward(args)...); 1845| 9.15k| } else { 1846| 9.15k| return make_regular_sub_pos(node, shift, size) 1847| 9.15k| .visit(v, std::forward(args)...); 1848| 9.15k| } 1849| 11.2k|} _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.13k| { 1814| 2.13k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.13k| } _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| 9.15k| { 1037| 9.15k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 9.15k| } _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| 11.2k| { 1037| 11.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 11.2k| } _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.89k| { 145| 7.89k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.89k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2Ev: 114| 2.90M| : size{0} 115| 2.90M| , shift{BL} 116| 2.90M| , root{empty_root()} 117| 2.90M| , tail{empty_tail()} 118| 2.90M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 2.90M, False: 0] ------------------ 120| 2.90M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10empty_rootEv: 61| 2.92M| { 62| 2.92M| static const auto empty_ = [] { 63| 2.92M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 2.92M| static std::aligned_storage_t 65| 2.92M| storage; 66| 2.92M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 2.92M| }(); 68| 2.92M| return empty_->inc(); 69| 2.92M| } _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.90M| { 73| 2.90M| static const auto empty_ = [] { 74| 2.90M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 2.90M| static std::aligned_storage_t 76| 2.90M| storage; 77| 2.90M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 2.90M| }(); 79| 2.90M| return empty_->inc(); 80| 2.90M| } _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| 6.09M| { 1373| 6.09M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 6.09M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 1.40k, False: 6.09M] | | ------------------ | | 33| 6.09M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 1.40k|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 6.09M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 6.09M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 6.09M] | | ------------------ | | 33| 6.09M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 6.09M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 6.09M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 6.09M] | | ------------------ | | 33| 6.09M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 6.09M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 6.09M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 6.09M] | | ------------------ | | 33| 6.09M| 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| 6.09M| return true; 1382| 6.09M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11tail_offsetEv: 197| 30.7M| { 198| 30.7M| auto r = root->relaxed(); 199| 30.7M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 15.0M, False: 15.6M] | Branch (199:9): [True: 15.6M, False: 0] | Branch (199:9): [True: 30.7M, False: 0] ------------------ 200| 30.7M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 15.6M, False: 15.0M] ------------------ 201| 30.7M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 6.34M, False: 8.75M] ------------------ 202| | /* otherwise */ 203| 15.0M| : 0; 204| 30.7M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9tail_sizeEv: 194| 6.41M| 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| 6.09M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE3decEv: 192| 6.09M| 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| 6.09M| { 209| 6.09M| auto tail_off = tail_offset(); 210| 6.09M| auto tail_size = size - tail_off; 211| | 212| 6.09M| if (tail_off) ------------------ | Branch (212:13): [True: 3.01M, False: 3.08M] ------------------ 213| 3.01M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 3.08M| else 215| 3.08M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 6.09M| if (tail_size) ------------------ | Branch (217:13): [True: 3.18M, False: 2.91M] ------------------ 218| 3.18M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 2.91M| else 220| 2.91M| make_empty_leaf_pos(tail).visit(v, args...); 221| 6.09M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_backEi: 500| 281k| { 501| 281k| auto ts = tail_size(); 502| 281k| if (ts < branches) { ------------------ | Branch (502:13): [True: 236k, False: 44.2k] ------------------ 503| 236k| auto new_tail = 504| 236k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 236k| return {size + 1, shift, root->inc(), new_tail}; 506| 236k| } else { 507| 44.2k| using std::get; 508| 44.2k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 44.2k| auto tail_off = tail_offset(); 510| 44.2k| IMMER_TRY { ------------------ | | 49| 44.2k|#define IMMER_TRY try ------------------ 511| 44.2k| auto new_root = 512| 44.2k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 44.2k| tail->inc(); 514| 44.2k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 44.2k| } 516| 44.2k| 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.2k| } 521| 281k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2EmjPNS1_4nodeIiSA_Lj3ELj3EEESE_: 127| 3.18M| : size{sz} 128| 3.18M| , shift{sh} 129| 3.18M| , root{r} 130| 3.18M| , tail{t} 131| 3.18M| { 132| 3.18M|#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.18M| try { 137| 3.18M| check_tree(); 138| 3.18M| } catch (...) { 139| | // This not fully constructed rrbtree owns the nodes already, have 140| | // to dec them. 141| 1.40k| if (r && t) ------------------ | Branch (141:17): [True: 1.40k, False: 0] | Branch (141:22): [True: 1.40k, False: 0] ------------------ 142| 1.40k| dec(); 143| 1.40k| throw; 144| 1.40k| } 145| |#else 146| | assert(check_tree()); 147| |#endif 148| 3.18M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_tailEPNS1_4nodeIiSA_Lj3ELj3EEEjmSE_j: 369| 1.17M| { 370| 1.17M| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 347k, False: 826k] ------------------ 371| 347k| auto new_root = 372| 347k| make_relaxed_pos(root, shift, r) 373| 347k| .visit(push_tail_visitor{}, tail, tail_size); 374| 347k| if (new_root) ------------------ | Branch (374:17): [True: 344k, False: 2.69k] ------------------ 375| 344k| return std::make_tuple(shift, new_root); 376| 2.69k| else { 377| 2.69k| auto new_root = node_t::make_inner_r_n(2); 378| 2.69k| IMMER_TRY { ------------------ | | 49| 2.69k|#define IMMER_TRY try ------------------ 379| 2.69k| auto new_path = node_t::make_path(shift, tail); 380| 2.69k| new_root->inner()[0] = root->inc(); 381| 2.69k| new_root->inner()[1] = new_path; 382| 2.69k| new_root->relaxed()->d.sizes[0] = size; 383| 2.69k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 2.69k| assert(size); ------------------ | Branch (384:21): [True: 2.69k, False: 0] ------------------ 385| 2.69k| assert(tail_size); ------------------ | Branch (385:21): [True: 2.69k, False: 0] ------------------ 386| 2.69k| new_root->relaxed()->d.count = 2u; 387| 2.69k| } 388| 2.69k| 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.69k| return std::make_tuple(shift + B, new_root); 393| 2.69k| } 394| 826k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 6.92k, False: 819k] ------------------ 395| 6.92k| auto new_root = node_t::make_inner_n(2); 396| 6.92k| IMMER_TRY { ------------------ | | 49| 6.92k|#define IMMER_TRY try ------------------ 397| 6.92k| auto new_path = node_t::make_path(shift, tail); 398| 6.92k| new_root->inner()[0] = root->inc(); 399| 6.92k| new_root->inner()[1] = new_path; 400| 6.92k| } 401| 6.92k| 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.92k| return std::make_tuple(shift + B, new_root); 406| 819k| } else if (size) { ------------------ | Branch (406:20): [True: 796k, False: 22.6k] ------------------ 407| 796k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 796k| .visit(push_tail_visitor{}, tail); 409| 796k| return std::make_tuple(shift, new_root); 410| 796k| } else { 411| 22.6k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 22.6k| } 413| 1.17M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2EOSB_: 157| 2.81M| : rrbtree{} 158| 2.81M| { 159| 2.81M| swap(*this, other); 160| 2.81M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEESC_: 176| 5.34M| { 177| 5.34M| using std::swap; 178| 5.34M| swap(x.size, y.size); 179| 5.34M| swap(x.shift, y.shift); 180| 5.34M| swap(x.root, y.root); 181| 5.34M| swap(x.tail, y.tail); 182| 5.34M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEaSEOSB_: 170| 2.52M| { 171| 2.52M| swap(*this, other); 172| 2.52M| return *this; 173| 2.52M| } 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| 168k| { 581| 168k| auto tail_off = tail_offset(); 582| 168k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 121k, False: 47.2k] ------------------ 583| 121k| auto tail_size = size - tail_off; 584| 121k| auto new_tail = 585| 121k| make_leaf_sub_pos(tail, tail_size) 586| 121k| .visit(update_visitor{}, idx - tail_off, fn); 587| 121k| return {size, shift, root->inc(), new_tail}; 588| 121k| } else { 589| 47.2k| auto new_root = visit_maybe_relaxed_sub( 590| 47.2k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 47.2k| return {size, shift, new_root, tail->inc()}; 592| 47.2k| } 593| 168k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4takeEm: 647| 21.0k| { 648| 21.0k| auto tail_off = tail_offset(); 649| 21.0k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 3.79k, False: 17.2k] ------------------ 650| 3.79k| return {}; 651| 17.2k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 703, False: 16.5k] ------------------ 652| 703| return *this; 653| 16.5k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 2.00k, False: 14.5k] ------------------ 654| 2.00k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 2.00k| return {new_size, shift, root->inc(), new_tail}; 656| 14.5k| } else { 657| 14.5k| using std::get; 658| 14.5k| auto l = new_size - 1; 659| 14.5k| auto v = slice_right_visitor(); 660| 14.5k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 14.5k| auto new_shift = get<0>(r); 662| 14.5k| auto new_root = get<1>(r); 663| 14.5k| auto new_tail = get<3>(r); 664| 14.5k| if (new_root) { ------------------ | Branch (664:17): [True: 10.1k, False: 4.32k] ------------------ 665| 10.1k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 10.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 10.1k, False: 0] ------------------ 666| 10.1k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 10.1k, False: 0] ------------------ 667| 10.1k| return {new_size, new_shift, new_root, new_tail}; 668| 10.1k| } else { 669| 4.32k| return {new_size, BL, empty_root(), new_tail}; 670| 4.32k| } 671| 14.5k| } 672| 21.0k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2ERKSB_: 151| 13.7k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 13.7k| { 153| 13.7k| inc(); 154| 13.7k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE3incEv: 187| 13.7k| { 188| 13.7k| root->inc(); 189| 13.7k| tail->inc(); 190| 13.7k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4dropEm: 711| 27.1k| { 712| 27.1k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.09k, False: 25.0k] ------------------ 713| 2.09k| return *this; 714| 25.0k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 1.28k, False: 23.7k] ------------------ 715| 1.28k| return {}; 716| 23.7k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 1.98k, False: 21.7k] ------------------ 717| 1.98k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 21.7k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 2.26k, False: 19.5k] ------------------ 719| 2.26k| auto tail_off = tail_offset(); 720| 2.26k| auto new_tail = 721| 2.26k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 2.26k| return {size - elems, BL, empty_root(), new_tail}; 723| 19.5k| } else { 724| 19.5k| using std::get; 725| 19.5k| auto v = slice_left_visitor(); 726| 19.5k| auto r = 727| 19.5k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 19.5k| auto new_root = get<1>(r); 729| 19.5k| auto new_shift = get<0>(r); 730| 19.5k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 19.5k| } 732| 27.1k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8max_sizeEv: 54| 3.82M| { 55| 3.82M| auto S = sizeof(size_t) * 8; 56| 3.82M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 3.82M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 3.82M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6concatERKSB_: 735| 2.29M| { 736| 2.29M| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 2.29M, False: 0] ------------------ 737| 2.29M| using std::get; 738| 2.29M| if (size == 0) ------------------ | Branch (738:13): [True: 4.78k, False: 2.29M] ------------------ 739| 4.78k| return r; 740| 2.29M| else if (r.size == 0) ------------------ | Branch (740:18): [True: 3.75k, False: 2.28M] ------------------ 741| 3.75k| return *this; 742| 2.28M| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 1.16M, False: 1.11M] ------------------ 743| | // just concat the tail, similar to push_back 744| 1.16M| auto tail_offst = tail_offset(); 745| 1.16M| auto tail_size = size - tail_offst; 746| 1.16M| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 165k, False: 1.00M] ------------------ 747| 165k| auto new_root = 748| 165k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 165k| tail->inc(); 750| 165k| return {size + r.size, 751| 165k| get<0>(new_root), 752| 165k| get<1>(new_root), 753| 165k| r.tail->inc()}; 754| 1.00M| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 40.6k, False: 963k] ------------------ 755| 40.6k| auto new_tail = 756| 40.6k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 40.6k| return {size + r.size, shift, root->inc(), new_tail}; 758| 963k| } else { 759| 963k| auto remaining = branches - tail_size; 760| 963k| auto add_tail = 761| 963k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 963k| IMMER_TRY { ------------------ | | 49| 963k|#define IMMER_TRY try ------------------ 763| 963k| auto new_tail = 764| 963k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 963k| IMMER_TRY { ------------------ | | 49| 963k|#define IMMER_TRY try ------------------ 766| 963k| auto new_root = push_tail( 767| 963k| root, shift, tail_offst, add_tail, branches); 768| 963k| return {size + r.size, 769| 963k| get<0>(new_root), 770| 963k| get<1>(new_root), 771| 963k| new_tail}; 772| 963k| } 773| 963k| 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| 963k| } 778| 963k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 963k| } 783| 1.16M| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 6.52k, False: 1.11M] ------------------ 784| 6.52k| auto tail_offst = tail_offset(); 785| 6.52k| auto tail_size = size - tail_offst; 786| 6.52k| auto concated = 787| 6.52k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 6.52k| auto new_shift = concated.shift(); 789| 6.52k| auto new_root = concated.node(); 790| 6.52k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 6.52k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 6.52k, False: 0] ------------------ 791| 6.52k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 6.52k, False: 0] ------------------ 792| 6.52k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 1.11M| } else { 794| 1.11M| auto tail_offst = tail_offset(); 795| 1.11M| auto tail_size = size - tail_offst; 796| 1.11M| auto concated = concat_trees(root, 797| 1.11M| shift, 798| 1.11M| tail_offst, 799| 1.11M| tail, 800| 1.11M| tail_size, 801| 1.11M| r.root, 802| 1.11M| r.shift, 803| 1.11M| r.tail_offset()); 804| 1.11M| auto new_shift = concated.shift(); 805| 1.11M| auto new_root = concated.node(); 806| 1.11M| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 1.11M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 1.11M, False: 0] ------------------ 807| 1.11M| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 1.11M, False: 0] ------------------ 808| 1.11M| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 1.11M| } 810| 2.29M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 28.7k| { 479| 28.7k| auto ts = tail_size(); 480| 28.7k| if (ts < branches) { ------------------ | Branch (480:13): [True: 21.9k, False: 6.78k] ------------------ 481| 21.9k| ensure_mutable_tail(e, ts); 482| 21.9k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 21.9k| } else { 484| 6.78k| using std::get; 485| 6.78k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 6.78k| auto tail_off = tail_offset(); 487| 6.78k| IMMER_TRY { ------------------ | | 49| 6.78k|#define IMMER_TRY try ------------------ 488| 6.78k| push_tail_mut(e, tail_off, tail, ts); 489| 6.78k| tail = new_tail; 490| 6.78k| } 491| 6.78k| IMMER_CATCH (...) { 492| 0| node_t::delete_leaf(new_tail, 1u); 493| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 494| 0| } 495| 6.78k| } 496| 28.7k| ++size; 497| 28.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 296k| { 470| 296k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 7.47k, False: 289k] ------------------ 471| 7.47k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 7.47k| dec_leaf(tail, n); 473| 7.47k| tail = new_tail; 474| 7.47k| } 475| 296k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj3ELj3EEEj: 417| 317k| { 418| 317k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 158k, False: 159k] ------------------ 419| 158k| auto new_root = 420| 158k| make_relaxed_pos(root, shift, r) 421| 158k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 158k| if (new_root) { ------------------ | Branch (422:17): [True: 157k, False: 1.38k] ------------------ 423| 157k| root = new_root; 424| 157k| } else { 425| 1.38k| auto new_root = node_t::make_inner_r_e(e); 426| 1.38k| IMMER_TRY { ------------------ | | 49| 1.38k|#define IMMER_TRY try ------------------ 427| 1.38k| auto new_path = node_t::make_path_e(e, shift, tail); 428| 1.38k| new_root->inner()[0] = root; 429| 1.38k| new_root->inner()[1] = new_path; 430| 1.38k| new_root->relaxed()->d.sizes[0] = tail_off; 431| 1.38k| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 1.38k| assert(tail_off); ------------------ | Branch (432:21): [True: 1.38k, False: 0] ------------------ 433| 1.38k| assert(tail_size); ------------------ | Branch (433:21): [True: 1.38k, False: 0] ------------------ 434| 1.38k| new_root->relaxed()->d.count = 2u; 435| 1.38k| root = new_root; 436| 1.38k| shift += B; 437| 1.38k| } 438| 1.38k| 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.38k| } 443| 159k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 1.68k, False: 157k] ------------------ 444| 1.68k| auto new_root = node_t::make_inner_e(e); 445| 1.68k| IMMER_TRY { ------------------ | | 49| 1.68k|#define IMMER_TRY try ------------------ 446| 1.68k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 1.68k| new_root->inner()[0] = root; 448| 1.68k| new_root->inner()[1] = new_path; 449| 1.68k| root = new_root; 450| 1.68k| shift += B; 451| 1.68k| } 452| 1.68k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 157k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 155k, False: 1.91k] ------------------ 457| 155k| auto new_root = 458| 155k| make_regular_sub_pos(root, shift, tail_off) 459| 155k| .visit(push_tail_mut_visitor{}, e, tail); 460| 155k| root = new_root; 461| 155k| } else { 462| 1.91k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 1.91k| dec_empty_regular(root); 464| 1.91k| root = new_root; 465| 1.91k| } 466| 317k| } 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| 14.7k| { 574| 14.7k| auto& elem = get_mut(e, idx); 575| 14.7k| elem = std::forward(fn)(std::move(elem)); 576| 14.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 14.7k| { 540| 14.7k| auto tail_off = tail_offset(); 541| 14.7k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 744, False: 13.9k] ------------------ 542| 744| ensure_mutable_tail(e, size - tail_off); 543| 744| return tail->leaf()[(idx - tail_off) & mask]; 544| 13.9k| } else { 545| 13.9k| return visit_maybe_relaxed_sub(root, 546| 13.9k| shift, 547| 13.9k| tail_off, 548| 13.9k| get_mut_visitor{}, 549| 13.9k| idx, 550| 13.9k| e, 551| 13.9k| &root); 552| 13.9k| } 553| 14.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 33.5k| { 607| 33.5k| auto tail_off = tail_offset(); 608| 33.5k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 924, False: 32.6k] ------------------ 609| 924| *this = {}; 610| 32.6k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 880, False: 31.7k] ------------------ 611| 880| return; 612| 31.7k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 613, False: 31.1k] ------------------ 613| 613| auto ts = size - tail_off; 614| 613| auto newts = new_size - tail_off; 615| 613| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 311, False: 302] ------------------ 616| 311| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 311| } else { 618| 302| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 302| dec_leaf(tail, ts); 620| 302| tail = new_tail; 621| 302| } 622| 613| size = new_size; 623| 613| return; 624| 31.1k| } else { 625| 31.1k| using std::get; 626| 31.1k| auto l = new_size - 1; 627| 31.1k| auto v = slice_right_mut_visitor(); 628| 31.1k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 31.1k| auto new_shift = get<0>(r); 630| 31.1k| auto new_root = get<1>(r); 631| 31.1k| auto new_tail = get<3>(r); 632| 31.1k| if (new_root) { ------------------ | Branch (632:17): [True: 24.5k, False: 6.53k] ------------------ 633| 24.5k| root = new_root; 634| 24.5k| shift = new_shift; 635| 24.5k| } else { 636| 6.53k| root = empty_root(); 637| 6.53k| shift = BL; 638| 6.53k| } 639| 31.1k| dec_leaf(tail, size - tail_off); 640| 31.1k| size = new_size; 641| 31.1k| tail = new_tail; 642| 31.1k| return; 643| 31.1k| } 644| 33.5k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 71.8k| { 676| 71.8k| using std::get; 677| 71.8k| auto tail_off = tail_offset(); 678| 71.8k| if (elems == 0) { ------------------ | Branch (678:13): [True: 4.75k, False: 67.1k] ------------------ 679| 4.75k| return; 680| 67.1k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 247, False: 66.8k] ------------------ 681| 247| *this = {}; 682| 66.8k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 216, False: 66.6k] ------------------ 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| 66.6k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 909, False: 65.7k] ------------------ 689| 909| auto v = slice_left_mut_visitor(); 690| 909| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 909| .visit(v, elems - tail_off, e)); 692| 909| if (tail_off) { ------------------ | Branch (692:17): [True: 345, False: 564] ------------------ 693| 345| dec_inner(root, shift, tail_off); 694| 345| shift = BL; 695| 345| root = empty_root(); 696| 345| } 697| 909| size -= elems; 698| 909| return; 699| 65.7k| } else { 700| 65.7k| auto v = slice_left_mut_visitor(); 701| 65.7k| auto r = 702| 65.7k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 65.7k| shift = get<0>(r); 704| 65.7k| root = get<1>(r); 705| 65.7k| size -= elems; 706| 65.7k| return; 707| 65.7k| } 708| 71.8k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editERKSB_: 816| 328k| { 817| 328k| assert(&l != &r); ------------------ | Branch (817:9): [True: 328k, False: 0] ------------------ 818| 328k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 328k, False: 0] ------------------ 819| 328k| using std::get; 820| 328k| if (l.size == 0) ------------------ | Branch (820:13): [True: 420, False: 328k] ------------------ 821| 420| l = r; 822| 328k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 885, False: 327k] ------------------ 823| 885| return; 824| 327k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 262k, False: 65.2k] ------------------ 825| | // just concat the tail, similar to push_back 826| 262k| auto tail_offst = l.tail_offset(); 827| 262k| auto tail_size = l.size - tail_offst; 828| 262k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 25.7k, False: 236k] ------------------ 829| 25.7k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 25.7k| l.tail = r.tail->inc(); 831| 25.7k| l.size += r.size; 832| 25.7k| return; 833| 236k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 2.45k, False: 233k] ------------------ 834| 2.45k| l.ensure_mutable_tail(el, tail_size); 835| 2.45k| detail::uninitialized_copy(r.tail->leaf(), 836| 2.45k| r.tail->leaf() + r.size, 837| 2.45k| l.tail->leaf() + tail_size); 838| 2.45k| l.size += r.size; 839| 2.45k| return; 840| 233k| } else { 841| 233k| auto remaining = branches - tail_size; 842| 233k| l.ensure_mutable_tail(el, tail_size); 843| 233k| detail::uninitialized_copy(r.tail->leaf(), 844| 233k| r.tail->leaf() + remaining, 845| 233k| l.tail->leaf() + tail_size); 846| 233k| IMMER_TRY { ------------------ | | 49| 233k|#define IMMER_TRY try ------------------ 847| 233k| auto new_tail = 848| 233k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 233k| IMMER_TRY { ------------------ | | 49| 233k|#define IMMER_TRY try ------------------ 850| 233k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 233k| l.tail = new_tail; 852| 233k| l.size += r.size; 853| 233k| return; 854| 233k| } 855| 233k| 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| 233k| } 860| 233k| 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| 233k| } 865| 262k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 643, False: 64.6k] ------------------ 866| 643| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 643] ------------------ 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| 643| } else { 886| 643| auto tail_offst = l.tail_offset(); 887| 643| auto tail_size = l.size - tail_offst; 888| 643| auto concated = concat_trees( 889| 643| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 643| l = {l.size + r.size, 891| 643| concated.shift(), 892| 643| concated.node(), 893| 643| r.tail->inc()}; 894| 643| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 643, False: 0] ------------------ 895| 643| return; 896| 643| } 897| 64.6k| } else { 898| 64.6k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 64.6k] ------------------ 899| 0| auto tail_offst = l.tail_offset(); 900| 0| auto tail_size = l.size - tail_offst; 901| 0| assert(l.check_tree()); ------------------ | Branch (901:17): [True: 0, False: 0] ------------------ 902| 0| assert(r.check_tree()); ------------------ | Branch (902:17): [True: 0, False: 0] ------------------ 903| 0| auto concated = 904| 0| concat_trees_mut(el, 905| 0| el, 906| 0| l.root, 907| 0| l.shift, 908| 0| tail_offst, 909| 0| l.tail, 910| 0| tail_size, 911| 0| MemoryPolicy::transience_t::noone, 912| 0| r.root, 913| 0| r.shift, 914| 0| r.tail_offset()); 915| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (915:17): [True: 0, False: 0] ------------------ 916| 0| concated.node()->compute_shift()); 917| 0| l.size += r.size; 918| 0| l.shift = concated.shift(); 919| 0| l.root = concated.node(); 920| 0| l.tail = r.tail; 921| 0| assert(l.check_tree()); ------------------ | Branch (921:17): [True: 0, False: 0] ------------------ 922| 64.6k| } else { 923| 64.6k| auto tail_offst = l.tail_offset(); 924| 64.6k| auto tail_size = l.size - tail_offst; 925| 64.6k| auto concated = concat_trees(l.root, 926| 64.6k| l.shift, 927| 64.6k| tail_offst, 928| 64.6k| l.tail, 929| 64.6k| tail_size, 930| 64.6k| r.root, 931| 64.6k| r.shift, 932| 64.6k| r.tail_offset()); 933| 64.6k| l = {l.size + r.size, 934| 64.6k| concated.shift(), 935| 64.6k| concated.node(), 936| 64.6k| r.tail->inc()}; 937| 64.6k| } 938| 64.6k| } 939| 328k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEaSERKSB_: 163| 2.42k| { 164| 2.42k| auto next{other}; 165| 2.42k| swap(*this, next); 166| 2.42k| return *this; 167| 2.42k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERSB_NS9_5applyIS6_E4type4editE: 942| 4.16k| { 943| 4.16k| assert(&l != &r); ------------------ | Branch (943:9): [True: 4.16k, False: 0] ------------------ 944| 4.16k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 4.16k, False: 0] ------------------ 945| 4.16k| using std::get; 946| 4.16k| if (r.size == 0) ------------------ | Branch (946:13): [True: 403, False: 3.76k] ------------------ 947| 403| r = std::move(l); 948| 3.76k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 233, False: 3.52k] ------------------ 949| 233| return; 950| 3.52k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 838, False: 2.68k] ------------------ 951| | // just concat the tail, similar to push_back 952| 838| auto tail_offst = l.tail_offset(); 953| 838| auto tail_size = l.size - tail_offst; 954| 838| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 274, False: 564] ------------------ 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| 274| auto res = 959| 274| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 274| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 274| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 274| return; 965| 564| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 322, False: 242] ------------------ 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| 322| auto new_tail = 974| 322| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 322| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 322| return; 977| 322| } else { 978| | // like the immutable version 979| 242| auto remaining = branches - tail_size; 980| 242| auto add_tail = node_t::copy_leaf_e( 981| 242| er, l.tail, tail_size, r.tail, remaining); 982| 242| IMMER_TRY { ------------------ | | 49| 242|#define IMMER_TRY try ------------------ 983| 242| auto new_tail = 984| 242| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 242| IMMER_TRY { ------------------ | | 49| 242|#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| 242| auto new_root = l.push_tail(l.root, 990| 242| l.shift, 991| 242| tail_offst, 992| 242| add_tail, 993| 242| branches); 994| 242| r = {l.size + r.size, 995| 242| get<0>(new_root), 996| 242| get<1>(new_root), 997| 242| new_tail}; 998| 242| return; 999| 242| } 1000| 242| 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| 242| } 1005| 242| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 242| } 1010| 2.68k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 1.42k, False: 1.26k] ------------------ 1011| 1.42k| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 1.42k] ------------------ 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| 1.42k| } else { 1030| 1.42k| auto tail_offst = l.tail_offset(); 1031| 1.42k| auto tail_size = l.size - tail_offst; 1032| 1.42k| auto concated = concat_trees( 1033| 1.42k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 1.42k| r = {l.size + r.size, 1035| 1.42k| concated.shift(), 1036| 1.42k| concated.node(), 1037| 1.42k| r.tail->inc()}; 1038| 1.42k| return; 1039| 1.42k| } 1040| 1.42k| } else { 1041| 1.26k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.26k] ------------------ 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.26k| } else { 1064| 1.26k| auto tail_offst = l.tail_offset(); 1065| 1.26k| auto tail_size = l.size - tail_offst; 1066| 1.26k| auto concated = concat_trees(l.root, 1067| 1.26k| l.shift, 1068| 1.26k| tail_offst, 1069| 1.26k| l.tail, 1070| 1.26k| tail_size, 1071| 1.26k| r.root, 1072| 1.26k| r.shift, 1073| 1.26k| r.tail_offset()); 1074| 1.26k| r = {l.size + r.size, 1075| 1.26k| concated.shift(), 1076| 1.26k| concated.node(), 1077| 1.26k| r.tail->inc()}; 1078| 1.26k| return; 1079| 1.26k| } 1080| 1.26k| } 1081| 4.16k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 385k| { 1085| 385k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 385k, False: 0] ------------------ 1086| 385k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 385k, False: 0] ------------------ 1087| 385k| using std::get; 1088| 385k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 1.60k, False: 384k] ------------------ 1089| 1.60k| l = r; 1090| 384k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 949, False: 383k] ------------------ 1091| 949| return; 1092| 383k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 54.2k, False: 328k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 54.2k| auto tail_offst = l.tail_offset(); 1095| 54.2k| auto tail_size = l.size - tail_offst; 1096| 54.2k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 16.5k, False: 37.7k] ------------------ 1097| 16.5k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 16.5k| l.tail = r.tail->inc(); 1099| 16.5k| l.size += r.size; 1100| 16.5k| return; 1101| 37.7k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 2.77k, False: 34.9k] ------------------ 1102| 2.77k| l.ensure_mutable_tail(el, tail_size); 1103| 2.77k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 1.09k, False: 1.67k] ------------------ 1104| 1.09k| detail::uninitialized_move(r.tail->leaf(), 1105| 1.09k| r.tail->leaf() + r.size, 1106| 1.09k| l.tail->leaf() + tail_size); 1107| 1.67k| else 1108| 1.67k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.67k| r.tail->leaf() + r.size, 1110| 1.67k| l.tail->leaf() + tail_size); 1111| 2.77k| l.size += r.size; 1112| 2.77k| return; 1113| 34.9k| } else { 1114| 34.9k| auto remaining = branches - tail_size; 1115| 34.9k| l.ensure_mutable_tail(el, tail_size); 1116| 34.9k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 12.5k, False: 22.4k] ------------------ 1117| 12.5k| detail::uninitialized_move(r.tail->leaf(), 1118| 12.5k| r.tail->leaf() + remaining, 1119| 12.5k| l.tail->leaf() + tail_size); 1120| 22.4k| else 1121| 22.4k| detail::uninitialized_copy(r.tail->leaf(), 1122| 22.4k| r.tail->leaf() + remaining, 1123| 22.4k| l.tail->leaf() + tail_size); 1124| 34.9k| IMMER_TRY { ------------------ | | 49| 34.9k|#define IMMER_TRY try ------------------ 1125| 34.9k| auto new_tail = 1126| 34.9k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 34.9k| IMMER_TRY { ------------------ | | 49| 34.9k|#define IMMER_TRY try ------------------ 1128| 34.9k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 34.9k| l.tail = new_tail; 1130| 34.9k| l.size += r.size; 1131| 34.9k| return; 1132| 34.9k| } 1133| 34.9k| 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| 34.9k| } 1138| 34.9k| 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| 34.9k| } 1143| 328k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.30k, False: 325k] ------------------ 1144| 3.30k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.30k] ------------------ 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.30k| } else { 1165| 3.30k| auto tail_offst = l.tail_offset(); 1166| 3.30k| auto tail_size = l.size - tail_offst; 1167| 3.30k| auto concated = concat_trees( 1168| 3.30k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.30k| l = {l.size + r.size, 1170| 3.30k| concated.shift(), 1171| 3.30k| concated.node(), 1172| 3.30k| r.tail->inc()}; 1173| 3.30k| return; 1174| 3.30k| } 1175| 325k| } else { 1176| 325k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 325k] ------------------ 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| 325k| } else { 1200| 325k| auto tail_offst = l.tail_offset(); 1201| 325k| auto tail_size = l.size - tail_offst; 1202| 325k| auto concated = concat_trees(l.root, 1203| 325k| l.shift, 1204| 325k| tail_offst, 1205| 325k| l.tail, 1206| 325k| tail_size, 1207| 325k| r.root, 1208| 325k| r.shift, 1209| 325k| r.tail_offset()); 1210| 325k| l = {l.size + r.size, 1211| 325k| concated.shift(), 1212| 325k| concated.node(), 1213| 325k| r.tail->inc()}; 1214| 325k| return; 1215| 325k| } 1216| 325k| } 1217| 385k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6equalsERKSB_: 315| 34.6k| { 316| 34.6k| using iter_t = rrbtree_iterator; 317| 34.6k| if (size != other.size) ------------------ | Branch (317:13): [True: 11.1k, False: 23.4k] ------------------ 318| 11.1k| return false; 319| 23.4k| if (size == 0) ------------------ | Branch (319:13): [True: 215, False: 23.2k] ------------------ 320| 215| return true; 321| 23.2k| auto tail_off = tail_offset(); 322| 23.2k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 23.2k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 22.3k, False: 844] | Branch (324:29): [True: 22.1k, False: 195] ------------------ 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| 22.1k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 21.6k, False: 524] ------------------ 329| 21.6k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 10.2k, False: 11.4k] ------------------ 330| 21.6k| other.shift, 331| 21.6k| tail_off_other, 332| 21.6k| equals_visitor::rrb{}, 333| 21.6k| iter_t{other}, 334| 21.6k| root, 335| 21.6k| shift, 336| 21.6k| tail_off)) 337| 10.2k| return false; 338| 21.6k| } else { 339| 524| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 212, False: 312] ------------------ 340| 524| shift, 341| 524| tail_off, 342| 524| equals_visitor::rrb{}, 343| 524| iter_t{*this}, 344| 524| other.root, 345| 524| other.shift, 346| 524| tail_off_other)) 347| 212| return false; 348| 524| } 349| 22.1k| } 350| 12.7k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 7.89k, False: 4.89k] ------------------ 351| 12.7k| ? make_leaf_sub_pos(tail, tail_size()) 352| 7.89k| .visit(equals_visitor{}, other.tail) 353| 12.7k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 1.90k, False: 2.99k] ------------------ 354| 4.89k| ? std::equal(tail->leaf(), 355| 1.90k| tail->leaf() + (size - tail_off), 356| 1.90k| other.tail->leaf() + 357| 1.90k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 4.89k| : std::equal(tail->leaf(), 360| 2.99k| tail->leaf() + (size - tail_off), 361| 2.99k| iter_t{other} + tail_off); 362| 23.2k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10region_forEm: 524| 1.51M| { 525| 1.51M| using std::get; 526| 1.51M| auto tail_off = tail_offset(); 527| 1.51M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 5.12k, False: 1.51M] ------------------ 528| 5.12k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.51M| } else { 530| 1.51M| auto subs = visit_maybe_relaxed_sub( 531| 1.51M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.51M| auto first = idx - get<1>(subs); 533| 1.51M| auto end = first + get<2>(subs); 534| 1.51M| return std::make_tuple(get<0>(subs), first, end); 535| 1.51M| } 536| 1.51M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11dereferenceEv: 90| 11.2M| { 91| 11.2M| using std::get; 92| 11.2M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 67.1k, False: 11.1M] | Branch (92:35): [True: 1.45M, False: 9.69M] ------------------ 93| 1.51M| curr_ = v_->region_for(i_); 94| 11.2M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 11.2M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7advanceEl: 74| 227k| { 75| 227k| using std::get; 76| 227k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 296, False: 227k] | Branch (76:9): [True: 227k, False: 0] | Branch (76:9): [True: 227k, False: 0] ------------------ 77| 227k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 227k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 227k, False: 0] ------------------ 78| 227k| i_ += n; 79| 227k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9incrementEv: 60| 9.75M| { 61| 9.75M| using std::get; 62| 9.75M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 9.75M, False: 0] ------------------ 63| 9.75M| ++i_; 64| 9.75M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2ERKNS1_7rrbtreeIiSA_Lj3ELj3EEE: 39| 25.1k| : v_{&v} 40| 25.1k| , i_{0} 41| 25.1k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 25.1k| { 43| 25.1k| } _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| 15.6k| { 32| 15.6k| return Deriv::visit_inner(std::forward(args)...); 33| 15.6k| } _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| 54.9k| { 32| 54.9k| return Deriv::visit_inner(std::forward(args)...); 33| 54.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EEEE13visit_regularIJRNS1_15regular_sub_posISD_EERmEEEDcDpOT_: 37| 828| { 38| 828| return Deriv::visit_inner(std::forward(args)...); 39| 828| } _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.28k| { 38| 4.28k| return Deriv::visit_inner(std::forward(args)...); 39| 4.28k| } _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.93k| { 38| 6.93k| return Deriv::visit_inner(std::forward(args)...); 39| 6.93k| } _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| 749| { 38| 749| return Deriv::visit_inner(std::forward(args)...); 39| 749| } _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.96k| { 38| 1.96k| return Deriv::visit_inner(std::forward(args)...); 39| 1.96k| } _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| 11.9k| { 38| 11.9k| return Deriv::visit_inner(std::forward(args)...); 39| 11.9k| } _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| 11.9k| { 44| 11.9k| return Deriv::visit_node(std::forward(args)...); 45| 11.9k| } _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| 9.09k| { 32| 9.09k| return Deriv::visit_inner(std::forward(args)...); 33| 9.09k| } _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| 9.09k| { 44| 9.09k| return Deriv::visit_node(std::forward(args)...); 45| 9.09k| } _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| 14.6M| { 50| 14.6M| return Deriv::visit_node(std::forward(args)...); 51| 14.6M| } _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| 171M| { 32| 171M| return Deriv::visit_inner(std::forward(args)...); 33| 171M| } _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| 171M| { 44| 171M| return Deriv::visit_node(std::forward(args)...); 45| 171M| } _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| 171M| { 32| 171M| return Deriv::visit_inner(std::forward(args)...); 33| 171M| } _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| 53.2k| { 32| 53.2k| return Deriv::visit_inner(std::forward(args)...); 33| 53.2k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 310| { 38| 310| return Deriv::visit_inner(std::forward(args)...); 39| 310| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 927| { 38| 927| return Deriv::visit_inner(std::forward(args)...); 39| 927| } _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.44M| { 50| 5.44M| return Deriv::visit_node(std::forward(args)...); 51| 5.44M| } _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| 733k| { 38| 733k| return Deriv::visit_inner(std::forward(args)...); 39| 733k| } _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| 733k| { 44| 733k| return Deriv::visit_node(std::forward(args)...); 45| 733k| } _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| 733k| { 38| 733k| return Deriv::visit_inner(std::forward(args)...); 39| 733k| } _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.88M| { 38| 3.88M| return Deriv::visit_inner(std::forward(args)...); 39| 3.88M| } _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.88M| { 44| 3.88M| return Deriv::visit_node(std::forward(args)...); 45| 3.88M| } _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.88M| { 38| 3.88M| return Deriv::visit_inner(std::forward(args)...); 39| 3.88M| } _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.80k| { 38| 2.80k| return Deriv::visit_inner(std::forward(args)...); 39| 2.80k| } _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.80k| { 44| 2.80k| return Deriv::visit_node(std::forward(args)...); 45| 2.80k| } _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.48M| { 32| 1.48M| return Deriv::visit_inner(std::forward(args)...); 33| 1.48M| } _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.48M| { 44| 1.48M| return Deriv::visit_node(std::forward(args)...); 45| 1.48M| } _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.46M| { 32| 1.46M| return Deriv::visit_inner(std::forward(args)...); 33| 1.46M| } _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.46M| { 44| 1.46M| return Deriv::visit_node(std::forward(args)...); 45| 1.46M| } _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| 4.14M| { 32| 4.14M| return Deriv::visit_inner(std::forward(args)...); 33| 4.14M| } _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| 5.12k| { 38| 5.12k| return Deriv::visit_inner(std::forward(args)...); 39| 5.12k| } _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.17M| { 32| 1.17M| return Deriv::visit_inner(std::forward(args)...); 33| 1.17M| } _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| 366k| { 38| 366k| return Deriv::visit_inner(std::forward(args)...); 39| 366k| } _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| 2.73k| { 38| 2.73k| return Deriv::visit_inner(std::forward(args)...); 39| 2.73k| } _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| 37.3k| { 38| 37.3k| return Deriv::visit_inner(std::forward(args)...); 39| 37.3k| } _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| 22.2k| { 38| 22.2k| return Deriv::visit_inner(std::forward(args)...); 39| 22.2k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 37| 14.0k| { 38| 14.0k| return Deriv::visit_inner(std::forward(args)...); 39| 14.0k| } _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.53M| { 38| 1.53M| return Deriv::visit_inner(std::forward(args)...); 39| 1.53M| } _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| 11.6M| { 32| 11.6M| return Deriv::visit_inner(std::forward(args)...); 33| 11.6M| } _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| 2.60k| { 38| 2.60k| return Deriv::visit_inner(std::forward(args)...); 39| 2.60k| } _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| 63.5k| { 32| 63.5k| return Deriv::visit_inner(std::forward(args)...); 33| 63.5k| } _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| 3.37k| { 38| 3.37k| return Deriv::visit_inner(std::forward(args)...); 39| 3.37k| } _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| 312| { 32| 312| return Deriv::visit_inner(std::forward(args)...); 33| 312| } _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| 2.40k| { 32| 2.40k| return Deriv::visit_inner(std::forward(args)...); 33| 2.40k| } _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| 11.5M| { 32| 11.5M| return Deriv::visit_inner(std::forward(args)...); 33| 11.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| 19.6k| { 38| 19.6k| return Deriv::visit_inner(std::forward(args)...); 39| 19.6k| } _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| 19.6k| { 44| 19.6k| return Deriv::visit_node(std::forward(args)...); 45| 19.6k| } _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| 24.0k| { 38| 24.0k| return Deriv::visit_inner(std::forward(args)...); 39| 24.0k| } _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| 24.0k| { 44| 24.0k| return Deriv::visit_node(std::forward(args)...); 45| 24.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_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 6.26k| { 32| 6.26k| return Deriv::visit_inner(std::forward(args)...); 33| 6.26k| } _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.26k| { 44| 6.26k| return Deriv::visit_node(std::forward(args)...); 45| 6.26k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 17.7k| { 38| 17.7k| return Deriv::visit_inner(std::forward(args)...); 39| 17.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| 17.7k| { 44| 17.7k| return Deriv::visit_node(std::forward(args)...); 45| 17.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| 20.8k| { 32| 20.8k| return Deriv::visit_inner(std::forward(args)...); 33| 20.8k| } _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.19k| { 32| 2.19k| return Deriv::visit_inner(std::forward(args)...); 33| 2.19k| } _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| 517| { 32| 517| return Deriv::visit_inner(std::forward(args)...); 33| 517| } _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| 843| { 38| 843| return Deriv::visit_inner(std::forward(args)...); 39| 843| } _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| 5.46M| { 32| 5.46M| return Deriv::visit_inner(std::forward(args)...); 33| 5.46M| } _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| 354k| { 38| 354k| return Deriv::visit_inner(std::forward(args)...); 39| 354k| } _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| 493k| { 38| 493k| return Deriv::visit_inner(std::forward(args)...); 39| 493k| } _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| 55.6k| { 38| 55.6k| return Deriv::visit_inner(std::forward(args)...); 39| 55.6k| } _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| 34.8k| { 38| 34.8k| return Deriv::visit_inner(std::forward(args)...); 39| 34.8k| } _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| 546| { 38| 546| return Deriv::visit_inner(std::forward(args)...); 39| 546| } _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.6k| { 38| 13.6k| return Deriv::visit_inner(std::forward(args)...); 39| 13.6k| } _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| 5.02k| { 38| 5.02k| return Deriv::visit_inner(std::forward(args)...); 39| 5.02k| } _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| 1.94k| { 38| 1.94k| return Deriv::visit_inner(std::forward(args)...); 39| 1.94k| } _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.16k| { 38| 2.16k| return Deriv::visit_inner(std::forward(args)...); 39| 2.16k| } _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| 166k| { 32| 166k| return Deriv::visit_inner(std::forward(args)...); 33| 166k| } _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| 1.06k| { 32| 1.06k| return Deriv::visit_inner(std::forward(args)...); 33| 1.06k| } _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| 1.06k| { 44| 1.06k| return Deriv::visit_node(std::forward(args)...); 45| 1.06k| } _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| 11.2k| { 38| 11.2k| return Deriv::visit_inner(std::forward(args)...); 39| 11.2k| } _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| 11.2k| { 44| 11.2k| return Deriv::visit_node(std::forward(args)...); 45| 11.2k| } _ZN5immer6detail15auto_const_castINS_22unsafe_refcount_policyEEERT_RKS3_: 143| 785M|{ 144| 785M| return const_cast(x); 145| 785M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 461M| { 114| 461M| check_base(); 115| 461M| auto* base = static_cast(this); 116| 461M| return reinterpret_cast(base + 1); 117| 461M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 461M| { 135| 461M| static_assert(std::is_standard_layout::value && 136| 461M| !std::is_empty::value, 137| 461M| "Please add 'true' if the derived class is emtpy"); 138| 461M| } _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| 51.1M|{ 330| 51.1M| std::forward(f)(empty_t{}); 331| 51.1M|} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 3.04M|{ 189| 3.04M| return first + n; 190| 3.04M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6leaf_tEiLb1EE15get_storage_ptrEv: 75| 19.7M| { 76| 19.7M| check_base(); 77| 19.7M| return reinterpret_cast(this); 78| 19.7M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6leaf_tEiLb1EE10check_baseEv: 94| 19.7M| { 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| 19.7M| static_assert(std::is_standard_layout::value, 100| 19.7M| "Please remove 'true' if the derived class is non emtpy"); 101| 19.7M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 4.47M|{ 237| 4.47M| return std::copy(first, last, out); 238| 4.47M|} _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| 137k|{ 345| 137k| return std::forward(f2)(empty_t{}); 346| 137k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 80.4M|{ 324| 80.4M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 3.82M, False: 76.5M] ------------------ 325| 80.4M|} _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| 192k|{ 345| 192k| return std::forward(f2)(empty_t{}); 346| 192k|} _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| 171k|{ 330| 171k| std::forward(f)(empty_t{}); 331| 171k|} _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| 19.2k|{ 345| 19.2k| return std::forward(f2)(empty_t{}); 346| 19.2k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 311|{ 189| 311| return first + n; 190| 311|} _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| 176k|{ 345| 176k| return std::forward(f2)(empty_t{}); 346| 176k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 13.5k|{ 211| 13.5k| return std::copy(first, last, out); 212| 13.5k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.45M|{ 30| 1.45M| return x; 31| 1.45M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 15.4k|{ 261| 15.4k| auto ptr = Heap::allocate(sizeof(T)); 262| 15.4k| IMMER_TRY { ------------------ | | 49| 15.4k|#define IMMER_TRY try ------------------ 263| 15.4k| return new (ptr) T(std::forward(args)...); 264| 15.4k| } 265| 15.4k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 15.4k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2Ev: 96| 83.7k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_backEi: 246| 281k| { 247| 281k| return impl_.push_back(std::move(value)); 248| 281k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj3ELj3EEE: 536| 2.79M| : impl_(std::move(impl)) 537| 2.79M| { 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.79M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4sizeEv: 181| 4.93M| 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| 168k| { 324| 168k| return impl_.update(index, std::forward(fn)); 325| 168k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4takeEm: 350| 21.0k| { 351| 21.0k| return impl_.take(elems); 352| 21.0k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4dropEm: 376| 27.1k| { 377| 27.1k| return impl_.drop(elems); 378| 27.1k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8max_sizeEv: 90| 1.53M| 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.29M| { 404| 2.29M| return l.impl_.concat(r.impl_); 405| 2.29M| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_backEi: 251| 28.7k| { 252| 28.7k| return push_back_move(move_t{}, std::move(value)); 253| 28.7k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 28.7k| { 548| 28.7k| impl_.push_back_mut({}, std::move(value)); 549| 28.7k| return std::move(*this); 550| 28.7k| } 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| 14.7k| { 330| 14.7k| return update_move(move_t{}, index, std::forward(fn)); 331| 14.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| 14.7k| { 569| 14.7k| impl_.update_mut({}, index, std::forward(fn)); 570| 14.7k| return std::move(*this); 571| 14.7k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4takeEm: 355| 33.5k| { 356| 33.5k| return take_move(move_t{}, elems); 357| 33.5k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 33.5k| { 580| 33.5k| impl_.take_mut({}, elems); 581| 33.5k| return std::move(*this); 582| 33.5k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4dropEm: 381| 71.8k| { 382| 71.8k| return drop_move(move_t{}, elems); 383| 71.8k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 71.8k| { 590| 71.8k| impl_.drop_mut({}, elems); 591| 71.8k| return std::move(*this); 592| 71.8k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERKS9_: 409| 328k| { 410| 328k| return concat_move(move_t{}, std::move(l), r); 411| 328k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 328k| { 601| 328k| concat_mut_l(l.impl_, {}, r.impl_); 602| 328k| return std::move(l); 603| 328k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEOS9_: 415| 4.16k| { 416| 4.16k| return concat_move(move_t{}, l, std::move(r)); 417| 4.16k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 4.16k| { 607| 4.16k| concat_mut_r(l.impl_, r.impl_, {}); 608| 4.16k| return std::move(r); 609| 4.16k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEESA_: 421| 385k| { 422| 385k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 385k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 385k| { 613| 385k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 385k| return std::move(l); 615| 385k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEeqERKS9_: 222| 34.6k| { 223| 34.6k| return impl_.equals(other.impl_); 224| 34.6k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5eraseEm: 480| 3.72k| { 481| 3.72k| return take(pos) + drop(pos + 1); 482| 3.72k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6insertEmi: 442| 15.4k| { 443| 15.4k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 15.4k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 110M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 59.8M| { 28| 59.8M| return ::operator new(size); 29| 59.8M| } _ZN5immer8cpp_heap8allocateIJNS_10norefs_tagEEEEPvmDpT_: 27| 50.9M| { 28| 50.9M| return ::operator new(size); 29| 50.9M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 15.4k| { 50| 15.4k| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 15.4k| new (p) std::size_t{size}; 52| 15.4k| return ((char*) p) + extra_size; 53| 15.4k| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 15.4k| { 58| 15.4k| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 15.4k| assert(*p == size); ------------------ | Branch (59:9): [True: 15.4k, False: 0] ------------------ 60| 15.4k| Base::deallocate(size + extra_size, p, tags...); 61| 15.4k| } _ZN5immer15refcount_policyC2Ev: 28| 15.4k| : refcount{1} {}; _ZN5immer15refcount_policy3decEv: 36| 15.4k| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer22unsafe_refcount_policyC2Ev: 27| 110M| : refcount{1} {}; _ZN5immer22unsafe_refcount_policy3incEv: 33| 335M| void inc() { ++refcount; } _ZN5immer22unsafe_refcount_policy3decEv: 34| 446M| bool dec() { return --refcount == 0; } _ZN5immer22unsafe_refcount_policy6uniqueEv: 35| 2.96M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee5ownedEv: 36| 110M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee10can_mutateENS6_4editE: 35| 188k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeaSENS6_4editE: 34| 845k| ownee& operator=(edit) { return *this; };