LLVMFuzzerTestOneInput: 24| 10.1k|{ 25| 10.1k| constexpr auto var_count = 8; 26| 10.1k| constexpr auto bits = 3; 27| | 28| 10.1k| using vector_t = immer::flex_vector; 29| 10.1k| using size_t = std::uint8_t; 30| | 31| 10.1k| auto vars = std::array{}; 32| | 33| 10.1k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 34| 10.1k| auto is_valid_var_neq = [](auto other) { 35| 10.1k| return [=](auto idx) { 36| 10.1k| return idx >= 0 && idx < var_count && idx != other; 37| 10.1k| }; 38| 10.1k| }; 39| 10.1k| auto is_valid_index = [](auto& v) { 40| 10.1k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 10.1k| }; 42| 10.1k| auto is_valid_size = [](auto& v) { 43| 10.1k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 10.1k| }; 45| 10.1k| auto can_concat = [](const auto& v1, const auto& v2) { 46| | // First, check max_size 47| 10.1k| if (v1.size() + v2.size() > vector_t::max_size()) { 48| 10.1k| return false; 49| 10.1k| } 50| | 51| | // But just checking max_size is not sufficient, because there are other 52| | // conditions for the validity of the tree, like shift constraints, for 53| | // example. 54| 10.1k| try { 55| | // Try to concat and catch an exception if it fails 56| 10.1k| const auto v3 = v1 + v2; 57| 10.1k| if (v3.size()) { 58| 10.1k| return true; 59| 10.1k| } 60| 10.1k| } catch (const immer::detail::rbts::invalid_tree&) { 61| 10.1k| return false; 62| 10.1k| } 63| 10.1k| return true; 64| 10.1k| }; 65| 10.1k| auto can_compare = [](auto&& v) { 66| | // avoid comparing vectors that are too big, and hence, slow to compare 67| 10.1k| return v.size() < (1 << 15); 68| 10.1k| }; 69| 10.1k| return fuzzer_input{data, size}.run([&](auto& in) { 70| 10.1k| enum ops 71| 10.1k| { 72| 10.1k| op_push_back, 73| 10.1k| op_update, 74| 10.1k| op_take, 75| 10.1k| op_drop, 76| 10.1k| op_concat, 77| 10.1k| op_push_back_move, 78| 10.1k| op_update_move, 79| 10.1k| op_take_move, 80| 10.1k| op_drop_move, 81| 10.1k| op_concat_move_l, 82| 10.1k| op_concat_move_r, 83| 10.1k| op_concat_move_lr, 84| 10.1k| op_insert, 85| 10.1k| op_erase, 86| 10.1k| op_compare, 87| 10.1k| }; 88| 10.1k| auto src = read(in, is_valid_var); 89| 10.1k| auto dst = read(in, is_valid_var); 90| 10.1k| switch (read(in)) { 91| 10.1k| case op_push_back: { 92| 10.1k| vars[dst] = vars[src].push_back(42); 93| 10.1k| break; 94| 10.1k| } 95| 10.1k| case op_update: { 96| 10.1k| auto idx = read(in, is_valid_index(vars[src])); 97| 10.1k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 98| 10.1k| break; 99| 10.1k| } 100| 10.1k| case op_take: { 101| 10.1k| auto idx = read(in, is_valid_size(vars[src])); 102| 10.1k| vars[dst] = vars[src].take(idx); 103| 10.1k| break; 104| 10.1k| } 105| 10.1k| case op_drop: { 106| 10.1k| auto idx = read(in, is_valid_size(vars[src])); 107| 10.1k| vars[dst] = vars[src].drop(idx); 108| 10.1k| break; 109| 10.1k| } 110| 10.1k| case op_concat: { 111| 10.1k| auto src2 = read(in, is_valid_var); 112| 10.1k| if (can_concat(vars[src], vars[src2])) 113| 10.1k| vars[dst] = vars[src] + vars[src2]; 114| 10.1k| break; 115| 10.1k| } 116| 10.1k| case op_push_back_move: { 117| 10.1k| vars[dst] = std::move(vars[src]).push_back(21); 118| 10.1k| break; 119| 10.1k| } 120| 10.1k| case op_update_move: { 121| 10.1k| auto idx = read(in, is_valid_index(vars[src])); 122| 10.1k| vars[dst] = 123| 10.1k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 124| 10.1k| break; 125| 10.1k| } 126| 10.1k| case op_take_move: { 127| 10.1k| auto idx = read(in, is_valid_size(vars[src])); 128| 10.1k| vars[dst] = std::move(vars[src]).take(idx); 129| 10.1k| break; 130| 10.1k| } 131| 10.1k| case op_drop_move: { 132| 10.1k| auto idx = read(in, is_valid_size(vars[src])); 133| 10.1k| vars[dst] = std::move(vars[src]).drop(idx); 134| 10.1k| break; 135| 10.1k| } 136| 10.1k| case op_concat_move_l: { 137| 10.1k| auto src2 = read(in, is_valid_var_neq(src)); 138| 10.1k| if (can_concat(vars[src], vars[src2])) 139| 10.1k| vars[dst] = std::move(vars[src]) + vars[src2]; 140| 10.1k| break; 141| 10.1k| } 142| 10.1k| case op_concat_move_r: { 143| 10.1k| auto src2 = read(in, is_valid_var_neq(src)); 144| 10.1k| if (can_concat(vars[src], vars[src2])) 145| 10.1k| vars[dst] = vars[src] + std::move(vars[src2]); 146| 10.1k| break; 147| 10.1k| } 148| 10.1k| case op_concat_move_lr: { 149| 10.1k| auto src2 = read(in, is_valid_var_neq(src)); 150| 10.1k| if (can_concat(vars[src], vars[src2])) 151| 10.1k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 152| 10.1k| break; 153| 10.1k| } 154| 10.1k| case op_compare: { 155| 10.1k| using std::swap; 156| 10.1k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 157| 10.1k| swap(vars[src], vars[dst]); 158| 10.1k| break; 159| 10.1k| } 160| 10.1k| case op_erase: { 161| 10.1k| auto idx = read(in, is_valid_index(vars[src])); 162| 10.1k| vars[dst] = vars[src].erase(idx); 163| 10.1k| break; 164| 10.1k| } 165| 10.1k| case op_insert: { 166| 10.1k| auto idx = read(in, is_valid_size(vars[src])); 167| 10.1k| vars[dst] = vars[src].insert(idx, immer::box{42}); 168| 10.1k| break; 169| 10.1k| } 170| 10.1k| default: 171| 10.1k| break; 172| 10.1k| }; 173| 10.1k| return true; 174| 10.1k| }); 175| 10.1k|} flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 69| 2.12M| return fuzzer_input{data, size}.run([&](auto& in) { 70| 2.12M| enum ops 71| 2.12M| { 72| 2.12M| op_push_back, 73| 2.12M| op_update, 74| 2.12M| op_take, 75| 2.12M| op_drop, 76| 2.12M| op_concat, 77| 2.12M| op_push_back_move, 78| 2.12M| op_update_move, 79| 2.12M| op_take_move, 80| 2.12M| op_drop_move, 81| 2.12M| op_concat_move_l, 82| 2.12M| op_concat_move_r, 83| 2.12M| op_concat_move_lr, 84| 2.12M| op_insert, 85| 2.12M| op_erase, 86| 2.12M| op_compare, 87| 2.12M| }; 88| 2.12M| auto src = read(in, is_valid_var); 89| 2.12M| auto dst = read(in, is_valid_var); 90| 2.12M| switch (read(in)) { 91| 270k| case op_push_back: { ------------------ | Branch (91:9): [True: 270k, False: 1.85M] ------------------ 92| 270k| vars[dst] = vars[src].push_back(42); 93| 270k| break; 94| 0| } 95| 144k| case op_update: { ------------------ | Branch (95:9): [True: 144k, False: 1.98M] ------------------ 96| 144k| auto idx = read(in, is_valid_index(vars[src])); 97| 144k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 98| 144k| break; 99| 0| } 100| 1.91k| case op_take: { ------------------ | Branch (100:9): [True: 1.91k, False: 2.12M] ------------------ 101| 1.91k| auto idx = read(in, is_valid_size(vars[src])); 102| 1.91k| vars[dst] = vars[src].take(idx); 103| 1.91k| break; 104| 0| } 105| 8.52k| case op_drop: { ------------------ | Branch (105:9): [True: 8.52k, False: 2.12M] ------------------ 106| 8.52k| auto idx = read(in, is_valid_size(vars[src])); 107| 8.52k| vars[dst] = vars[src].drop(idx); 108| 8.52k| break; 109| 0| } 110| 770k| case op_concat: { ------------------ | Branch (110:9): [True: 770k, False: 1.35M] ------------------ 111| 770k| auto src2 = read(in, is_valid_var); 112| 770k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (112:17): [True: 745k, False: 24.7k] ------------------ 113| 745k| vars[dst] = vars[src] + vars[src2]; 114| 770k| break; 115| 0| } 116| 13.0k| case op_push_back_move: { ------------------ | Branch (116:9): [True: 13.0k, False: 2.11M] ------------------ 117| 13.0k| vars[dst] = std::move(vars[src]).push_back(21); 118| 13.0k| break; 119| 0| } 120| 15.7k| case op_update_move: { ------------------ | Branch (120:9): [True: 15.7k, False: 2.11M] ------------------ 121| 15.7k| auto idx = read(in, is_valid_index(vars[src])); 122| 15.7k| vars[dst] = 123| 15.7k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 124| 15.7k| break; 125| 0| } 126| 32.8k| case op_take_move: { ------------------ | Branch (126:9): [True: 32.8k, False: 2.09M] ------------------ 127| 32.8k| auto idx = read(in, is_valid_size(vars[src])); 128| 32.8k| vars[dst] = std::move(vars[src]).take(idx); 129| 32.8k| break; 130| 0| } 131| 69.5k| case op_drop_move: { ------------------ | Branch (131:9): [True: 69.5k, False: 2.06M] ------------------ 132| 69.5k| auto idx = read(in, is_valid_size(vars[src])); 133| 69.5k| vars[dst] = std::move(vars[src]).drop(idx); 134| 69.5k| break; 135| 0| } 136| 345k| case op_concat_move_l: { ------------------ | Branch (136:9): [True: 345k, False: 1.78M] ------------------ 137| 345k| auto src2 = read(in, is_valid_var_neq(src)); 138| 345k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (138:17): [True: 340k, False: 4.64k] ------------------ 139| 340k| vars[dst] = std::move(vars[src]) + vars[src2]; 140| 345k| break; 141| 0| } 142| 7.91k| case op_concat_move_r: { ------------------ | Branch (142:9): [True: 7.91k, False: 2.12M] ------------------ 143| 7.91k| auto src2 = read(in, is_valid_var_neq(src)); 144| 7.91k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (144:17): [True: 4.52k, False: 3.39k] ------------------ 145| 4.52k| vars[dst] = vars[src] + std::move(vars[src2]); 146| 7.91k| break; 147| 0| } 148| 354k| case op_concat_move_lr: { ------------------ | Branch (148:9): [True: 354k, False: 1.77M] ------------------ 149| 354k| auto src2 = read(in, is_valid_var_neq(src)); 150| 354k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (150:17): [True: 346k, False: 8.13k] ------------------ 151| 346k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 152| 354k| break; 153| 0| } 154| 37.4k| case op_compare: { ------------------ | Branch (154:9): [True: 37.4k, False: 2.09M] ------------------ 155| 37.4k| using std::swap; 156| 37.4k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (156:17): [True: 34.1k, False: 3.29k] | Branch (156:43): [True: 6.57k, False: 27.6k] ------------------ 157| 6.57k| swap(vars[src], vars[dst]); 158| 37.4k| break; 159| 0| } 160| 3.72k| case op_erase: { ------------------ | Branch (160:9): [True: 3.72k, False: 2.12M] ------------------ 161| 3.72k| auto idx = read(in, is_valid_index(vars[src])); 162| 3.72k| vars[dst] = vars[src].erase(idx); 163| 3.72k| break; 164| 0| } 165| 15.5k| case op_insert: { ------------------ | Branch (165:9): [True: 15.5k, False: 2.11M] ------------------ 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| 28.6k| default: ------------------ | Branch (170:9): [True: 28.6k, False: 2.10M] ------------------ 171| 28.6k| break; 172| 2.12M| }; 173| 2.11M| return true; 174| 2.12M| }); flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 33| 5.47M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (33:48): [True: 5.27M, False: 201k] | Branch (33:60): [True: 5.01M, False: 266k] ------------------ 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| 169k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (40:39): [True: 169k, False: 0] | Branch (40:51): [True: 163k, False: 6.41k] ------------------ flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaRT_: 39| 163k| auto is_valid_index = [](auto& v) { 40| 163k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 163k| }; flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 97| 143k| 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| 138k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (43:39): [True: 138k, False: 0] | Branch (43:51): [True: 128k, False: 10.6k] ------------------ flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaRT_: 42| 128k| auto is_valid_size = [](auto& v) { 43| 128k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 128k| }; flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_4clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEESB_EEDaRKT_RKT0_: 45| 1.47M| auto can_concat = [](const auto& v1, const auto& v2) { 46| | // First, check max_size 47| 1.47M| if (v1.size() + v2.size() > vector_t::max_size()) { ------------------ | Branch (47:13): [True: 39.0k, False: 1.43M] ------------------ 48| 39.0k| return false; 49| 39.0k| } 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.43M| try { 55| | // Try to concat and catch an exception if it fails 56| 1.43M| const auto v3 = v1 + v2; 57| 1.43M| if (v3.size()) { ------------------ | Branch (57:17): [True: 1.43M, False: 2.90k] ------------------ 58| 1.43M| return true; 59| 1.43M| } 60| 1.43M| } catch (const immer::detail::rbts::invalid_tree&) { 61| 1.64k| return false; 62| 1.64k| } 63| 1.25k| return true; 64| 1.43M| }; flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 123| 15.7k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector-st.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 35| 783k| return [=](auto idx) { 36| 783k| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (36:20): [True: 766k, False: 17.0k] | Branch (36:32): [True: 735k, False: 31.2k] | Branch (36:51): [True: 707k, False: 27.8k] ------------------ 37| 783k| }; flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 34| 707k| auto is_valid_var_neq = [](auto other) { 35| 707k| return [=](auto idx) { 36| 707k| return idx >= 0 && idx < var_count && idx != other; 37| 707k| }; 38| 707k| }; flex-vector-st.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaOT_: 65| 37.4k| auto can_compare = [](auto&& v) { 66| | // avoid comparing vectors that are too big, and hence, slow to compare 67| 37.4k| return v.size() < (1 << 15); 68| 37.4k| }; flex-vector-st.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 10.1k| { 51| 10.1k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 3, False: 10.1k] ------------------ 52| 3| return 0; 53| 10.1k| try { 54| 2.12M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.11M, False: 10.1k] ------------------ 55| 2.11M| continue; 56| 10.1k| } catch (const no_more_input&) { 57| 10.1k| }; 58| 10.1k| return 0; 59| 10.1k| } flex-vector-st.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 5.02M|{ 71| 5.02M| auto x = read(fz); 72| 5.48M| while (!cond(x)) ------------------ | Branch (72:12): [True: 467k, False: 5.02M] ------------------ 73| 467k| x = read(fz); 74| 5.02M| return x; 75| 5.02M|} _Z4readIcERKT_R12fuzzer_input: 64| 8.39M|{ 65| 8.39M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 8.39M|} _ZN12fuzzer_input4nextEmm: 40| 8.70M| { 41| 8.70M| auto& p = const_cast(reinterpret_cast(data_)); 42| 8.70M| auto r = std::align(align, size, p, size_); 43| 8.70M| if (r == nullptr) ------------------ | Branch (43:13): [True: 10.1k, False: 8.69M] ------------------ 44| 10.1k| throw no_more_input{}; 45| 8.69M| return next(size); 46| 8.70M| } _ZN12fuzzer_input4nextEm: 30| 8.69M| { 31| 8.69M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 8.69M] ------------------ 32| 0| throw no_more_input{}; 33| 8.69M| auto r = data_; 34| 8.69M| data_ += size; 35| 8.69M| size_ -= size; 36| 8.69M| return r; 37| 8.69M| } 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| 163k|{ 71| 163k| auto x = read(fz); 72| 169k| while (!cond(x)) ------------------ | Branch (72:12): [True: 6.41k, False: 163k] ------------------ 73| 6.41k| x = read(fz); 74| 163k| return x; 75| 163k|} _Z4readIhERKT_R12fuzzer_input: 64| 308k|{ 65| 308k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 308k|} 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| 128k|{ 71| 128k| auto x = read(fz); 72| 139k| while (!cond(x)) ------------------ | Branch (72:12): [True: 10.6k, False: 128k] ------------------ 73| 10.6k| x = read(fz); 74| 128k| return x; 75| 128k|} flex-vector-st.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 707k|{ 71| 707k| auto x = read(fz); 72| 784k| while (!cond(x)) ------------------ | Branch (72:12): [True: 76.1k, False: 707k] ------------------ 73| 76.1k| x = read(fz); 74| 707k| return x; 75| 707k|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 15.5k| : impl_{detail::make(std::forward(arg))} 86| 15.5k| { 87| 15.5k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 15.5k| : value(std::forward(args)...) 48| 15.5k| { 49| 15.5k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 15.5k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 15.5k| 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.5k| { 132| 15.5k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 15.5k, False: 0] | Branch (132:22): [True: 15.5k, False: 0] ------------------ 133| 15.5k| impl_->~holder(); 134| 15.5k| heap::deallocate(sizeof(holder), impl_); 135| 15.5k| } 136| 15.5k| } _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| 696M| { 171| 696M| return x.get_(type_t{}); 172| 696M| } _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| 696M| { 185| 696M| return n.get_(t); 186| 696M| } _ZNK5immer6detail3csl6memberINS_22unsafe_refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 745M| 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| 48.9M| { 171| 48.9M| return x.get_(type_t{}); 172| 48.9M| } _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| 48.9M| { 185| 48.9M| return n.get_(t); 186| 48.9M| } _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| 48.4M| { 166| 48.4M| return x.get_(type_t{}); 167| 48.4M| } _ZN5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14relaxed_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE: 179| 48.4M| { 180| 48.4M| return n.get_(t); 181| 48.4M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 105M| 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| 57.2M| { 166| 57.2M| return x.get_(type_t{}); 167| 57.2M| } _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| 57.2M| { 180| 57.2M| return n.get_(t); 181| 57.2M| } _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| 162k| { 171| 162k| return x.get_(type_t{}); 172| 162k| } _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| 162k| { 185| 162k| return n.get_(t); 186| 162k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 162k| 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.8M| 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.8M| { 23| 11.8M| return x.dereference(); 24| 11.8M| } _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.9M| { 87| 11.9M| static_assert(std::is_base_of::value, 88| 11.9M| "must pass a derived thing"); 89| 11.9M| return *static_cast(this); 90| 11.9M| } _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| 232k| { 152| 232k| access_t::advance(derived(), n); 153| 232k| return derived(); 154| 232k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEElEEDcOT_T0_: 46| 232k| { 47| 232k| return x.advance(d); 48| 232k| } _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| 21.0M| { 93| 21.0M| static_assert(std::is_base_of::value, 94| 21.0M| "must pass a derived thing"); 95| 21.0M| return *static_cast(this); 96| 21.0M| } _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| 10.3M| { 120| 10.3M| access_t::increment(derived()); 121| 10.3M| return derived(); 122| 10.3M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDcOT_: 28| 10.3M| { 29| 10.3M| return x.increment(); 30| 10.3M| } _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| 72.2k| { 165| 72.2k| auto tmp = derived(); 166| 72.2k| return tmp += n; 167| 72.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE17make_inner_n_intoEPvmj: 213| 5.21M| { 214| 5.21M| assert(n <= branches); ------------------ | Branch (214:9): [True: 5.21M, False: 0] ------------------ 215| 5.21M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 5.21M, False: 0] ------------------ 216| 5.21M| auto p = new (buffer) node_t; 217| 5.21M| p->impl.d.data.inner.relaxed = nullptr; 218| 5.21M|#if IMMER_TAGGED_NODE 219| 5.21M| p->impl.d.kind = node_t::kind_t::inner; 220| 5.21M|#endif 221| 5.21M| return p; 222| 5.21M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14sizeof_inner_nEj: 145| 20.9M| { 146| 20.9M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 20.9M, Folded] ------------------ 147| 20.9M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE3incEv: 956| 176M| { 957| 176M| refs(this).inc(); 958| 176M| return this; 959| 176M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4refsEPKSB_: 203| 696M| { 204| 696M| return auto_const_cast(get(x->impl)); 205| 696M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE16make_leaf_n_intoEPvmj: 330| 2.52M| { 331| 2.52M| assert(n <= branches); ------------------ | Branch (331:9): [True: 2.52M, False: 0] ------------------ 332| 2.52M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 2.52M, False: 0] ------------------ 333| 2.52M| auto p = new (buffer) node_t; 334| 2.52M|#if IMMER_TAGGED_NODE 335| 2.52M| p->impl.d.kind = node_t::kind_t::leaf; 336| 2.52M|#endif 337| 2.52M| return p; 338| 2.52M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13sizeof_leaf_nEj: 160| 10.4M| { 161| 10.4M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 10.4M, Folded] ------------------ 162| 10.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7relaxedEv: 172| 968M| { 173| 968M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 968M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 968M, False: 0] ------------------ 174| 968M| return impl.d.data.inner.relaxed; 175| 968M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4kindEv: 168| 1.51G| 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| 375M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5innerEv: 184| 438M| { 185| 438M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 438M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 438M, False: 0] ------------------ 186| 438M| return impl.d.data.inner.get_storage_ptr(); 187| 438M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14delete_inner_rEPSB_j: 832| 48.3M| { 833| 48.3M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 48.3M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 48.3M, False: 0] ------------------ 834| 48.3M| auto r = p->relaxed(); 835| 48.3M| assert(r); ------------------ | Branch (835:9): [True: 48.3M, False: 0] ------------------ 836| 48.3M| static_if([&](auto) { 837| 48.3M| if (node_t::refs(r).dec()) 838| 48.3M| heap::deallocate(node_t::ownee(r).owned() 839| 48.3M| ? node_t::max_sizeof_relaxed 840| 48.3M| : node_t::sizeof_relaxed_n(n), 841| 48.3M| r); 842| 48.3M| }); 843| 48.3M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 48.3M] ------------------ 844| 48.3M| : node_t::sizeof_inner_r_n(n), 845| 48.3M| p); 846| 48.3M| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14delete_inner_rEPSB_jENKUlT_E_clINS0_7empty_tEEEDaSD_: 836| 48.3M| static_if([&](auto) { 837| 48.3M| if (node_t::refs(r).dec()) ------------------ | Branch (837:17): [True: 48.2M, False: 152k] ------------------ 838| 48.2M| heap::deallocate(node_t::ownee(r).owned() ------------------ | Branch (838:34): [True: 0, False: 48.2M] ------------------ 839| 48.2M| ? node_t::max_sizeof_relaxed 840| 48.2M| : node_t::sizeof_relaxed_n(n), 841| 48.2M| r); 842| 48.3M| }); _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| 48.9M| { 197| 48.9M| return auto_const_cast(get(*x)); 198| 48.9M| } _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| 48.4M| static ownee_t& ownee(relaxed_t* x) { return get(*x); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE16sizeof_relaxed_nEj: 155| 96.2M| { 156| 96.2M| return keep_headroom ? max_sizeof_relaxed : sizeof_packed_relaxed_n(n); ------------------ | Branch (156:16): [True: 96.2M, Folded] ------------------ 157| 96.2M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5owneeEPSB_: 210| 57.2M| 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| 96.5M| { 151| 96.5M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 96.5M, Folded] ------------------ 152| 96.5M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11delete_leafEPSB_j: 861| 2.91M| { 862| 2.91M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 68| 2.91M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (862:9): [True: 2.91M, False: 0] ------------------ 863| 2.91M| detail::destroy_n(p->leaf(), n); 864| 2.91M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (864:26): [True: 0, False: 2.91M] ------------------ 865| 2.91M| : node_t::sizeof_leaf_n(n), 866| 2.91M| p); 867| 2.91M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4leafEv: 190| 19.2M| { 191| 19.2M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 19.2M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 19.2M, False: 0] ------------------ 192| 19.2M| return impl.d.data.leaf.get_storage_ptr(); 193| 19.2M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12delete_innerEPSB_j: 808| 5.29M| { 809| 5.29M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 5.29M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 5.29M, False: 0] ------------------ 810| 5.29M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 5.29M, False: 0] ------------------ 811| 5.29M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 5.29M] ------------------ 812| 5.29M| : node_t::sizeof_inner_n(n), 813| 5.29M| p); 814| 5.29M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 227k| { 795| 227k| auto dst = copy_leaf_n(n + 1, src, n); 796| 227k| IMMER_TRY { ------------------ | | 49| 227k|#define IMMER_TRY try ------------------ 797| 227k| new (dst->leaf() + n) T(std::forward(x)); 798| 227k| } 799| 227k| 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| 227k| return dst; 805| 227k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_nEjPSB_j: 696| 227k| { 697| 227k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 227k, False: 0] ------------------ 698| 227k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 227k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 227k, False: 0] ------------------ 699| 227k| auto dst = make_leaf_n(allocn); 700| 227k| IMMER_TRY { ------------------ | | 49| 227k|#define IMMER_TRY try ------------------ 701| 227k| detail::uninitialized_copy( 702| 227k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 227k| } 704| 227k| 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| 227k| return dst; 709| 227k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_nEj: 341| 2.52M| { 342| 2.52M| assert(n <= branches); ------------------ | Branch (342:9): [True: 2.52M, False: 0] ------------------ 343| 2.52M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 2.52M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 2.52M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_nIiEEPSB_jOT_: 470| 42.7k| { 471| 42.7k| assert(n >= 1); ------------------ | Branch (471:9): [True: 42.7k, False: 0] ------------------ 472| 42.7k| auto p = make_leaf_n(n); 473| 42.7k| IMMER_TRY { ------------------ | | 49| 42.7k|#define IMMER_TRY try ------------------ 474| 42.7k| new (p->leaf()) T(std::forward(x)); 475| 42.7k| } 476| 42.7k| IMMER_CATCH (...) { 477| 0| heap::deallocate(node_t::sizeof_leaf_n(n), p); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 42.7k| return p; 481| 42.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13do_copy_innerEPSB_SC_j: 558| 5.01M| { 559| 5.01M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 5.01M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 5.01M, False: 0] ------------------ 560| 5.01M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 5.01M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 5.01M, False: 0] ------------------ 561| 5.01M| auto p = src->inner(); 562| 5.01M| inc_nodes(p, n); 563| 5.01M| std::copy(p, p + n, dst->inner()); 564| 5.01M| return dst; 565| 5.01M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9inc_nodesEPPSB_j: 970| 40.7M| { 971| 182M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 141M, False: 40.7M] ------------------ 972| 141M| refs(*i).inc(); 973| 40.7M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14copy_inner_r_nEjPSB_j: 588| 502k| { 589| 502k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 502k, False: 0] ------------------ 590| 502k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 502k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 502k, False: 0] ------------------ 591| 502k| auto dst = make_inner_r_n(allocn); 592| 502k| return do_copy_inner_r(dst, src, n); 593| 502k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE15do_copy_inner_rEPSB_SC_j: 610| 521k| { 611| 521k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 521k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 521k, False: 0] ------------------ 612| 521k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 521k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 521k, False: 0] ------------------ 613| 521k| auto src_r = src->relaxed(); 614| 521k| auto dst_r = dst->relaxed(); 615| 521k| inc_nodes(src->inner(), n); 616| 521k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 521k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 521k| dst_r->d.count = n; 619| 521k| return dst; 620| 521k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14make_inner_r_nEj: 243| 48.0M| { 244| 48.0M| assert(n <= branches); ------------------ | Branch (244:9): [True: 48.0M, False: 0] ------------------ 245| 48.0M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 48.0M| auto mr = static_cast(nullptr); 247| 48.0M| if (embed_relaxed) { ------------------ | Branch (247:13): [Folded, False: 48.0M] ------------------ 248| 0| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 48.0M| } else { 250| 48.0M| IMMER_TRY { ------------------ | | 49| 48.0M|#define IMMER_TRY try ------------------ 251| 48.0M| mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{}); 252| 48.0M| } 253| 48.0M| IMMER_CATCH (...) { 254| 0| heap::deallocate(sizeof_inner_r_n(n), mp); 255| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 256| 0| } 257| 48.0M| } 258| 48.0M| auto p = new (mp) node_t; 259| 48.0M| auto r = new (mr) relaxed_t; 260| 48.0M| r->d.count = 0; 261| 48.0M| p->impl.d.data.inner.relaxed = r; 262| 48.0M|#if IMMER_TAGGED_NODE 263| 48.0M| p->impl.d.kind = node_t::kind_t::inner; 264| 48.0M|#endif 265| 48.0M| return p; 266| 48.0M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9make_pathEjPSB_: 498| 1.29M| { 499| 1.29M| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 1.29M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 1.29M, False: 0] ------------------ 500| 1.29M| if (shift == endshift) ------------------ | Branch (500:13): [True: 1.10M, False: 188k] ------------------ 501| 1.10M| return node; 502| 188k| else { 503| 188k| auto n = node_t::make_inner_n(1); 504| 188k| IMMER_TRY { ------------------ | | 49| 188k|#define IMMER_TRY try ------------------ 505| 188k| n->inner()[0] = make_path(shift - B, node); 506| 188k| } 507| 188k| 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| 188k| return n; 512| 188k| } 513| 1.29M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12make_inner_nEj: 224| 5.21M| { 225| 5.21M| assert(n <= branches); ------------------ | Branch (225:9): [True: 5.21M, False: 0] ------------------ 226| 5.21M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 5.21M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 5.21M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9copy_leafEPSB_j: 666| 155k| { 667| 155k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 155k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 155k, False: 0] ------------------ 668| 155k| auto dst = make_leaf_n(n); 669| 155k| IMMER_TRY { ------------------ | | 49| 155k|#define IMMER_TRY try ------------------ 670| 155k| detail::uninitialized_copy( 671| 155k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 155k| } 673| 155k| 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| 155k| return dst; 678| 155k| } _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| 157k| { 270| 157k| return static_if( 271| 157k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 157k| [&](auto) { 273| 157k| auto p = 274| 157k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 157k| assert(r->d.count >= n); 276| 157k| node_t::refs(r).inc(); 277| 157k| p->impl.d.data.inner.relaxed = r; 278| 157k|#if IMMER_TAGGED_NODE 279| 157k| p->impl.d.kind = node_t::kind_t::inner; 280| 157k|#endif 281| 157k| return p; 282| 157k| }); 283| 157k| } _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| 157k| [&](auto) { 273| 157k| auto p = 274| 157k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 157k| assert(r->d.count >= n); ------------------ | Branch (275:17): [True: 157k, False: 0] ------------------ 276| 157k| node_t::refs(r).inc(); 277| 157k| p->impl.d.data.inner.relaxed = r; 278| 157k|#if IMMER_TAGGED_NODE 279| 157k| p->impl.d.kind = node_t::kind_t::inner; 280| 157k|#endif 281| 157k| return p; 282| 157k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE24do_copy_inner_replace_srEPSB_SC_jjSC_: 652| 157k| { 653| 157k| if (embed_relaxed) ------------------ | Branch (653:13): [Folded, False: 157k] ------------------ 654| 0| return do_copy_inner_replace_r(dst, src, n, offset, child); 655| 157k| else { 656| 157k| auto p = src->inner(); 657| 157k| inc_nodes(p, offset); 658| 157k| inc_nodes(p + offset + 1, n - offset - 1); 659| 157k| std::copy(p, p + n, dst->inner()); 660| 157k| dst->inner()[offset] = child; 661| 157k| return dst; 662| 157k| } 663| 157k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 40.1k| { 570| 40.1k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 40.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 40.1k, False: 0] ------------------ 571| 40.1k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 40.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 40.1k, False: 0] ------------------ 572| 40.1k| auto p = src->inner(); 573| 40.1k| inc_nodes(p, offset); 574| 40.1k| inc_nodes(p + offset + 1, n - offset - 1); 575| 40.1k| std::copy(p, p + n, dst->inner()); 576| 40.1k| dst->inner()[offset] = child; 577| 40.1k| return dst; 578| 40.1k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12copy_inner_nEjPSB_j: 543| 8.61k| { 544| 8.61k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 8.61k, False: 0] ------------------ 545| 8.61k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 8.61k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 8.61k, False: 0] ------------------ 546| 8.61k| auto dst = make_inner_n(allocn); 547| 8.61k| return do_copy_inner(dst, src, n); 548| 8.61k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12copy_inner_rEPSB_j: 581| 3.06k| { 582| 3.06k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 3.06k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 3.06k, False: 0] ------------------ 583| 3.06k| auto dst = make_inner_r_n(n); 584| 3.06k| return do_copy_inner_r(dst, src, n); 585| 3.06k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13compute_shiftEv: 977| 14.4M| { 978| 14.4M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 1.07M, False: 13.3M] ------------------ 979| 1.07M| return endshift; 980| 13.3M| else 981| 13.3M| return B + inner()[0]->compute_shift(); 982| 14.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5checkEjm: 986| 1.07M| { 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.07M| return true; 1023| 1.07M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9copy_leafEPSB_jj: 778| 934k| { 779| 934k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 934k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 934k, False: 0] ------------------ 780| 934k| auto dst = make_leaf_n(last - idx); 781| 934k| IMMER_TRY { ------------------ | | 49| 934k|#define IMMER_TRY try ------------------ 782| 934k| detail::uninitialized_copy( 783| 934k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 934k| } 785| 934k| 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| 934k| return dst; 790| 934k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9copy_leafEPSB_jSC_j: 712| 955k| { 713| 955k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 955k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 955k, False: 0] ------------------ 714| 955k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 955k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 955k, False: 0] ------------------ 715| 955k| auto dst = make_leaf_n(n1 + n2); 716| 955k| IMMER_TRY { ------------------ | | 49| 955k|#define IMMER_TRY try ------------------ 717| 955k| detail::uninitialized_copy( 718| 955k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 955k| } 720| 955k| 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| 955k| IMMER_TRY { ------------------ | | 49| 955k|#define IMMER_TRY try ------------------ 725| 955k| detail::uninitialized_copy( 726| 955k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 955k| } 728| 955k| 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| 955k| return dst; 734| 955k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 2.80M| { 871| 2.80M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 2.64M, False: 162k] | Branch (871:39): [True: 0, False: 162k] ------------------ 872| 2.80M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5owneeEPKSB_: 207| 162k| { 208| 162k| return get(x->impl); 209| 162k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 40.9k| { 682| 40.9k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 40.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 40.9k, False: 0] ------------------ 683| 40.9k| auto dst = make_leaf_e(e); 684| 40.9k| IMMER_TRY { ------------------ | | 49| 40.9k|#define IMMER_TRY try ------------------ 685| 40.9k| detail::uninitialized_copy( 686| 40.9k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 40.9k| } 688| 40.9k| 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.9k| return dst; 693| 40.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 395k| { 349| 395k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 395k| ownee(p) = e; 351| 395k|#if IMMER_TAGGED_NODE 352| 395k| p->impl.d.kind = node_t::kind_t::leaf; 353| 395k|#endif 354| 395k| return p; 355| 395k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 6.90k| { 486| 6.90k| auto p = make_leaf_e(e); 487| 6.90k| IMMER_TRY { ------------------ | | 49| 6.90k|#define IMMER_TRY try ------------------ 488| 6.90k| new (p->leaf()) T(std::forward(x)); 489| 6.90k| } 490| 6.90k| 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.90k| return p; 495| 6.90k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 212k| { 931| 212k| auto src_r = relaxed(); 932| 212k| return static_if( 933| 212k| [&](auto) { return src_r; }, 934| 212k| [&](auto) { 935| 212k| if (node_t::refs(src_r).unique() || 936| 212k| node_t::ownee(src_r).can_mutate(e)) 937| 212k| return src_r; 938| 212k| else { 939| 212k| auto dst_r = 940| 212k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 212k| if (src_r) { 942| 212k| std::copy( 943| 212k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 212k| if (node_t::refs(src_r).dec()) 945| 212k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 212k| src_r); 947| 212k| } 948| 212k| dst_r->d.count = n; 949| 212k| node_t::ownee(dst_r) = e; 950| 212k| return impl.d.data.inner.relaxed = dst_r; 951| 212k| } 952| 212k| }); 953| 212k| } _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| 212k| [&](auto) { 935| 212k| if (node_t::refs(src_r).unique() || ------------------ | Branch (935:21): [True: 207k, False: 5.10k] ------------------ 936| 5.10k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (936:21): [True: 0, False: 5.10k] ------------------ 937| 207k| return src_r; 938| 5.10k| else { 939| 5.10k| auto dst_r = 940| 5.10k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 5.10k| if (src_r) { ------------------ | Branch (941:25): [True: 5.10k, False: 0] ------------------ 942| 5.10k| std::copy( 943| 5.10k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 5.10k| if (node_t::refs(src_r).dec()) ------------------ | Branch (944:29): [True: 0, False: 5.10k] ------------------ 945| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 0| src_r); 947| 5.10k| } 948| 5.10k| dst_r->d.count = n; 949| 5.10k| node_t::ownee(dst_r) = e; 950| 5.10k| return impl.d.data.inner.relaxed = dst_r; 951| 5.10k| } 952| 212k| }); _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| 160k| { 287| 160k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 160k| auto mr = static_cast(nullptr); 289| 160k| if (embed_relaxed) { ------------------ | Branch (289:13): [Folded, False: 160k] ------------------ 290| 0| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 160k| } else { 292| 160k| IMMER_TRY { ------------------ | | 49| 160k|#define IMMER_TRY try ------------------ 293| 160k| mr = heap::allocate(max_sizeof_relaxed, norefs_tag{}); 294| 160k| } 295| 160k| IMMER_CATCH (...) { 296| 0| heap::deallocate(max_sizeof_inner_r, mp); 297| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 298| 0| } 299| 160k| } 300| 160k| auto p = new (mp) node_t; 301| 160k| auto r = new (mr) relaxed_t; 302| 160k| ownee(p) = e; 303| 160k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 160k| r->d.count = 0; 305| 160k| p->impl.d.data.inner.relaxed = r; 306| 160k|#if IMMER_TAGGED_NODE 307| 160k| p->impl.d.kind = node_t::kind_t::inner; 308| 160k|#endif 309| 160k| return p; 310| 160k| } _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| 160k| 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| 378k| { 517| 378k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 378k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 378k, False: 0] ------------------ 518| 378k| if (shift == endshift) ------------------ | Branch (518:13): [True: 327k, False: 51.4k] ------------------ 519| 327k| return node; 520| 51.4k| else { 521| 51.4k| auto n = node_t::make_inner_e(e); 522| 51.4k| IMMER_TRY { ------------------ | | 49| 51.4k|#define IMMER_TRY try ------------------ 523| 51.4k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 51.4k| } 525| 51.4k| 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| 51.4k| return n; 530| 51.4k| } 531| 378k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 81.9k| { 232| 81.9k| auto m = heap::allocate(max_sizeof_inner); 233| 81.9k| auto p = new (m) node_t; 234| 81.9k| ownee(p) = e; 235| 81.9k| p->impl.d.data.inner.relaxed = nullptr; 236| 81.9k|#if IMMER_TAGGED_NODE 237| 81.9k| p->impl.d.kind = node_t::kind_t::inner; 238| 81.9k|#endif 239| 81.9k| return p; 240| 81.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 21.2k| { 552| 21.2k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 21.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 21.2k, False: 0] ------------------ 553| 21.2k| auto dst = make_inner_e(e); 554| 21.2k| return do_copy_inner(dst, src, n); 555| 21.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 19.8k| { 604| 19.8k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 19.8k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 19.8k, False: 0] ------------------ 605| 19.8k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 19.8k| return do_copy_inner_sr(dst, src, n); 607| 19.8k| } _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.8k| { 314| 19.8k| return static_if( 315| 19.8k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 19.8k| [&](auto) { 317| 19.8k| auto p = 318| 19.8k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 19.8k| node_t::refs(r).inc(); 320| 19.8k| p->impl.d.data.inner.relaxed = r; 321| 19.8k| node_t::ownee(p) = e; 322| 19.8k|#if IMMER_TAGGED_NODE 323| 19.8k| p->impl.d.kind = node_t::kind_t::inner; 324| 19.8k|#endif 325| 19.8k| return p; 326| 19.8k| }); 327| 19.8k| } _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.8k| [&](auto) { 317| 19.8k| auto p = 318| 19.8k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 19.8k| node_t::refs(r).inc(); 320| 19.8k| p->impl.d.data.inner.relaxed = r; 321| 19.8k| node_t::ownee(p) = e; 322| 19.8k|#if IMMER_TAGGED_NODE 323| 19.8k| p->impl.d.kind = node_t::kind_t::inner; 324| 19.8k|#endif 325| 19.8k| return p; 326| 19.8k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE16do_copy_inner_srEPSB_SC_j: 640| 19.8k| { 641| 19.8k| if (embed_relaxed) ------------------ | Branch (641:13): [Folded, False: 19.8k] ------------------ 642| 0| return do_copy_inner_r(dst, src, n); 643| 19.8k| else { 644| 19.8k| inc_nodes(src->inner(), n); 645| 19.8k| std::copy(src->inner(), src->inner() + n, dst->inner()); 646| 19.8k| return dst; 647| 19.8k| } 648| 19.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 347k| { 764| 347k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 347k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 347k, False: 0] ------------------ 765| 347k| auto dst = make_leaf_e(e); 766| 347k| IMMER_TRY { ------------------ | | 49| 347k|#define IMMER_TRY try ------------------ 767| 347k| detail::uninitialized_copy( 768| 347k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 347k| } 770| 347k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 347k| return dst; 775| 347k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 171k| { 878| 171k| auto src_r = relaxed(); 879| 171k| return static_if( 880| 171k| [&](auto) { return src_r; }, 881| 171k| [&](auto) { 882| 171k| if (node_t::refs(src_r).unique() || 883| 171k| node_t::ownee(src_r).can_mutate(e)) 884| 171k| return src_r; 885| 171k| else { 886| 171k| auto dst_r = impl.d.data.inner.relaxed = 887| 171k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 171k| if (src_r) { 889| 171k| auto n = dst_r->d.count = src_r->d.count; 890| 171k| std::copy( 891| 171k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 171k| if (node_t::refs(src_r).dec()) 893| 171k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 171k| src_r); 895| 171k| } 896| 171k| node_t::ownee(dst_r) = e; 897| 171k| return dst_r; 898| 171k| } 899| 171k| }); 900| 171k| } _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| 171k| [&](auto) { 882| 171k| if (node_t::refs(src_r).unique() || ------------------ | Branch (882:21): [True: 152k, False: 19.2k] ------------------ 883| 19.2k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (883:21): [True: 0, False: 19.2k] ------------------ 884| 152k| return src_r; 885| 19.2k| else { 886| 19.2k| auto dst_r = impl.d.data.inner.relaxed = 887| 19.2k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 19.2k| if (src_r) { ------------------ | Branch (888:25): [True: 19.2k, False: 0] ------------------ 889| 19.2k| auto n = dst_r->d.count = src_r->d.count; 890| 19.2k| std::copy( 891| 19.2k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 19.2k| if (node_t::refs(src_r).dec()) ------------------ | Branch (892:29): [True: 0, False: 19.2k] ------------------ 893| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 0| src_r); 895| 19.2k| } 896| 19.2k| node_t::ownee(dst_r) = e; 897| 19.2k| return dst_r; 898| 19.2k| } 899| 171k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j: 738| 258| { 739| 258| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 258|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 258, False: 0] ------------------ 740| 258| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 258|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 258, False: 0] ------------------ 741| 258| auto dst = make_leaf_e(e); 742| 258| IMMER_TRY { ------------------ | | 49| 258|#define IMMER_TRY try ------------------ 743| 258| detail::uninitialized_copy( 744| 258| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 258| } 746| 258| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 258| IMMER_TRY { ------------------ | | 49| 258|#define IMMER_TRY try ------------------ 751| 258| detail::uninitialized_copy( 752| 258| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 258| } 754| 258| 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| 258| return dst; 760| 258| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 523| 246M| { 524| 246M| using node_t = node_type; 525| 246M| auto node = p.node(); 526| 246M| if (node->dec()) { ------------------ | Branch (526:13): [True: 48.3M, False: 197M] ------------------ 527| 48.3M| p.each(this_t{}); 528| 48.3M| node_t::delete_inner_r(node, p.count()); 529| 48.3M| } 530| 246M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 16.3M| { 535| 16.3M| using node_t = node_type; 536| 16.3M| auto node = p.node(); 537| 16.3M| if (node->dec()) { ------------------ | Branch (537:13): [True: 1.13M, False: 15.2M] ------------------ 538| 1.13M| p.each(this_t{}); 539| 1.13M| node_t::delete_inner(node, p.count()); 540| 1.13M| } 541| 16.3M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 4.24M| { 546| 4.24M| using node_t = node_type; 547| 4.24M| auto node = p.node(); 548| 4.24M| if (node->dec()) { ------------------ | Branch (548:13): [True: 612k, False: 3.62M] ------------------ 549| 612k| node_t::delete_leaf(node, p.count()); 550| 612k| } 551| 4.24M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.09M| { 546| 1.09M| using node_t = node_type; 547| 1.09M| auto node = p.node(); 548| 1.09M| if (node->dec()) { ------------------ | Branch (548:13): [True: 618k, False: 476k] ------------------ 549| 618k| node_t::delete_leaf(node, p.count()); 550| 618k| } 551| 1.09M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 9.41M| { 535| 9.41M| using node_t = node_type; 536| 9.41M| auto node = p.node(); 537| 9.41M| if (node->dec()) { ------------------ | Branch (537:13): [True: 103k, False: 9.31M] ------------------ 538| 103k| p.each(this_t{}); 539| 103k| node_t::delete_inner(node, p.count()); 540| 103k| } 541| 9.41M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 4.10M| { 535| 4.10M| using node_t = node_type; 536| 4.10M| auto node = p.node(); 537| 4.10M| if (node->dec()) { ------------------ | Branch (537:13): [True: 4.04M, False: 56.7k] ------------------ 538| 4.04M| p.each(this_t{}); 539| 4.04M| node_t::delete_inner(node, p.count()); 540| 4.04M| } 541| 4.10M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 534| 2.92M| { 535| 2.92M| using node_t = node_type; 536| 2.92M| auto node = p.node(); 537| 2.92M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 2.92M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 2.92M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 88.0M| { 546| 88.0M| using node_t = node_type; 547| 88.0M| auto node = p.node(); 548| 88.0M| if (node->dec()) { ------------------ | Branch (548:13): [True: 1.68M, False: 86.4M] ------------------ 549| 1.68M| node_t::delete_leaf(node, p.count()); 550| 1.68M| } 551| 88.0M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_: 545| 2.76M| { 546| 2.76M| using node_t = node_type; 547| 2.76M| auto node = p.node(); 548| 2.76M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 2.76M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 2.76M| } _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| 505k| { 792| 505k| auto level = pos.shift(); 793| 505k| auto idx = pos.count() - 1; 794| 505k| auto children = pos.size(idx); 795| 505k| auto new_idx = 796| 505k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 15.5k, False: 490k] | Branch (796:47): [True: 748, False: 489k] ------------------ 797| 505k| auto new_child = static_cast(nullptr); 798| 505k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 4.55k, False: 501k] ------------------ 799| 4.55k| return nullptr; 800| 501k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 489k, False: 11.7k] ------------------ 801| 489k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 489k| if (!new_child) { ------------------ | Branch (802:17): [True: 5.18k, False: 484k] ------------------ 803| 5.18k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 1.90k, False: 3.27k] ------------------ 804| 1.90k| new_child = node_t::make_path(level - B, tail); 805| 3.27k| else 806| 3.27k| return nullptr; 807| 5.18k| } 808| 489k| } else 809| 11.7k| new_child = node_t::make_path(level - B, tail); 810| 497k| IMMER_TRY { ------------------ | | 49| 497k|#define IMMER_TRY try ------------------ 811| 497k| auto count = new_idx + 1; 812| 497k| auto new_parent = 813| 497k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 497k| auto new_relaxed = new_parent->relaxed(); 815| 497k| new_parent->inner()[new_idx] = new_child; 816| 497k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 497k| new_relaxed->d.count = count; 818| 497k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 497k, False: 0] ------------------ 819| 497k| return new_parent; 820| 497k| } 821| 497k| 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| 497k| } _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| 305k| { 835| 305k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 305k, False: 0] ------------------ 836| 305k| auto idx = pos.index(pos.size() - 1); 837| 305k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 305k| auto count = new_idx + 1; 839| 305k| auto new_parent = node_t::make_inner_n(count); 840| 305k| IMMER_TRY { ------------------ | | 49| 305k|#define IMMER_TRY try ------------------ 841| 305k| new_parent->inner()[new_idx] = 842| 305k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 294k, False: 10.4k] ------------------ 843| | /* otherwise */ 844| 305k| : node_t::make_path(pos.shift() - B, tail); 845| 305k| } 846| 305k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 305k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 305k| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_SI_DpOT0_: 834| 3.91M| { 835| 3.91M| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 3.91M, False: 0] ------------------ 836| 3.91M| auto idx = pos.index(pos.size() - 1); 837| 3.91M| auto new_idx = pos.index(pos.size() + branches - 1); 838| 3.91M| auto count = new_idx + 1; 839| 3.91M| auto new_parent = node_t::make_inner_n(count); 840| 3.91M| IMMER_TRY { ------------------ | | 49| 3.91M|#define IMMER_TRY try ------------------ 841| 3.91M| new_parent->inner()[new_idx] = 842| 3.91M| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 2.90M, False: 1.00M] ------------------ 843| | /* otherwise */ 844| 3.91M| : node_t::make_path(pos.shift() - B, tail); 845| 3.91M| } 846| 3.91M| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 3.91M| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 3.91M| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEvPT_jm: 562| 584|{ 563| 584| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 584|} _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| 758k| { 835| 758k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 758k, False: 0] ------------------ 836| 758k| auto idx = pos.index(pos.size() - 1); 837| 758k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 758k| auto count = new_idx + 1; 839| 758k| auto new_parent = node_t::make_inner_n(count); 840| 758k| IMMER_TRY { ------------------ | | 49| 758k|#define IMMER_TRY try ------------------ 841| 758k| new_parent->inner()[new_idx] = 842| 758k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 714k, False: 43.7k] ------------------ 843| | /* otherwise */ 844| 758k| : node_t::make_path(pos.shift() - B, tail); 845| 758k| } 846| 758k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 758k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 758k| } 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| 120k| { 503| 120k| auto offset = pos.index(idx); 504| 120k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 120k| IMMER_TRY { ------------------ | | 49| 120k|#define IMMER_TRY try ------------------ 506| 120k| node->leaf()[offset] = 507| 120k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 120k| return node; 509| 120k| } 510| 120k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 120k| } 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| 157k| { 467| 157k| auto offset = pos.index(idx); 468| 157k| auto count = pos.count(); 469| 157k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 157k| IMMER_TRY { ------------------ | | 49| 157k|#define IMMER_TRY try ------------------ 471| 157k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 157k| node_t::do_copy_inner_replace_sr( 473| 157k| node, pos.node(), count, offset, child); 474| 157k| return node; 475| 157k| } 476| 157k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 157k| } 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| 23.2k| { 485| 23.2k| auto offset = pos.index(idx); 486| 23.2k| auto count = pos.count(); 487| 23.2k| auto node = node_t::make_inner_n(count); 488| 23.2k| IMMER_TRY { ------------------ | | 49| 23.2k|#define IMMER_TRY try ------------------ 489| 23.2k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 23.2k| node_t::do_copy_inner_replace( 491| 23.2k| node, pos.node(), count, offset, child); 492| 23.2k| return node; 493| 23.2k| } 494| 23.2k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 23.2k| } flex-vector-st.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 15.3k| { 503| 15.3k| auto offset = pos.index(idx); 504| 15.3k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 15.3k| IMMER_TRY { ------------------ | | 49| 15.3k|#define IMMER_TRY try ------------------ 506| 15.3k| node->leaf()[offset] = 507| 15.3k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 15.3k| return node; 509| 15.3k| } 510| 15.3k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 15.3k| } flex-vector-st.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13visit_regularIRNS1_8full_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 14.5k| { 485| 14.5k| auto offset = pos.index(idx); 486| 14.5k| auto count = pos.count(); 487| 14.5k| auto node = node_t::make_inner_n(count); 488| 14.5k| IMMER_TRY { ------------------ | | 49| 14.5k|#define IMMER_TRY try ------------------ 489| 14.5k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 14.5k| node_t::do_copy_inner_replace( 491| 14.5k| node, pos.node(), count, offset, child); 492| 14.5k| return node; 493| 14.5k| } 494| 14.5k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 14.5k| } flex-vector-st.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_8leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 7.81k| { 503| 7.81k| auto offset = pos.index(idx); 504| 7.81k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 7.81k| IMMER_TRY { ------------------ | | 49| 7.81k|#define IMMER_TRY try ------------------ 506| 7.81k| node->leaf()[offset] = 507| 7.81k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 7.81k| return node; 509| 7.81k| } 510| 7.81k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 7.81k| } 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.35k| { 485| 2.35k| auto offset = pos.index(idx); 486| 2.35k| auto count = pos.count(); 487| 2.35k| auto node = node_t::make_inner_n(count); 488| 2.35k| IMMER_TRY { ------------------ | | 49| 2.35k|#define IMMER_TRY try ------------------ 489| 2.35k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 2.35k| node_t::do_copy_inner_replace( 491| 2.35k| node, pos.node(), count, offset, child); 492| 2.35k| return node; 493| 2.35k| } 494| 2.35k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 2.35k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1096| 30.3k| { 1097| 30.3k| auto idx = pos.index(last); 1098| 30.3k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 30.3k, Folded] | Branch (1098:25): [True: 24.2k, False: 6.09k] ------------------ 1099| 24.2k| return pos.towards_oh(this_t{}, last, idx); 1100| 24.2k| } else { 1101| 6.09k| using std::get; 1102| 6.09k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 6.09k| auto next = get<1>(subs); 1104| 6.09k| auto ts = get<2>(subs); 1105| 6.09k| auto tail = get<3>(subs); 1106| 6.09k| IMMER_TRY { ------------------ | | 49| 6.09k|#define IMMER_TRY try ------------------ 1107| 6.09k| if (next) { ------------------ | Branch (1107:21): [True: 3.99k, False: 2.09k] ------------------ 1108| 3.99k| auto count = idx + 1; 1109| 3.99k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 3.99k| auto newr = newn->relaxed(); 1111| 3.99k| newn->inner()[idx] = next; 1112| 3.99k| newr->d.sizes[idx] = last + 1 - ts; 1113| 3.99k| newr->d.count = count; 1114| 3.99k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 3.99k, False: 0] ------------------ 1115| 3.99k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 3.99k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 2.09k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 2.09k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 2.09k, Folded] | Branch (1118:40): [True: 1.31k, False: 784] | Branch (1118:52): [True: 907, False: 406] ------------------ 1119| 907| auto newn = pos.node()->inner()[0]; 1120| 907| return std::make_tuple( 1121| 907| pos.shift() - B, newn->inc(), ts, tail); 1122| 1.19k| } else { 1123| 1.19k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.19k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.19k| } 1126| 6.09k| } 1127| 6.09k| 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.09k| } 1138| 30.3k| } _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.09k| { 1182| 2.09k| auto old_tail_size = pos.count(); 1183| 2.09k| auto new_tail_size = pos.index(last) + 1; 1184| 2.09k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 490, False: 1.60k] ------------------ 1185| 2.09k| ? pos.node()->inc() 1186| 2.09k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.09k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.09k| } _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.46k| { 1182| 3.46k| auto old_tail_size = pos.count(); 1183| 3.46k| auto new_tail_size = pos.index(last) + 1; 1184| 3.46k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.03k, False: 2.43k] ------------------ 1185| 3.46k| ? pos.node()->inc() 1186| 3.46k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 3.46k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 3.46k| } _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.86k| { 1097| 3.86k| auto idx = pos.index(last); 1098| 3.86k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 3.86k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 3.86k| } else { 1101| 3.86k| using std::get; 1102| 3.86k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 3.86k| auto next = get<1>(subs); 1104| 3.86k| auto ts = get<2>(subs); 1105| 3.86k| auto tail = get<3>(subs); 1106| 3.86k| IMMER_TRY { ------------------ | | 49| 3.86k|#define IMMER_TRY try ------------------ 1107| 3.86k| if (next) { ------------------ | Branch (1107:21): [True: 1.08k, False: 2.78k] ------------------ 1108| 1.08k| auto count = idx + 1; 1109| 1.08k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 1.08k| auto newr = newn->relaxed(); 1111| 1.08k| newn->inner()[idx] = next; 1112| 1.08k| newr->d.sizes[idx] = last + 1 - ts; 1113| 1.08k| newr->d.count = count; 1114| 1.08k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 1.08k, False: 0] ------------------ 1115| 1.08k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 2.78k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 908, False: 1.87k] ------------------ 1117| 908| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 1.87k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 1.87k] | 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.87k| } else { 1123| 1.87k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.87k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.87k| } 1126| 3.86k| } 1127| 3.86k| 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.86k| } 1138| 3.86k| } _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.47k, False: 1.15k] ------------------ 1154| 1.47k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.47k| newn->inner()[idx] = next; 1156| 1.47k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.47k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 510, False: 644] ------------------ 1158| 510| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 644| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 644] | 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| 644| } else { 1164| 644| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 644| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 644| } 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.82k| { 1182| 3.82k| auto old_tail_size = pos.count(); 1183| 3.82k| auto new_tail_size = pos.index(last) + 1; 1184| 3.82k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.59k, False: 2.23k] ------------------ 1185| 3.82k| ? pos.node()->inc() 1186| 3.82k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 3.82k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 3.82k| } _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.05k| { 1143| 2.05k| auto idx = pos.index(last); 1144| 2.05k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.05k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.05k| } else { 1147| 2.05k| using std::get; 1148| 2.05k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.05k| auto next = get<1>(subs); 1150| 2.05k| auto ts = get<2>(subs); 1151| 2.05k| auto tail = get<3>(subs); 1152| 2.05k| IMMER_TRY { ------------------ | | 49| 2.05k|#define IMMER_TRY try ------------------ 1153| 2.05k| if (next) { ------------------ | Branch (1153:21): [True: 210, False: 1.84k] ------------------ 1154| 210| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 210| newn->inner()[idx] = next; 1156| 210| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.84k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 528, False: 1.31k] ------------------ 1158| 528| 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.05k| } 1168| 2.05k| 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.05k| } 1177| 2.05k| } _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.99k| { 1182| 2.99k| auto old_tail_size = pos.count(); 1183| 2.99k| auto new_tail_size = pos.index(last) + 1; 1184| 2.99k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.16k, False: 1.83k] ------------------ 1185| 2.99k| ? pos.node()->inc() 1186| 2.99k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.99k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.99k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 3.18k| { 1143| 3.18k| auto idx = pos.index(last); 1144| 3.18k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.18k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 3.18k| } else { 1147| 3.18k| using std::get; 1148| 3.18k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.18k| auto next = get<1>(subs); 1150| 3.18k| auto ts = get<2>(subs); 1151| 3.18k| auto tail = get<3>(subs); 1152| 3.18k| IMMER_TRY { ------------------ | | 49| 3.18k|#define IMMER_TRY try ------------------ 1153| 3.18k| if (next) { ------------------ | Branch (1153:21): [True: 875, False: 2.31k] ------------------ 1154| 875| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 875| newn->inner()[idx] = next; 1156| 875| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.31k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.14k, False: 1.16k] ------------------ 1158| 1.14k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.16k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.16k] | 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.16k| } else { 1164| 1.16k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.16k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.16k| } 1167| 3.18k| } 1168| 3.18k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 3.18k| } 1177| 3.18k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEvPT_j: 556| 38.3k|{ 557| 38.3k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 38.3k|} _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.53k| { 1143| 6.53k| auto idx = pos.index(last); 1144| 6.53k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 6.53k, Folded] | Branch (1144:25): [True: 3.49k, False: 3.04k] ------------------ 1145| 3.49k| return pos.towards_oh(this_t{}, last, idx); 1146| 3.49k| } else { 1147| 3.04k| using std::get; 1148| 3.04k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.04k| auto next = get<1>(subs); 1150| 3.04k| auto ts = get<2>(subs); 1151| 3.04k| auto tail = get<3>(subs); 1152| 3.04k| IMMER_TRY { ------------------ | | 49| 3.04k|#define IMMER_TRY try ------------------ 1153| 3.04k| if (next) { ------------------ | Branch (1153:21): [True: 683, False: 2.35k] ------------------ 1154| 683| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 683| newn->inner()[idx] = next; 1156| 683| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.35k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.35k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.35k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.35k, Folded] | Branch (1159:40): [True: 2.00k, False: 357] | Branch (1159:52): [True: 1.00k, False: 1.00k] ------------------ 1160| 1.00k| auto newn = pos.node()->inner()[0]; 1161| 1.00k| return std::make_tuple( 1162| 1.00k| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.35k| } else { 1164| 1.35k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.35k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.35k| } 1167| 3.04k| } 1168| 3.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| 3.04k| } 1177| 6.53k| } _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.53k| { 1182| 1.53k| auto old_tail_size = pos.count(); 1183| 1.53k| auto new_tail_size = pos.index(last) + 1; 1184| 1.53k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 643, False: 894] ------------------ 1185| 1.53k| ? pos.node()->inc() 1186| 1.53k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.53k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.53k| } _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.08k| { 1143| 2.08k| auto idx = pos.index(last); 1144| 2.08k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 2.08k, Folded] | Branch (1144:25): [True: 937, False: 1.15k] ------------------ 1145| 937| return pos.towards_oh(this_t{}, last, idx); 1146| 1.15k| } else { 1147| 1.15k| using std::get; 1148| 1.15k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 1.15k| auto next = get<1>(subs); 1150| 1.15k| auto ts = get<2>(subs); 1151| 1.15k| auto tail = get<3>(subs); 1152| 1.15k| IMMER_TRY { ------------------ | | 49| 1.15k|#define IMMER_TRY try ------------------ 1153| 1.15k| if (next) { ------------------ | Branch (1153:21): [True: 322, False: 828] ------------------ 1154| 322| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 322| newn->inner()[idx] = next; 1156| 322| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 828| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 828] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 828| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 828, Folded] | Branch (1159:40): [True: 478, False: 350] | Branch (1159:52): [True: 261, False: 217] ------------------ 1160| 261| auto newn = pos.node()->inner()[0]; 1161| 261| return std::make_tuple( 1162| 261| pos.shift() - B, newn->inc(), ts, tail); 1163| 567| } else { 1164| 567| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 567| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 567| } 1167| 1.15k| } 1168| 1.15k| 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.15k| } 1177| 2.08k| } _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| 805| { 1182| 805| auto old_tail_size = pos.count(); 1183| 805| auto new_tail_size = pos.index(last) + 1; 1184| 805| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 522, False: 283] ------------------ 1185| 805| ? pos.node()->inc() 1186| 805| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 805| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 805| } _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| 16.6k| { 1415| 16.6k| auto idx = pos.subindex(first); 1416| 16.6k| auto count = pos.count(); 1417| 16.6k| auto left_size = pos.size_before(idx); 1418| 16.6k| auto child_size = pos.size_sbh(idx, left_size); 1419| 16.6k| auto dropped_size = first; 1420| 16.6k| auto child_dropped_size = dropped_size - left_size; 1421| 16.6k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 16.6k, Folded] | Branch (1421:25): [True: 14.8k, False: 1.76k] | Branch (1421:45): [True: 3.39k, False: 11.4k] ------------------ 1422| 3.39k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 13.2k| } else { 1424| 13.2k| using std::get; 1425| 13.2k| auto n = pos.node(); 1426| 13.2k| auto newc = count - idx; 1427| 13.2k| auto newn = node_t::make_inner_r_n(newc); 1428| 13.2k| IMMER_TRY { ------------------ | | 49| 13.2k|#define IMMER_TRY try ------------------ 1429| 13.2k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 13.2k| auto newr = newn->relaxed(); 1431| 13.2k| newr->d.count = count - idx; 1432| 13.2k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 13.2k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 13.2k, False: 0] ------------------ 1434| 13.2k| pos.copy_sizes(idx + 1, 1435| 13.2k| newr->d.count - 1, 1436| 13.2k| newr->d.sizes[0], 1437| 13.2k| newr->d.sizes + 1); 1438| 13.2k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 13.2k, False: 0] ------------------ 1439| 13.2k| pos.size() - dropped_size); 1440| 13.2k| newn->inner()[0] = get<1>(subs); 1441| 13.2k| std::copy(n->inner() + idx + 1, 1442| 13.2k| n->inner() + count, 1443| 13.2k| newn->inner() + 1); 1444| 13.2k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 13.2k| return std::make_tuple(pos.shift(), newn); 1446| 13.2k| } 1447| 13.2k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 13.2k| } 1452| 16.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| 12.3k| { 1457| 12.3k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 12.3k| return std::make_tuple(0, n); 1459| 12.3k| } _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| 57.1k| { 1415| 57.1k| auto idx = pos.subindex(first); 1416| 57.1k| auto count = pos.count(); 1417| 57.1k| auto left_size = pos.size_before(idx); 1418| 57.1k| auto child_size = pos.size_sbh(idx, left_size); 1419| 57.1k| auto dropped_size = first; 1420| 57.1k| auto child_dropped_size = dropped_size - left_size; 1421| 57.1k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 57.1k] | 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| 57.1k| } else { 1424| 57.1k| using std::get; 1425| 57.1k| auto n = pos.node(); 1426| 57.1k| auto newc = count - idx; 1427| 57.1k| auto newn = node_t::make_inner_r_n(newc); 1428| 57.1k| IMMER_TRY { ------------------ | | 49| 57.1k|#define IMMER_TRY try ------------------ 1429| 57.1k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 57.1k| auto newr = newn->relaxed(); 1431| 57.1k| newr->d.count = count - idx; 1432| 57.1k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 57.1k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 57.1k, False: 0] ------------------ 1434| 57.1k| pos.copy_sizes(idx + 1, 1435| 57.1k| newr->d.count - 1, 1436| 57.1k| newr->d.sizes[0], 1437| 57.1k| newr->d.sizes + 1); 1438| 57.1k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 57.1k, False: 0] ------------------ 1439| 57.1k| pos.size() - dropped_size); 1440| 57.1k| newn->inner()[0] = get<1>(subs); 1441| 57.1k| std::copy(n->inner() + idx + 1, 1442| 57.1k| n->inner() + count, 1443| 57.1k| newn->inner() + 1); 1444| 57.1k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 57.1k| return std::make_tuple(pos.shift(), newn); 1446| 57.1k| } 1447| 57.1k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 57.1k| } 1452| 57.1k| } _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| 812| { 1415| 812| auto idx = pos.subindex(first); 1416| 812| auto count = pos.count(); 1417| 812| auto left_size = pos.size_before(idx); 1418| 812| auto child_size = pos.size_sbh(idx, left_size); 1419| 812| auto dropped_size = first; 1420| 812| auto child_dropped_size = dropped_size - left_size; 1421| 812| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 812] | 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| 812| } else { 1424| 812| using std::get; 1425| 812| auto n = pos.node(); 1426| 812| auto newc = count - idx; 1427| 812| auto newn = node_t::make_inner_r_n(newc); 1428| 812| IMMER_TRY { ------------------ | | 49| 812|#define IMMER_TRY try ------------------ 1429| 812| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 812| auto newr = newn->relaxed(); 1431| 812| newr->d.count = count - idx; 1432| 812| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 812| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 812, False: 0] ------------------ 1434| 812| pos.copy_sizes(idx + 1, 1435| 812| newr->d.count - 1, 1436| 812| newr->d.sizes[0], 1437| 812| newr->d.sizes + 1); 1438| 812| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 812, False: 0] ------------------ 1439| 812| pos.size() - dropped_size); 1440| 812| newn->inner()[0] = get<1>(subs); 1441| 812| std::copy(n->inner() + idx + 1, 1442| 812| n->inner() + count, 1443| 812| newn->inner() + 1); 1444| 812| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 812| return std::make_tuple(pos.shift(), newn); 1446| 812| } 1447| 812| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 812| } 1452| 812| } _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.68k| { 1457| 7.68k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 7.68k| return std::make_tuple(0, n); 1459| 7.68k| } _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.17k| { 1415| 4.17k| auto idx = pos.subindex(first); 1416| 4.17k| auto count = pos.count(); 1417| 4.17k| auto left_size = pos.size_before(idx); 1418| 4.17k| auto child_size = pos.size_sbh(idx, left_size); 1419| 4.17k| auto dropped_size = first; 1420| 4.17k| auto child_dropped_size = dropped_size - left_size; 1421| 4.17k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 4.17k] | 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.17k| } else { 1424| 4.17k| using std::get; 1425| 4.17k| auto n = pos.node(); 1426| 4.17k| auto newc = count - idx; 1427| 4.17k| auto newn = node_t::make_inner_r_n(newc); 1428| 4.17k| IMMER_TRY { ------------------ | | 49| 4.17k|#define IMMER_TRY try ------------------ 1429| 4.17k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 4.17k| auto newr = newn->relaxed(); 1431| 4.17k| newr->d.count = count - idx; 1432| 4.17k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 4.17k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 4.17k, False: 0] ------------------ 1434| 4.17k| pos.copy_sizes(idx + 1, 1435| 4.17k| newr->d.count - 1, 1436| 4.17k| newr->d.sizes[0], 1437| 4.17k| newr->d.sizes + 1); 1438| 4.17k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 4.17k, False: 0] ------------------ 1439| 4.17k| pos.size() - dropped_size); 1440| 4.17k| newn->inner()[0] = get<1>(subs); 1441| 4.17k| std::copy(n->inner() + idx + 1, 1442| 4.17k| n->inner() + count, 1443| 4.17k| newn->inner() + 1); 1444| 4.17k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 4.17k| return std::make_tuple(pos.shift(), newn); 1446| 4.17k| } 1447| 4.17k| 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.17k| } 1452| 4.17k| } _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.78k| { 1415| 8.78k| auto idx = pos.subindex(first); 1416| 8.78k| auto count = pos.count(); 1417| 8.78k| auto left_size = pos.size_before(idx); 1418| 8.78k| auto child_size = pos.size_sbh(idx, left_size); 1419| 8.78k| auto dropped_size = first; 1420| 8.78k| auto child_dropped_size = dropped_size - left_size; 1421| 8.78k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 8.78k, Folded] | Branch (1421:25): [True: 5.44k, False: 3.34k] | Branch (1421:45): [True: 2.76k, False: 2.67k] ------------------ 1422| 2.76k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 6.02k| } else { 1424| 6.02k| using std::get; 1425| 6.02k| auto n = pos.node(); 1426| 6.02k| auto newc = count - idx; 1427| 6.02k| auto newn = node_t::make_inner_r_n(newc); 1428| 6.02k| IMMER_TRY { ------------------ | | 49| 6.02k|#define IMMER_TRY try ------------------ 1429| 6.02k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 6.02k| auto newr = newn->relaxed(); 1431| 6.02k| newr->d.count = count - idx; 1432| 6.02k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 6.02k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 6.02k, False: 0] ------------------ 1434| 6.02k| pos.copy_sizes(idx + 1, 1435| 6.02k| newr->d.count - 1, 1436| 6.02k| newr->d.sizes[0], 1437| 6.02k| newr->d.sizes + 1); 1438| 6.02k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 6.02k, False: 0] ------------------ 1439| 6.02k| pos.size() - dropped_size); 1440| 6.02k| newn->inner()[0] = get<1>(subs); 1441| 6.02k| std::copy(n->inner() + idx + 1, 1442| 6.02k| n->inner() + count, 1443| 6.02k| newn->inner() + 1); 1444| 6.02k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 6.02k| return std::make_tuple(pos.shift(), newn); 1446| 6.02k| } 1447| 6.02k| 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.02k| } 1452| 8.78k| } _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| 855| { 1415| 855| auto idx = pos.subindex(first); 1416| 855| auto count = pos.count(); 1417| 855| auto left_size = pos.size_before(idx); 1418| 855| auto child_size = pos.size_sbh(idx, left_size); 1419| 855| auto dropped_size = first; 1420| 855| auto child_dropped_size = dropped_size - left_size; 1421| 855| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 855, Folded] | Branch (1421:25): [True: 286, False: 569] | Branch (1421:45): [True: 0, False: 286] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 855| } else { 1424| 855| using std::get; 1425| 855| auto n = pos.node(); 1426| 855| auto newc = count - idx; 1427| 855| auto newn = node_t::make_inner_r_n(newc); 1428| 855| IMMER_TRY { ------------------ | | 49| 855|#define IMMER_TRY try ------------------ 1429| 855| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 855| auto newr = newn->relaxed(); 1431| 855| newr->d.count = count - idx; 1432| 855| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 855| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 855, False: 0] ------------------ 1434| 855| pos.copy_sizes(idx + 1, 1435| 855| newr->d.count - 1, 1436| 855| newr->d.sizes[0], 1437| 855| newr->d.sizes + 1); 1438| 855| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 855, False: 0] ------------------ 1439| 855| pos.size() - dropped_size); 1440| 855| newn->inner()[0] = get<1>(subs); 1441| 855| std::copy(n->inner() + idx + 1, 1442| 855| n->inner() + count, 1443| 855| newn->inner() + 1); 1444| 855| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 855| return std::make_tuple(pos.shift(), newn); 1446| 855| } 1447| 855| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 855| } 1452| 855| } _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.6k|{ 2002| 11.6k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 11.6k| .visit(concat_trees_left_visitor{}, 2004| 11.6k| empty_leaf_pos{}, 2005| 11.6k| rroot, 2006| 11.6k| rshift, 2007| 11.6k| rsize) 2008| 11.6k| .realize(); 2009| 11.6k|} _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.6k| { 1972| 11.6k| return visit_maybe_relaxed_sub( 1973| 11.6k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 11.6k| } _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| 8.84k| { 1959| 8.84k| return concat_inners(lpos, tpos, rpos); 1960| 8.84k| } _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.4k|{ 1873| 62.4k| auto lshift = lpos.shift(); 1874| 62.4k| auto rshift = rpos.shift(); 1875| 62.4k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 62.4k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 62.4k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 53.9k, False: 8.54k] ------------------ 1879| 53.9k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 53.9k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 53.9k| } else { 1882| 8.54k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 8.54k, False: 0] ------------------ 1883| 8.54k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 8.54k] | Branch (1883:9): [True: 8.54k, False: 0] | Branch (1883:9): [True: 8.54k, False: 0] ------------------ 1884| 8.54k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 8.54k| return concat_rebalance(lpos, cpos, rpos); 1886| 8.54k| } 1887| 62.4k|} _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| 18.0M| { 1513| 18.0M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.44M, False: 16.6M] ------------------ 1514| 1.44M| auto s = size_t{}; 1515| 5.76M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 4.31M, False: 1.44M] ------------------ 1516| 4.31M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 4.31M| s = sizes_[i]; 1518| 4.31M| } 1519| 16.6M| } else { 1520| 45.6M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 29.0M, False: 16.6M] ------------------ 1521| 29.0M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 29.0M| .visit(v, args...); 1523| 16.6M| } 1524| 18.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| 13.9M| { 1734| 13.9M| auto count = p.count(); 1735| 13.9M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 13.9M, False: 0] ------------------ 1736| 13.9M| plan.counts[plan.n++] = count; 1737| 13.9M| plan.total += count; 1738| 13.9M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 162M| { 1734| 162M| auto count = p.count(); 1735| 162M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 162M, False: 0] ------------------ 1736| 162M| plan.counts[plan.n++] = count; 1737| 162M| plan.total += count; 1738| 162M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE7shuffleEj: 1762| 18.0M| { 1763| | // gcc seems to not really understand this code... :( 1764| 18.0M|#if !defined(_MSC_VER) 1765| 18.0M|#pragma GCC diagnostic push 1766| 18.0M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 18.0M|#endif 1768| 18.0M| constexpr count_t rrb_extras = 2; 1769| 18.0M| constexpr count_t rrb_invariant = 1; 1770| 18.0M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 1.44M, False: 16.6M] ------------------ 1771| 18.0M| const auto branches = count_t{1} << bits; 1772| 18.0M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 18.0M| count_t i = 0; 1774| 22.7M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 4.63M, False: 18.0M] ------------------ 1775| | // skip ok nodes 1776| 10.4M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 5.76M, False: 4.63M] ------------------ 1777| 5.76M| i++; 1778| 4.63M| assert(i < n); ------------------ | Branch (1778:13): [True: 4.63M, False: 0] ------------------ 1779| | // short node, redistribute 1780| 4.63M| auto remaining = counts[i]; 1781| 17.9M| do { 1782| 17.9M| auto next = counts[i + 1]; 1783| 17.9M| auto count = std::min(remaining + next, branches); 1784| 17.9M| counts[i] = count; 1785| 17.9M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 17.9M, False: 0] ------------------ 1786| 17.9M| remaining += next - count; 1787| 17.9M| ++i; 1788| 17.9M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 13.3M, False: 4.63M] ------------------ 1789| | // remove node 1790| 4.63M| std::move(counts + i + 1, counts + n, counts + i); 1791| 4.63M| --n; 1792| 4.63M| --i; 1793| 4.63M| } 1794| 18.0M|#if !defined(_MSC_VER) 1795| 18.0M|#pragma GCC diagnostic pop 1796| 18.0M|#endif 1797| 18.0M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 1478| 36.1M| auto shift() const { return shift_; } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEC2EjPjj: 1577| 18.0M| : curr_{counts} 1578| 18.0M| , n_{n} 1579| 18.0M| , result_{ 1580| 18.0M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 18.0M| { 1582| 18.0M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEC2EjPSC_m: 1481| 18.0M| : shift_{s} 1482| 18.0M| , count_{1} 1483| 18.0M| , nodes_{n0} 1484| 18.0M| , sizes_{s0} 1485| 18.0M| { 1486| 18.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| 18.0M| { 1513| 18.0M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.44M, False: 16.6M] ------------------ 1514| 1.44M| auto s = size_t{}; 1515| 5.76M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 4.31M, False: 1.44M] ------------------ 1516| 4.31M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 4.31M| s = sizes_[i]; 1518| 4.31M| } 1519| 16.6M| } else { 1520| 45.6M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 29.0M, False: 16.6M] ------------------ 1521| 29.0M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 29.0M| .visit(v, args...); 1523| 16.6M| } 1524| 18.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| 13.9M| { 1722| 13.9M| merger.merge_leaf(p); 1723| 13.9M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_: 1614| 13.9M| { 1615| 13.9M| auto from = p.node(); 1616| 13.9M| auto from_size = p.size(); 1617| 13.9M| auto from_count = p.count(); 1618| 13.9M| assert(from_size); ------------------ | Branch (1618:9): [True: 13.9M, False: 0] ------------------ 1619| 13.9M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 13.7M, False: 210k] | Branch (1619:21): [True: 13.6M, False: 99.1k] ------------------ 1620| 13.6M| add_child(from, from_size); 1621| 13.6M| from->inc(); 1622| 13.6M| } else { 1623| 309k| auto from_offset = count_t{}; 1624| 309k| auto from_data = from->leaf(); 1625| 417k| do { 1626| 417k| if (!to_) { ------------------ | Branch (1626:21): [True: 207k, False: 210k] ------------------ 1627| 207k| to_ = node_t::make_leaf_n(*curr_); 1628| 207k| to_offset_ = 0; 1629| 207k| } 1630| 417k| auto data = to_->leaf(); 1631| 417k| auto to_copy = 1632| 417k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 417k| detail::uninitialized_copy(from_data + from_offset, 1634| 417k| from_data + from_offset + to_copy, 1635| 417k| data + to_offset_); 1636| 417k| to_offset_ += to_copy; 1637| 417k| from_offset += to_copy; 1638| 417k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 207k, False: 210k] ------------------ 1639| 207k| add_child(to_, to_offset_); 1640| 207k| to_ = nullptr; 1641| 207k| } 1642| 417k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 107k, False: 309k] ------------------ 1643| 309k| } 1644| 13.9M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9add_childEPSC_m: 1589| 181M| { 1590| 181M| assert(size); ------------------ | Branch (1590:9): [True: 181M, False: 0] ------------------ 1591| 181M| ++curr_; 1592| 181M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 181M| auto relaxed = parent->relaxed(); 1594| 181M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 12.4M, False: 169M] ------------------ 1595| 12.4M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 12.4M, False: 0] ------------------ 1596| 12.4M| n_ -= branches; 1597| 12.4M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 12.4M| relaxed = parent->relaxed(); 1599| 12.4M| result_.nodes_[result_.count_] = parent; 1600| 12.4M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 12.4M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 12.4M, False: 0] ------------------ 1602| 12.4M| ++result_.count_; 1603| 12.4M| } 1604| 181M| auto idx = relaxed->d.count++; 1605| 181M| result_.sizes_[result_.count_ - 1] += size; 1606| 181M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 181M, False: 0] ------------------ 1607| 181M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 151M, False: 30.5M] ------------------ 1608| 181M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 181M, False: 0] ------------------ 1609| 181M| parent->inner()[idx] = p; 1610| 181M| }; _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| 162M| { 1716| 162M| merger.merge_inner(p); 1717| 162M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 162M| { 1649| 162M| auto from = p.node(); 1650| 162M| auto from_size = p.size(); 1651| 162M| auto from_count = p.count(); 1652| 162M| assert(from_size); ------------------ | Branch (1652:9): [True: 162M, False: 0] ------------------ 1653| 162M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 146M, False: 16.0M] | Branch (1653:21): [True: 143M, False: 3.59M] ------------------ 1654| 143M| add_child(from, from_size); 1655| 143M| from->inc(); 1656| 143M| } else { 1657| 19.6M| auto from_offset = count_t{}; 1658| 19.6M| auto from_data = from->inner(); 1659| 31.2M| do { 1660| 31.2M| if (!to_) { ------------------ | Branch (1660:21): [True: 15.1M, False: 16.0M] ------------------ 1661| 15.1M| to_ = node_t::make_inner_r_n(*curr_); 1662| 15.1M| to_offset_ = 0; 1663| 15.1M| to_size_ = 0; 1664| 15.1M| } 1665| 31.2M| auto data = to_->inner(); 1666| 31.2M| auto to_copy = 1667| 31.2M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 31.2M| std::copy(from_data + from_offset, 1669| 31.2M| from_data + from_offset + to_copy, 1670| 31.2M| data + to_offset_); 1671| 31.2M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 31.2M| auto sizes = to_->relaxed()->d.sizes; 1673| 31.2M| p.copy_sizes( 1674| 31.2M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 31.2M| to_offset_ += to_copy; 1676| 31.2M| from_offset += to_copy; 1677| 31.2M| to_size_ = sizes[to_offset_ - 1]; 1678| 31.2M| assert(to_size_); ------------------ | Branch (1678:17): [True: 31.2M, False: 0] ------------------ 1679| 31.2M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 15.1M, False: 16.0M] ------------------ 1680| 15.1M| to_->relaxed()->d.count = to_offset_; 1681| 15.1M| add_child(to_, to_size_); 1682| 15.1M| to_ = nullptr; 1683| 15.1M| } 1684| 31.2M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 11.5M, False: 19.6M] ------------------ 1685| 19.6M| } 1686| 162M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE6finishEv: 1689| 18.0M| { 1690| 18.0M| assert(!to_); ------------------ | Branch (1690:9): [True: 18.0M, False: 0] ------------------ 1691| 18.0M| return result_; 1692| 18.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| 18.0M| { 1513| 18.0M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.44M, False: 16.6M] ------------------ 1514| 1.44M| auto s = size_t{}; 1515| 5.76M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 4.31M, False: 1.44M] ------------------ 1516| 4.31M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 4.31M| s = sizes_[i]; 1518| 4.31M| } 1519| 16.6M| } else { 1520| 45.6M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 29.0M, False: 16.6M] ------------------ 1521| 29.0M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 29.0M| .visit(v, args...); 1523| 16.6M| } 1524| 18.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.43M| : shift_{s} 1504| 1.43M| , count_{3} 1505| 1.43M| , nodes_{n0, n1, n2} 1506| 1.43M| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 1.43M| { 1508| 1.43M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEC2EjPSC_mSE_m: 1489| 11.6k| : shift_{s} 1490| 11.6k| , count_{2} 1491| 11.6k| , nodes_{n0, n1} 1492| 11.6k| , sizes_{s0, s0 + s1} 1493| 11.6k| { 1494| 11.6k| } _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.6k| { 1918| 53.6k| return concat_inners(lpos, tpos, rpos); 1919| 53.6k| } _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| 303| { 1918| 303| return concat_inners(lpos, tpos, rpos); 1919| 303| } _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.09k|{ 1873| 3.09k| auto lshift = lpos.shift(); 1874| 3.09k| auto rshift = rpos.shift(); 1875| 3.09k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 3.09k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 3.09k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 601, False: 2.49k] ------------------ 1879| 601| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 601| 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.09k|} _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| 903| { 1918| 903| return concat_inners(lpos, tpos, rpos); 1919| 903| } _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| 903|{ 1873| 903| auto lshift = lpos.shift(); 1874| 903| auto rshift = rpos.shift(); 1875| 903| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 903] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 903| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 302, False: 601] ------------------ 1879| 302| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 302| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 601| } else { 1882| 601| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 601, False: 0] ------------------ 1883| 601| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 601] | Branch (1883:9): [True: 601, False: 0] | Branch (1883:9): [True: 601, False: 0] ------------------ 1884| 601| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 601| return concat_rebalance(lpos, cpos, rpos); 1886| 601| } 1887| 903|} _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| 738|{ 1824| 738| auto plan = concat_rebalance_plan{}; 1825| 738| plan.fill(lpos, cpos, rpos); 1826| 738| plan.shuffle(cpos.shift()); 1827| 738| IMMER_TRY { ------------------ | | 49| 738|#define IMMER_TRY try ------------------ 1828| 738| return plan.merge(lpos, cpos, rpos); 1829| 738| } 1830| 738| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 738|} _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| 738| { 1753| 738| assert(n == 0u); ------------------ | Branch (1753:9): [True: 738, False: 0] ------------------ 1754| 738| assert(total == 0u); ------------------ | Branch (1754:9): [True: 738, False: 0] ------------------ 1755| 738| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 738| lpos.each_left_sub(visitor_t{}, *this); 1757| 738| cpos.each_sub(visitor_t{}, *this); 1758| 738| rpos.each_right_sub(visitor_t{}, *this); 1759| 738| } _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.12M| { 1734| 5.12M| auto count = p.count(); 1735| 5.12M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 5.12M, False: 0] ------------------ 1736| 5.12M| plan.counts[plan.n++] = count; 1737| 5.12M| plan.total += count; 1738| 5.12M| } _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| 679k| { 1734| 679k| auto count = p.count(); 1735| 679k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 679k, False: 0] ------------------ 1736| 679k| plan.counts[plan.n++] = count; 1737| 679k| plan.total += count; 1738| 679k| } _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| 738| { 1803| 738| using node_t = node_type; 1804| 738| using merger_t = concat_merger; 1805| 738| using visitor_t = concat_merger_visitor; 1806| 738| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 738| IMMER_TRY { ------------------ | | 49| 738|#define IMMER_TRY try ------------------ 1808| 738| lpos.each_left_sub(visitor_t{}, merger); 1809| 738| cpos.each_sub(visitor_t{}, merger); 1810| 738| rpos.each_right_sub(visitor_t{}, merger); 1811| 738| cpos.each_sub(dec_visitor{}); 1812| 738| return merger.finish(); 1813| 738| } 1814| 738| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 738| } _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.12M| { 1722| 5.12M| merger.merge_leaf(p); 1723| 5.12M| } _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.12M| { 1615| 5.12M| auto from = p.node(); 1616| 5.12M| auto from_size = p.size(); 1617| 5.12M| auto from_count = p.count(); 1618| 5.12M| assert(from_size); ------------------ | Branch (1618:9): [True: 5.12M, False: 0] ------------------ 1619| 5.12M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 5.12M, False: 0] | Branch (1619:21): [True: 5.12M, False: 0] ------------------ 1620| 5.12M| add_child(from, from_size); 1621| 5.12M| from->inc(); 1622| 5.12M| } 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.12M| } _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| 679k| { 1716| 679k| merger.merge_inner(p); 1717| 679k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 679k| { 1649| 679k| auto from = p.node(); 1650| 679k| auto from_size = p.size(); 1651| 679k| auto from_count = p.count(); 1652| 679k| assert(from_size); ------------------ | Branch (1652:9): [True: 679k, False: 0] ------------------ 1653| 679k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 679k, False: 0] | Branch (1653:21): [True: 679k, False: 0] ------------------ 1654| 679k| add_child(from, from_size); 1655| 679k| from->inc(); 1656| 679k| } 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| 679k| } _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| 601| { 1945| 601| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 601| } _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.09k| { 1925| 3.09k| return concat_leafs(lpos, tpos, rpos); 1926| 3.09k| } _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.09k|{ 1839| 3.09k| static_assert(Node::bits >= 2, ""); 1840| 3.09k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 3.09k, False: 0] ------------------ 1841| 3.09k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 3.09k, False: 0] ------------------ 1842| 3.09k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 3.09k, False: 0] ------------------ 1843| 3.09k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 3.09k] ------------------ 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.09k| else 1854| 3.09k| return { 1855| 3.09k| Node::bits_leaf, 1856| 3.09k| lpos.node()->inc(), 1857| 3.09k| lpos.count(), 1858| 3.09k| rpos.node()->inc(), 1859| 3.09k| rpos.count(), 1860| 3.09k| }; 1861| 3.09k|} _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| 601|{ 1824| 601| auto plan = concat_rebalance_plan{}; 1825| 601| plan.fill(lpos, cpos, rpos); 1826| 601| plan.shuffle(cpos.shift()); 1827| 601| IMMER_TRY { ------------------ | | 49| 601|#define IMMER_TRY try ------------------ 1828| 601| return plan.merge(lpos, cpos, rpos); 1829| 601| } 1830| 601| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 601|} _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| 601| { 1753| 601| assert(n == 0u); ------------------ | Branch (1753:9): [True: 601, False: 0] ------------------ 1754| 601| assert(total == 0u); ------------------ | Branch (1754:9): [True: 601, False: 0] ------------------ 1755| 601| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 601| lpos.each_left_sub(visitor_t{}, *this); 1757| 601| cpos.each_sub(visitor_t{}, *this); 1758| 601| rpos.each_right_sub(visitor_t{}, *this); 1759| 601| } _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| 601| { 1803| 601| using node_t = node_type; 1804| 601| using merger_t = concat_merger; 1805| 601| using visitor_t = concat_merger_visitor; 1806| 601| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 601| IMMER_TRY { ------------------ | | 49| 601|#define IMMER_TRY try ------------------ 1808| 601| lpos.each_left_sub(visitor_t{}, merger); 1809| 601| cpos.each_sub(visitor_t{}, merger); 1810| 601| rpos.each_right_sub(visitor_t{}, merger); 1811| 601| cpos.each_sub(dec_visitor{}); 1812| 601| return merger.finish(); 1813| 601| } 1814| 601| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 601| } _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.77k|{ 1824| 1.77k| auto plan = concat_rebalance_plan{}; 1825| 1.77k| plan.fill(lpos, cpos, rpos); 1826| 1.77k| plan.shuffle(cpos.shift()); 1827| 1.77k| IMMER_TRY { ------------------ | | 49| 1.77k|#define IMMER_TRY try ------------------ 1828| 1.77k| return plan.merge(lpos, cpos, rpos); 1829| 1.77k| } 1830| 1.77k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.77k|} _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.77k| { 1753| 1.77k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.77k, False: 0] ------------------ 1754| 1.77k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.77k, False: 0] ------------------ 1755| 1.77k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.77k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.77k| cpos.each_sub(visitor_t{}, *this); 1758| 1.77k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.77k| } _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.72M| { 1734| 3.72M| auto count = p.count(); 1735| 3.72M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 3.72M, False: 0] ------------------ 1736| 3.72M| plan.counts[plan.n++] = count; 1737| 3.72M| plan.total += count; 1738| 3.72M| } _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.77k| { 1803| 1.77k| using node_t = node_type; 1804| 1.77k| using merger_t = concat_merger; 1805| 1.77k| using visitor_t = concat_merger_visitor; 1806| 1.77k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.77k| IMMER_TRY { ------------------ | | 49| 1.77k|#define IMMER_TRY try ------------------ 1808| 1.77k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.77k| cpos.each_sub(visitor_t{}, merger); 1810| 1.77k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.77k| cpos.each_sub(dec_visitor{}); 1812| 1.77k| return merger.finish(); 1813| 1.77k| } 1814| 1.77k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.77k| } _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.72M| { 1716| 3.72M| merger.merge_inner(p); 1717| 3.72M| } _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.72M| { 1649| 3.72M| auto from = p.node(); 1650| 3.72M| auto from_size = p.size(); 1651| 3.72M| auto from_count = p.count(); 1652| 3.72M| assert(from_size); ------------------ | Branch (1652:9): [True: 3.72M, False: 0] ------------------ 1653| 3.72M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 2.06M, False: 1.65M] | Branch (1653:21): [True: 2.06M, False: 0] ------------------ 1654| 2.06M| add_child(from, from_size); 1655| 2.06M| from->inc(); 1656| 2.06M| } else { 1657| 1.65M| auto from_offset = count_t{}; 1658| 1.65M| auto from_data = from->inner(); 1659| 3.31M| do { 1660| 3.31M| if (!to_) { ------------------ | Branch (1660:21): [True: 1.65M, False: 1.65M] ------------------ 1661| 1.65M| to_ = node_t::make_inner_r_n(*curr_); 1662| 1.65M| to_offset_ = 0; 1663| 1.65M| to_size_ = 0; 1664| 1.65M| } 1665| 3.31M| auto data = to_->inner(); 1666| 3.31M| auto to_copy = 1667| 3.31M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 3.31M| std::copy(from_data + from_offset, 1669| 3.31M| from_data + from_offset + to_copy, 1670| 3.31M| data + to_offset_); 1671| 3.31M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 3.31M| auto sizes = to_->relaxed()->d.sizes; 1673| 3.31M| p.copy_sizes( 1674| 3.31M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 3.31M| to_offset_ += to_copy; 1676| 3.31M| from_offset += to_copy; 1677| 3.31M| to_size_ = sizes[to_offset_ - 1]; 1678| 3.31M| assert(to_size_); ------------------ | Branch (1678:17): [True: 3.31M, False: 0] ------------------ 1679| 3.31M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 1.65M, False: 1.65M] ------------------ 1680| 1.65M| to_->relaxed()->d.count = to_offset_; 1681| 1.65M| add_child(to_, to_size_); 1682| 1.65M| to_ = nullptr; 1683| 1.65M| } 1684| 3.31M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.65M, False: 1.65M] ------------------ 1685| 1.65M| } 1686| 3.72M| } _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.54k| { 1925| 8.54k| return concat_leafs(lpos, tpos, rpos); 1926| 8.54k| } _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.54k|{ 1839| 8.54k| static_assert(Node::bits >= 2, ""); 1840| 8.54k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 8.54k, False: 0] ------------------ 1841| 8.54k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 8.54k, False: 0] ------------------ 1842| 8.54k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 8.54k, False: 0] ------------------ 1843| 8.54k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 8.54k] ------------------ 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.54k| else 1854| 8.54k| return { 1855| 8.54k| Node::bits_leaf, 1856| 8.54k| lpos.node()->inc(), 1857| 8.54k| lpos.count(), 1858| 8.54k| rpos.node()->inc(), 1859| 8.54k| rpos.count(), 1860| 8.54k| }; 1861| 8.54k|} _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| 160k|{ 1824| 160k| auto plan = concat_rebalance_plan{}; 1825| 160k| plan.fill(lpos, cpos, rpos); 1826| 160k| plan.shuffle(cpos.shift()); 1827| 160k| IMMER_TRY { ------------------ | | 49| 160k|#define IMMER_TRY try ------------------ 1828| 160k| return plan.merge(lpos, cpos, rpos); 1829| 160k| } 1830| 160k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 160k|} _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| 160k| { 1753| 160k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 160k, False: 0] ------------------ 1754| 160k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 160k, False: 0] ------------------ 1755| 160k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 160k| lpos.each_left_sub(visitor_t{}, *this); 1757| 160k| cpos.each_sub(visitor_t{}, *this); 1758| 160k| rpos.each_right_sub(visitor_t{}, *this); 1759| 160k| } _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| 160k| { 1803| 160k| using node_t = node_type; 1804| 160k| using merger_t = concat_merger; 1805| 160k| using visitor_t = concat_merger_visitor; 1806| 160k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 160k| IMMER_TRY { ------------------ | | 49| 160k|#define IMMER_TRY try ------------------ 1808| 160k| lpos.each_left_sub(visitor_t{}, merger); 1809| 160k| cpos.each_sub(visitor_t{}, merger); 1810| 160k| rpos.each_right_sub(visitor_t{}, merger); 1811| 160k| cpos.each_sub(dec_visitor{}); 1812| 160k| return merger.finish(); 1813| 160k| } 1814| 160k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 160k| } _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.54k| { 1945| 8.54k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 8.54k| } _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.54k|{ 1824| 8.54k| auto plan = concat_rebalance_plan{}; 1825| 8.54k| plan.fill(lpos, cpos, rpos); 1826| 8.54k| plan.shuffle(cpos.shift()); 1827| 8.54k| IMMER_TRY { ------------------ | | 49| 8.54k|#define IMMER_TRY try ------------------ 1828| 8.54k| return plan.merge(lpos, cpos, rpos); 1829| 8.54k| } 1830| 8.54k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 8.54k|} _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.54k| { 1753| 8.54k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 8.54k, False: 0] ------------------ 1754| 8.54k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 8.54k, False: 0] ------------------ 1755| 8.54k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 8.54k| lpos.each_left_sub(visitor_t{}, *this); 1757| 8.54k| cpos.each_sub(visitor_t{}, *this); 1758| 8.54k| rpos.each_right_sub(visitor_t{}, *this); 1759| 8.54k| } _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.54k| { 1803| 8.54k| using node_t = node_type; 1804| 8.54k| using merger_t = concat_merger; 1805| 8.54k| using visitor_t = concat_merger_visitor; 1806| 8.54k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 8.54k| IMMER_TRY { ------------------ | | 49| 8.54k|#define IMMER_TRY try ------------------ 1808| 8.54k| lpos.each_left_sub(visitor_t{}, merger); 1809| 8.54k| cpos.each_sub(visitor_t{}, merger); 1810| 8.54k| rpos.each_right_sub(visitor_t{}, merger); 1811| 8.54k| cpos.each_sub(dec_visitor{}); 1812| 8.54k| return merger.finish(); 1813| 8.54k| } 1814| 8.54k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 8.54k| } _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.78k| { 1959| 2.78k| return concat_inners(lpos, tpos, rpos); 1960| 2.78k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7realizeEv: 1527| 1.44M| { 1528| 1.44M| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 81.3k, False: 1.36M] ------------------ 1529| 81.3k| IMMER_TRY { ------------------ | | 49| 81.3k|#define IMMER_TRY try ------------------ 1530| 81.3k| auto result = node_t::make_inner_r_n(count_); 1531| 81.3k| auto r = result->relaxed(); 1532| 81.3k| r->d.count = count_; 1533| 81.3k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 81.3k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 81.3k| return {result, shift_, r}; 1536| 81.3k| } 1537| 81.3k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 1.36M| } else { 1542| 1.36M| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 1.36M, False: 0] ------------------ 1543| 1.36M| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 1.36M| } 1545| 1.44M| } _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.43M|{ 1987| 1.43M| return visit_maybe_relaxed_sub(lroot, 1988| 1.43M| lshift, 1989| 1.43M| lsize, 1990| 1.43M| concat_trees_left_visitor{}, 1991| 1.43M| make_leaf_pos(ltail, ltcount), 1992| 1.43M| rroot, 1993| 1.43M| rshift, 1994| 1.43M| rsize) 1995| 1.43M| .realize(); 1996| 1.43M|} _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.40M| { 1972| 1.40M| return visit_maybe_relaxed_sub( 1973| 1.40M| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 1.40M| } _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.39M| { 1959| 1.39M| return concat_inners(lpos, tpos, rpos); 1960| 1.39M| } _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| 16.4M|{ 1873| 16.4M| auto lshift = lpos.shift(); 1874| 16.4M| auto rshift = rpos.shift(); 1875| 16.4M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 3.97M, False: 12.4M] ------------------ 1876| 3.97M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 3.97M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 12.4M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 99.3k, False: 12.3M] ------------------ 1879| 99.3k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 99.3k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 12.3M| } else { 1882| 12.3M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 12.3M, False: 0] ------------------ 1883| 12.3M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 12.3M] | Branch (1883:9): [True: 12.3M, False: 0] | Branch (1883:9): [True: 12.3M, False: 0] ------------------ 1884| 12.3M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 12.3M| return concat_rebalance(lpos, cpos, rpos); 1886| 12.3M| } 1887| 16.4M|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 3.97M| { 1898| 3.97M| return concat_inners(lpos, tpos, rpos); 1899| 3.97M| } _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 4.98k| { 1898| 4.98k| return concat_inners(lpos, tpos, rpos); 1899| 4.98k| } _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.11M|{ 1873| 1.11M| auto lshift = lpos.shift(); 1874| 1.11M| auto rshift = rpos.shift(); 1875| 1.11M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.84k, False: 1.11M] ------------------ 1876| 2.84k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.84k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.11M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 7.00k, False: 1.10M] ------------------ 1879| 7.00k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 7.00k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.10M| } else { 1882| 1.10M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.10M, False: 0] ------------------ 1883| 1.10M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.10M] | Branch (1883:9): [True: 1.10M, False: 0] | Branch (1883:9): [True: 1.10M, False: 0] ------------------ 1884| 1.10M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.10M| return concat_rebalance(lpos, cpos, rpos); 1886| 1.10M| } 1887| 1.11M|} _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.65k|{ 1824| 4.65k| auto plan = concat_rebalance_plan{}; 1825| 4.65k| plan.fill(lpos, cpos, rpos); 1826| 4.65k| plan.shuffle(cpos.shift()); 1827| 4.65k| IMMER_TRY { ------------------ | | 49| 4.65k|#define IMMER_TRY try ------------------ 1828| 4.65k| return plan.merge(lpos, cpos, rpos); 1829| 4.65k| } 1830| 4.65k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.65k|} _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.65k| { 1753| 4.65k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.65k, False: 0] ------------------ 1754| 4.65k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.65k, False: 0] ------------------ 1755| 4.65k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.65k| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.65k| cpos.each_sub(visitor_t{}, *this); 1758| 4.65k| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.65k| } _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.65k| { 1803| 4.65k| using node_t = node_type; 1804| 4.65k| using merger_t = concat_merger; 1805| 4.65k| using visitor_t = concat_merger_visitor; 1806| 4.65k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.65k| IMMER_TRY { ------------------ | | 49| 4.65k|#define IMMER_TRY try ------------------ 1808| 4.65k| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.65k| cpos.each_sub(visitor_t{}, merger); 1810| 4.65k| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.65k| cpos.each_sub(dec_visitor{}); 1812| 4.65k| return merger.finish(); 1813| 4.65k| } 1814| 4.65k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.65k| } _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.10M| { 1918| 1.10M| return concat_inners(lpos, tpos, rpos); 1919| 1.10M| } _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| 348k| { 1918| 348k| return concat_inners(lpos, tpos, rpos); 1919| 348k| } _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| 368k|{ 1873| 368k| auto lshift = lpos.shift(); 1874| 368k| auto rshift = rpos.shift(); 1875| 368k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 1.81k, False: 366k] ------------------ 1876| 1.81k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 1.81k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 366k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 709, False: 365k] ------------------ 1879| 709| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 709| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 365k| } else { 1882| 365k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 365k, False: 0] ------------------ 1883| 365k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 365k] | Branch (1883:9): [True: 365k, False: 0] | Branch (1883:9): [True: 365k, False: 0] ------------------ 1884| 365k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 365k| return concat_rebalance(lpos, cpos, rpos); 1886| 365k| } 1887| 368k|} _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.59k| { 1898| 2.59k| return concat_inners(lpos, tpos, rpos); 1899| 2.59k| } _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| 36.1k| { 1918| 36.1k| return concat_inners(lpos, tpos, rpos); 1919| 36.1k| } _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| 36.1k|{ 1873| 36.1k| auto lshift = lpos.shift(); 1874| 36.1k| auto rshift = rpos.shift(); 1875| 36.1k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 36.1k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 36.1k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 238, False: 35.9k] ------------------ 1879| 238| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 238| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 35.9k| } else { 1882| 35.9k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 35.9k, False: 0] ------------------ 1883| 35.9k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 35.9k] | Branch (1883:9): [True: 35.9k, False: 0] | Branch (1883:9): [True: 35.9k, False: 0] ------------------ 1884| 35.9k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 35.9k| return concat_rebalance(lpos, cpos, rpos); 1886| 35.9k| } 1887| 36.1k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 20.8k| { 1945| 20.8k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 20.8k| } _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| 384k| { 1925| 384k| return concat_leafs(lpos, tpos, rpos); 1926| 384k| } _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| 384k|{ 1839| 384k| static_assert(Node::bits >= 2, ""); 1840| 384k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 384k, False: 0] ------------------ 1841| 384k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 384k, False: 0] ------------------ 1842| 384k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 384k, False: 0] ------------------ 1843| 384k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 384k, False: 0] ------------------ 1844| 384k| return { 1845| 384k| Node::bits_leaf, 1846| 384k| lpos.node()->inc(), 1847| 384k| lpos.count(), 1848| 384k| tpos.node()->inc(), 1849| 384k| tpos.count(), 1850| 384k| rpos.node()->inc(), 1851| 384k| rpos.count(), 1852| 384k| }; 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| 384k|} _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| 18.4k| { 1938| 18.4k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 18.4k| } _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| 35.9k|{ 1824| 35.9k| auto plan = concat_rebalance_plan{}; 1825| 35.9k| plan.fill(lpos, cpos, rpos); 1826| 35.9k| plan.shuffle(cpos.shift()); 1827| 35.9k| IMMER_TRY { ------------------ | | 49| 35.9k|#define IMMER_TRY try ------------------ 1828| 35.9k| return plan.merge(lpos, cpos, rpos); 1829| 35.9k| } 1830| 35.9k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 35.9k|} _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| 35.9k| { 1753| 35.9k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 35.9k, False: 0] ------------------ 1754| 35.9k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 35.9k, False: 0] ------------------ 1755| 35.9k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 35.9k| lpos.each_left_sub(visitor_t{}, *this); 1757| 35.9k| cpos.each_sub(visitor_t{}, *this); 1758| 35.9k| rpos.each_right_sub(visitor_t{}, *this); 1759| 35.9k| } _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| 35.9k| { 1803| 35.9k| using node_t = node_type; 1804| 35.9k| using merger_t = concat_merger; 1805| 35.9k| using visitor_t = concat_merger_visitor; 1806| 35.9k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 35.9k| IMMER_TRY { ------------------ | | 49| 35.9k|#define IMMER_TRY try ------------------ 1808| 35.9k| lpos.each_left_sub(visitor_t{}, merger); 1809| 35.9k| cpos.each_sub(visitor_t{}, merger); 1810| 35.9k| rpos.each_right_sub(visitor_t{}, merger); 1811| 35.9k| cpos.each_sub(dec_visitor{}); 1812| 35.9k| return merger.finish(); 1813| 35.9k| } 1814| 35.9k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 35.9k| } _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| 363k| { 1945| 363k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 363k| } _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.04M| { 1925| 1.04M| return concat_leafs(lpos, tpos, rpos); 1926| 1.04M| } _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.04M|{ 1839| 1.04M| static_assert(Node::bits >= 2, ""); 1840| 1.04M| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 1.04M, False: 0] ------------------ 1841| 1.04M| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 1.04M, False: 0] ------------------ 1842| 1.04M| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 1.04M, False: 0] ------------------ 1843| 1.04M| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 1.04M, False: 0] ------------------ 1844| 1.04M| return { 1845| 1.04M| Node::bits_leaf, 1846| 1.04M| lpos.node()->inc(), 1847| 1.04M| lpos.count(), 1848| 1.04M| tpos.node()->inc(), 1849| 1.04M| tpos.count(), 1850| 1.04M| rpos.node()->inc(), 1851| 1.04M| rpos.count(), 1852| 1.04M| }; 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.04M|} _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| 16.7k| { 1938| 16.7k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 16.7k| } _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| 365k|{ 1824| 365k| auto plan = concat_rebalance_plan{}; 1825| 365k| plan.fill(lpos, cpos, rpos); 1826| 365k| plan.shuffle(cpos.shift()); 1827| 365k| IMMER_TRY { ------------------ | | 49| 365k|#define IMMER_TRY try ------------------ 1828| 365k| return plan.merge(lpos, cpos, rpos); 1829| 365k| } 1830| 365k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 365k|} _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| 365k| { 1753| 365k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 365k, False: 0] ------------------ 1754| 365k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 365k, False: 0] ------------------ 1755| 365k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 365k| lpos.each_left_sub(visitor_t{}, *this); 1757| 365k| cpos.each_sub(visitor_t{}, *this); 1758| 365k| rpos.each_right_sub(visitor_t{}, *this); 1759| 365k| } _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| 365k| { 1803| 365k| using node_t = node_type; 1804| 365k| using merger_t = concat_merger; 1805| 365k| using visitor_t = concat_merger_visitor; 1806| 365k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 365k| IMMER_TRY { ------------------ | | 49| 365k|#define IMMER_TRY try ------------------ 1808| 365k| lpos.each_left_sub(visitor_t{}, merger); 1809| 365k| cpos.each_sub(visitor_t{}, merger); 1810| 365k| rpos.each_right_sub(visitor_t{}, merger); 1811| 365k| cpos.each_sub(dec_visitor{}); 1812| 365k| return merger.finish(); 1813| 365k| } 1814| 365k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 365k| } _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.04M| { 1945| 1.04M| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 1.04M| } _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.44M| { 1938| 1.44M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.44M| } _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.10M|{ 1824| 1.10M| auto plan = concat_rebalance_plan{}; 1825| 1.10M| plan.fill(lpos, cpos, rpos); 1826| 1.10M| plan.shuffle(cpos.shift()); 1827| 1.10M| IMMER_TRY { ------------------ | | 49| 1.10M|#define IMMER_TRY try ------------------ 1828| 1.10M| return plan.merge(lpos, cpos, rpos); 1829| 1.10M| } 1830| 1.10M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.10M|} _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.10M| { 1753| 1.10M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.10M, False: 0] ------------------ 1754| 1.10M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.10M, False: 0] ------------------ 1755| 1.10M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.10M| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.10M| cpos.each_sub(visitor_t{}, *this); 1758| 1.10M| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.10M| } _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.10M| { 1803| 1.10M| using node_t = node_type; 1804| 1.10M| using merger_t = concat_merger; 1805| 1.10M| using visitor_t = concat_merger_visitor; 1806| 1.10M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.10M| IMMER_TRY { ------------------ | | 49| 1.10M|#define IMMER_TRY try ------------------ 1808| 1.10M| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.10M| cpos.each_sub(visitor_t{}, merger); 1810| 1.10M| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.10M| cpos.each_sub(dec_visitor{}); 1812| 1.10M| return merger.finish(); 1813| 1.10M| } 1814| 1.10M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.10M| } _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.01M|{ 1824| 4.01M| auto plan = concat_rebalance_plan{}; 1825| 4.01M| plan.fill(lpos, cpos, rpos); 1826| 4.01M| plan.shuffle(cpos.shift()); 1827| 4.01M| IMMER_TRY { ------------------ | | 49| 4.01M|#define IMMER_TRY try ------------------ 1828| 4.01M| return plan.merge(lpos, cpos, rpos); 1829| 4.01M| } 1830| 4.01M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.01M|} _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.01M| { 1753| 4.01M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.01M, False: 0] ------------------ 1754| 4.01M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.01M, False: 0] ------------------ 1755| 4.01M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.01M| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.01M| cpos.each_sub(visitor_t{}, *this); 1758| 4.01M| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.01M| } _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.01M| { 1803| 4.01M| using node_t = node_type; 1804| 4.01M| using merger_t = concat_merger; 1805| 4.01M| using visitor_t = concat_merger_visitor; 1806| 4.01M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.01M| IMMER_TRY { ------------------ | | 49| 4.01M|#define IMMER_TRY try ------------------ 1808| 4.01M| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.01M| cpos.each_sub(visitor_t{}, merger); 1810| 4.01M| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.01M| cpos.each_sub(dec_visitor{}); 1812| 4.01M| return merger.finish(); 1813| 4.01M| } 1814| 4.01M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.01M| } _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.0M| { 1918| 11.0M| return concat_inners(lpos, tpos, rpos); 1919| 11.0M| } _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| 3.17k| { 1918| 3.17k| return concat_inners(lpos, tpos, rpos); 1919| 3.17k| } _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| 51.8k|{ 1873| 51.8k| auto lshift = lpos.shift(); 1874| 51.8k| auto rshift = rpos.shift(); 1875| 51.8k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 34.4k, False: 17.3k] ------------------ 1876| 34.4k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 34.4k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 34.4k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 462, False: 16.9k] ------------------ 1879| 462| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 462| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 16.9k| } else { 1882| 16.9k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 16.9k, False: 0] ------------------ 1883| 16.9k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 16.9k] | Branch (1883:9): [True: 16.9k, False: 0] | Branch (1883:9): [True: 16.9k, False: 0] ------------------ 1884| 16.9k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 16.9k| return concat_rebalance(lpos, cpos, rpos); 1886| 16.9k| } 1887| 51.8k|} _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| 33.6k| { 1898| 33.6k| return concat_inners(lpos, tpos, rpos); 1899| 33.6k| } _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.79k| { 1918| 3.79k| return concat_inners(lpos, tpos, rpos); 1919| 3.79k| } _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.79k|{ 1873| 3.79k| auto lshift = lpos.shift(); 1874| 3.79k| auto rshift = rpos.shift(); 1875| 3.79k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 3.79k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 3.79k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 198, False: 3.59k] ------------------ 1879| 198| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 198| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 3.59k| } else { 1882| 3.59k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 3.59k, False: 0] ------------------ 1883| 3.59k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 3.59k] | Branch (1883:9): [True: 3.59k, False: 0] | Branch (1883:9): [True: 3.59k, False: 0] ------------------ 1884| 3.59k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 3.59k| return concat_rebalance(lpos, cpos, rpos); 1886| 3.59k| } 1887| 3.79k|} _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| 223| { 1938| 223| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 223| } _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.59k|{ 1824| 3.59k| auto plan = concat_rebalance_plan{}; 1825| 3.59k| plan.fill(lpos, cpos, rpos); 1826| 3.59k| plan.shuffle(cpos.shift()); 1827| 3.59k| IMMER_TRY { ------------------ | | 49| 3.59k|#define IMMER_TRY try ------------------ 1828| 3.59k| return plan.merge(lpos, cpos, rpos); 1829| 3.59k| } 1830| 3.59k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.59k|} _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.59k| { 1753| 3.59k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.59k, False: 0] ------------------ 1754| 3.59k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.59k, False: 0] ------------------ 1755| 3.59k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.59k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.59k| cpos.each_sub(visitor_t{}, *this); 1758| 3.59k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.59k| } _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.59k| { 1803| 3.59k| using node_t = node_type; 1804| 3.59k| using merger_t = concat_merger; 1805| 3.59k| using visitor_t = concat_merger_visitor; 1806| 3.59k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.59k| IMMER_TRY { ------------------ | | 49| 3.59k|#define IMMER_TRY try ------------------ 1808| 3.59k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.59k| cpos.each_sub(visitor_t{}, merger); 1810| 3.59k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.59k| cpos.each_sub(dec_visitor{}); 1812| 3.59k| return merger.finish(); 1813| 3.59k| } 1814| 3.59k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.59k| } _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.91k| { 1938| 2.91k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 2.91k| } _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| 16.9k|{ 1824| 16.9k| auto plan = concat_rebalance_plan{}; 1825| 16.9k| plan.fill(lpos, cpos, rpos); 1826| 16.9k| plan.shuffle(cpos.shift()); 1827| 16.9k| IMMER_TRY { ------------------ | | 49| 16.9k|#define IMMER_TRY try ------------------ 1828| 16.9k| return plan.merge(lpos, cpos, rpos); 1829| 16.9k| } 1830| 16.9k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 16.9k|} _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| 16.9k| { 1753| 16.9k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 16.9k, False: 0] ------------------ 1754| 16.9k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 16.9k, False: 0] ------------------ 1755| 16.9k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 16.9k| lpos.each_left_sub(visitor_t{}, *this); 1757| 16.9k| cpos.each_sub(visitor_t{}, *this); 1758| 16.9k| rpos.each_right_sub(visitor_t{}, *this); 1759| 16.9k| } _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| 16.9k| { 1803| 16.9k| using node_t = node_type; 1804| 16.9k| using merger_t = concat_merger; 1805| 16.9k| using visitor_t = concat_merger_visitor; 1806| 16.9k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 16.9k| IMMER_TRY { ------------------ | | 49| 16.9k|#define IMMER_TRY try ------------------ 1808| 16.9k| lpos.each_left_sub(visitor_t{}, merger); 1809| 16.9k| cpos.each_sub(visitor_t{}, merger); 1810| 16.9k| rpos.each_right_sub(visitor_t{}, merger); 1811| 16.9k| cpos.each_sub(dec_visitor{}); 1812| 16.9k| return merger.finish(); 1813| 16.9k| } 1814| 16.9k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 16.9k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 10.9M| { 1938| 10.9M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 10.9M| } _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| 12.3M|{ 1824| 12.3M| auto plan = concat_rebalance_plan{}; 1825| 12.3M| plan.fill(lpos, cpos, rpos); 1826| 12.3M| plan.shuffle(cpos.shift()); 1827| 12.3M| IMMER_TRY { ------------------ | | 49| 12.3M|#define IMMER_TRY try ------------------ 1828| 12.3M| return plan.merge(lpos, cpos, rpos); 1829| 12.3M| } 1830| 12.3M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 12.3M|} _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| 12.3M| { 1753| 12.3M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 12.3M, False: 0] ------------------ 1754| 12.3M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 12.3M, False: 0] ------------------ 1755| 12.3M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 12.3M| lpos.each_left_sub(visitor_t{}, *this); 1757| 12.3M| cpos.each_sub(visitor_t{}, *this); 1758| 12.3M| rpos.each_right_sub(visitor_t{}, *this); 1759| 12.3M| } _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| 12.3M| { 1803| 12.3M| using node_t = node_type; 1804| 12.3M| using merger_t = concat_merger; 1805| 12.3M| using visitor_t = concat_merger_visitor; 1806| 12.3M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 12.3M| IMMER_TRY { ------------------ | | 49| 12.3M|#define IMMER_TRY try ------------------ 1808| 12.3M| lpos.each_left_sub(visitor_t{}, merger); 1809| 12.3M| cpos.each_sub(visitor_t{}, merger); 1810| 12.3M| rpos.each_right_sub(visitor_t{}, merger); 1811| 12.3M| cpos.each_sub(dec_visitor{}); 1812| 12.3M| return merger.finish(); 1813| 12.3M| } 1814| 12.3M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 12.3M| } _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| 15.0k| { 1959| 15.0k| return concat_inners(lpos, tpos, rpos); 1960| 15.0k| } _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 24.3k| { 1972| 24.3k| return visit_maybe_relaxed_sub( 1973| 24.3k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 24.3k| } _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.67k| { 1959| 6.67k| return concat_inners(lpos, tpos, rpos); 1960| 6.67k| } _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.6k| { 1959| 17.6k| return concat_inners(lpos, tpos, rpos); 1960| 17.6k| } _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| 207k| { 681| 207k| auto node = pos.node(); 682| 207k| auto level = pos.shift(); 683| 207k| auto idx = pos.count() - 1; 684| 207k| auto children = pos.size(idx); 685| 207k| auto new_idx = 686| 207k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 3.78k, False: 203k] | Branch (686:47): [True: 270, False: 203k] ------------------ 687| 207k| auto new_child = static_cast(nullptr); 688| 207k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 207k, Folded] | Branch (688:38): [True: 204k, False: 2.49k] ------------------ 689| | 690| 207k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 1.71k, False: 205k] ------------------ 691| 1.71k| return nullptr; 692| 205k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 203k, False: 2.33k] ------------------ 693| 203k| new_child = 694| 203k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 201k, False: 1.81k] ------------------ 695| 203k| : pos.last_oh_csh( 696| 1.81k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 203k| if (!new_child) { ------------------ | Branch (697:17): [True: 2.10k, False: 201k] ------------------ 698| 2.10k| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 618, False: 1.48k] ------------------ 699| 618| new_child = node_t::make_path_e(e, level - B, tail); 700| 1.48k| else 701| 1.48k| return nullptr; 702| 2.10k| } 703| 203k| } else 704| 2.33k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 204k| if (mutate) { ------------------ | Branch (706:13): [True: 202k, False: 1.89k] ------------------ 707| 202k| auto count = new_idx + 1; 708| 202k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 202k| node->inner()[new_idx] = new_child; 710| 202k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 202k| relaxed->d.count = count; 712| 202k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 202k, False: 0] ------------------ 713| 202k| return node; 714| 202k| } else { 715| 1.89k| IMMER_TRY { ------------------ | | 49| 1.89k|#define IMMER_TRY try ------------------ 716| 1.89k| auto count = new_idx + 1; 717| 1.89k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 1.89k| auto relaxed = new_node->relaxed(); 719| 1.89k| new_node->inner()[new_idx] = new_child; 720| 1.89k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 1.89k| relaxed->d.count = count; 722| 1.89k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 1.89k, False: 0] ------------------ 723| 1.89k| if (Mutating) ------------------ | Branch (723:21): [True: 1.89k, Folded] ------------------ 724| 1.89k| pos.visit(dec_visitor{}); 725| 1.89k| return new_node; 726| 1.89k| } 727| 1.89k| 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.89k| } 737| 204k| } _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| 163k| { 742| 163k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 163k, False: 0] ------------------ 743| 163k| auto node = pos.node(); 744| 163k| auto idx = pos.index(pos.size() - 1); 745| 163k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 163k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 163k, Folded] | Branch (746:36): [True: 163k, False: 596] ------------------ 747| 163k| if (mutate) { ------------------ | Branch (747:13): [True: 163k, False: 596] ------------------ 748| 163k| node->inner()[new_idx] = 749| 163k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 160k, False: 2.49k] ------------------ 750| | /* otherwise */ 751| 163k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 163k| return node; 753| 163k| } else { 754| 596| auto new_parent = node_t::make_inner_e(e); 755| 596| IMMER_TRY { ------------------ | | 49| 596|#define IMMER_TRY try ------------------ 756| 596| new_parent->inner()[new_idx] = 757| 596| idx == new_idx ------------------ | Branch (757:21): [True: 292, False: 304] ------------------ 758| 596| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 596| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 596| node_t::do_copy_inner(new_parent, node, new_idx); 762| 596| if (Mutating) ------------------ | Branch (762:21): [True: 596, Folded] ------------------ 763| 596| pos.visit(dec_visitor{}); 764| 596| return new_parent; 765| 596| } 766| 596| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 596| } 771| 163k| } _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.52M| { 742| 1.52M| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.52M, False: 0] ------------------ 743| 1.52M| auto node = pos.node(); 744| 1.52M| auto idx = pos.index(pos.size() - 1); 745| 1.52M| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.52M| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 1.52M, Folded] | Branch (746:36): [True: 1.51M, False: 2.04k] ------------------ 747| 1.52M| if (mutate) { ------------------ | Branch (747:13): [True: 1.51M, False: 2.04k] ------------------ 748| 1.51M| node->inner()[new_idx] = 749| 1.51M| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 1.21M, False: 304k] ------------------ 750| | /* otherwise */ 751| 1.51M| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 1.51M| return node; 753| 1.51M| } else { 754| 2.04k| auto new_parent = node_t::make_inner_e(e); 755| 2.04k| IMMER_TRY { ------------------ | | 49| 2.04k|#define IMMER_TRY try ------------------ 756| 2.04k| new_parent->inner()[new_idx] = 757| 2.04k| idx == new_idx ------------------ | Branch (757:21): [True: 1.22k, False: 826] ------------------ 758| 2.04k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 2.04k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 2.04k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 2.04k| if (Mutating) ------------------ | Branch (762:21): [True: 2.04k, Folded] ------------------ 763| 2.04k| pos.visit(dec_visitor{}); 764| 2.04k| return new_parent; 765| 2.04k| } 766| 2.04k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 2.04k| } 771| 1.52M| } _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.34k| { 742| 3.34k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 3.34k, False: 0] ------------------ 743| 3.34k| auto node = pos.node(); 744| 3.34k| auto idx = pos.index(pos.size() - 1); 745| 3.34k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 3.34k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 3.34k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 3.34k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 3.34k] ------------------ 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.34k| } else { 754| 3.34k| auto new_parent = node_t::make_inner_e(e); 755| 3.34k| IMMER_TRY { ------------------ | | 49| 3.34k|#define IMMER_TRY try ------------------ 756| 3.34k| new_parent->inner()[new_idx] = 757| 3.34k| idx == new_idx ------------------ | Branch (757:21): [True: 1.01k, False: 2.33k] ------------------ 758| 3.34k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 3.34k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 3.34k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 3.34k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 3.34k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 3.34k| return new_parent; 765| 3.34k| } 766| 3.34k| 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.34k| } 771| 3.34k| } _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.65k| { 681| 4.65k| auto node = pos.node(); 682| 4.65k| auto level = pos.shift(); 683| 4.65k| auto idx = pos.count() - 1; 684| 4.65k| auto children = pos.size(idx); 685| 4.65k| auto new_idx = 686| 4.65k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 940, False: 3.71k] | Branch (686:47): [True: 195, False: 3.51k] ------------------ 687| 4.65k| auto new_child = static_cast(nullptr); 688| 4.65k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 4.65k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 4.65k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 348, False: 4.30k] ------------------ 691| 348| return nullptr; 692| 4.30k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 3.51k, False: 787] ------------------ 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: 660, False: 2.85k] ------------------ 698| 660| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 209, False: 451] ------------------ 699| 209| new_child = node_t::make_path_e(e, level - B, tail); 700| 451| else 701| 451| return nullptr; 702| 660| } 703| 3.51k| } else 704| 787| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 3.85k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 3.85k] ------------------ 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.85k| } else { 715| 3.85k| IMMER_TRY { ------------------ | | 49| 3.85k|#define IMMER_TRY try ------------------ 716| 3.85k| auto count = new_idx + 1; 717| 3.85k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 3.85k| auto relaxed = new_node->relaxed(); 719| 3.85k| new_node->inner()[new_idx] = new_child; 720| 3.85k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 3.85k| relaxed->d.count = count; 722| 3.85k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 3.85k, False: 0] ------------------ 723| 3.85k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 3.85k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 3.85k| return new_node; 726| 3.85k| } 727| 3.85k| 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.85k| } 737| 3.85k| } _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| 679| { 742| 679| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 679, False: 0] ------------------ 743| 679| auto node = pos.node(); 744| 679| auto idx = pos.index(pos.size() - 1); 745| 679| auto new_idx = pos.index(pos.size() + branches - 1); 746| 679| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 679] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 679| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 679] ------------------ 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| 679| } else { 754| 679| auto new_parent = node_t::make_inner_e(e); 755| 679| IMMER_TRY { ------------------ | | 49| 679|#define IMMER_TRY try ------------------ 756| 679| new_parent->inner()[new_idx] = 757| 679| idx == new_idx ------------------ | Branch (757:21): [True: 410, False: 269] ------------------ 758| 679| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 679| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 679| node_t::do_copy_inner(new_parent, node, new_idx); 762| 679| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 679] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 679| return new_parent; 765| 679| } 766| 679| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 679| } 771| 679| } _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| 153k| { 742| 153k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 153k, False: 0] ------------------ 743| 153k| auto node = pos.node(); 744| 153k| auto idx = pos.index(pos.size() - 1); 745| 153k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 153k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 153k, Folded] | Branch (746:36): [True: 152k, False: 694] ------------------ 747| 153k| if (mutate) { ------------------ | Branch (747:13): [True: 152k, False: 694] ------------------ 748| 152k| node->inner()[new_idx] = 749| 152k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 145k, False: 7.48k] ------------------ 750| | /* otherwise */ 751| 152k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 152k| return node; 753| 152k| } else { 754| 694| auto new_parent = node_t::make_inner_e(e); 755| 694| IMMER_TRY { ------------------ | | 49| 694|#define IMMER_TRY try ------------------ 756| 694| new_parent->inner()[new_idx] = 757| 694| idx == new_idx ------------------ | Branch (757:21): [True: 405, False: 289] ------------------ 758| 694| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 694| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 694| node_t::do_copy_inner(new_parent, node, new_idx); 762| 694| if (Mutating) ------------------ | Branch (762:21): [True: 694, Folded] ------------------ 763| 694| pos.visit(dec_visitor{}); 764| 694| return new_parent; 765| 694| } 766| 694| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 694| } 771| 153k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEvPT_: 580| 1.95k|{ 581| 1.95k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 1.95k|} _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| 62.9k| { 596| 62.9k| auto offset = pos.index(idx); 597| 62.9k| auto count = pos.count(); 598| 62.9k| auto node = pos.node(); 599| 62.9k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 43.1k, False: 19.8k] ------------------ 600| 43.1k| return pos.towards_oh( 601| 43.1k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 43.1k| } else { 603| 19.8k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 19.8k| IMMER_TRY { ------------------ | | 49| 19.8k|#define IMMER_TRY try ------------------ 605| 19.8k| auto& res = pos.towards_oh( 606| 19.8k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 19.8k| pos.visit(dec_visitor{}); 608| 19.8k| *location = new_node; 609| 19.8k| return res; 610| 19.8k| } 611| 19.8k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 19.8k| } 616| 62.9k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 10.2k| { 653| 10.2k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 10.2k, False: 0] ------------------ 654| 10.2k| auto node = pos.node(); 655| 10.2k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 833, False: 9.40k] ------------------ 656| 833| return node->leaf()[pos.index(idx)]; 657| 9.40k| } else { 658| 9.40k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 9.40k| pos.visit(dec_visitor{}); 660| 9.40k| *location = new_node; 661| 9.40k| return new_node->leaf()[pos.index(idx)]; 662| 9.40k| } 663| 10.2k| } _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.64k| { 622| 4.64k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 4.64k, False: 0] ------------------ 623| 4.64k| auto offset = pos.index(idx); 624| 4.64k| auto count = pos.count(); 625| 4.64k| auto node = pos.node(); 626| 4.64k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 2.35k, False: 2.29k] ------------------ 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.29k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 2.29k| IMMER_TRY { ------------------ | | 49| 2.29k|#define IMMER_TRY try ------------------ 632| 2.29k| auto& res = pos.towards_oh_ch(this_t{}, 633| 2.29k| idx, 634| 2.29k| offset, 635| 2.29k| count, 636| 2.29k| e, 637| 2.29k| &new_node->inner()[offset]); 638| 2.29k| pos.visit(dec_visitor{}); 639| 2.29k| *location = new_node; 640| 2.29k| return res; 641| 2.29k| } 642| 2.29k| 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.29k| } 647| 4.64k| } _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.60k| { 653| 3.60k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 3.60k, False: 0] ------------------ 654| 3.60k| auto node = pos.node(); 655| 3.60k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.29k, False: 2.31k] ------------------ 656| 1.29k| return node->leaf()[pos.index(idx)]; 657| 2.31k| } else { 658| 2.31k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 2.31k| pos.visit(dec_visitor{}); 660| 2.31k| *location = new_node; 661| 2.31k| return new_node->leaf()[pos.index(idx)]; 662| 2.31k| } 663| 3.60k| } _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.94k| { 622| 2.94k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.94k, False: 0] ------------------ 623| 2.94k| auto offset = pos.index(idx); 624| 2.94k| auto count = pos.count(); 625| 2.94k| auto node = pos.node(); 626| 2.94k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 963, False: 1.98k] ------------------ 627| 963| return pos.towards_oh_ch( 628| 963| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.98k| } else { 630| 1.98k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.98k| IMMER_TRY { ------------------ | | 49| 1.98k|#define IMMER_TRY try ------------------ 632| 1.98k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.98k| idx, 634| 1.98k| offset, 635| 1.98k| count, 636| 1.98k| e, 637| 1.98k| &new_node->inner()[offset]); 638| 1.98k| pos.visit(dec_visitor{}); 639| 1.98k| *location = new_node; 640| 1.98k| return res; 641| 1.98k| } 642| 1.98k| 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.98k| } 647| 2.94k| } _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| 1.03k| { 653| 1.03k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 1.03k, False: 0] ------------------ 654| 1.03k| auto node = pos.node(); 655| 1.03k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 691, False: 347] ------------------ 656| 691| return node->leaf()[pos.index(idx)]; 657| 691| } else { 658| 347| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 347| pos.visit(dec_visitor{}); 660| 347| *location = new_node; 661| 347| return new_node->leaf()[pos.index(idx)]; 662| 347| } 663| 1.03k| } _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.49k| { 622| 2.49k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.49k, False: 0] ------------------ 623| 2.49k| auto offset = pos.index(idx); 624| 2.49k| auto count = pos.count(); 625| 2.49k| auto node = pos.node(); 626| 2.49k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.28k, False: 1.20k] ------------------ 627| 1.28k| return pos.towards_oh_ch( 628| 1.28k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.28k| } else { 630| 1.20k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.20k| IMMER_TRY { ------------------ | | 49| 1.20k|#define IMMER_TRY try ------------------ 632| 1.20k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.20k| idx, 634| 1.20k| offset, 635| 1.20k| count, 636| 1.20k| e, 637| 1.20k| &new_node->inner()[offset]); 638| 1.20k| pos.visit(dec_visitor{}); 639| 1.20k| *location = new_node; 640| 1.20k| return res; 641| 1.20k| } 642| 1.20k| 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.20k| } 647| 2.49k| } _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.4k| { 914| 29.4k| auto idx = pos.index(last); 915| 29.4k| auto node = pos.node(); 916| 29.4k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 29.4k, Folded] | Branch (916:35): [True: 20.7k, False: 8.62k] ------------------ 917| 29.4k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 29.4k, Folded] | Branch (917:25): [True: 15.9k, False: 13.4k] ------------------ 918| 15.9k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 11.2k, False: 4.68k] ------------------ 919| 15.9k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 15.9k| if (Mutating) ------------------ | Branch (920:17): [True: 15.9k, Folded] ------------------ 921| 15.9k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 15.9k| return res; 923| 15.9k| } else { 924| 13.4k| using std::get; 925| 13.4k| auto subs = 926| 13.4k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 9.49k, False: 3.94k] ------------------ 927| 13.4k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 13.4k| auto next = get<1>(subs); 929| 13.4k| auto ts = get<2>(subs); 930| 13.4k| auto tail = get<3>(subs); 931| 13.4k| IMMER_TRY { ------------------ | | 49| 13.4k|#define IMMER_TRY try ------------------ 932| 13.4k| if (next) { ------------------ | Branch (932:21): [True: 9.25k, False: 4.18k] ------------------ 933| 9.25k| if (mutate) { ------------------ | Branch (933:25): [True: 6.36k, False: 2.88k] ------------------ 934| 6.36k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 6.36k| pos.each_right(dec_visitor{}, idx + 1); 936| 6.36k| node->inner()[idx] = next; 937| 6.36k| nodr->d.sizes[idx] = last + 1 - ts; 938| 6.36k| nodr->d.count = idx + 1; 939| 6.36k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 6.36k, False: 0] ------------------ 940| 6.36k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 6.36k| } else { 942| 2.88k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 2.88k| auto newr = newn->relaxed(); 944| 2.88k| newn->inner()[idx] = next; 945| 2.88k| newr->d.sizes[idx] = last + 1 - ts; 946| 2.88k| newr->d.count = idx + 1; 947| 2.88k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 2.88k, False: 0] ------------------ 948| 2.88k| if (Mutating) ------------------ | Branch (948:29): [True: 2.88k, Folded] ------------------ 949| 2.88k| pos.visit(dec_visitor{}); 950| 2.88k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 2.88k| } 952| 9.25k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 4.18k] ------------------ 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.18k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 4.18k, Folded] | Branch (956:40): [True: 3.39k, False: 787] | Branch (956:52): [True: 2.48k, False: 908] ------------------ 957| 2.48k| auto newn = pos.node()->inner()[0]; 958| 2.48k| if (!mutate) ------------------ | Branch (958:25): [True: 693, False: 1.79k] ------------------ 959| 693| newn->inc(); 960| 2.48k| if (Mutating) ------------------ | Branch (960:25): [True: 2.48k, Folded] ------------------ 961| 2.48k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 2.48k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.48k| } else { 964| 1.69k| if (mutate) { ------------------ | Branch (964:25): [True: 1.32k, False: 367] ------------------ 965| 1.32k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.32k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.32k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.32k| } else { 969| 367| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 367| if (Mutating) ------------------ | Branch (970:29): [True: 367, Folded] ------------------ 971| 367| pos.visit(dec_visitor{}); 972| 367| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 367| } 974| 1.69k| } 975| 13.4k| } 976| 13.4k| 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.4k| } 987| 29.4k| } _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| 944| { 1060| 944| auto old_tail_size = pos.count(); 1061| 944| auto new_tail_size = pos.index(last) + 1; 1062| 944| auto node = pos.node(); 1063| 944| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 944, Folded] | Branch (1063:42): [True: 274, False: 670] ------------------ 1064| 944| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 225, False: 719] ------------------ 1065| 225| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 225] ------------------ 1066| 0| node->inc(); 1067| 225| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 719| } else if (mutate) { ------------------ | Branch (1068:20): [True: 268, False: 451] ------------------ 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| 451| } else { 1073| 451| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 451| if (Mutating) ------------------ | Branch (1074:17): [True: 451, Folded] ------------------ 1075| 451| pos.visit(dec_visitor{}); 1076| 451| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 451| } 1078| 944| } _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| 1.02k| { 1060| 1.02k| auto old_tail_size = pos.count(); 1061| 1.02k| auto new_tail_size = pos.index(last) + 1; 1062| 1.02k| auto node = pos.node(); 1063| 1.02k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.02k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.02k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 571, False: 452] ------------------ 1065| 571| if (!Mutating) ------------------ | Branch (1065:17): [True: 571, Folded] ------------------ 1066| 571| node->inc(); 1067| 571| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 571| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 452] ------------------ 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| 452| } else { 1073| 452| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 452| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 452] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 452| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 452| } 1078| 1.02k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 17.6k| { 914| 17.6k| auto idx = pos.index(last); 915| 17.6k| auto node = pos.node(); 916| 17.6k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 17.6k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 17.6k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 17.6k, Folded] | Branch (917:25): [True: 15.1k, False: 2.55k] ------------------ 918| 15.1k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 15.1k] ------------------ 919| 15.1k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 15.1k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 15.1k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 15.1k| return res; 923| 15.1k| } else { 924| 2.55k| using std::get; 925| 2.55k| auto subs = 926| 2.55k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 2.55k] ------------------ 927| 2.55k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 2.55k| auto next = get<1>(subs); 929| 2.55k| auto ts = get<2>(subs); 930| 2.55k| auto tail = get<3>(subs); 931| 2.55k| IMMER_TRY { ------------------ | | 49| 2.55k|#define IMMER_TRY try ------------------ 932| 2.55k| if (next) { ------------------ | Branch (932:21): [True: 1.54k, False: 1.01k] ------------------ 933| 1.54k| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 1.54k] ------------------ 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.54k| } else { 942| 1.54k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.54k| auto newr = newn->relaxed(); 944| 1.54k| newn->inner()[idx] = next; 945| 1.54k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.54k| newr->d.count = idx + 1; 947| 1.54k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.54k, False: 0] ------------------ 948| 1.54k| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 1.54k] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 1.54k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.54k| } 952| 1.54k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 1.01k] ------------------ 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.01k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 1.01k, Folded] | Branch (956:40): [True: 528, False: 489] | Branch (956:52): [True: 249, False: 279] ------------------ 957| 249| auto newn = pos.node()->inner()[0]; 958| 249| if (!mutate) ------------------ | Branch (958:25): [True: 249, False: 0] ------------------ 959| 249| newn->inc(); 960| 249| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 249] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 249| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 768| } else { 964| 768| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 768] ------------------ 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| 768| } else { 969| 768| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 768| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 768] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 768| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 768| } 974| 768| } 975| 2.55k| } 976| 2.55k| 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.55k| } 987| 17.6k| } _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: 216, False: 888] ------------------ 996| 216| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 216] ------------------ 997| 216| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 216| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 216] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 216| return res; 1001| 888| } else { 1002| 888| using std::get; 1003| 888| auto subs = 1004| 888| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 888] ------------------ 1005| 888| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 888| auto next = get<1>(subs); 1007| 888| auto ts = get<2>(subs); 1008| 888| auto tail = get<3>(subs); 1009| 888| IMMER_TRY { ------------------ | | 49| 888|#define IMMER_TRY try ------------------ 1010| 888| if (next) { ------------------ | Branch (1010:21): [True: 266, False: 622] ------------------ 1011| 266| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 266] ------------------ 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| 266| } else { 1016| 266| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 266| newn->inner()[idx] = next; 1018| 266| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 266] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 266| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 266| } 1022| 622| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 622] ------------------ 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| 622| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 622, Folded] | Branch (1026:40): [True: 389, False: 233] | Branch (1026:52): [True: 195, False: 194] ------------------ 1027| 195| auto newn = pos.node()->inner()[0]; 1028| 195| if (!mutate) ------------------ | Branch (1028:25): [True: 195, False: 0] ------------------ 1029| 195| newn->inc(); 1030| 195| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 195] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 195| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 427| } else { 1034| 427| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 427] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 427| } else { 1038| 427| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 427| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 427] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 427| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 427| } 1043| 427| } 1044| 888| } 1045| 888| 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| 888| } 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.58k| { 1060| 1.58k| auto old_tail_size = pos.count(); 1061| 1.58k| auto new_tail_size = pos.index(last) + 1; 1062| 1.58k| auto node = pos.node(); 1063| 1.58k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.58k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.58k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 432, False: 1.15k] ------------------ 1065| 432| if (!Mutating) ------------------ | Branch (1065:17): [True: 432, Folded] ------------------ 1066| 432| node->inc(); 1067| 432| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.15k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 1.15k] ------------------ 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.15k| } else { 1073| 1.15k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.15k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 1.15k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 1.15k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.15k| } 1078| 1.58k| } _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.83k| { 992| 1.83k| auto idx = pos.index(last); 993| 1.83k| auto node = pos.node(); 994| 1.83k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.83k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.83k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.83k, Folded] | Branch (995:25): [True: 852, False: 984] ------------------ 996| 852| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 852] ------------------ 997| 852| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 852| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 852] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 852| return res; 1001| 984| } else { 1002| 984| using std::get; 1003| 984| auto subs = 1004| 984| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 984] ------------------ 1005| 984| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 984| auto next = get<1>(subs); 1007| 984| auto ts = get<2>(subs); 1008| 984| auto tail = get<3>(subs); 1009| 984| IMMER_TRY { ------------------ | | 49| 984|#define IMMER_TRY try ------------------ 1010| 984| if (next) { ------------------ | Branch (1010:21): [True: 290, False: 694] ------------------ 1011| 290| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 290] ------------------ 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| 290| } else { 1016| 290| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 290| newn->inner()[idx] = next; 1018| 290| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 290] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 290| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 290| } 1022| 694| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 694] ------------------ 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| 694| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 694, Folded] | Branch (1026:40): [True: 432, False: 262] | Branch (1026:52): [True: 201, False: 231] ------------------ 1027| 201| auto newn = pos.node()->inner()[0]; 1028| 201| if (!mutate) ------------------ | Branch (1028:25): [True: 201, False: 0] ------------------ 1029| 201| newn->inc(); 1030| 201| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 201] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 201| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 493| } else { 1034| 493| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 493] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 493| } else { 1038| 493| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 493| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 493] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 493| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 493| } 1043| 493| } 1044| 984| } 1045| 984| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 984| } 1055| 1.83k| } _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.12k| { 1060| 3.12k| auto old_tail_size = pos.count(); 1061| 3.12k| auto new_tail_size = pos.index(last) + 1; 1062| 3.12k| auto node = pos.node(); 1063| 3.12k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 3.12k, Folded] | Branch (1063:42): [True: 666, False: 2.46k] ------------------ 1064| 3.12k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.32k, False: 1.80k] ------------------ 1065| 1.32k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.32k] ------------------ 1066| 0| node->inc(); 1067| 1.32k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.80k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 577, False: 1.22k] ------------------ 1069| 577| detail::destroy_n(node->leaf() + new_tail_size, 1070| 577| old_tail_size - new_tail_size); 1071| 577| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.22k| } else { 1073| 1.22k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.22k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.22k, Folded] ------------------ 1075| 1.22k| pos.visit(dec_visitor{}); 1076| 1.22k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.22k| } 1078| 3.12k| } _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.38k| { 992| 3.38k| auto idx = pos.index(last); 993| 3.38k| auto node = pos.node(); 994| 3.38k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.38k, Folded] | Branch (994:35): [True: 1.28k, False: 2.09k] ------------------ 995| 3.38k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.38k] | 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.38k| } else { 1002| 3.38k| using std::get; 1003| 3.38k| auto subs = 1004| 3.38k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 1.28k, False: 2.09k] ------------------ 1005| 3.38k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.38k| auto next = get<1>(subs); 1007| 3.38k| auto ts = get<2>(subs); 1008| 3.38k| auto tail = get<3>(subs); 1009| 3.38k| IMMER_TRY { ------------------ | | 49| 3.38k|#define IMMER_TRY try ------------------ 1010| 3.38k| if (next) { ------------------ | Branch (1010:21): [True: 857, False: 2.52k] ------------------ 1011| 857| if (mutate) { ------------------ | Branch (1011:25): [True: 342, False: 515] ------------------ 1012| 342| node->inner()[idx] = next; 1013| 342| pos.each_right(dec_visitor{}, idx + 1); 1014| 342| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 515| } else { 1016| 515| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 515| newn->inner()[idx] = next; 1018| 515| if (Mutating) ------------------ | Branch (1018:29): [True: 515, Folded] ------------------ 1019| 515| pos.visit(dec_visitor{}); 1020| 515| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 515| } 1022| 2.52k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 879, False: 1.65k] ------------------ 1023| 879| if (Mutating) ------------------ | Branch (1023:25): [True: 879, Folded] ------------------ 1024| 879| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 879| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.65k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.65k] | 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.65k| } else { 1034| 1.65k| if (mutate) { ------------------ | Branch (1034:25): [True: 570, False: 1.08k] ------------------ 1035| 570| pos.each_right(dec_visitor{}, idx + 1); 1036| 570| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.08k| } else { 1038| 1.08k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.08k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.08k, Folded] ------------------ 1040| 1.08k| pos.visit(dec_visitor{}); 1041| 1.08k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.08k| } 1043| 1.65k| } 1044| 3.38k| } 1045| 3.38k| 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.38k| } 1055| 3.38k| } _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.75k| { 879| 2.75k| using node_t = node_type; 880| 2.75k| auto node = p.node(); 881| 2.75k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.33k, False: 1.41k] ------------------ 882| 1.33k| p.each_right(dec_t{}, idx); 883| 1.33k| node_t::delete_inner(node, p.count()); 884| 1.33k| } 885| 2.75k| } _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.36k| { 1060| 9.36k| auto old_tail_size = pos.count(); 1061| 9.36k| auto new_tail_size = pos.index(last) + 1; 1062| 9.36k| auto node = pos.node(); 1063| 9.36k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 9.36k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 9.36k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.35k, False: 8.01k] ------------------ 1065| 1.35k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.35k, Folded] ------------------ 1066| 1.35k| node->inc(); 1067| 1.35k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 8.01k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 8.01k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 8.01k| } else { 1073| 8.01k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 8.01k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 8.01k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 8.01k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 8.01k| } 1078| 9.36k| } _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.40k| { 992| 5.40k| auto idx = pos.index(last); 993| 5.40k| auto node = pos.node(); 994| 5.40k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 5.40k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 5.40k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 5.40k] | 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.40k| } else { 1002| 5.40k| using std::get; 1003| 5.40k| auto subs = 1004| 5.40k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 5.40k] ------------------ 1005| 5.40k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.40k| auto next = get<1>(subs); 1007| 5.40k| auto ts = get<2>(subs); 1008| 5.40k| auto tail = get<3>(subs); 1009| 5.40k| IMMER_TRY { ------------------ | | 49| 5.40k|#define IMMER_TRY try ------------------ 1010| 5.40k| if (next) { ------------------ | Branch (1010:21): [True: 600, False: 4.80k] ------------------ 1011| 600| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 600] ------------------ 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| 600| } else { 1016| 600| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 600| newn->inner()[idx] = next; 1018| 600| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 600] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 600| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 600| } 1022| 4.80k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.23k, False: 3.57k] ------------------ 1023| 1.23k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.23k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.23k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.57k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 3.57k] | 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.57k| } else { 1034| 3.57k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 3.57k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 3.57k| } else { 1038| 3.57k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 3.57k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 3.57k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 3.57k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 3.57k| } 1043| 3.57k| } 1044| 5.40k| } 1045| 5.40k| 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.40k| } 1055| 5.40k| } _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| 403| { 1060| 403| auto old_tail_size = pos.count(); 1061| 403| auto new_tail_size = pos.index(last) + 1; 1062| 403| auto node = pos.node(); 1063| 403| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 403] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 403| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 195, False: 208] ------------------ 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| 208| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 208] ------------------ 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| 208| } else { 1073| 208| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 208| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 208] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 208| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 208| } 1078| 403| } _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.57k| { 1060| 1.57k| auto old_tail_size = pos.count(); 1061| 1.57k| auto new_tail_size = pos.index(last) + 1; 1062| 1.57k| auto node = pos.node(); 1063| 1.57k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.57k, Folded] | Branch (1063:42): [True: 207, False: 1.37k] ------------------ 1064| 1.57k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 347, False: 1.23k] ------------------ 1065| 347| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 347] ------------------ 1066| 0| node->inc(); 1067| 347| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.23k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 205, False: 1.02k] ------------------ 1069| 205| detail::destroy_n(node->leaf() + new_tail_size, 1070| 205| old_tail_size - new_tail_size); 1071| 205| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.02k| } else { 1073| 1.02k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.02k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.02k, Folded] ------------------ 1075| 1.02k| pos.visit(dec_visitor{}); 1076| 1.02k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.02k| } 1078| 1.57k| } _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.89k| { 992| 3.89k| auto idx = pos.index(last); 993| 3.89k| auto node = pos.node(); 994| 3.89k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.89k, Folded] | Branch (994:35): [True: 2.76k, False: 1.12k] ------------------ 995| 3.89k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.89k] | 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.89k| } else { 1002| 3.89k| using std::get; 1003| 3.89k| auto subs = 1004| 3.89k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.76k, False: 1.12k] ------------------ 1005| 3.89k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.89k| auto next = get<1>(subs); 1007| 3.89k| auto ts = get<2>(subs); 1008| 3.89k| auto tail = get<3>(subs); 1009| 3.89k| IMMER_TRY { ------------------ | | 49| 3.89k|#define IMMER_TRY try ------------------ 1010| 3.89k| if (next) { ------------------ | Branch (1010:21): [True: 1.70k, False: 2.18k] ------------------ 1011| 1.70k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.02k, False: 680] ------------------ 1012| 1.02k| node->inner()[idx] = next; 1013| 1.02k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.02k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.02k| } else { 1016| 680| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 680| newn->inner()[idx] = next; 1018| 680| if (Mutating) ------------------ | Branch (1018:29): [True: 680, Folded] ------------------ 1019| 680| pos.visit(dec_visitor{}); 1020| 680| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 680| } 1022| 2.18k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.45k, False: 731] ------------------ 1023| 1.45k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.45k, Folded] ------------------ 1024| 1.45k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.45k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.45k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 731] | 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| 731| } else { 1034| 731| if (mutate) { ------------------ | Branch (1034:25): [True: 504, False: 227] ------------------ 1035| 504| pos.each_right(dec_visitor{}, idx + 1); 1036| 504| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 504| } else { 1038| 227| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 227| if (Mutating) ------------------ | Branch (1039:29): [True: 227, Folded] ------------------ 1040| 227| pos.visit(dec_visitor{}); 1041| 227| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 227| } 1043| 731| } 1044| 3.89k| } 1045| 3.89k| 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.89k| } 1055| 3.89k| } _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.45k| { 879| 1.45k| using node_t = node_type; 880| 1.45k| auto node = p.node(); 881| 1.45k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.23k, False: 218] ------------------ 882| 1.23k| p.each_right(dec_t{}, idx); 883| 1.23k| node_t::delete_inner(node, p.count()); 884| 1.23k| } 885| 1.45k| } _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.56k| { 1060| 2.56k| auto old_tail_size = pos.count(); 1061| 2.56k| auto new_tail_size = pos.index(last) + 1; 1062| 2.56k| auto node = pos.node(); 1063| 2.56k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.56k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.56k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 438, False: 2.12k] ------------------ 1065| 438| if (!Mutating) ------------------ | Branch (1065:17): [True: 438, Folded] ------------------ 1066| 438| node->inc(); 1067| 438| 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.56k| } _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.25k| { 992| 3.25k| auto idx = pos.index(last); 993| 3.25k| auto node = pos.node(); 994| 3.25k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.25k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.25k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.25k] | 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.25k| } else { 1002| 3.25k| using std::get; 1003| 3.25k| auto subs = 1004| 3.25k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.25k] ------------------ 1005| 3.25k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.25k| auto next = get<1>(subs); 1007| 3.25k| auto ts = get<2>(subs); 1008| 3.25k| auto tail = get<3>(subs); 1009| 3.25k| IMMER_TRY { ------------------ | | 49| 3.25k|#define IMMER_TRY try ------------------ 1010| 3.25k| if (next) { ------------------ | Branch (1010:21): [True: 921, False: 2.33k] ------------------ 1011| 921| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 921] ------------------ 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| 921| } else { 1016| 921| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 921| newn->inner()[idx] = next; 1018| 921| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 921] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 921| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 921| } 1022| 2.33k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 689, False: 1.64k] ------------------ 1023| 689| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 689] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 689| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.64k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.64k] | 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.64k| } else { 1034| 1.64k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.64k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.64k| } else { 1038| 1.64k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.64k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.64k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.64k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.64k| } 1043| 1.64k| } 1044| 3.25k| } 1045| 3.25k| 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.25k| } 1055| 3.25k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEEEvOT_j: 867| 19.6k| { 868| 19.6k| using node_t = node_type; 869| 19.6k| auto node = p.node(); 870| 19.6k| if (node->dec()) { ------------------ | Branch (870:13): [True: 13.7k, False: 5.89k] ------------------ 871| 13.7k| p.each_right(dec_t{}, idx); 872| 13.7k| node_t::delete_inner_r(node, p.count()); 873| 13.7k| } 874| 19.6k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 2.80k| { 1060| 2.80k| auto old_tail_size = pos.count(); 1061| 2.80k| auto new_tail_size = pos.index(last) + 1; 1062| 2.80k| auto node = pos.node(); 1063| 2.80k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 2.80k, Folded] | Branch (1063:42): [True: 445, False: 2.36k] ------------------ 1064| 2.80k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 885, False: 1.92k] ------------------ 1065| 885| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 885] ------------------ 1066| 0| node->inc(); 1067| 885| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.92k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 403, False: 1.51k] ------------------ 1069| 403| detail::destroy_n(node->leaf() + new_tail_size, 1070| 403| old_tail_size - new_tail_size); 1071| 403| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.51k| } else { 1073| 1.51k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.51k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.51k, Folded] ------------------ 1075| 1.51k| pos.visit(dec_visitor{}); 1076| 1.51k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.51k| } 1078| 2.80k| } _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.57k| { 914| 4.57k| auto idx = pos.index(last); 915| 4.57k| auto node = pos.node(); 916| 4.57k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 4.57k, Folded] | Branch (916:35): [True: 3.02k, False: 1.55k] ------------------ 917| 4.57k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 4.57k] | 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.57k| } else { 924| 4.57k| using std::get; 925| 4.57k| auto subs = 926| 4.57k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 3.02k, False: 1.55k] ------------------ 927| 4.57k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 4.57k| auto next = get<1>(subs); 929| 4.57k| auto ts = get<2>(subs); 930| 4.57k| auto tail = get<3>(subs); 931| 4.57k| IMMER_TRY { ------------------ | | 49| 4.57k|#define IMMER_TRY try ------------------ 932| 4.57k| if (next) { ------------------ | Branch (932:21): [True: 1.61k, False: 2.96k] ------------------ 933| 1.61k| if (mutate) { ------------------ | Branch (933:25): [True: 1.31k, False: 292] ------------------ 934| 1.31k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 1.31k| pos.each_right(dec_visitor{}, idx + 1); 936| 1.31k| node->inner()[idx] = next; 937| 1.31k| nodr->d.sizes[idx] = last + 1 - ts; 938| 1.31k| nodr->d.count = idx + 1; 939| 1.31k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 1.31k, False: 0] ------------------ 940| 1.31k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 1.31k| } else { 942| 292| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 292| auto newr = newn->relaxed(); 944| 292| newn->inner()[idx] = next; 945| 292| newr->d.sizes[idx] = last + 1 - ts; 946| 292| newr->d.count = idx + 1; 947| 292| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 292, False: 0] ------------------ 948| 292| if (Mutating) ------------------ | Branch (948:29): [True: 292, Folded] ------------------ 949| 292| pos.visit(dec_visitor{}); 950| 292| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 292| } 952| 2.96k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 1.17k, False: 1.79k] ------------------ 953| 1.17k| if (Mutating) ------------------ | Branch (953:25): [True: 1.17k, Folded] ------------------ 954| 1.17k| pos.visit(dec_right_visitor{}, count_t{1}); 955| 1.17k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.79k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.79k] | 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.79k| } else { 964| 1.79k| if (mutate) { ------------------ | Branch (964:25): [True: 1.05k, False: 748] ------------------ 965| 1.05k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.05k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.05k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.05k| } else { 969| 748| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 748| if (Mutating) ------------------ | Branch (970:29): [True: 748, Folded] ------------------ 971| 748| pos.visit(dec_visitor{}); 972| 748| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 748| } 974| 1.79k| } 975| 4.57k| } 976| 4.57k| 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.57k| } 987| 4.57k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 5.13k| { 992| 5.13k| auto idx = pos.index(last); 993| 5.13k| auto node = pos.node(); 994| 5.13k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 5.13k, Folded] | Branch (994:35): [True: 3.83k, False: 1.29k] ------------------ 995| 5.13k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 5.13k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 5.13k| } else { 1002| 5.13k| using std::get; 1003| 5.13k| auto subs = 1004| 5.13k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.83k, False: 1.29k] ------------------ 1005| 5.13k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.13k| auto next = get<1>(subs); 1007| 5.13k| auto ts = get<2>(subs); 1008| 5.13k| auto tail = get<3>(subs); 1009| 5.13k| IMMER_TRY { ------------------ | | 49| 5.13k|#define IMMER_TRY try ------------------ 1010| 5.13k| if (next) { ------------------ | Branch (1010:21): [True: 3.37k, False: 1.75k] ------------------ 1011| 3.37k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.86k, False: 516] ------------------ 1012| 2.86k| node->inner()[idx] = next; 1013| 2.86k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.86k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.86k| } 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| 3.37k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 853, False: 899] ------------------ 1023| 853| if (Mutating) ------------------ | Branch (1023:25): [True: 853, Folded] ------------------ 1024| 853| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 853| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 899| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 899] | 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| 899| } else { 1034| 899| if (mutate) { ------------------ | Branch (1034:25): [True: 427, False: 472] ------------------ 1035| 427| pos.each_right(dec_visitor{}, idx + 1); 1036| 427| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 472| } else { 1038| 472| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 472| if (Mutating) ------------------ | Branch (1039:29): [True: 472, Folded] ------------------ 1040| 472| pos.visit(dec_visitor{}); 1041| 472| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 472| } 1043| 899| } 1044| 5.13k| } 1045| 5.13k| 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.13k| } 1055| 5.13k| } _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.57k| { 879| 9.57k| using node_t = node_type; 880| 9.57k| auto node = p.node(); 881| 9.57k| if (node->dec()) { ------------------ | Branch (881:13): [True: 6.38k, False: 3.18k] ------------------ 882| 6.38k| p.each_right(dec_t{}, idx); 883| 6.38k| node_t::delete_inner(node, p.count()); 884| 6.38k| } 885| 9.57k| } _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.15k| { 1060| 5.15k| auto old_tail_size = pos.count(); 1061| 5.15k| auto new_tail_size = pos.index(last) + 1; 1062| 5.15k| auto node = pos.node(); 1063| 5.15k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 5.15k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 5.15k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 973, False: 4.18k] ------------------ 1065| 973| if (!Mutating) ------------------ | Branch (1065:17): [True: 973, Folded] ------------------ 1066| 973| node->inc(); 1067| 973| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 4.18k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 4.18k] ------------------ 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.18k| } else { 1073| 4.18k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 4.18k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 4.18k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 4.18k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 4.18k| } 1078| 5.15k| } _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.44k| { 914| 4.44k| auto idx = pos.index(last); 915| 4.44k| auto node = pos.node(); 916| 4.44k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 4.44k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 4.44k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 4.44k] | 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.44k| } else { 924| 4.44k| using std::get; 925| 4.44k| auto subs = 926| 4.44k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 4.44k] ------------------ 927| 4.44k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 4.44k| auto next = get<1>(subs); 929| 4.44k| auto ts = get<2>(subs); 930| 4.44k| auto tail = get<3>(subs); 931| 4.44k| IMMER_TRY { ------------------ | | 49| 4.44k|#define IMMER_TRY try ------------------ 932| 4.44k| if (next) { ------------------ | Branch (932:21): [True: 1.09k, False: 3.35k] ------------------ 933| 1.09k| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 1.09k] ------------------ 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.09k| } else { 942| 1.09k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.09k| auto newr = newn->relaxed(); 944| 1.09k| newn->inner()[idx] = next; 945| 1.09k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.09k| newr->d.count = idx + 1; 947| 1.09k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.09k, False: 0] ------------------ 948| 1.09k| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 1.09k] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 1.09k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.09k| } 952| 3.35k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 1.07k, False: 2.28k] ------------------ 953| 1.07k| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 1.07k] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 1.07k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 2.28k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 2.28k] | 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.28k| } else { 964| 2.28k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 2.28k] ------------------ 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.28k| } else { 969| 2.28k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 2.28k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 2.28k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 2.28k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 2.28k| } 974| 2.28k| } 975| 4.44k| } 976| 4.44k| 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.44k| } 987| 4.44k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 2.89k| { 992| 2.89k| auto idx = pos.index(last); 993| 2.89k| auto node = pos.node(); 994| 2.89k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 2.89k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 2.89k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 2.89k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 2.89k| } else { 1002| 2.89k| using std::get; 1003| 2.89k| auto subs = 1004| 2.89k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 2.89k] ------------------ 1005| 2.89k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 2.89k| auto next = get<1>(subs); 1007| 2.89k| auto ts = get<2>(subs); 1008| 2.89k| auto tail = get<3>(subs); 1009| 2.89k| IMMER_TRY { ------------------ | | 49| 2.89k|#define IMMER_TRY try ------------------ 1010| 2.89k| if (next) { ------------------ | Branch (1010:21): [True: 2.12k, False: 769] ------------------ 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: 461, False: 308] ------------------ 1023| 461| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 461] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 461| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 461| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 308] | 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| 308| } else { 1034| 308| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 308] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 308| } else { 1038| 308| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 308| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 308] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 308| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 308| } 1043| 308| } 1044| 2.89k| } 1045| 2.89k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 2.89k| } 1055| 2.89k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 11.5k| { 992| 11.5k| auto idx = pos.index(last); 993| 11.5k| auto node = pos.node(); 994| 11.5k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 11.5k, Folded] | Branch (994:35): [True: 7.67k, False: 3.84k] ------------------ 995| 11.5k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 11.5k, Folded] | Branch (995:25): [True: 6.59k, False: 4.92k] ------------------ 996| 6.59k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 4.37k, False: 2.21k] ------------------ 997| 6.59k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 6.59k| if (Mutating) ------------------ | Branch (998:17): [True: 6.59k, Folded] ------------------ 999| 6.59k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 6.59k| return res; 1001| 6.59k| } else { 1002| 4.92k| using std::get; 1003| 4.92k| auto subs = 1004| 4.92k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.29k, False: 1.62k] ------------------ 1005| 4.92k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.92k| auto next = get<1>(subs); 1007| 4.92k| auto ts = get<2>(subs); 1008| 4.92k| auto tail = get<3>(subs); 1009| 4.92k| IMMER_TRY { ------------------ | | 49| 4.92k|#define IMMER_TRY try ------------------ 1010| 4.92k| if (next) { ------------------ | Branch (1010:21): [True: 1.04k, False: 3.88k] ------------------ 1011| 1.04k| if (mutate) { ------------------ | Branch (1011:25): [True: 509, False: 532] ------------------ 1012| 509| node->inner()[idx] = next; 1013| 509| pos.each_right(dec_visitor{}, idx + 1); 1014| 509| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 532| } else { 1016| 532| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 532| newn->inner()[idx] = next; 1018| 532| if (Mutating) ------------------ | Branch (1018:29): [True: 532, Folded] ------------------ 1019| 532| pos.visit(dec_visitor{}); 1020| 532| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 532| } 1022| 3.88k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 3.88k] ------------------ 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| 3.88k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 3.88k, Folded] | Branch (1026:40): [True: 3.49k, False: 383] | Branch (1026:52): [True: 2.12k, False: 1.37k] ------------------ 1027| 2.12k| auto newn = pos.node()->inner()[0]; 1028| 2.12k| if (!mutate) ------------------ | Branch (1028:25): [True: 662, False: 1.45k] ------------------ 1029| 662| newn->inc(); 1030| 2.12k| if (Mutating) ------------------ | Branch (1030:25): [True: 2.12k, Folded] ------------------ 1031| 2.12k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 2.12k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 2.12k| } else { 1034| 1.76k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.32k, False: 433] ------------------ 1035| 1.32k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.32k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.32k| } else { 1038| 433| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 433| if (Mutating) ------------------ | Branch (1039:29): [True: 433, Folded] ------------------ 1040| 433| pos.visit(dec_visitor{}); 1041| 433| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 433| } 1043| 1.76k| } 1044| 4.92k| } 1045| 4.92k| 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.92k| } 1055| 11.5k| } _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.33k| { 1060| 1.33k| auto old_tail_size = pos.count(); 1061| 1.33k| auto new_tail_size = pos.index(last) + 1; 1062| 1.33k| auto node = pos.node(); 1063| 1.33k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.33k, Folded] | Branch (1063:42): [True: 436, False: 899] ------------------ 1064| 1.33k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 397, False: 938] ------------------ 1065| 397| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 397] ------------------ 1066| 0| node->inc(); 1067| 397| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 938| } else if (mutate) { ------------------ | Branch (1068:20): [True: 436, False: 502] ------------------ 1069| 436| detail::destroy_n(node->leaf() + new_tail_size, 1070| 436| old_tail_size - new_tail_size); 1071| 436| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 502| } else { 1073| 502| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 502| if (Mutating) ------------------ | Branch (1074:17): [True: 502, Folded] ------------------ 1075| 502| pos.visit(dec_visitor{}); 1076| 502| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 502| } 1078| 1.33k| } _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.09k| { 992| 3.09k| auto idx = pos.index(last); 993| 3.09k| auto node = pos.node(); 994| 3.09k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.09k, Folded] | Branch (994:35): [True: 1.54k, False: 1.54k] ------------------ 995| 3.09k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.09k, Folded] | Branch (995:25): [True: 1.28k, False: 1.81k] ------------------ 996| 1.28k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 747, False: 535] ------------------ 997| 1.28k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 1.28k| if (Mutating) ------------------ | Branch (998:17): [True: 1.28k, Folded] ------------------ 999| 1.28k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 1.28k| return res; 1001| 1.81k| } else { 1002| 1.81k| using std::get; 1003| 1.81k| auto subs = 1004| 1.81k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 801, False: 1.01k] ------------------ 1005| 1.81k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.81k| auto next = get<1>(subs); 1007| 1.81k| auto ts = get<2>(subs); 1008| 1.81k| auto tail = get<3>(subs); 1009| 1.81k| IMMER_TRY { ------------------ | | 49| 1.81k|#define IMMER_TRY try ------------------ 1010| 1.81k| if (next) { ------------------ | Branch (1010:21): [True: 494, False: 1.31k] ------------------ 1011| 494| if (mutate) { ------------------ | Branch (1011:25): [True: 205, False: 289] ------------------ 1012| 205| node->inner()[idx] = next; 1013| 205| pos.each_right(dec_visitor{}, idx + 1); 1014| 205| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 289| } else { 1016| 289| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 289| newn->inner()[idx] = next; 1018| 289| if (Mutating) ------------------ | Branch (1018:29): [True: 289, Folded] ------------------ 1019| 289| pos.visit(dec_visitor{}); 1020| 289| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 289| } 1022| 1.31k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.31k] ------------------ 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.31k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.31k, Folded] | Branch (1026:40): [True: 1.01k, False: 301] | Branch (1026:52): [True: 593, False: 425] ------------------ 1027| 593| auto newn = pos.node()->inner()[0]; 1028| 593| if (!mutate) ------------------ | Branch (1028:25): [True: 377, False: 216] ------------------ 1029| 377| newn->inc(); 1030| 593| if (Mutating) ------------------ | Branch (1030:25): [True: 593, Folded] ------------------ 1031| 593| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 593| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 726| } else { 1034| 726| if (mutate) { ------------------ | Branch (1034:25): [True: 380, False: 346] ------------------ 1035| 380| pos.each_right(dec_visitor{}, idx + 1); 1036| 380| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 380| } else { 1038| 346| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 346| if (Mutating) ------------------ | Branch (1039:29): [True: 346, Folded] ------------------ 1040| 346| pos.visit(dec_visitor{}); 1041| 346| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 346| } 1043| 726| } 1044| 1.81k| } 1045| 1.81k| 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.81k| } 1055| 3.09k| } _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| 696| { 1060| 696| auto old_tail_size = pos.count(); 1061| 696| auto new_tail_size = pos.index(last) + 1; 1062| 696| auto node = pos.node(); 1063| 696| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 696, Folded] | Branch (1063:42): [True: 266, False: 430] ------------------ 1064| 696| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 237, False: 459] ------------------ 1065| 237| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 237] ------------------ 1066| 0| node->inc(); 1067| 237| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 459| } else if (mutate) { ------------------ | Branch (1068:20): [True: 198, False: 261] ------------------ 1069| 198| detail::destroy_n(node->leaf() + new_tail_size, 1070| 198| old_tail_size - new_tail_size); 1071| 198| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 261| } else { 1073| 261| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 261| if (Mutating) ------------------ | Branch (1074:17): [True: 261, Folded] ------------------ 1075| 261| pos.visit(dec_visitor{}); 1076| 261| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 261| } 1078| 696| } _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| 929| { 1378| 929| auto node = pos.node(); 1379| 929| auto idx = pos.index(first); 1380| 929| auto count = pos.count(); 1381| 929| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 929| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 652, False: 277] ------------------ 1384| 929| if (mutate) { ------------------ | Branch (1384:13): [True: 652, False: 277] ------------------ 1385| 652| auto data = node->leaf(); 1386| 652| auto newcount = count - idx; 1387| 652| std::move(data + idx, data + count, data); 1388| 652| detail::destroy_n(data + newcount, idx); 1389| 652| return std::make_tuple(0, node); 1390| 652| } else { 1391| 277| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 277| if (Mutating) ------------------ | Branch (1392:17): [True: 277, Folded] ------------------ 1393| 277| pos.visit(dec_visitor{}); 1394| 277| return std::make_tuple(0, newn); 1395| 277| } 1396| 929| } _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| 59.5k| { 1247| 59.5k| auto idx = pos.subindex(first); 1248| 59.5k| auto count = pos.count(); 1249| 59.5k| auto node = pos.node(); 1250| 59.5k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 59.5k, Folded] | Branch (1250:47): [True: 45.6k, False: 13.8k] ------------------ 1251| 59.5k| auto left_size = pos.size_before(idx); 1252| 59.5k| auto child_size = pos.size_sbh(idx, left_size); 1253| 59.5k| auto dropped_size = first; 1254| 59.5k| auto child_dropped_size = dropped_size - left_size; 1255| 59.5k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 59.5k, Folded] | Branch (1255:25): [True: 57.7k, False: 1.76k] | Branch (1255:45): [True: 4.96k, False: 52.7k] ------------------ 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| 54.5k| } else { 1264| 54.5k| using std::get; 1265| 54.5k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 43.5k, False: 11.0k] ------------------ 1266| 54.5k| : node_t::make_inner_r_e(e); 1267| 54.5k| auto newr = newn->relaxed(); 1268| 54.5k| auto newcount = count - idx; 1269| 54.5k| auto new_child_size = child_size - child_dropped_size; 1270| 54.5k| IMMER_TRY { ------------------ | | 49| 54.5k|#define IMMER_TRY try ------------------ 1271| 54.5k| auto subs = 1272| 54.5k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 43.5k, False: 11.0k] ------------------ 1273| 54.5k| : pos.towards_sub_oh( 1274| 11.0k| no_collapse_no_mut_t{}, first, idx, e); 1275| 54.5k| if (mutate) ------------------ | Branch (1275:21): [True: 43.5k, False: 11.0k] ------------------ 1276| 43.5k| pos.each_left(dec_visitor{}, idx); 1277| 54.5k| pos.copy_sizes( 1278| 54.5k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 54.5k| std::copy(node->inner() + idx + 1, 1280| 54.5k| node->inner() + count, 1281| 54.5k| newn->inner() + 1); 1282| 54.5k| newn->inner()[0] = get<1>(subs); 1283| 54.5k| newr->d.sizes[0] = new_child_size; 1284| 54.5k| newr->d.count = newcount; 1285| 54.5k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 54.5k, False: 0] ------------------ 1286| 54.5k| if (!mutate) { ------------------ | Branch (1286:21): [True: 11.0k, False: 43.5k] ------------------ 1287| 11.0k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 11.0k| if (Mutating) ------------------ | Branch (1288:25): [True: 11.0k, Folded] ------------------ 1289| 11.0k| pos.visit(dec_visitor{}); 1290| 11.0k| } 1291| 54.5k| return std::make_tuple(pos.shift(), newn); 1292| 54.5k| } 1293| 54.5k| 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| 54.5k| } 1299| 59.5k| } _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.32k| { 1247| 2.32k| auto idx = pos.subindex(first); 1248| 2.32k| auto count = pos.count(); 1249| 2.32k| auto node = pos.node(); 1250| 2.32k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.32k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.32k| auto left_size = pos.size_before(idx); 1252| 2.32k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.32k| auto dropped_size = first; 1254| 2.32k| auto child_dropped_size = dropped_size - left_size; 1255| 2.32k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.32k, Folded] | Branch (1255:25): [True: 921, False: 1.40k] | Branch (1255:45): [True: 640, False: 281] ------------------ 1256| 640| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 640] ------------------ 1257| 640| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 640| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 640] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 640| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 640] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 640| return r; 1263| 1.68k| } else { 1264| 1.68k| using std::get; 1265| 1.68k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.68k] ------------------ 1266| 1.68k| : node_t::make_inner_r_e(e); 1267| 1.68k| auto newr = newn->relaxed(); 1268| 1.68k| auto newcount = count - idx; 1269| 1.68k| auto new_child_size = child_size - child_dropped_size; 1270| 1.68k| IMMER_TRY { ------------------ | | 49| 1.68k|#define IMMER_TRY try ------------------ 1271| 1.68k| auto subs = 1272| 1.68k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.68k] ------------------ 1273| 1.68k| : pos.towards_sub_oh( 1274| 1.68k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.68k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.68k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.68k| pos.copy_sizes( 1278| 1.68k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.68k| std::copy(node->inner() + idx + 1, 1280| 1.68k| node->inner() + count, 1281| 1.68k| newn->inner() + 1); 1282| 1.68k| newn->inner()[0] = get<1>(subs); 1283| 1.68k| newr->d.sizes[0] = new_child_size; 1284| 1.68k| newr->d.count = newcount; 1285| 1.68k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.68k, False: 0] ------------------ 1286| 1.68k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.68k, False: 0] ------------------ 1287| 1.68k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.68k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.68k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.68k| } 1291| 1.68k| return std::make_tuple(pos.shift(), newn); 1292| 1.68k| } 1293| 1.68k| 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.68k| } 1299| 2.32k| } _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: 939, False: 1.01k] | Branch (1316:45): [True: 697, False: 242] ------------------ 1317| 697| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 697] ------------------ 1318| 697| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 697| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 697] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 697| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 697] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 697| return r; 1324| 1.26k| } else { 1325| 1.26k| 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.26k| auto newcount = count - idx; 1330| 1.26k| auto newn = 1331| 1.26k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.26k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.26k| : node_t::make_inner_r_e(e); 1336| 1.26k| auto newr = newn->relaxed(); 1337| 1.26k| IMMER_TRY { ------------------ | | 49| 1.26k|#define IMMER_TRY try ------------------ 1338| 1.26k| auto subs = 1339| 1.26k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.26k] ------------------ 1340| 1.26k| : pos.towards_sub_oh( 1341| 1.26k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.26k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.26k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.26k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.26k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.26k, False: 0] ------------------ 1346| 1.26k| pos.copy_sizes( 1347| 1.26k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.26k| newr->d.count = newcount; 1349| 1.26k| newn->inner()[0] = get<1>(subs); 1350| 1.26k| std::copy(node->inner() + idx + 1, 1351| 1.26k| node->inner() + count, 1352| 1.26k| newn->inner() + 1); 1353| 1.26k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.26k, False: 0] ------------------ 1354| 1.26k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.26k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.26k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.26k| } 1358| 1.26k| return std::make_tuple(pos.shift(), newn); 1359| 1.26k| } 1360| 1.26k| 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.26k| } 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| 627| { 1304| 627| auto idx = pos.subindex(first); 1305| 627| auto count = pos.count(); 1306| 627| auto node = pos.node(); 1307| 627| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 627] ------------------ 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| 627| auto left_size = pos.size_before(idx); 1313| 627| auto child_size = pos.size_sbh(idx, left_size); 1314| 627| auto dropped_size = first; 1315| 627| auto child_dropped_size = dropped_size - left_size; 1316| 627| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 627, Folded] | Branch (1316:25): [True: 204, False: 423] | Branch (1316:45): [True: 0, False: 204] ------------------ 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| 627| } else { 1325| 627| 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| 627| auto newcount = count - idx; 1330| 627| auto newn = 1331| 627| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 627] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 627| : node_t::make_inner_r_e(e); 1336| 627| auto newr = newn->relaxed(); 1337| 627| IMMER_TRY { ------------------ | | 49| 627|#define IMMER_TRY try ------------------ 1338| 627| auto subs = 1339| 627| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 627] ------------------ 1340| 627| : pos.towards_sub_oh( 1341| 627| no_collapse_no_mut_t{}, first, idx, e); 1342| 627| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 627] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 627| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 627| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 627, False: 0] ------------------ 1346| 627| pos.copy_sizes( 1347| 627| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 627| newr->d.count = newcount; 1349| 627| newn->inner()[0] = get<1>(subs); 1350| 627| std::copy(node->inner() + idx + 1, 1351| 627| node->inner() + count, 1352| 627| newn->inner() + 1); 1353| 627| if (!mutate) { ------------------ | Branch (1353:21): [True: 627, False: 0] ------------------ 1354| 627| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 627| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 627] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 627| } 1358| 627| return std::make_tuple(pos.shift(), newn); 1359| 627| } 1360| 627| 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| 627| } 1373| 627| } _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.84k| { 1378| 2.84k| auto node = pos.node(); 1379| 2.84k| auto idx = pos.index(first); 1380| 2.84k| auto count = pos.count(); 1381| 2.84k| 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.84k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 688, False: 2.15k] ------------------ 1384| 2.84k| if (mutate) { ------------------ | Branch (1384:13): [True: 688, False: 2.15k] ------------------ 1385| 688| auto data = node->leaf(); 1386| 688| auto newcount = count - idx; 1387| 688| std::move(data + idx, data + count, data); 1388| 688| detail::destroy_n(data + newcount, idx); 1389| 688| return std::make_tuple(0, node); 1390| 2.15k| } else { 1391| 2.15k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.15k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.15k, Folded] ------------------ 1393| 2.15k| pos.visit(dec_visitor{}); 1394| 2.15k| return std::make_tuple(0, newn); 1395| 2.15k| } 1396| 2.84k| } _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.56k| { 1304| 1.56k| auto idx = pos.subindex(first); 1305| 1.56k| auto count = pos.count(); 1306| 1.56k| auto node = pos.node(); 1307| 1.56k| 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.56k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 640, False: 920] ------------------ 1312| 1.56k| auto left_size = pos.size_before(idx); 1313| 1.56k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.56k| auto dropped_size = first; 1315| 1.56k| auto child_dropped_size = dropped_size - left_size; 1316| 1.56k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.56k] | 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.56k| } else { 1325| 1.56k| 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.56k| auto newcount = count - idx; 1330| 1.56k| auto newn = 1331| 1.56k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 640, False: 920] ------------------ 1332| 640| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 640| norefs_tag{})) relaxed_t, 1334| 640| node) 1335| 1.56k| : node_t::make_inner_r_e(e); 1336| 1.56k| auto newr = newn->relaxed(); 1337| 1.56k| IMMER_TRY { ------------------ | | 49| 1.56k|#define IMMER_TRY try ------------------ 1338| 1.56k| auto subs = 1339| 1.56k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 640, False: 920] ------------------ 1340| 1.56k| : pos.towards_sub_oh( 1341| 920| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.56k| if (mutate) ------------------ | Branch (1342:21): [True: 640, False: 920] ------------------ 1343| 640| pos.each_left(dec_visitor{}, idx); 1344| 1.56k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.56k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.56k, False: 0] ------------------ 1346| 1.56k| pos.copy_sizes( 1347| 1.56k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.56k| newr->d.count = newcount; 1349| 1.56k| newn->inner()[0] = get<1>(subs); 1350| 1.56k| std::copy(node->inner() + idx + 1, 1351| 1.56k| node->inner() + count, 1352| 1.56k| newn->inner() + 1); 1353| 1.56k| if (!mutate) { ------------------ | Branch (1353:21): [True: 920, False: 640] ------------------ 1354| 920| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 920| if (Mutating) ------------------ | Branch (1355:25): [True: 920, Folded] ------------------ 1356| 920| pos.visit(dec_visitor{}); 1357| 920| } 1358| 1.56k| return std::make_tuple(pos.shift(), newn); 1359| 1.56k| } 1360| 1.56k| 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.56k| } 1373| 1.56k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 6.97k| { 1378| 6.97k| auto node = pos.node(); 1379| 6.97k| auto idx = pos.index(first); 1380| 6.97k| auto count = pos.count(); 1381| 6.97k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 6.97k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 6.97k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 6.97k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 6.97k| } else { 1391| 6.97k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 6.97k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 6.97k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 6.97k| return std::make_tuple(0, newn); 1395| 6.97k| } 1396| 6.97k| } _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.72k| { 1304| 1.72k| auto idx = pos.subindex(first); 1305| 1.72k| auto count = pos.count(); 1306| 1.72k| auto node = pos.node(); 1307| 1.72k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.72k] ------------------ 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.72k| auto left_size = pos.size_before(idx); 1313| 1.72k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.72k| auto dropped_size = first; 1315| 1.72k| auto child_dropped_size = dropped_size - left_size; 1316| 1.72k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.72k] | 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.72k| } else { 1325| 1.72k| 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.72k| auto newcount = count - idx; 1330| 1.72k| auto newn = 1331| 1.72k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.72k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.72k| : node_t::make_inner_r_e(e); 1336| 1.72k| auto newr = newn->relaxed(); 1337| 1.72k| IMMER_TRY { ------------------ | | 49| 1.72k|#define IMMER_TRY try ------------------ 1338| 1.72k| auto subs = 1339| 1.72k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.72k] ------------------ 1340| 1.72k| : pos.towards_sub_oh( 1341| 1.72k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.72k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.72k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.72k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.72k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.72k, False: 0] ------------------ 1346| 1.72k| pos.copy_sizes( 1347| 1.72k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.72k| newr->d.count = newcount; 1349| 1.72k| newn->inner()[0] = get<1>(subs); 1350| 1.72k| std::copy(node->inner() + idx + 1, 1351| 1.72k| node->inner() + count, 1352| 1.72k| newn->inner() + 1); 1353| 1.72k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.72k, False: 0] ------------------ 1354| 1.72k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.72k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.72k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.72k| } 1358| 1.72k| return std::make_tuple(pos.shift(), newn); 1359| 1.72k| } 1360| 1.72k| 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.72k| } 1373| 1.72k| } _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.83k| { 1378| 3.83k| auto node = pos.node(); 1379| 3.83k| auto idx = pos.index(first); 1380| 3.83k| auto count = pos.count(); 1381| 3.83k| 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.83k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 1.56k, False: 2.26k] ------------------ 1384| 3.83k| if (mutate) { ------------------ | Branch (1384:13): [True: 1.56k, False: 2.26k] ------------------ 1385| 1.56k| auto data = node->leaf(); 1386| 1.56k| auto newcount = count - idx; 1387| 1.56k| std::move(data + idx, data + count, data); 1388| 1.56k| detail::destroy_n(data + newcount, idx); 1389| 1.56k| return std::make_tuple(0, node); 1390| 2.26k| } else { 1391| 2.26k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.26k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.26k, Folded] ------------------ 1393| 2.26k| pos.visit(dec_visitor{}); 1394| 2.26k| return std::make_tuple(0, newn); 1395| 2.26k| } 1396| 3.83k| } _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.64k| { 1304| 1.64k| auto idx = pos.subindex(first); 1305| 1.64k| auto count = pos.count(); 1306| 1.64k| auto node = pos.node(); 1307| 1.64k| 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.64k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 392, False: 1.25k] ------------------ 1312| 1.64k| auto left_size = pos.size_before(idx); 1313| 1.64k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.64k| auto dropped_size = first; 1315| 1.64k| auto child_dropped_size = dropped_size - left_size; 1316| 1.64k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.64k] | 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.64k| } else { 1325| 1.64k| 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.64k| auto newcount = count - idx; 1330| 1.64k| auto newn = 1331| 1.64k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 392, False: 1.25k] ------------------ 1332| 392| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 392| norefs_tag{})) relaxed_t, 1334| 392| node) 1335| 1.64k| : node_t::make_inner_r_e(e); 1336| 1.64k| auto newr = newn->relaxed(); 1337| 1.64k| IMMER_TRY { ------------------ | | 49| 1.64k|#define IMMER_TRY try ------------------ 1338| 1.64k| auto subs = 1339| 1.64k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 392, False: 1.25k] ------------------ 1340| 1.64k| : pos.towards_sub_oh( 1341| 1.25k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.64k| if (mutate) ------------------ | Branch (1342:21): [True: 392, False: 1.25k] ------------------ 1343| 392| pos.each_left(dec_visitor{}, idx); 1344| 1.64k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.64k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.64k, False: 0] ------------------ 1346| 1.64k| pos.copy_sizes( 1347| 1.64k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.64k| newr->d.count = newcount; 1349| 1.64k| newn->inner()[0] = get<1>(subs); 1350| 1.64k| std::copy(node->inner() + idx + 1, 1351| 1.64k| node->inner() + count, 1352| 1.64k| newn->inner() + 1); 1353| 1.64k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.25k, False: 392] ------------------ 1354| 1.25k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.25k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.25k, Folded] ------------------ 1356| 1.25k| pos.visit(dec_visitor{}); 1357| 1.25k| } 1358| 1.64k| return std::make_tuple(pos.shift(), newn); 1359| 1.64k| } 1360| 1.64k| 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.64k| } 1373| 1.64k| } _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| 49.6k| { 1378| 49.6k| auto node = pos.node(); 1379| 49.6k| auto idx = pos.index(first); 1380| 49.6k| auto count = pos.count(); 1381| 49.6k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 49.6k] ------------------ 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| 49.6k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 49.6k] ------------------ 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| 49.6k| } else { 1391| 49.6k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 49.6k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 49.6k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 49.6k| return std::make_tuple(0, newn); 1395| 49.6k| } 1396| 49.6k| } _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.07k| { 1304| 1.07k| auto idx = pos.subindex(first); 1305| 1.07k| auto count = pos.count(); 1306| 1.07k| auto node = pos.node(); 1307| 1.07k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.07k] ------------------ 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.07k| auto left_size = pos.size_before(idx); 1313| 1.07k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.07k| auto dropped_size = first; 1315| 1.07k| auto child_dropped_size = dropped_size - left_size; 1316| 1.07k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.07k] | 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.07k| } else { 1325| 1.07k| 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.07k| auto newcount = count - idx; 1330| 1.07k| auto newn = 1331| 1.07k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.07k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.07k| : node_t::make_inner_r_e(e); 1336| 1.07k| auto newr = newn->relaxed(); 1337| 1.07k| IMMER_TRY { ------------------ | | 49| 1.07k|#define IMMER_TRY try ------------------ 1338| 1.07k| auto subs = 1339| 1.07k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.07k] ------------------ 1340| 1.07k| : pos.towards_sub_oh( 1341| 1.07k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.07k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.07k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.07k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.07k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.07k, False: 0] ------------------ 1346| 1.07k| pos.copy_sizes( 1347| 1.07k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.07k| newr->d.count = newcount; 1349| 1.07k| newn->inner()[0] = get<1>(subs); 1350| 1.07k| std::copy(node->inner() + idx + 1, 1351| 1.07k| node->inner() + count, 1352| 1.07k| newn->inner() + 1); 1353| 1.07k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.07k, False: 0] ------------------ 1354| 1.07k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.07k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.07k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.07k| } 1358| 1.07k| return std::make_tuple(pos.shift(), newn); 1359| 1.07k| } 1360| 1.07k| 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.07k| } 1373| 1.07k| } _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| 166k| { 1247| 166k| auto idx = pos.subindex(first); 1248| 166k| auto count = pos.count(); 1249| 166k| auto node = pos.node(); 1250| 166k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 166k, Folded] | Branch (1250:47): [True: 128k, False: 38.0k] ------------------ 1251| 166k| auto left_size = pos.size_before(idx); 1252| 166k| auto child_size = pos.size_sbh(idx, left_size); 1253| 166k| auto dropped_size = first; 1254| 166k| auto child_dropped_size = dropped_size - left_size; 1255| 166k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 166k] | 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| 166k| } else { 1264| 166k| using std::get; 1265| 166k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 128k, False: 38.0k] ------------------ 1266| 166k| : node_t::make_inner_r_e(e); 1267| 166k| auto newr = newn->relaxed(); 1268| 166k| auto newcount = count - idx; 1269| 166k| auto new_child_size = child_size - child_dropped_size; 1270| 166k| IMMER_TRY { ------------------ | | 49| 166k|#define IMMER_TRY try ------------------ 1271| 166k| auto subs = 1272| 166k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 128k, False: 38.0k] ------------------ 1273| 166k| : pos.towards_sub_oh( 1274| 38.0k| no_collapse_no_mut_t{}, first, idx, e); 1275| 166k| if (mutate) ------------------ | Branch (1275:21): [True: 128k, False: 38.0k] ------------------ 1276| 128k| pos.each_left(dec_visitor{}, idx); 1277| 166k| pos.copy_sizes( 1278| 166k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 166k| std::copy(node->inner() + idx + 1, 1280| 166k| node->inner() + count, 1281| 166k| newn->inner() + 1); 1282| 166k| newn->inner()[0] = get<1>(subs); 1283| 166k| newr->d.sizes[0] = new_child_size; 1284| 166k| newr->d.count = newcount; 1285| 166k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 166k, False: 0] ------------------ 1286| 166k| if (!mutate) { ------------------ | Branch (1286:21): [True: 38.0k, False: 128k] ------------------ 1287| 38.0k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 38.0k| if (Mutating) ------------------ | Branch (1288:25): [True: 38.0k, Folded] ------------------ 1289| 38.0k| pos.visit(dec_visitor{}); 1290| 38.0k| } 1291| 166k| return std::make_tuple(pos.shift(), newn); 1292| 166k| } 1293| 166k| 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| 166k| } 1299| 166k| } _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| 84.1k| { 1247| 84.1k| auto idx = pos.subindex(first); 1248| 84.1k| auto count = pos.count(); 1249| 84.1k| auto node = pos.node(); 1250| 84.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 84.1k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 84.1k| auto left_size = pos.size_before(idx); 1252| 84.1k| auto child_size = pos.size_sbh(idx, left_size); 1253| 84.1k| auto dropped_size = first; 1254| 84.1k| auto child_dropped_size = dropped_size - left_size; 1255| 84.1k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 84.1k] | 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| 84.1k| } else { 1264| 84.1k| using std::get; 1265| 84.1k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 84.1k] ------------------ 1266| 84.1k| : node_t::make_inner_r_e(e); 1267| 84.1k| auto newr = newn->relaxed(); 1268| 84.1k| auto newcount = count - idx; 1269| 84.1k| auto new_child_size = child_size - child_dropped_size; 1270| 84.1k| IMMER_TRY { ------------------ | | 49| 84.1k|#define IMMER_TRY try ------------------ 1271| 84.1k| auto subs = 1272| 84.1k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 84.1k] ------------------ 1273| 84.1k| : pos.towards_sub_oh( 1274| 84.1k| no_collapse_no_mut_t{}, first, idx, e); 1275| 84.1k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 84.1k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 84.1k| pos.copy_sizes( 1278| 84.1k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 84.1k| std::copy(node->inner() + idx + 1, 1280| 84.1k| node->inner() + count, 1281| 84.1k| newn->inner() + 1); 1282| 84.1k| newn->inner()[0] = get<1>(subs); 1283| 84.1k| newr->d.sizes[0] = new_child_size; 1284| 84.1k| newr->d.count = newcount; 1285| 84.1k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 84.1k, False: 0] ------------------ 1286| 84.1k| if (!mutate) { ------------------ | Branch (1286:21): [True: 84.1k, False: 0] ------------------ 1287| 84.1k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 84.1k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 84.1k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 84.1k| } 1291| 84.1k| return std::make_tuple(pos.shift(), newn); 1292| 84.1k| } 1293| 84.1k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 84.1k| } 1299| 84.1k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 6.99k| { 1304| 6.99k| auto idx = pos.subindex(first); 1305| 6.99k| auto count = pos.count(); 1306| 6.99k| auto node = pos.node(); 1307| 6.99k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 6.99k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 4.85k, False: 2.14k] ------------------ 1312| 6.99k| auto left_size = pos.size_before(idx); 1313| 6.99k| auto child_size = pos.size_sbh(idx, left_size); 1314| 6.99k| auto dropped_size = first; 1315| 6.99k| auto child_dropped_size = dropped_size - left_size; 1316| 6.99k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 6.99k, Folded] | Branch (1316:25): [True: 4.62k, False: 2.37k] | Branch (1316:45): [True: 2.95k, False: 1.67k] ------------------ 1317| 2.95k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 2.22k, False: 731] ------------------ 1318| 2.95k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 2.95k| if (mutate) ------------------ | Branch (1319:17): [True: 2.22k, False: 731] ------------------ 1320| 2.22k| pos.visit(dec_left_visitor{}, idx); 1321| 731| else if (Mutating) ------------------ | Branch (1321:22): [True: 731, Folded] ------------------ 1322| 731| pos.visit(dec_visitor{}); 1323| 2.95k| return r; 1324| 4.04k| } else { 1325| 4.04k| 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.04k| auto newcount = count - idx; 1330| 4.04k| auto newn = 1331| 4.04k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 2.62k, False: 1.41k] ------------------ 1332| 2.62k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 2.62k| norefs_tag{})) relaxed_t, 1334| 2.62k| node) 1335| 4.04k| : node_t::make_inner_r_e(e); 1336| 4.04k| auto newr = newn->relaxed(); 1337| 4.04k| IMMER_TRY { ------------------ | | 49| 4.04k|#define IMMER_TRY try ------------------ 1338| 4.04k| auto subs = 1339| 4.04k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 2.62k, False: 1.41k] ------------------ 1340| 4.04k| : pos.towards_sub_oh( 1341| 1.41k| no_collapse_no_mut_t{}, first, idx, e); 1342| 4.04k| if (mutate) ------------------ | Branch (1342:21): [True: 2.62k, False: 1.41k] ------------------ 1343| 2.62k| pos.each_left(dec_visitor{}, idx); 1344| 4.04k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 4.04k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 4.04k, False: 0] ------------------ 1346| 4.04k| pos.copy_sizes( 1347| 4.04k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 4.04k| newr->d.count = newcount; 1349| 4.04k| newn->inner()[0] = get<1>(subs); 1350| 4.04k| std::copy(node->inner() + idx + 1, 1351| 4.04k| node->inner() + count, 1352| 4.04k| newn->inner() + 1); 1353| 4.04k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.41k, False: 2.62k] ------------------ 1354| 1.41k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.41k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.41k, Folded] ------------------ 1356| 1.41k| pos.visit(dec_visitor{}); 1357| 1.41k| } 1358| 4.04k| return std::make_tuple(pos.shift(), newn); 1359| 4.04k| } 1360| 4.04k| 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.04k| } 1373| 6.99k| } _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.16k| { 1304| 1.16k| auto idx = pos.subindex(first); 1305| 1.16k| auto count = pos.count(); 1306| 1.16k| auto node = pos.node(); 1307| 1.16k| 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.16k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 747, False: 419] ------------------ 1312| 1.16k| auto left_size = pos.size_before(idx); 1313| 1.16k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.16k| auto dropped_size = first; 1315| 1.16k| auto child_dropped_size = dropped_size - left_size; 1316| 1.16k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 1.16k, Folded] | Branch (1316:25): [True: 201, False: 965] | Branch (1316:45): [True: 0, False: 201] ------------------ 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.16k| } else { 1325| 1.16k| 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.16k| auto newcount = count - idx; 1330| 1.16k| auto newn = 1331| 1.16k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 747, False: 419] ------------------ 1332| 747| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 747| norefs_tag{})) relaxed_t, 1334| 747| node) 1335| 1.16k| : node_t::make_inner_r_e(e); 1336| 1.16k| auto newr = newn->relaxed(); 1337| 1.16k| IMMER_TRY { ------------------ | | 49| 1.16k|#define IMMER_TRY try ------------------ 1338| 1.16k| auto subs = 1339| 1.16k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 747, False: 419] ------------------ 1340| 1.16k| : pos.towards_sub_oh( 1341| 419| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.16k| if (mutate) ------------------ | Branch (1342:21): [True: 747, False: 419] ------------------ 1343| 747| pos.each_left(dec_visitor{}, idx); 1344| 1.16k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.16k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.16k, False: 0] ------------------ 1346| 1.16k| pos.copy_sizes( 1347| 1.16k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.16k| newr->d.count = newcount; 1349| 1.16k| newn->inner()[0] = get<1>(subs); 1350| 1.16k| std::copy(node->inner() + idx + 1, 1351| 1.16k| node->inner() + count, 1352| 1.16k| newn->inner() + 1); 1353| 1.16k| if (!mutate) { ------------------ | Branch (1353:21): [True: 419, False: 747] ------------------ 1354| 419| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 419| if (Mutating) ------------------ | Branch (1355:25): [True: 419, Folded] ------------------ 1356| 419| pos.visit(dec_visitor{}); 1357| 419| } 1358| 1.16k| return std::make_tuple(pos.shift(), newn); 1359| 1.16k| } 1360| 1.16k| 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.16k| } 1373| 1.16k| } _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| 11.4k| { 350| 11.4k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 11.4k, False: 0] ------------------ 351| 11.4k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 10.6k, False: 800] ------------------ 352| 11.4k| ? visit_maybe_relaxed_sub(rootl, 353| 10.6k| shiftl, 354| 10.6k| sizel, 355| 10.6k| this_t{}, 356| 10.6k| posr, 357| 10.6k| first, 358| 10.6k| size_t{}) 359| 11.4k| : posr.first_sub_inner( 360| 800| rrb{}, first, rootl, shiftl, sizel); 361| 11.4k| } _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| 29.4k| { 383| 29.4k| auto nl = posl.node(); 384| 29.4k| auto nr = posr.node(); 385| 29.4k| if (nl == nr) ------------------ | Branch (385:13): [True: 10.0k, False: 19.3k] ------------------ 386| 10.0k| return true; 387| 19.3k| auto cl = posl.count(); 388| 19.3k| auto cr = posr.count(); 389| 19.3k| assert(cr > 0); ------------------ | Branch (389:9): [True: 19.3k, False: 0] ------------------ 390| 19.3k| auto sbr = size_t{}; 391| 19.3k| auto i = count_t{}; 392| 19.3k| auto j = count_t{}; 393| 100k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 88.4k, False: 12.3k] ------------------ 394| 88.4k| auto sbl = posl.size_before(i); 395| 157k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 138k, False: 18.9k] | Branch (395:34): [True: 68.7k, False: 69.4k] ------------------ 396| 68.7k| ; 397| 88.4k| auto res = 398| 88.4k| sbl == sbr ------------------ | Branch (398:17): [True: 42.9k, False: 45.5k] ------------------ 399| 88.4k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 88.4k| : posl.nth_sub(i, 401| 45.5k| for_each_chunk_p_visitor{}, 402| 45.5k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 88.4k| if (!res) ------------------ | Branch (403:17): [True: 7.04k, False: 81.4k] ------------------ 404| 7.04k| return false; 405| 88.4k| } 406| 12.3k| return true; 407| 19.3k| } _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.9k| { 337| 18.9k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 18.9k| } _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.7k| { 428| 19.7k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 12.7k, False: 6.94k] ------------------ 429| 12.7k| return true; 430| 6.94k| auto cl = posl.count(); 431| 6.94k| auto cr = posr.count(); 432| 6.94k| auto mp = std::min(cl, cr); 433| 6.94k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 5.60k, False: 1.33k] ------------------ 434| 6.94k| posl.node()->leaf() + mp, 435| 6.94k| posr.node()->leaf()) && 436| 5.60k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 5.37k, False: 227] ------------------ 437| 5.60k| posl.node()->leaf() + posl.count(), 438| 5.60k| first + (idx + mp)); 439| 19.7k| } _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| 21.6k| { 330| 21.6k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 21.6k| } _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.10k| { 413| 4.10k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.10k| } _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.10k| { 383| 4.10k| auto nl = posl.node(); 384| 4.10k| auto nr = posr.node(); 385| 4.10k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.10k] ------------------ 386| 0| return true; 387| 4.10k| auto cl = posl.count(); 388| 4.10k| auto cr = posr.count(); 389| 4.10k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.10k, False: 0] ------------------ 390| 4.10k| auto sbr = size_t{}; 391| 4.10k| auto i = count_t{}; 392| 4.10k| auto j = count_t{}; 393| 12.4k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 10.0k, False: 2.42k] ------------------ 394| 10.0k| auto sbl = posl.size_before(i); 395| 15.8k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 13.0k, False: 2.87k] | Branch (395:34): [True: 5.87k, False: 7.14k] ------------------ 396| 5.87k| ; 397| 10.0k| auto res = 398| 10.0k| sbl == sbr ------------------ | Branch (398:17): [True: 6.67k, False: 3.34k] ------------------ 399| 10.0k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 10.0k| : posl.nth_sub(i, 401| 3.34k| for_each_chunk_p_visitor{}, 402| 3.34k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 10.0k| if (!res) ------------------ | Branch (403:17): [True: 1.68k, False: 8.34k] ------------------ 404| 1.68k| return false; 405| 10.0k| } 406| 2.42k| return true; 407| 4.10k| } _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.96k| { 337| 3.96k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 3.96k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_12leaf_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 10.8k| { 428| 10.8k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 8.57k, False: 2.31k] ------------------ 429| 8.57k| return true; 430| 2.31k| auto cl = posl.count(); 431| 2.31k| auto cr = posr.count(); 432| 2.31k| auto mp = std::min(cl, cr); 433| 2.31k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 1.88k, False: 432] ------------------ 434| 2.31k| posl.node()->leaf() + mp, 435| 2.31k| posr.node()->leaf()) && 436| 1.88k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 1.66k, False: 225] ------------------ 437| 1.88k| posl.node()->leaf() + posl.count(), 438| 1.88k| first + (idx + mp)); 439| 10.8k| } _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.15k| { 330| 2.15k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.15k| } _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.14k| { 413| 2.14k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.14k| } _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.14k| { 383| 2.14k| auto nl = posl.node(); 384| 2.14k| auto nr = posr.node(); 385| 2.14k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.14k] ------------------ 386| 0| return true; 387| 2.14k| auto cl = posl.count(); 388| 2.14k| auto cr = posr.count(); 389| 2.14k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.14k, False: 0] ------------------ 390| 2.14k| auto sbr = size_t{}; 391| 2.14k| auto i = count_t{}; 392| 2.14k| auto j = count_t{}; 393| 16.2k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 14.5k, False: 1.73k] ------------------ 394| 14.5k| auto sbl = posl.size_before(i); 395| 24.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 20.1k, False: 4.59k] | Branch (395:34): [True: 10.1k, False: 9.94k] ------------------ 396| 10.1k| ; 397| 14.5k| auto res = 398| 14.5k| sbl == sbr ------------------ | Branch (398:17): [True: 9.02k, False: 5.52k] ------------------ 399| 14.5k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 14.5k| : posl.nth_sub(i, 401| 5.52k| for_each_chunk_p_visitor{}, 402| 5.52k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 14.5k| if (!res) ------------------ | Branch (403:17): [True: 410, False: 14.1k] ------------------ 404| 410| return false; 405| 14.5k| } 406| 1.73k| return true; 407| 2.14k| } _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.73k| { 337| 7.73k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 7.73k| } _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| 458| { 330| 458| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 458| } _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| 829| { 330| 829| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 829| } _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| 26.7k| { 444| 26.7k| auto node = pos.node(); 445| 26.7k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 17.8k, False: 8.84k] | Branch (445:33): [True: 3.62k, False: 5.21k] ------------------ 446| 26.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| 33.8k| { 451| 33.8k| auto node = pos.node(); 452| 33.8k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 22.1k, False: 11.6k] | Branch (452:33): [True: 7.18k, False: 4.50k] ------------------ 453| 11.6k| node->leaf() + pos.count(), 454| 11.6k| other->leaf()); 455| 33.8k| } _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| 12.2k| { 444| 12.2k| auto node = pos.node(); 445| 12.2k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 4.01k, False: 8.24k] | Branch (445:33): [True: 3.38k, False: 4.85k] ------------------ 446| 12.2k| } _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.27k| { 451| 3.27k| auto node = pos.node(); 452| 3.27k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.82k, False: 1.45k] | Branch (452:33): [True: 712, False: 738] ------------------ 453| 1.45k| node->leaf() + pos.count(), 454| 1.45k| other->leaf()); 455| 3.27k| } _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.97k| { 444| 4.97k| auto node = pos.node(); 445| 4.97k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 849, False: 4.13k] | Branch (445:33): [True: 2.98k, False: 1.14k] ------------------ 446| 4.97k| } _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| 376k| { 113| 376k| auto data = as_const(pos.node()->leaf()); 114| 376k| return fn(data, data + pos.count()); 115| 376k| } _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.54M| return [iter](auto f, auto e) mutable { 368| 1.54M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 160k, False: 1.38M] ------------------ 369| 160k| iter += e - f; 370| 160k| return true; 371| 160k| } 372| 11.6M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 10.2M, False: 1.37M] ------------------ 373| 10.2M| if (*f != *iter) ------------------ | Branch (373:21): [True: 2.78k, False: 10.2M] ------------------ 374| 2.78k| return false; 375| 1.37M| return true; 376| 1.38M| }; _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.73M| { 54| 5.73M| return pos.towards(this_t{}, idx); 55| 5.73M| } _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.19M| { 60| 1.19M| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 1.19M| } _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| 403k| { 54| 403k| return pos.towards(this_t{}, idx); 55| 403k| } _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| 384k| { 60| 384k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 384k| } _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| 622k| { 54| 622k| return pos.towards(this_t{}, idx); 55| 622k| } _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.9k| { 60| 18.9k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 18.9k| } _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| 59.1k| { 54| 59.1k| return pos.towards(this_t{}, idx); 55| 59.1k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 41.6k| { 107| 41.6k| return pos.each_pred(this_t{}, fn); 108| 41.6k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 558| { 330| 558| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 558| } _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| 11.3k| { 420| 11.3k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 11.3k, False: 0] ------------------ 421| 11.3k| ? this_t::visit_regular(posl, posr.node()) 422| 11.3k| : this_t::visit_regular(posr, posl.node()); 423| 11.3k| } _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.15M| { 113| 1.15M| auto data = as_const(pos.node()->leaf()); 114| 1.15M| return fn(data, data + pos.count()); 115| 1.15M| } _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| 14.0k| { 107| 14.0k| return pos.each_pred(this_t{}, fn); 108| 14.0k| } _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.7k| { 113| 12.7k| auto data = as_const(pos.node()->leaf()); 114| 12.7k| return fn(data, data + pos.count()); 115| 12.7k| } _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.16k| { 107| 5.16k| return pos.each_pred(this_t{}, fn); 108| 5.16k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 2.89k| { 330| 2.89k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.89k| } _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.34k| { 383| 2.34k| auto nl = posl.node(); 384| 2.34k| auto nr = posr.node(); 385| 2.34k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.34k] ------------------ 386| 0| return true; 387| 2.34k| auto cl = posl.count(); 388| 2.34k| auto cr = posr.count(); 389| 2.34k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.34k, False: 0] ------------------ 390| 2.34k| auto sbr = size_t{}; 391| 2.34k| auto i = count_t{}; 392| 2.34k| auto j = count_t{}; 393| 8.65k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 7.48k, False: 1.17k] ------------------ 394| 7.48k| auto sbl = posl.size_before(i); 395| 11.9k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 9.63k, False: 2.28k] | Branch (395:34): [True: 4.44k, False: 5.19k] ------------------ 396| 4.44k| ; 397| 7.48k| auto res = 398| 7.48k| sbl == sbr ------------------ | Branch (398:17): [True: 4.43k, False: 3.04k] ------------------ 399| 7.48k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 7.48k| : posl.nth_sub(i, 401| 3.04k| for_each_chunk_p_visitor{}, 402| 3.04k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 7.48k| if (!res) ------------------ | Branch (403:17): [True: 1.16k, False: 6.31k] ------------------ 404| 1.16k| return false; 405| 7.48k| } 406| 1.17k| return true; 407| 2.34k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 5.92k| { 337| 5.92k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 5.92k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_13full_leaf_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 5.92k| { 428| 5.92k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 4.45k, False: 1.46k] ------------------ 429| 4.45k| return true; 430| 1.46k| auto cl = posl.count(); 431| 1.46k| auto cr = posr.count(); 432| 1.46k| auto mp = std::min(cl, cr); 433| 1.46k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 1.15k, False: 310] ------------------ 434| 1.46k| posl.node()->leaf() + mp, 435| 1.46k| posr.node()->leaf()) && 436| 1.15k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 1.15k, False: 0] ------------------ 437| 1.15k| posl.node()->leaf() + posl.count(), 438| 1.15k| first + (idx + mp)); 439| 5.92k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 2.03k| { 330| 2.03k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.03k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_8full_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 1.16k| { 383| 1.16k| auto nl = posl.node(); 384| 1.16k| auto nr = posr.node(); 385| 1.16k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.16k] ------------------ 386| 0| return true; 387| 1.16k| auto cl = posl.count(); 388| 1.16k| auto cr = posr.count(); 389| 1.16k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.16k, False: 0] ------------------ 390| 1.16k| auto sbr = size_t{}; 391| 1.16k| auto i = count_t{}; 392| 1.16k| auto j = count_t{}; 393| 8.12k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 7.22k, False: 903] ------------------ 394| 7.22k| auto sbl = posl.size_before(i); 395| 13.2k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 12.4k, False: 763] | Branch (395:34): [True: 6.01k, False: 6.45k] ------------------ 396| 6.01k| ; 397| 7.22k| auto res = 398| 7.22k| sbl == sbr ------------------ | Branch (398:17): [True: 4.03k, False: 3.19k] ------------------ 399| 7.22k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 7.22k| : posl.nth_sub(i, 401| 3.19k| for_each_chunk_p_visitor{}, 402| 3.19k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 7.22k| if (!res) ------------------ | Branch (403:17): [True: 262, False: 6.96k] ------------------ 404| 262| return false; 405| 7.22k| } 406| 903| return true; 407| 1.16k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_8full_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 419| 866| { 420| 866| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 866, False: 0] ------------------ 421| 866| ? this_t::visit_regular(posl, posr.node()) 422| 866| : this_t::visit_regular(posr, posl.node()); 423| 866| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 172k| { 107| 172k| return pos.each_pred(this_t{}, fn); 108| 172k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaOT_: 366| 60.6k| { 367| 60.6k| return [iter](auto f, auto e) mutable { 368| 60.6k| if (f == &*iter) { 369| 60.6k| iter += e - f; 370| 60.6k| return true; 371| 60.6k| } 372| 60.6k| for (; f != e; ++f, ++iter) 373| 60.6k| if (*f != *iter) 374| 60.6k| return false; 375| 60.6k| return true; 376| 60.6k| }; 377| 60.6k| } _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: 800, False: 261] ------------------ 352| 1.06k| ? visit_maybe_relaxed_sub(rootl, 353| 800| shiftl, 354| 800| sizel, 355| 800| this_t{}, 356| 800| posr, 357| 800| first, 358| 800| 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| 10.8k| { 350| 10.8k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 10.8k, False: 0] ------------------ 351| 10.8k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 10.8k, False: 0] ------------------ 352| 10.8k| ? visit_maybe_relaxed_sub(rootl, 353| 10.8k| shiftl, 354| 10.8k| sizel, 355| 10.8k| this_t{}, 356| 10.8k| posr, 357| 10.8k| first, 358| 10.8k| size_t{}) 359| 10.8k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 10.8k| } _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.90k| { 451| 7.90k| auto node = pos.node(); 452| 7.90k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.59k, False: 6.31k] | Branch (452:33): [True: 1.95k, False: 4.35k] ------------------ 453| 6.31k| node->leaf() + pos.count(), 454| 6.31k| other->leaf()); 455| 7.90k| } _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| 233M|{ 1839| 233M| assert(node); ------------------ | Branch (1839:5): [True: 233M, False: 0] ------------------ 1840| 233M| auto relaxed = node->relaxed(); 1841| 233M| if (relaxed) { ------------------ | Branch (1841:9): [True: 216M, False: 16.3M] ------------------ 1842| 216M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 216M, False: 0] ------------------ 1843| 216M| return make_relaxed_pos(node, shift, relaxed) 1844| 216M| .visit(v, std::forward(args)...); 1845| 216M| } else { 1846| 16.3M| return make_regular_sub_pos(node, shift, size) 1847| 16.3M| .visit(v, std::forward(args)...); 1848| 16.3M| } 1849| 233M|} _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| 609M|{ 1829| 609M| assert(node); ------------------ | Branch (1829:5): [True: 609M, False: 0] ------------------ 1830| 609M| assert(relaxed); ------------------ | Branch (1830:5): [True: 609M, False: 0] ------------------ 1831| 609M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 609M, False: 0] ------------------ 1832| 609M| return {node, shift, relaxed}; 1833| 609M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 246M| { 1814| 246M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 246M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 1431| 411M| 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| 48.3M| { 1477| 48.3M| each_left(v, relaxed_->d.count, args...); 1478| 48.3M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 48.5M| { 1624| 48.5M| auto p = node_->inner(); 1625| 48.5M| auto s = size_t{}; 1626| 48.5M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 11.2M, False: 37.2M] ------------------ 1627| 91.9M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 80.6M, False: 11.2M] ------------------ 1628| 80.6M| IMMER_PREFETCH(p + i + 1); 1629| 80.6M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 80.6M| .visit(v, args...); 1631| 80.6M| s = relaxed_->d.sizes[i]; 1632| 80.6M| assert(s); ------------------ | Branch (1632:17): [True: 80.6M, False: 0] ------------------ 1633| 80.6M| } 1634| 37.2M| } else { 1635| 37.2M| auto ss = shift_ - B; 1636| 267M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 230M, False: 37.2M] ------------------ 1637| 230M| visit_maybe_relaxed_sub( 1638| 230M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 230M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 230M, False: 0] ------------------ 1641| 230M| } 1642| 37.2M| } 1643| 48.5M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 1430| 376M| count_t count() const { return relaxed_->d.count; } _ZN5immer6detail4rbts20make_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_15regular_sub_posIT_EEPSE_jm: 1044| 27.6M|{ 1045| 27.6M| assert(node); ------------------ | Branch (1045:5): [True: 27.6M, False: 0] ------------------ 1046| 27.6M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 27.6M, False: 0] ------------------ 1047| 27.6M| assert(size > 0); ------------------ | Branch (1047:5): [True: 27.6M, False: 0] ------------------ 1048| 27.6M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 27.6M, False: 0] ------------------ 1049| 27.6M| return {node, shift, size}; 1050| 27.6M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1036| 16.3M| { 1037| 16.3M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 16.3M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 785| 29.0M| node_t* node() const { return node_; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 825| 1.13M| { 826| 1.13M| return each_regular(*this, v, args...); 827| 1.13M| } _ZN5immer6detail4rbts12each_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_DpOT1_: 343| 1.13M|{ 344| 1.13M| constexpr auto B = bits; 345| 1.13M| constexpr auto BL = bits_leaf; 346| 1.13M| auto n = p.node()->inner(); 347| 1.13M| auto last = p.count() - 1; 348| 1.13M| auto e = n + last; 349| 1.13M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 87.3k, False: 1.05M] ------------------ 350| 280k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 192k, False: 87.3k] ------------------ 351| 192k| IMMER_PREFETCH(n + 1); 352| 192k| make_full_leaf_pos(*n).visit(v, args...); 353| 192k| } 354| 87.3k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 1.05M| } else { 356| 1.05M| auto ss = p.shift() - B; 357| 3.51M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 2.46M, False: 1.05M] ------------------ 358| 2.46M| make_full_pos(*n, ss).visit(v, args...); 359| 1.05M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 1.05M| } 361| 1.13M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 787| 13.0M| shift_t shift() const { return shift_; } _ZN5immer6detail4rbts18make_full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_13full_leaf_posIT_EEPSE_: 214| 15.7M|{ 215| 15.7M| assert(node); ------------------ | Branch (215:5): [True: 15.7M, False: 0] ------------------ 216| 15.7M| return {node}; 217| 15.7M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 4.24M| { 208| 4.24M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 4.24M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 199| 10.6M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 198| 12.0M| 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.57M|{ 120| 2.57M| assert(node); ------------------ | Branch (120:5): [True: 2.57M, False: 0] ------------------ 121| 2.57M| assert(size > 0); ------------------ | Branch (121:5): [True: 2.57M, False: 0] ------------------ 122| 2.57M| return {node, size}; 123| 2.57M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 786| 10.4M| size_t size() const { return size_; } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 112| 1.09M| { 113| 1.09M| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.09M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 104| 2.58M| 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.53M| 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.56M| count_t index(size_t idx) const { return idx & mask; } _ZN5immer6detail4rbts13make_full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_8full_posIT_EEPSE_j: 1412| 11.5M|{ 1413| 11.5M| assert(node); ------------------ | Branch (1413:5): [True: 11.5M, False: 0] ------------------ 1414| 11.5M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 11.5M, False: 0] ------------------ 1415| 11.5M| return {node, shift}; 1416| 11.5M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 9.41M| { 1406| 9.41M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 9.41M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 1159| 10.1M| node_t* node() const { return node_; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 1185| 103k| { 1186| 103k| auto p = node_->inner(); 1187| 103k| auto e = p + branches; 1188| 103k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 89.7k, False: 13.4k] ------------------ 1189| 807k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 718k, False: 89.7k] ------------------ 1190| 718k| IMMER_PREFETCH(p + 1); 1191| 718k| make_full_leaf_pos(*p).visit(v, args...); 1192| 718k| } 1193| 89.7k| } else { 1194| 13.4k| auto ss = shift_ - B; 1195| 121k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 107k, False: 13.4k] ------------------ 1196| 107k| make_full_pos(*p, ss).visit(v, args...); 1197| 13.4k| } 1198| 103k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 1158| 1.51M| count_t count() const { return branches; } _ZN5immer6detail4rbts16make_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_11regular_posIT_EEPSE_jm: 690| 9.61M|{ 691| 9.61M| assert(node); ------------------ | Branch (691:5): [True: 9.61M, False: 0] ------------------ 692| 9.61M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 9.61M, False: 0] ------------------ 693| 9.61M| assert(size > 0); ------------------ | Branch (693:5): [True: 9.61M, False: 0] ------------------ 694| 9.61M| return {node, shift, size}; 695| 9.61M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 4.10M| { 337| 4.10M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.10M| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 231| 17.8M| 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.04M| { 244| 4.04M| return each_regular(*this, v, args...); 245| 4.04M| } _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.04M|{ 344| 4.04M| constexpr auto B = bits; 345| 4.04M| constexpr auto BL = bits_leaf; 346| 4.04M| auto n = p.node()->inner(); 347| 4.04M| auto last = p.count() - 1; 348| 4.04M| auto e = n + last; 349| 4.04M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 1.00M, False: 3.04M] ------------------ 350| 4.30M| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 3.30M, False: 1.00M] ------------------ 351| 3.30M| IMMER_PREFETCH(n + 1); 352| 3.30M| make_full_leaf_pos(*n).visit(v, args...); 353| 3.30M| } 354| 1.00M| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 3.04M| } else { 356| 3.04M| auto ss = p.shift() - B; 357| 9.86M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 6.81M, False: 3.04M] ------------------ 358| 6.81M| make_full_pos(*n, ss).visit(v, args...); 359| 3.04M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 3.04M| } 361| 4.04M|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 233| 16.7M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 232| 24.5M| size_t size() const { return size_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 230| 12.3M| count_t count() const { return index(size_ - 1) + 1; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 234| 23.3M| count_t index(size_t idx) const { return (idx >> shift_) & mask; } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5countEv: 784| 21.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| 24.5M| count_t subindex(size_t idx) const { return idx >> shift_; } _ZN5immer6detail4rbts22make_empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_17empty_regular_posIT_EEPSE_: 64| 2.92M|{ 65| 2.92M| return {node}; 66| 2.92M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 2.92M| { 58| 2.92M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 2.92M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 41| 2.92M| 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| 121M|{ 152| 121M| assert(node); ------------------ | Branch (152:5): [True: 121M, False: 0] ------------------ 153| 121M| assert(count <= branches); ------------------ | Branch (153:5): [True: 121M, False: 0] ------------------ 154| 121M| return {node, count}; 155| 121M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 88.0M| { 145| 88.0M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 88.0M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 136| 107M| 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| 34.7M| count_t count() const { return count_; } _ZN5immer6detail4rbts19make_empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_14empty_leaf_posIT_EEPSE_: 88| 2.76M|{ 89| 2.76M| assert(node); ------------------ | Branch (89:5): [True: 2.76M, False: 0] ------------------ 90| 2.76M| return {node}; 91| 2.76M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 2.76M| { 82| 2.76M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 2.76M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4nodeEv: 75| 2.76M| 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.6k| 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| 505k| { 1814| 505k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 505k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 1433| 36.7M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEj: 1443| 17.9M| { 1444| 17.9M| return size_sbh(offset, size_before(offset)); 1445| 17.9M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8size_sbhEjm: 1448| 18.3M| { 1449| 18.3M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 18.3M, False: 0] ------------------ 1450| 18.3M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 18.3M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11size_beforeEj: 1438| 68.6M| { 1439| 68.6M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 44.0M, False: 24.5M] ------------------ 1440| 68.6M| } _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| 489k| { 1738| 489k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 489k, False: 0] ------------------ 1739| 489k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 489k, False: 0] ------------------ 1740| 489k| auto child = node_->inner()[offset_hint]; 1741| 489k| auto is_leaf = shift_ == BL; 1742| 489k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 489k] ------------------ 1743| 489k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 489k| : visit_maybe_relaxed_sub( 1745| 489k| child, shift_ - B, child_size_hint, v, args...); 1746| 489k| } _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| 489k|{ 1839| 489k| assert(node); ------------------ | Branch (1839:5): [True: 489k, False: 0] ------------------ 1840| 489k| auto relaxed = node->relaxed(); 1841| 489k| if (relaxed) { ------------------ | Branch (1841:9): [True: 184k, False: 305k] ------------------ 1842| 184k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 184k, False: 0] ------------------ 1843| 184k| return make_relaxed_pos(node, shift, relaxed) 1844| 184k| .visit(v, std::forward(args)...); 1845| 305k| } else { 1846| 305k| return make_regular_sub_pos(node, shift, size) 1847| 305k| .visit(v, std::forward(args)...); 1848| 305k| } 1849| 489k|} _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| 305k| { 1037| 305k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 305k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 788| 3.70M| count_t index(size_t idx) const { return (idx >> shift_) & mask; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7last_ohINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_jDpOT0_: 952| 1.00M| { 953| 1.00M| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.00M| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_: 677| 1.00M|{ 678| 1.00M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.00M, False: 0] ------------------ 679| 1.00M| constexpr auto B = bits; 680| 1.00M| constexpr auto BL = bits_leaf; 681| 1.00M| auto child = p.node()->inner()[offset_hint]; 682| 1.00M| auto is_leaf = p.shift() == BL; 683| 1.00M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.00M] ------------------ 684| 1.00M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.00M| .visit(v, args...); 686| 1.00M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 336| 3.91M| { 337| 3.91M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.91M| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7last_ohINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_jDpOT0_: 330| 2.90M| { 331| 2.90M| return last_oh_regular(*this, v, offset_hint, args...); 332| 2.90M| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_: 677| 2.90M|{ 678| 2.90M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 2.90M, False: 0] ------------------ 679| 2.90M| constexpr auto B = bits; 680| 2.90M| constexpr auto BL = bits_leaf; 681| 2.90M| auto child = p.node()->inner()[offset_hint]; 682| 2.90M| auto is_leaf = p.shift() == BL; 683| 2.90M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 2.90M] ------------------ 684| 2.90M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 2.90M| .visit(v, args...); 686| 2.90M|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 1432| 163M| 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| 758k| { 1037| 758k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 758k| } 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| 98.6k| { 145| 98.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 98.6k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 139| 1.40M| 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| 180k|{ 1839| 180k| assert(node); ------------------ | Branch (1839:5): [True: 180k, False: 0] ------------------ 1840| 180k| auto relaxed = node->relaxed(); 1841| 180k| if (relaxed) { ------------------ | Branch (1841:9): [True: 157k, False: 23.2k] ------------------ 1842| 157k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 157k, False: 0] ------------------ 1843| 157k| return make_relaxed_pos(node, shift, relaxed) 1844| 157k| .visit(v, std::forward(args)...); 1845| 157k| } else { 1846| 23.2k| return make_regular_sub_pos(node, shift, size) 1847| 23.2k| .visit(v, std::forward(args)...); 1848| 23.2k| } 1849| 180k|} 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| 157k| { 1814| 157k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 157k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 1454| 19.2M| { 1455| 19.2M| auto offset = idx >> shift_; 1456| 29.0M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 9.72M, False: 19.2M] ------------------ 1457| 9.72M| ++offset; 1458| 19.2M| return offset; 1459| 19.2M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7relaxedEv: 1435| 157k| 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| 157k| { 1687| 157k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 157k, False: 0] ------------------ 1688| 157k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 21.3k, False: 135k] ------------------ 1689| 157k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 157k| } 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| 157k| { 1699| 157k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 157k| } 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| 157k| { 1718| 157k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 157k, False: 0] ------------------ 1719| 157k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 21.3k, False: 135k] | Branch (1719:9): [True: 157k, False: 0] ------------------ 1720| 157k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 157k| auto child = node_->inner()[offset_hint]; 1722| 157k| auto is_leaf = shift_ == BL; 1723| 157k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 157k| auto next_idx = idx - left_size_hint; 1725| 157k| return is_leaf ------------------ | Branch (1725:16): [True: 22.1k, False: 135k] ------------------ 1726| 157k| ? make_leaf_sub_pos(child, next_size) 1727| 22.1k| .visit(v, next_idx, args...) 1728| 157k| : visit_maybe_relaxed_sub( 1729| 135k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 157k| } 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| 22.1k| { 145| 22.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 22.1k| } 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| 23.2k| { 1037| 23.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 23.2k| } flex-vector-st.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 938| 23.2k| { 939| 23.2k| return towards_oh_ch_regular( 940| 23.2k| *this, v, idx, offset_hint, count(), args...); 941| 23.2k| } flex-vector-st.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 23.2k|{ 633| 23.2k| constexpr auto B = bits; 634| 23.2k| constexpr auto BL = bits_leaf; 635| 23.2k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 23.2k, False: 0] ------------------ 636| 23.2k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 23.2k, False: 0] ------------------ 637| 23.2k| auto is_leaf = p.shift() == BL; 638| 23.2k| auto child = p.node()->inner()[offset_hint]; 639| 23.2k| auto is_full = offset_hint + 1 != count_hint; 640| 23.2k| return is_full ------------------ | Branch (640:12): [True: 14.3k, False: 8.90k] ------------------ 641| 23.2k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 4.90k, False: 9.40k] ------------------ 642| 14.3k| : make_full_pos(child, p.shift() - B) 643| 9.40k| .visit(v, idx, args...)) 644| 23.2k| : (is_leaf ------------------ | Branch (644:19): [True: 6.85k, False: 2.04k] ------------------ 645| 8.90k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 8.90k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.04k| .visit(v, idx, args...)); 648| 23.2k|} flex-vector-st.cpp:_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 207| 15.3k| { 208| 15.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 15.3k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 202| 441k| 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.5k| { 1406| 14.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 14.5k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5indexEm: 1162| 1.32M| 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.5k| { 1330| 14.5k| return towards_oh(v, idx, offset_hint, args...); 1331| 14.5k| } 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.5k| { 1337| 14.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 14.5k, False: 0] ------------------ 1338| 14.5k| auto is_leaf = shift_ == BL; 1339| 14.5k| auto child = node_->inner()[offset_hint]; 1340| 14.5k| return is_leaf ------------------ | Branch (1340:16): [True: 10.1k, False: 4.44k] ------------------ 1341| 14.5k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 14.5k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 14.5k| } flex-vector-st.cpp:_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 112| 7.81k| { 113| 7.81k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 7.81k| } 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.35k| { 337| 2.35k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.35k| } 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.35k| { 317| 2.35k| return towards_oh_ch_regular( 318| 2.35k| *this, v, idx, offset_hint, count(), args...); 319| 2.35k| } 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.35k|{ 633| 2.35k| constexpr auto B = bits; 634| 2.35k| constexpr auto BL = bits_leaf; 635| 2.35k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.35k, False: 0] ------------------ 636| 2.35k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.35k, False: 0] ------------------ 637| 2.35k| auto is_leaf = p.shift() == BL; 638| 2.35k| auto child = p.node()->inner()[offset_hint]; 639| 2.35k| auto is_full = offset_hint + 1 != count_hint; 640| 2.35k| return is_full ------------------ | Branch (640:12): [True: 1.08k, False: 1.27k] ------------------ 641| 2.35k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 353, False: 729] ------------------ 642| 1.08k| : make_full_pos(child, p.shift() - B) 643| 729| .visit(v, idx, args...)) 644| 2.35k| : (is_leaf ------------------ | Branch (644:19): [True: 965, False: 312] ------------------ 645| 1.27k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.27k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 312| .visit(v, idx, args...)); 648| 2.35k|} _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 36.9k|{ 1839| 36.9k| assert(node); ------------------ | Branch (1839:5): [True: 36.9k, False: 0] ------------------ 1840| 36.9k| auto relaxed = node->relaxed(); 1841| 36.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 30.3k, False: 6.53k] ------------------ 1842| 30.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 30.3k, False: 0] ------------------ 1843| 30.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 30.3k| .visit(v, std::forward(args)...); 1845| 30.3k| } else { 1846| 6.53k| return make_regular_sub_pos(node, shift, size) 1847| 6.53k| .visit(v, std::forward(args)...); 1848| 6.53k| } 1849| 36.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 30.3k| { 1814| 30.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 30.3k| } _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| 24.2k| { 1687| 24.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 24.2k, False: 0] ------------------ 1688| 24.2k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 24.2k] ------------------ 1689| 24.2k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 24.2k| } _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| 24.2k| { 1699| 24.2k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 24.2k| } _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| 24.2k| { 1718| 24.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 24.2k, False: 0] ------------------ 1719| 24.2k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 24.2k] | Branch (1719:9): [True: 24.2k, False: 0] ------------------ 1720| 24.2k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 24.2k| auto child = node_->inner()[offset_hint]; 1722| 24.2k| auto is_leaf = shift_ == BL; 1723| 24.2k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 24.2k| auto next_idx = idx - left_size_hint; 1725| 24.2k| return is_leaf ------------------ | Branch (1725:16): [True: 2.09k, False: 22.1k] ------------------ 1726| 24.2k| ? make_leaf_sub_pos(child, next_size) 1727| 2.09k| .visit(v, next_idx, args...) 1728| 24.2k| : visit_maybe_relaxed_sub( 1729| 22.1k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 24.2k| } _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.09k| { 145| 2.09k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.09k| } _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.96k| { 1687| 9.96k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 9.96k, False: 0] ------------------ 1688| 9.96k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 8.65k, False: 1.31k] ------------------ 1689| 9.96k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 9.96k| } _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.96k| { 1699| 9.96k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 9.96k| } _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.96k| { 1718| 9.96k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 9.96k, False: 0] ------------------ 1719| 9.96k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 8.65k, False: 1.31k] | Branch (1719:9): [True: 9.96k, False: 0] ------------------ 1720| 9.96k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 9.96k| auto child = node_->inner()[offset_hint]; 1722| 9.96k| auto is_leaf = shift_ == BL; 1723| 9.96k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 9.96k| auto next_idx = idx - left_size_hint; 1725| 9.96k| return is_leaf ------------------ | Branch (1725:16): [True: 3.46k, False: 6.49k] ------------------ 1726| 9.96k| ? make_leaf_sub_pos(child, next_size) 1727| 3.46k| .visit(v, next_idx, args...) 1728| 9.96k| : visit_maybe_relaxed_sub( 1729| 6.49k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 9.96k| } _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.46k| { 145| 3.46k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.46k| } _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.49k|{ 1839| 6.49k| assert(node); ------------------ | Branch (1839:5): [True: 6.49k, False: 0] ------------------ 1840| 6.49k| auto relaxed = node->relaxed(); 1841| 6.49k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.86k, False: 2.63k] ------------------ 1842| 3.86k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.86k, False: 0] ------------------ 1843| 3.86k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.86k| .visit(v, std::forward(args)...); 1845| 3.86k| } 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.49k|} _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.86k| { 1814| 3.86k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.86k| } _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.67k| { 928| 5.67k| return towards_oh_ch_regular( 929| 5.67k| *this, v, idx, offset_hint, count(), args...); 930| 5.67k| } _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.67k|{ 633| 5.67k| constexpr auto B = bits; 634| 5.67k| constexpr auto BL = bits_leaf; 635| 5.67k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.67k, False: 0] ------------------ 636| 5.67k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.67k, False: 0] ------------------ 637| 5.67k| auto is_leaf = p.shift() == BL; 638| 5.67k| auto child = p.node()->inner()[offset_hint]; 639| 5.67k| auto is_full = offset_hint + 1 != count_hint; 640| 5.67k| return is_full ------------------ | Branch (640:12): [True: 1.40k, False: 4.27k] ------------------ 641| 5.67k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 735, False: 665] ------------------ 642| 1.40k| : make_full_pos(child, p.shift() - B) 643| 665| .visit(v, idx, args...)) 644| 5.67k| : (is_leaf ------------------ | Branch (644:19): [True: 1.58k, False: 2.68k] ------------------ 645| 4.27k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.27k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.68k| .visit(v, idx, args...)); 648| 5.67k|} _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.82k| { 208| 3.82k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.82k| } _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.05k| { 1406| 2.05k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.05k| } _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.20k| { 1337| 3.20k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 3.20k, False: 0] ------------------ 1338| 3.20k| auto is_leaf = shift_ == BL; 1339| 3.20k| auto child = node_->inner()[offset_hint]; 1340| 3.20k| return is_leaf ------------------ | Branch (1340:16): [True: 2.40k, False: 803] ------------------ 1341| 3.20k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 3.20k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 3.20k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 1161| 70.3k| shift_t shift() const { return shift_; } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 112| 2.99k| { 113| 2.99k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.99k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 336| 3.18k| { 337| 3.18k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.18k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 305| 3.18k| { 306| 3.18k| return towards_oh_ch_regular( 307| 3.18k| *this, v, idx, offset_hint, count(), args...); 308| 3.18k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 3.18k|{ 633| 3.18k| constexpr auto B = bits; 634| 3.18k| constexpr auto BL = bits_leaf; 635| 3.18k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.18k, False: 0] ------------------ 636| 3.18k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.18k, False: 0] ------------------ 637| 3.18k| auto is_leaf = p.shift() == BL; 638| 3.18k| auto child = p.node()->inner()[offset_hint]; 639| 3.18k| auto is_full = offset_hint + 1 != count_hint; 640| 3.18k| return is_full ------------------ | Branch (640:12): [True: 1.27k, False: 1.91k] ------------------ 641| 3.18k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 684, False: 589] ------------------ 642| 1.27k| : make_full_pos(child, p.shift() - B) 643| 589| .visit(v, idx, args...)) 644| 3.18k| : (is_leaf ------------------ | Branch (644:19): [True: 1.41k, False: 503] ------------------ 645| 1.91k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.91k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 503| .visit(v, idx, args...)); 648| 3.18k|} _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.53k| { 1037| 6.53k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.53k| } _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.49k| { 928| 3.49k| return towards_oh_ch_regular( 929| 3.49k| *this, v, idx, offset_hint, count(), args...); 930| 3.49k| } _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.49k|{ 633| 3.49k| constexpr auto B = bits; 634| 3.49k| constexpr auto BL = bits_leaf; 635| 3.49k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.49k, False: 0] ------------------ 636| 3.49k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.49k, False: 0] ------------------ 637| 3.49k| auto is_leaf = p.shift() == BL; 638| 3.49k| auto child = p.node()->inner()[offset_hint]; 639| 3.49k| auto is_full = offset_hint + 1 != count_hint; 640| 3.49k| return is_full ------------------ | Branch (640:12): [True: 2.68k, False: 805] ------------------ 641| 3.49k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 900, False: 1.78k] ------------------ 642| 2.68k| : make_full_pos(child, p.shift() - B) 643| 1.78k| .visit(v, idx, args...)) 644| 3.49k| : (is_leaf ------------------ | Branch (644:19): [True: 805, False: 0] ------------------ 645| 805| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 805| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 3.49k|} _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.53k| { 208| 1.53k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.53k| } _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.08k| { 1406| 2.08k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.08k| } _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| 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: 637, False: 300] ------------------ 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_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 805| { 113| 805| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 805| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 23.4k|{ 1839| 23.4k| assert(node); ------------------ | Branch (1839:5): [True: 23.4k, False: 0] ------------------ 1840| 23.4k| auto relaxed = node->relaxed(); 1841| 23.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 16.6k, False: 6.87k] ------------------ 1842| 16.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 16.6k, False: 0] ------------------ 1843| 16.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 16.6k| .visit(v, std::forward(args)...); 1845| 16.6k| } else { 1846| 6.87k| return make_regular_sub_pos(node, shift, size) 1847| 6.87k| .visit(v, std::forward(args)...); 1848| 6.87k| } 1849| 23.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 16.6k| { 1814| 16.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 16.6k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8subindexEm: 1434| 6.11M| 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.39k| { 1706| 3.39k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.39k, False: 0] ------------------ 1707| 3.39k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 2.91k, False: 482] ------------------ 1708| 3.39k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.39k| } _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.39k| { 1718| 3.39k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.39k, False: 0] ------------------ 1719| 3.39k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 2.91k, False: 482] | Branch (1719:9): [True: 3.39k, False: 0] ------------------ 1720| 3.39k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.39k| auto child = node_->inner()[offset_hint]; 1722| 3.39k| auto is_leaf = shift_ == BL; 1723| 3.39k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.39k| auto next_idx = idx - left_size_hint; 1725| 3.39k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.39k] ------------------ 1726| 3.39k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.39k| : visit_maybe_relaxed_sub( 1729| 3.39k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.39k| } _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| 70.4k| { 1706| 70.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 70.4k, False: 0] ------------------ 1707| 70.4k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 21.1k, False: 49.2k] ------------------ 1708| 70.4k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 70.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 70.4k| { 1718| 70.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 70.4k, False: 0] ------------------ 1719| 70.4k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 21.1k, False: 49.2k] | Branch (1719:9): [True: 70.4k, False: 0] ------------------ 1720| 70.4k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 70.4k| auto child = node_->inner()[offset_hint]; 1722| 70.4k| auto is_leaf = shift_ == BL; 1723| 70.4k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 70.4k| auto next_idx = idx - left_size_hint; 1725| 70.4k| return is_leaf ------------------ | Branch (1725:16): [True: 12.3k, False: 58.0k] ------------------ 1726| 70.4k| ? make_leaf_sub_pos(child, next_size) 1727| 12.3k| .visit(v, next_idx, args...) 1728| 70.4k| : visit_maybe_relaxed_sub( 1729| 58.0k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 70.4k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 12.3k| { 145| 12.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 12.3k| } _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| 58.0k|{ 1839| 58.0k| assert(node); ------------------ | Branch (1839:5): [True: 58.0k, False: 0] ------------------ 1840| 58.0k| auto relaxed = node->relaxed(); 1841| 58.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 57.1k, False: 812] ------------------ 1842| 57.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 57.1k, False: 0] ------------------ 1843| 57.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 57.1k| .visit(v, std::forward(args)...); 1845| 57.1k| } else { 1846| 812| return make_regular_sub_pos(node, shift, size) 1847| 812| .visit(v, std::forward(args)...); 1848| 812| } 1849| 58.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 57.1k| { 1814| 57.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 57.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 812| { 1037| 812| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 812| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE11size_beforeEj: 791| 1.73M| { 792| 1.73M| return size_t{offset} << shift_; 793| 1.73M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8size_sbhEjm: 803| 21.2k| { 804| 21.2k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 21.2k, False: 0] ------------------ 805| 21.2k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 11.7k, False: 9.54k] ------------------ 806| 21.2k| : size_t{1} << shift_; 807| 21.2k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 946| 6.83k| { 947| 6.83k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 6.83k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_18slice_left_visitorISD_Lb0EEEJEEEDcOT_T0_mjDpOT1_: 653| 6.83k|{ 654| 6.83k| constexpr auto B = bits; 655| 6.83k| constexpr auto BL = bits_leaf; 656| 6.83k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 6.83k, False: 0] ------------------ 657| 6.83k| auto is_leaf = p.shift() == BL; 658| 6.83k| auto child = p.node()->inner()[offset_hint]; 659| 6.83k| auto lsize = offset_hint << p.shift(); 660| 6.83k| auto size = p.this_size(); 661| 6.83k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 6.83k| return is_full ------------------ | Branch (662:12): [True: 6.83k, False: 0] ------------------ 663| 6.83k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.08k, False: 2.74k] ------------------ 664| 6.83k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 6.83k| : make_full_pos(child, p.shift() - B) 666| 2.74k| .visit(v, idx - lsize, args...)) 667| 6.83k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 6.83k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9this_sizeEv: 794| 21.2k| 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.68k| { 208| 7.68k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 7.68k| } _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.17k| { 1406| 4.17k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.17k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8subindexEm: 1163| 10.1k| 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| 37.1k| { 1171| 37.1k| return size_t{offset} << shift_; 1172| 37.1k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8size_sbhEjm: 1166| 10.1k| { 1167| 10.1k| return size_t{1} << shift_; 1168| 10.1k| } _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.60k, False: 1.42k] ------------------ 1354| 5.03k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 5.03k| : make_full_pos(child, shift_ - B) 1356| 1.42k| .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.1k| { 1176| 10.1k| auto e = sizes + n; 1177| 54.3k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 44.2k, False: 10.1k] ------------------ 1178| 44.2k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 44.2k, False: 0] ------------------ 1180| 44.2k| } 1181| 10.1k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 1160| 684k| 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.32M| { 811| 3.32M| if (n) { ------------------ | Branch (811:13): [True: 3.32M, False: 5.31k] ------------------ 812| 3.32M| auto last = offset + n - 1; 813| 3.32M| auto e = sizes + n - 1; 814| 13.2M| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 9.95M, False: 3.32M] ------------------ 815| 9.95M| init = *sizes = init + (size_t{1} << shift_); 816| 9.95M| assert(init); ------------------ | Branch (816:17): [True: 9.95M, False: 0] ------------------ 817| 9.95M| } 818| 3.32M| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 3.32M, False: 0] ------------------ 820| 3.32M| } 821| 3.32M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEj: 797| 3.33M| { 798| 3.33M| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 1.67M, False: 1.66M] ------------------ 799| 3.33M| : size_t{1} << shift_; 800| 3.33M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1462| 31.6M| { 1463| 31.6M| auto e = sizes + n; 1464| 31.6M| auto prev = size_before(offset); 1465| 31.6M| auto these = relaxed_->d.sizes + offset; 1466| 144M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 113M, False: 31.6M] ------------------ 1467| 113M| auto this_size = *these; 1468| 113M| init = *sizes = init + (this_size - prev); 1469| 113M| assert(init); ------------------ | Branch (1469:13): [True: 113M, False: 0] ------------------ 1470| 113M| prev = this_size; 1471| 113M| } 1472| 31.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.87k| { 1037| 6.87k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.87k| } _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.76k| { 947| 2.76k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.76k| } _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.76k|{ 654| 2.76k| constexpr auto B = bits; 655| 2.76k| constexpr auto BL = bits_leaf; 656| 2.76k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.76k, False: 0] ------------------ 657| 2.76k| auto is_leaf = p.shift() == BL; 658| 2.76k| auto child = p.node()->inner()[offset_hint]; 659| 2.76k| auto lsize = offset_hint << p.shift(); 660| 2.76k| auto size = p.this_size(); 661| 2.76k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.76k| return is_full ------------------ | Branch (662:12): [True: 855, False: 1.91k] ------------------ 663| 2.76k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 855] ------------------ 664| 855| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 855| : make_full_pos(child, p.shift() - B) 666| 855| .visit(v, idx - lsize, args...)) 667| 2.76k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.91k] ------------------ 668| 1.91k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.91k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.91k| .visit(v, idx - lsize, args...)); 672| 2.76k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1405| 855| { 1406| 855| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 855| } _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.91k| { 1037| 1.91k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.91k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEDaPT_j: 766| 11.6k|{ 767| 11.6k| assert(leaf); ------------------ | Branch (767:5): [True: 11.6k, False: 0] ------------------ 768| 11.6k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 11.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 11.6k, False: 0] ------------------ 769| 11.6k| assert(count > 0); ------------------ | Branch (769:5): [True: 11.6k, False: 0] ------------------ 770| 11.6k| return singleton_regular_sub_pos{leaf, count}; 771| 11.6k|} _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.6k| { 760| 11.6k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 11.6k| } _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.6k|{ 1839| 11.6k| assert(node); ------------------ | Branch (1839:5): [True: 11.6k, False: 0] ------------------ 1840| 11.6k| auto relaxed = node->relaxed(); 1841| 11.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 8.84k, False: 2.78k] ------------------ 1842| 8.84k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 8.84k, False: 0] ------------------ 1843| 8.84k| return make_relaxed_pos(node, shift, relaxed) 1844| 8.84k| .visit(v, std::forward(args)...); 1845| 8.84k| } else { 1846| 2.78k| return make_regular_sub_pos(node, shift, size) 1847| 2.78k| .visit(v, std::forward(args)...); 1848| 2.78k| } 1849| 11.6k|} _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| 8.84k| { 1814| 8.84k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 8.84k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 735| 66.4k| 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.6k| { 745| 11.6k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 144| 13.9M| { 145| 13.9M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 13.9M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 1813| 162M| { 1814| 162M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 162M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 707| 4.01M| { 708| 4.01M| } _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.6k| { 745| 11.6k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 144| 13.9M| { 145| 13.9M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 13.9M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 137| 13.9M| size_t size() const { return count_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1813| 162M| { 1814| 162M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 162M| } _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.01M| { 708| 4.01M| } _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.9k| { 1763| 53.9k| auto child = node_->inner()[0]; 1764| 53.9k| auto child_size = relaxed_->d.sizes[0]; 1765| 53.9k| auto is_leaf = shift_ == BL; 1766| 53.9k| assert(child_size); ------------------ | Branch (1766:9): [True: 53.9k, False: 0] ------------------ 1767| 53.9k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 53.9k] ------------------ 1768| 53.9k| : visit_maybe_relaxed_sub( 1769| 53.9k| child, shift_ - B, child_size, v, args...); 1770| 53.9k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 76| 11.6k| 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.38M| shift_t shift() const { return 0; } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 53.9k|{ 1839| 53.9k| assert(node); ------------------ | Branch (1839:5): [True: 53.9k, False: 0] ------------------ 1840| 53.9k| auto relaxed = node->relaxed(); 1841| 53.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 53.6k, False: 303] ------------------ 1842| 53.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 53.6k, False: 0] ------------------ 1843| 53.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 53.6k| .visit(v, std::forward(args)...); 1845| 53.6k| } else { 1846| 303| return make_regular_sub_pos(node, shift, size) 1847| 303| .visit(v, std::forward(args)...); 1848| 303| } 1849| 53.9k|} _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.6k| { 1814| 53.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 53.6k| } _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| 303| { 1037| 303| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 303| } _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| 601| { 971| 601| auto is_leaf = shift_ == BL; 972| 601| auto child = node_->inner()[0]; 973| 601| auto is_full = size_ >= (size_t{1} << shift_); 974| 601| return is_full ------------------ | Branch (974:16): [True: 601, False: 0] ------------------ 975| 601| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 601] ------------------ 976| 601| ? make_full_leaf_pos(child).visit(v, args...) 977| 601| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 601| : (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| 601| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 201| 387k| 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| 903| { 1406| 903| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 903| } _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| 302| { 1362| 302| auto is_leaf = shift_ == BL; 1363| 302| auto child = node_->inner()[0]; 1364| 302| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 302] ------------------ 1365| 302| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 302| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 711| 162k| { 712| 162k| } _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| 40.8k| { 1305| 40.8k| each_i(v, 1, branches, args...); 1306| 40.8k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE6each_iINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jjDpOT0_: 1263| 40.8k| { 1264| 40.8k| auto p = node_->inner() + i; 1265| 40.8k| auto e = node_->inner() + n; 1266| 40.8k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 21.4k, False: 19.4k] ------------------ 1267| 171k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 150k, False: 21.4k] ------------------ 1268| 150k| IMMER_PREFETCH(p + 1); 1269| 150k| make_full_leaf_pos(*p).visit(v, args...); 1270| 150k| } 1271| 21.4k| } else { 1272| 19.4k| auto ss = shift_ - B; 1273| 155k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 135k, False: 19.4k] ------------------ 1274| 135k| make_full_pos(*p, ss).visit(v, args...); 1275| 19.4k| } 1276| 40.8k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 207| 5.12M| { 208| 5.12M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.12M| } _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| 679k| { 1406| 679k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 679k| } _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| 162k| { 712| 162k| } _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| 40.8k| { 1305| 40.8k| each_i(v, 1, branches, args...); 1306| 40.8k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE6each_iINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jjDpOT0_: 1263| 40.8k| { 1264| 40.8k| auto p = node_->inner() + i; 1265| 40.8k| auto e = node_->inner() + n; 1266| 40.8k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 21.4k, False: 19.4k] ------------------ 1267| 171k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 150k, False: 21.4k] ------------------ 1268| 150k| IMMER_PREFETCH(p + 1); 1269| 150k| make_full_leaf_pos(*p).visit(v, args...); 1270| 150k| } 1271| 21.4k| } else { 1272| 19.4k| auto ss = shift_ - B; 1273| 155k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 135k, False: 19.4k] ------------------ 1274| 135k| make_full_pos(*p, ss).visit(v, args...); 1275| 19.4k| } 1276| 40.8k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 207| 5.12M| { 208| 5.12M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.12M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE4sizeEv: 200| 5.12M| 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| 679k| { 1406| 679k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 679k| } _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| 601| { 754| 601| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 601| } _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| 601| { 145| 601| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 601| } _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| 601| { 1371| 601| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 601, False: 0] ------------------ 1372| 601| auto child = node_->inner()[0]; 1373| 601| return make_full_leaf_pos(child).visit(v, args...); 1374| 601| } _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.09k| { 208| 3.09k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.09k| } _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| 387k| { 907| 387k| if (count() > 1) ------------------ | Branch (907:13): [True: 367k, False: 19.7k] ------------------ 908| 367k| each_right_sub_(v, 1, args...); 909| 387k| } _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| 367k| { 880| 367k| auto last = count() - 1; 881| 367k| auto lsize = size_ - (last << shift_); 882| 367k| auto n = node()->inner() + i; 883| 367k| auto e = node()->inner() + last; 884| 367k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 345k, False: 21.4k] ------------------ 885| 2.40M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.05M, False: 345k] ------------------ 886| 2.05M| IMMER_PREFETCH(n + 1); 887| 2.05M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.05M| } 889| 345k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 345k| } else { 891| 21.4k| auto ss = shift_ - B; 892| 88.6k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 67.2k, False: 21.4k] ------------------ 893| 67.2k| make_full_pos(*n, ss).visit(v, args...); 894| 21.4k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 21.4k| } 896| 367k| } _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.72M| { 1037| 3.72M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.72M| } _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| 387k| { 907| 387k| if (count() > 1) ------------------ | Branch (907:13): [True: 367k, False: 19.7k] ------------------ 908| 367k| each_right_sub_(v, 1, args...); 909| 387k| } _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| 367k| { 880| 367k| auto last = count() - 1; 881| 367k| auto lsize = size_ - (last << shift_); 882| 367k| auto n = node()->inner() + i; 883| 367k| auto e = node()->inner() + last; 884| 367k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 345k, False: 21.4k] ------------------ 885| 2.40M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.05M, False: 345k] ------------------ 886| 2.05M| IMMER_PREFETCH(n + 1); 887| 2.05M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.05M| } 889| 345k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 345k| } else { 891| 21.4k| auto ss = shift_ - B; 892| 88.6k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 67.2k, False: 21.4k] ------------------ 893| 67.2k| make_full_pos(*n, ss).visit(v, args...); 894| 21.4k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 21.4k| } 896| 367k| } _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.72M| { 1037| 3.72M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.72M| } _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.54k| { 145| 8.54k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.54k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1647| 13.6M| { 1648| 13.6M| each_right(v, 1, std::forward(args)...); 1649| 13.6M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 1653| 13.6M| { 1654| 13.6M| assert(start > 0); ------------------ | Branch (1654:9): [True: 13.6M, False: 0] ------------------ 1655| 13.6M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 13.6M, False: 0] ------------------ 1656| 13.6M| auto s = relaxed_->d.sizes[start - 1]; 1657| 13.6M| auto p = node_->inner(); 1658| 13.6M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 1.05M, False: 12.5M] ------------------ 1659| 6.29M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 5.24M, False: 1.05M] ------------------ 1660| 5.24M| IMMER_PREFETCH(p + i + 1); 1661| 5.24M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 5.24M| .visit(v, args...); 1663| 5.24M| s = relaxed_->d.sizes[i]; 1664| 5.24M| assert(s); ------------------ | Branch (1664:17): [True: 5.24M, False: 0] ------------------ 1665| 5.24M| } 1666| 12.5M| } else { 1667| 12.5M| auto ss = shift_ - B; 1668| 92.0M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 79.4M, False: 12.5M] ------------------ 1669| 79.4M| visit_maybe_relaxed_sub( 1670| 79.4M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 79.4M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 79.4M, False: 0] ------------------ 1673| 79.4M| } 1674| 12.5M| } 1675| 13.6M| } _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| 137M|{ 1839| 137M| assert(node); ------------------ | Branch (1839:5): [True: 137M, False: 0] ------------------ 1840| 137M| auto relaxed = node->relaxed(); 1841| 137M| if (relaxed) { ------------------ | Branch (1841:9): [True: 133M, False: 3.69M] ------------------ 1842| 133M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 133M, False: 0] ------------------ 1843| 133M| return make_relaxed_pos(node, shift, relaxed) 1844| 133M| .visit(v, std::forward(args)...); 1845| 133M| } else { 1846| 3.69M| return make_regular_sub_pos(node, shift, size) 1847| 3.69M| .visit(v, std::forward(args)...); 1848| 3.69M| } 1849| 137M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1647| 13.6M| { 1648| 13.6M| each_right(v, 1, std::forward(args)...); 1649| 13.6M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 1653| 13.6M| { 1654| 13.6M| assert(start > 0); ------------------ | Branch (1654:9): [True: 13.6M, False: 0] ------------------ 1655| 13.6M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 13.6M, False: 0] ------------------ 1656| 13.6M| auto s = relaxed_->d.sizes[start - 1]; 1657| 13.6M| auto p = node_->inner(); 1658| 13.6M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 1.05M, False: 12.5M] ------------------ 1659| 6.29M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 5.24M, False: 1.05M] ------------------ 1660| 5.24M| IMMER_PREFETCH(p + i + 1); 1661| 5.24M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 5.24M| .visit(v, args...); 1663| 5.24M| s = relaxed_->d.sizes[i]; 1664| 5.24M| assert(s); ------------------ | Branch (1664:17): [True: 5.24M, False: 0] ------------------ 1665| 5.24M| } 1666| 12.5M| } else { 1667| 12.5M| auto ss = shift_ - B; 1668| 92.0M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 79.4M, False: 12.5M] ------------------ 1669| 79.4M| visit_maybe_relaxed_sub( 1670| 79.4M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 79.4M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 79.4M, False: 0] ------------------ 1673| 79.4M| } 1674| 12.5M| } 1675| 13.6M| } _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| 137M|{ 1839| 137M| assert(node); ------------------ | Branch (1839:5): [True: 137M, False: 0] ------------------ 1840| 137M| auto relaxed = node->relaxed(); 1841| 137M| if (relaxed) { ------------------ | Branch (1841:9): [True: 133M, False: 3.69M] ------------------ 1842| 133M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 133M, False: 0] ------------------ 1843| 133M| return make_relaxed_pos(node, shift, relaxed) 1844| 133M| .visit(v, std::forward(args)...); 1845| 133M| } else { 1846| 3.69M| return make_regular_sub_pos(node, shift, size) 1847| 3.69M| .visit(v, std::forward(args)...); 1848| 3.69M| } 1849| 137M|} _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.54k| { 754| 8.54k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 8.54k| } _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.54k| { 145| 8.54k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.54k| } _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.54k| { 1775| 8.54k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 8.54k, False: 0] ------------------ 1776| 8.54k| auto child = node_->inner()[0]; 1777| 8.54k| auto child_size = relaxed_->d.sizes[0]; 1778| 8.54k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 8.54k| } _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.78k| { 1037| 2.78k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.78k| } _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.43M|{ 1839| 1.43M| assert(node); ------------------ | Branch (1839:5): [True: 1.43M, False: 0] ------------------ 1840| 1.43M| auto relaxed = node->relaxed(); 1841| 1.43M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.40M, False: 24.3k] ------------------ 1842| 1.40M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.40M, False: 0] ------------------ 1843| 1.40M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.40M| .visit(v, std::forward(args)...); 1845| 1.40M| } else { 1846| 24.3k| return make_regular_sub_pos(node, shift, size) 1847| 24.3k| .visit(v, std::forward(args)...); 1848| 24.3k| } 1849| 1.43M|} _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.40M| { 1814| 1.40M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.40M| } _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.40M|{ 1839| 1.40M| assert(node); ------------------ | Branch (1839:5): [True: 1.40M, False: 0] ------------------ 1840| 1.40M| auto relaxed = node->relaxed(); 1841| 1.40M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.39M, False: 15.0k] ------------------ 1842| 1.39M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.39M, False: 0] ------------------ 1843| 1.39M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.39M| .visit(v, std::forward(args)...); 1845| 1.39M| } else { 1846| 15.0k| return make_regular_sub_pos(node, shift, size) 1847| 15.0k| .visit(v, std::forward(args)...); 1848| 15.0k| } 1849| 1.40M|} _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.39M| { 1814| 1.39M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.39M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1750| 3.97M| { 1751| 3.97M| auto offset = relaxed_->d.count - 1; 1752| 3.97M| auto child = node_->inner()[offset]; 1753| 3.97M| auto child_size = size(offset); 1754| 3.97M| auto is_leaf = shift_ == BL; 1755| 3.97M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 3.97M] ------------------ 1756| 3.97M| : visit_maybe_relaxed_sub( 1757| 3.97M| child, shift_ - B, child_size, v, args...); 1758| 3.97M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 3.97M|{ 1839| 3.97M| assert(node); ------------------ | Branch (1839:5): [True: 3.97M, False: 0] ------------------ 1840| 3.97M| auto relaxed = node->relaxed(); 1841| 3.97M| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.97M, False: 2.14k] ------------------ 1842| 3.97M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.97M, False: 0] ------------------ 1843| 3.97M| return make_relaxed_pos(node, shift, relaxed) 1844| 3.97M| .visit(v, std::forward(args)...); 1845| 3.97M| } else { 1846| 2.14k| return make_regular_sub_pos(node, shift, size) 1847| 2.14k| .visit(v, std::forward(args)...); 1848| 2.14k| } 1849| 3.97M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1813| 3.97M| { 1814| 3.97M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.97M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 1036| 4.98k| { 1037| 4.98k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.98k| } _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.84k| { 959| 2.84k| auto offset = count() - 1; 960| 2.84k| auto child = node_->inner()[offset]; 961| 2.84k| auto is_leaf = shift_ == BL; 962| 2.84k| auto lsize = size_ - (size_t{offset} << shift_); 963| 2.84k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 2.84k] ------------------ 964| 2.84k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 2.84k| .visit(v, args...); 966| 2.84k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 913| 1.51M| { 914| 1.51M| each_left(v, count() - 1, args...); 915| 1.51M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_leftINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 873| 1.51M| { 874| 1.51M| return each_left_regular(*this, v, last, args...); 875| 1.51M| } _ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvOT_T0_jDpOT1_: 575| 1.51M|{ 576| 1.51M| constexpr auto B = bits; 577| 1.51M| constexpr auto BL = bits_leaf; 578| 1.51M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.51M, False: 0] ------------------ 579| 1.51M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 777k, False: 734k] ------------------ 580| 777k| auto n = p.node()->inner(); 581| 777k| auto e = n + last; 582| 3.69M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 2.92M, False: 777k] ------------------ 583| 2.92M| IMMER_PREFETCH(n + 1); 584| 2.92M| make_full_leaf_pos(*n).visit(v, args...); 585| 2.92M| } 586| 777k| } else { 587| 734k| auto n = p.node()->inner(); 588| 734k| auto e = n + last; 589| 734k| auto ss = p.shift() - B; 590| 1.21M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 476k, False: 734k] ------------------ 591| 476k| make_full_pos(*n, ss).visit(v, args...); 592| 734k| } 593| 1.51M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 913| 1.51M| { 914| 1.51M| each_left(v, count() - 1, args...); 915| 1.51M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_leftINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 873| 1.51M| { 874| 1.51M| return each_left_regular(*this, v, last, args...); 875| 1.51M| } _ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISD_EEEEEvOT_T0_jDpOT1_: 575| 1.51M|{ 576| 1.51M| constexpr auto B = bits; 577| 1.51M| constexpr auto BL = bits_leaf; 578| 1.51M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.51M, False: 0] ------------------ 579| 1.51M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 777k, False: 734k] ------------------ 580| 777k| auto n = p.node()->inner(); 581| 777k| auto e = n + last; 582| 3.69M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 2.92M, False: 777k] ------------------ 583| 2.92M| IMMER_PREFETCH(n + 1); 584| 2.92M| make_full_leaf_pos(*n).visit(v, args...); 585| 2.92M| } 586| 777k| } else { 587| 734k| auto n = p.node()->inner(); 588| 734k| auto e = n + last; 589| 734k| auto ss = p.shift() - B; 590| 1.21M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 476k, False: 734k] ------------------ 591| 476k| make_full_pos(*n, ss).visit(v, args...); 592| 734k| } 593| 1.51M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1762| 1.45M| { 1763| 1.45M| auto child = node_->inner()[0]; 1764| 1.45M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.45M| auto is_leaf = shift_ == BL; 1766| 1.45M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.45M, False: 0] ------------------ 1767| 1.45M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.45M] ------------------ 1768| 1.45M| : visit_maybe_relaxed_sub( 1769| 1.45M| child, shift_ - B, child_size, v, args...); 1770| 1.45M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5shiftEv: 106| 1.43M| 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.45M|{ 1839| 1.45M| assert(node); ------------------ | Branch (1839:5): [True: 1.45M, False: 0] ------------------ 1840| 1.45M| auto relaxed = node->relaxed(); 1841| 1.45M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.10M, False: 348k] ------------------ 1842| 1.10M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.10M, False: 0] ------------------ 1843| 1.10M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.10M| .visit(v, std::forward(args)...); 1845| 1.10M| } else { 1846| 348k| return make_regular_sub_pos(node, shift, size) 1847| 348k| .visit(v, std::forward(args)...); 1848| 348k| } 1849| 1.45M|} _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.10M| { 1814| 1.10M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.10M| } _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| 348k| { 1037| 348k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 348k| } _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.81k| { 959| 1.81k| auto offset = count() - 1; 960| 1.81k| auto child = node_->inner()[offset]; 961| 1.81k| auto is_leaf = shift_ == BL; 962| 1.81k| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.81k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 1.81k] ------------------ 964| 1.81k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 1.81k| .visit(v, args...); 966| 1.81k| } _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.59k| { 1037| 2.59k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.59k| } _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| 17.4k| { 971| 17.4k| auto is_leaf = shift_ == BL; 972| 17.4k| auto child = node_->inner()[0]; 973| 17.4k| auto is_full = size_ >= (size_t{1} << shift_); 974| 17.4k| return is_full ------------------ | Branch (974:16): [True: 17.4k, False: 0] ------------------ 975| 17.4k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 17.4k] ------------------ 976| 17.4k| ? make_full_leaf_pos(child).visit(v, args...) 977| 17.4k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 17.4k| : (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| 17.4k| } _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| 36.1k| { 1406| 36.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 36.1k| } _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| 18.7k| { 1362| 18.7k| auto is_leaf = shift_ == BL; 1363| 18.7k| auto child = node_->inner()[0]; 1364| 18.7k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 18.7k] ------------------ 1365| 18.7k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 18.7k| } _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| 35.9k| { 959| 35.9k| auto offset = count() - 1; 960| 35.9k| auto child = node_->inner()[offset]; 961| 35.9k| auto is_leaf = shift_ == BL; 962| 35.9k| auto lsize = size_ - (size_t{offset} << shift_); 963| 35.9k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 17.6k, False: 18.2k] ------------------ 964| 35.9k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 18.2k| .visit(v, args...); 966| 35.9k| } _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| 20.8k| { 145| 20.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 20.8k| } _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| 20.8k| { 1371| 20.8k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 20.8k, False: 0] ------------------ 1372| 20.8k| auto child = node_->inner()[0]; 1373| 20.8k| return make_full_leaf_pos(child).visit(v, args...); 1374| 20.8k| } _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| 384k| { 208| 384k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 384k| } _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| 18.4k| { 1037| 18.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 18.4k| } _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| 365k| { 959| 365k| auto offset = count() - 1; 960| 365k| auto child = node_->inner()[offset]; 961| 365k| auto is_leaf = shift_ == BL; 962| 365k| auto lsize = size_ - (size_t{offset} << shift_); 963| 365k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 355k, False: 10.6k] ------------------ 964| 365k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 10.6k| .visit(v, args...); 966| 365k| } _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| 363k| { 145| 363k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 363k| } _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| 363k| { 987| 363k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 363k, False: 0] ------------------ 988| 363k| auto child = node_->inner()[0]; 989| 363k| auto is_full = size_ >= branches; 990| 363k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 363k, False: 0] ------------------ 991| 363k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 363k| } _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.04M| { 145| 1.04M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.04M| } _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| 16.7k| { 1037| 16.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 16.7k| } _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.10M| { 959| 1.10M| auto offset = count() - 1; 960| 1.10M| auto child = node_->inner()[offset]; 961| 1.10M| auto is_leaf = shift_ == BL; 962| 1.10M| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.10M| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 404k, False: 701k] ------------------ 964| 1.10M| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 701k| .visit(v, args...); 966| 1.10M| } _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.04M| { 145| 1.04M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.04M| } _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.04M| { 1775| 1.04M| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 1.04M, False: 0] ------------------ 1776| 1.04M| auto child = node_->inner()[0]; 1777| 1.04M| auto child_size = relaxed_->d.sizes[0]; 1778| 1.04M| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 1.04M| } _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.44M| { 1037| 1.44M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.44M| } _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| 16.3M| { 1618| 16.3M| each_left(v, relaxed_->d.count - 1, args...); 1619| 16.3M| } _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| 16.3M| { 1624| 16.3M| auto p = node_->inner(); 1625| 16.3M| auto s = size_t{}; 1626| 16.3M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 654k, False: 15.7M] ------------------ 1627| 4.72M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 4.07M, False: 654k] ------------------ 1628| 4.07M| IMMER_PREFETCH(p + i + 1); 1629| 4.07M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 4.07M| .visit(v, args...); 1631| 4.07M| s = relaxed_->d.sizes[i]; 1632| 4.07M| assert(s); ------------------ | Branch (1632:17): [True: 4.07M, False: 0] ------------------ 1633| 4.07M| } 1634| 15.7M| } else { 1635| 15.7M| auto ss = shift_ - B; 1636| 73.8M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 58.1M, False: 15.7M] ------------------ 1637| 58.1M| visit_maybe_relaxed_sub( 1638| 58.1M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 58.1M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 58.1M, False: 0] ------------------ 1641| 58.1M| } 1642| 15.7M| } 1643| 16.3M| } _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| 16.3M| { 1618| 16.3M| each_left(v, relaxed_->d.count - 1, args...); 1619| 16.3M| } _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| 16.3M| { 1624| 16.3M| auto p = node_->inner(); 1625| 16.3M| auto s = size_t{}; 1626| 16.3M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 654k, False: 15.7M] ------------------ 1627| 4.72M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 4.07M, False: 654k] ------------------ 1628| 4.07M| IMMER_PREFETCH(p + i + 1); 1629| 4.07M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 4.07M| .visit(v, args...); 1631| 4.07M| s = relaxed_->d.sizes[i]; 1632| 4.07M| assert(s); ------------------ | Branch (1632:17): [True: 4.07M, False: 0] ------------------ 1633| 4.07M| } 1634| 15.7M| } else { 1635| 15.7M| auto ss = shift_ - B; 1636| 73.8M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 58.1M, False: 15.7M] ------------------ 1637| 58.1M| visit_maybe_relaxed_sub( 1638| 58.1M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 58.1M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 58.1M, False: 0] ------------------ 1641| 58.1M| } 1642| 15.7M| } 1643| 16.3M| } _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.0M| { 1763| 11.0M| auto child = node_->inner()[0]; 1764| 11.0M| auto child_size = relaxed_->d.sizes[0]; 1765| 11.0M| auto is_leaf = shift_ == BL; 1766| 11.0M| assert(child_size); ------------------ | Branch (1766:9): [True: 11.0M, False: 0] ------------------ 1767| 11.0M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 11.0M] ------------------ 1768| 11.0M| : visit_maybe_relaxed_sub( 1769| 11.0M| child, shift_ - B, child_size, v, args...); 1770| 11.0M| } _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.0M|{ 1839| 11.0M| assert(node); ------------------ | Branch (1839:5): [True: 11.0M, False: 0] ------------------ 1840| 11.0M| auto relaxed = node->relaxed(); 1841| 11.0M| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.0M, False: 3.17k] ------------------ 1842| 11.0M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.0M, False: 0] ------------------ 1843| 11.0M| return make_relaxed_pos(node, shift, relaxed) 1844| 11.0M| .visit(v, std::forward(args)...); 1845| 11.0M| } else { 1846| 3.17k| return make_regular_sub_pos(node, shift, size) 1847| 3.17k| .visit(v, std::forward(args)...); 1848| 3.17k| } 1849| 11.0M|} _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.0M| { 1814| 11.0M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.0M| } _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| 3.17k| { 1037| 3.17k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.17k| } _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| 34.4k| { 1751| 34.4k| auto offset = relaxed_->d.count - 1; 1752| 34.4k| auto child = node_->inner()[offset]; 1753| 34.4k| auto child_size = size(offset); 1754| 34.4k| auto is_leaf = shift_ == BL; 1755| 34.4k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 34.4k] ------------------ 1756| 34.4k| : visit_maybe_relaxed_sub( 1757| 34.4k| child, shift_ - B, child_size, v, args...); 1758| 34.4k| } _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| 34.4k|{ 1839| 34.4k| assert(node); ------------------ | Branch (1839:5): [True: 34.4k, False: 0] ------------------ 1840| 34.4k| auto relaxed = node->relaxed(); 1841| 34.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 33.6k, False: 780] ------------------ 1842| 33.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 33.6k, False: 0] ------------------ 1843| 33.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 33.6k| .visit(v, std::forward(args)...); 1845| 33.6k| } else { 1846| 780| return make_regular_sub_pos(node, shift, size) 1847| 780| .visit(v, std::forward(args)...); 1848| 780| } 1849| 34.4k|} _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| 33.6k| { 1814| 33.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 33.6k| } _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| 3.37k| { 971| 3.37k| auto is_leaf = shift_ == BL; 972| 3.37k| auto child = node_->inner()[0]; 973| 3.37k| auto is_full = size_ >= (size_t{1} << shift_); 974| 3.37k| return is_full ------------------ | Branch (974:16): [True: 3.37k, False: 0] ------------------ 975| 3.37k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 3.37k] ------------------ 976| 3.37k| ? make_full_leaf_pos(child).visit(v, args...) 977| 3.37k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 3.37k| : (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| 3.37k| } _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.79k| { 1406| 3.79k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.79k| } _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| 421| { 1362| 421| auto is_leaf = shift_ == BL; 1363| 421| auto child = node_->inner()[0]; 1364| 421| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 421] ------------------ 1365| 421| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 421| } _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.59k| { 1751| 3.59k| auto offset = relaxed_->d.count - 1; 1752| 3.59k| auto child = node_->inner()[offset]; 1753| 3.59k| auto child_size = size(offset); 1754| 3.59k| auto is_leaf = shift_ == BL; 1755| 3.59k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 3.16k, False: 430] ------------------ 1756| 3.59k| : visit_maybe_relaxed_sub( 1757| 430| child, shift_ - B, child_size, v, args...); 1758| 3.59k| } _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| 430|{ 1839| 430| assert(node); ------------------ | Branch (1839:5): [True: 430, False: 0] ------------------ 1840| 430| auto relaxed = node->relaxed(); 1841| 430| if (relaxed) { ------------------ | Branch (1841:9): [True: 223, False: 207] ------------------ 1842| 223| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 223, False: 0] ------------------ 1843| 223| return make_relaxed_pos(node, shift, relaxed) 1844| 223| .visit(v, std::forward(args)...); 1845| 223| } else { 1846| 207| return make_regular_sub_pos(node, shift, size) 1847| 207| .visit(v, std::forward(args)...); 1848| 207| } 1849| 430|} _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| 223| { 1814| 223| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 223| } _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| 16.9k| { 1751| 16.9k| auto offset = relaxed_->d.count - 1; 1752| 16.9k| auto child = node_->inner()[offset]; 1753| 16.9k| auto child_size = size(offset); 1754| 16.9k| auto is_leaf = shift_ == BL; 1755| 16.9k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 7.90k, False: 9.03k] ------------------ 1756| 16.9k| : visit_maybe_relaxed_sub( 1757| 9.03k| child, shift_ - B, child_size, v, args...); 1758| 16.9k| } _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| 9.03k|{ 1839| 9.03k| assert(node); ------------------ | Branch (1839:5): [True: 9.03k, False: 0] ------------------ 1840| 9.03k| auto relaxed = node->relaxed(); 1841| 9.03k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.91k, False: 6.12k] ------------------ 1842| 2.91k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.91k, False: 0] ------------------ 1843| 2.91k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.91k| .visit(v, std::forward(args)...); 1845| 6.12k| } else { 1846| 6.12k| return make_regular_sub_pos(node, shift, size) 1847| 6.12k| .visit(v, std::forward(args)...); 1848| 6.12k| } 1849| 9.03k|} _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.91k| { 1814| 2.91k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.91k| } _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| 12.3M| { 1751| 12.3M| auto offset = relaxed_->d.count - 1; 1752| 12.3M| auto child = node_->inner()[offset]; 1753| 12.3M| auto child_size = size(offset); 1754| 12.3M| auto is_leaf = shift_ == BL; 1755| 12.3M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 643k, False: 11.7M] ------------------ 1756| 12.3M| : visit_maybe_relaxed_sub( 1757| 11.7M| child, shift_ - B, child_size, v, args...); 1758| 12.3M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 11.7M|{ 1839| 11.7M| assert(node); ------------------ | Branch (1839:5): [True: 11.7M, False: 0] ------------------ 1840| 11.7M| auto relaxed = node->relaxed(); 1841| 11.7M| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.9M, False: 743k] ------------------ 1842| 10.9M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 10.9M, False: 0] ------------------ 1843| 10.9M| return make_relaxed_pos(node, shift, relaxed) 1844| 10.9M| .visit(v, std::forward(args)...); 1845| 10.9M| } else { 1846| 743k| return make_regular_sub_pos(node, shift, size) 1847| 743k| .visit(v, std::forward(args)...); 1848| 743k| } 1849| 11.7M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1813| 10.9M| { 1814| 10.9M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 10.9M| } _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| 15.0k| { 1037| 15.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 15.0k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 1036| 24.3k| { 1037| 24.3k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 24.3k| } _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.3k|{ 1839| 24.3k| assert(node); ------------------ | Branch (1839:5): [True: 24.3k, False: 0] ------------------ 1840| 24.3k| auto relaxed = node->relaxed(); 1841| 24.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.67k, False: 17.6k] ------------------ 1842| 6.67k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.67k, False: 0] ------------------ 1843| 6.67k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.67k| .visit(v, std::forward(args)...); 1845| 17.6k| } else { 1846| 17.6k| return make_regular_sub_pos(node, shift, size) 1847| 17.6k| .visit(v, std::forward(args)...); 1848| 17.6k| } 1849| 24.3k|} _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.67k| { 1814| 6.67k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.67k| } _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.6k| { 1037| 17.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 17.6k| } _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| 207k| { 1814| 207k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 207k| } _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| 201k| { 1738| 201k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 201k, False: 0] ------------------ 1739| 201k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 201k, False: 0] ------------------ 1740| 201k| auto child = node_->inner()[offset_hint]; 1741| 201k| auto is_leaf = shift_ == BL; 1742| 201k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 201k] ------------------ 1743| 201k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 201k| : visit_maybe_relaxed_sub( 1745| 201k| child, shift_ - B, child_size_hint, v, args...); 1746| 201k| } _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| 201k|{ 1839| 201k| assert(node); ------------------ | Branch (1839:5): [True: 201k, False: 0] ------------------ 1840| 201k| auto relaxed = node->relaxed(); 1841| 201k| if (relaxed) { ------------------ | Branch (1841:9): [True: 37.6k, False: 163k] ------------------ 1842| 37.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 37.6k, False: 0] ------------------ 1843| 37.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 37.6k| .visit(v, std::forward(args)...); 1845| 163k| } else { 1846| 163k| return make_regular_sub_pos(node, shift, size) 1847| 163k| .visit(v, std::forward(args)...); 1848| 163k| } 1849| 201k|} _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| 163k| { 1037| 163k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 163k| } _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| 306k| { 953| 306k| return last_oh_regular(*this, v, offset_hint, args...); 954| 306k| } _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| 306k|{ 678| 306k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 306k, False: 0] ------------------ 679| 306k| constexpr auto B = bits; 680| 306k| constexpr auto BL = bits_leaf; 681| 306k| auto child = p.node()->inner()[offset_hint]; 682| 306k| auto is_leaf = p.shift() == BL; 683| 306k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 306k] ------------------ 684| 306k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 306k| .visit(v, args...); 686| 306k|} _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.52M| { 337| 1.52M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.52M| } _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.21M| { 331| 1.21M| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.21M| } _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.21M|{ 678| 1.21M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.21M, False: 0] ------------------ 679| 1.21M| constexpr auto B = bits; 680| 1.21M| constexpr auto BL = bits_leaf; 681| 1.21M| auto child = p.node()->inner()[offset_hint]; 682| 1.21M| auto is_leaf = p.shift() == BL; 683| 1.21M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.21M] ------------------ 684| 1.21M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.21M| .visit(v, args...); 686| 1.21M|} _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.23k| { 331| 2.23k| return last_oh_regular(*this, v, offset_hint, args...); 332| 2.23k| } _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.23k|{ 678| 2.23k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 2.23k, False: 0] ------------------ 679| 2.23k| constexpr auto B = bits; 680| 2.23k| constexpr auto BL = bits_leaf; 681| 2.23k| auto child = p.node()->inner()[offset_hint]; 682| 2.23k| auto is_leaf = p.shift() == BL; 683| 2.23k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 2.23k] ------------------ 684| 2.23k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 2.23k| .visit(v, args...); 686| 2.23k|} _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.34k| { 337| 3.34k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.34k| } _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.10k| { 953| 1.10k| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.10k| } _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.10k|{ 678| 1.10k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.10k, False: 0] ------------------ 679| 1.10k| constexpr auto B = bits; 680| 1.10k| constexpr auto BL = bits_leaf; 681| 1.10k| auto child = p.node()->inner()[offset_hint]; 682| 1.10k| auto is_leaf = p.shift() == BL; 683| 1.10k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.10k] ------------------ 684| 1.10k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.10k| .visit(v, args...); 686| 1.10k|} _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.32k| { 1738| 5.32k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 5.32k, False: 0] ------------------ 1739| 5.32k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 5.32k, False: 0] ------------------ 1740| 5.32k| auto child = node_->inner()[offset_hint]; 1741| 5.32k| auto is_leaf = shift_ == BL; 1742| 5.32k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 5.32k] ------------------ 1743| 5.32k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 5.32k| : visit_maybe_relaxed_sub( 1745| 5.32k| child, shift_ - B, child_size_hint, v, args...); 1746| 5.32k| } _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.32k|{ 1839| 5.32k| assert(node); ------------------ | Branch (1839:5): [True: 5.32k, False: 0] ------------------ 1840| 5.32k| auto relaxed = node->relaxed(); 1841| 5.32k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.65k, False: 679] ------------------ 1842| 4.65k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.65k, False: 0] ------------------ 1843| 4.65k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.65k| .visit(v, std::forward(args)...); 1845| 4.65k| } else { 1846| 679| return make_regular_sub_pos(node, shift, size) 1847| 679| .visit(v, std::forward(args)...); 1848| 679| } 1849| 5.32k|} _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.65k| { 1814| 4.65k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.65k| } _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| 679| { 1037| 679| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 679| } _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| 153k| { 1037| 153k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 153k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcPT_jmT0_DpOT1_: 1838| 14.8k|{ 1839| 14.8k| assert(node); ------------------ | Branch (1839:5): [True: 14.8k, False: 0] ------------------ 1840| 14.8k| auto relaxed = node->relaxed(); 1841| 14.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.5k, False: 2.29k] ------------------ 1842| 12.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.5k, False: 0] ------------------ 1843| 12.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 12.5k| .visit(v, std::forward(args)...); 1845| 12.5k| } else { 1846| 2.29k| return make_regular_sub_pos(node, shift, size) 1847| 2.29k| .visit(v, std::forward(args)...); 1848| 2.29k| } 1849| 14.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_: 1813| 12.5k| { 1814| 12.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 12.5k| } _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| 62.9k| { 1687| 62.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 62.9k, False: 0] ------------------ 1688| 62.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 16.4k, False: 46.5k] ------------------ 1689| 62.9k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 62.9k| } _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| 62.9k| { 1699| 62.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 62.9k| } _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| 62.9k| { 1718| 62.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 62.9k, False: 0] ------------------ 1719| 62.9k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 16.4k, False: 46.5k] | Branch (1719:9): [True: 62.9k, False: 0] ------------------ 1720| 62.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 62.9k| auto child = node_->inner()[offset_hint]; 1722| 62.9k| auto is_leaf = shift_ == BL; 1723| 62.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 62.9k| auto next_idx = idx - left_size_hint; 1725| 62.9k| return is_leaf ------------------ | Branch (1725:16): [True: 10.2k, False: 52.7k] ------------------ 1726| 62.9k| ? make_leaf_sub_pos(child, next_size) 1727| 10.2k| .visit(v, next_idx, args...) 1728| 62.9k| : visit_maybe_relaxed_sub( 1729| 52.7k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 62.9k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 144| 10.2k| { 145| 10.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 10.2k| } _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| 52.7k|{ 1839| 52.7k| assert(node); ------------------ | Branch (1839:5): [True: 52.7k, False: 0] ------------------ 1840| 52.7k| auto relaxed = node->relaxed(); 1841| 52.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 50.3k, False: 2.35k] ------------------ 1842| 50.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 50.3k, False: 0] ------------------ 1843| 50.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 50.3k| .visit(v, std::forward(args)...); 1845| 50.3k| } else { 1846| 2.35k| return make_regular_sub_pos(node, shift, size) 1847| 2.35k| .visit(v, std::forward(args)...); 1848| 2.35k| } 1849| 52.7k|} _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| 50.3k| { 1814| 50.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 50.3k| } _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.35k| { 1037| 2.35k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.35k| } _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.64k| { 939| 4.64k| return towards_oh_ch_regular( 940| 4.64k| *this, v, idx, offset_hint, count(), args...); 941| 4.64k| } _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.64k|{ 633| 4.64k| constexpr auto B = bits; 634| 4.64k| constexpr auto BL = bits_leaf; 635| 4.64k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.64k, False: 0] ------------------ 636| 4.64k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.64k, False: 0] ------------------ 637| 4.64k| auto is_leaf = p.shift() == BL; 638| 4.64k| auto child = p.node()->inner()[offset_hint]; 639| 4.64k| auto is_full = offset_hint + 1 != count_hint; 640| 4.64k| return is_full ------------------ | Branch (640:12): [True: 2.03k, False: 2.61k] ------------------ 641| 4.64k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.03k, False: 1.00k] ------------------ 642| 2.03k| : make_full_pos(child, p.shift() - B) 643| 1.00k| .visit(v, idx, args...)) 644| 4.64k| : (is_leaf ------------------ | Branch (644:19): [True: 620, False: 1.99k] ------------------ 645| 2.61k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.61k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.99k| .visit(v, idx, args...)); 648| 4.64k|} _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.60k| { 208| 3.60k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.60k| } _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.94k| { 1406| 2.94k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.94k| } _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.94k| { 1330| 2.94k| return towards_oh(v, idx, offset_hint, args...); 1331| 2.94k| } _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.94k| { 1337| 2.94k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.94k, False: 0] ------------------ 1338| 2.94k| auto is_leaf = shift_ == BL; 1339| 2.94k| auto child = node_->inner()[offset_hint]; 1340| 2.94k| return is_leaf ------------------ | Branch (1340:16): [True: 2.26k, False: 681] ------------------ 1341| 2.94k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.94k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.94k| } _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| 1.03k| { 113| 1.03k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.03k| } _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.49k| { 337| 2.49k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.49k| } _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.49k| { 317| 2.49k| return towards_oh_ch_regular( 318| 2.49k| *this, v, idx, offset_hint, count(), args...); 319| 2.49k| } _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.49k|{ 633| 2.49k| constexpr auto B = bits; 634| 2.49k| constexpr auto BL = bits_leaf; 635| 2.49k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.49k, False: 0] ------------------ 636| 2.49k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.49k, False: 0] ------------------ 637| 2.49k| auto is_leaf = p.shift() == BL; 638| 2.49k| auto child = p.node()->inner()[offset_hint]; 639| 2.49k| auto is_full = offset_hint + 1 != count_hint; 640| 2.49k| return is_full ------------------ | Branch (640:12): [True: 1.57k, False: 915] ------------------ 641| 2.49k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 312, False: 1.26k] ------------------ 642| 1.57k| : make_full_pos(child, p.shift() - B) 643| 1.26k| .visit(v, idx, args...)) 644| 2.49k| : (is_leaf ------------------ | Branch (644:19): [True: 418, False: 497] ------------------ 645| 915| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 915| : make_regular_pos(child, p.shift() - B, p.size()) 647| 497| .visit(v, idx, args...)); 648| 2.49k|} _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.29k| { 1037| 2.29k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.29k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 40.9k|{ 1839| 40.9k| assert(node); ------------------ | Branch (1839:5): [True: 40.9k, False: 0] ------------------ 1840| 40.9k| auto relaxed = node->relaxed(); 1841| 40.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 29.4k, False: 11.5k] ------------------ 1842| 29.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 29.4k, False: 0] ------------------ 1843| 29.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 29.4k| .visit(v, std::forward(args)...); 1845| 29.4k| } else { 1846| 11.5k| return make_regular_sub_pos(node, shift, size) 1847| 11.5k| .visit(v, std::forward(args)...); 1848| 11.5k| } 1849| 40.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 29.4k| { 1814| 29.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 29.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 11.2k| { 1687| 11.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 11.2k, False: 0] ------------------ 1688| 11.2k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 11.2k] ------------------ 1689| 11.2k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 11.2k| } _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.2k| { 1699| 11.2k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 11.2k| } _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.2k| { 1718| 11.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 11.2k, False: 0] ------------------ 1719| 11.2k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 11.2k] | Branch (1719:9): [True: 11.2k, False: 0] ------------------ 1720| 11.2k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 11.2k| auto child = node_->inner()[offset_hint]; 1722| 11.2k| auto is_leaf = shift_ == BL; 1723| 11.2k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 11.2k| auto next_idx = idx - left_size_hint; 1725| 11.2k| return is_leaf ------------------ | Branch (1725:16): [True: 944, False: 10.3k] ------------------ 1726| 11.2k| ? make_leaf_sub_pos(child, next_size) 1727| 944| .visit(v, next_idx, args...) 1728| 11.2k| : visit_maybe_relaxed_sub( 1729| 10.3k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 11.2k| } _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| 944| { 145| 944| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 944| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 19.8k| { 1687| 19.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 19.8k, False: 0] ------------------ 1688| 19.8k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 19.8k] ------------------ 1689| 19.8k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 19.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 19.8k| { 1699| 19.8k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 19.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 19.8k| { 1718| 19.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 19.8k, False: 0] ------------------ 1719| 19.8k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 19.8k] | Branch (1719:9): [True: 19.8k, False: 0] ------------------ 1720| 19.8k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 19.8k| auto child = node_->inner()[offset_hint]; 1722| 19.8k| auto is_leaf = shift_ == BL; 1723| 19.8k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 19.8k| auto next_idx = idx - left_size_hint; 1725| 19.8k| return is_leaf ------------------ | Branch (1725:16): [True: 1.02k, False: 18.7k] ------------------ 1726| 19.8k| ? make_leaf_sub_pos(child, next_size) 1727| 1.02k| .visit(v, next_idx, args...) 1728| 19.8k| : visit_maybe_relaxed_sub( 1729| 18.7k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 19.8k| } _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| 1.02k| { 145| 1.02k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.02k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 18.7k|{ 1839| 18.7k| assert(node); ------------------ | Branch (1839:5): [True: 18.7k, False: 0] ------------------ 1840| 18.7k| auto relaxed = node->relaxed(); 1841| 18.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 17.6k, False: 1.10k] ------------------ 1842| 17.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 17.6k, False: 0] ------------------ 1843| 17.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 17.6k| .visit(v, std::forward(args)...); 1845| 17.6k| } else { 1846| 1.10k| return make_regular_sub_pos(node, shift, size) 1847| 1.10k| .visit(v, std::forward(args)...); 1848| 1.10k| } 1849| 18.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 17.6k| { 1814| 17.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 17.6k| } _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.43k| { 928| 2.43k| return towards_oh_ch_regular( 929| 2.43k| *this, v, idx, offset_hint, count(), args...); 930| 2.43k| } _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.43k|{ 633| 2.43k| constexpr auto B = bits; 634| 2.43k| constexpr auto BL = bits_leaf; 635| 2.43k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.43k, False: 0] ------------------ 636| 2.43k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.43k, False: 0] ------------------ 637| 2.43k| auto is_leaf = p.shift() == BL; 638| 2.43k| auto child = p.node()->inner()[offset_hint]; 639| 2.43k| auto is_full = offset_hint + 1 != count_hint; 640| 2.43k| return is_full ------------------ | Branch (640:12): [True: 2.03k, False: 403] ------------------ 641| 2.43k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 480, False: 1.55k] ------------------ 642| 2.03k| : make_full_pos(child, p.shift() - B) 643| 1.55k| .visit(v, idx, args...)) 644| 2.43k| : (is_leaf ------------------ | Branch (644:19): [True: 403, False: 0] ------------------ 645| 403| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 403| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.43k|} _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.58k| { 208| 1.58k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.58k| } _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.83k| { 1406| 1.83k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.83k| } _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.38k| { 1337| 1.38k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.38k, False: 0] ------------------ 1338| 1.38k| auto is_leaf = shift_ == BL; 1339| 1.38k| auto child = node_->inner()[offset_hint]; 1340| 1.38k| return is_leaf ------------------ | Branch (1340:16): [True: 1.10k, False: 284] ------------------ 1341| 1.38k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.38k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.38k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 2.08k| { 1337| 2.08k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.08k, False: 0] ------------------ 1338| 2.08k| auto is_leaf = shift_ == BL; 1339| 2.08k| auto child = node_->inner()[offset_hint]; 1340| 2.08k| return is_leaf ------------------ | Branch (1340:16): [True: 1.32k, False: 767] ------------------ 1341| 2.08k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.08k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.08k| } _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.12k| { 208| 3.12k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.12k| } _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.38k| { 1406| 3.38k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.38k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 2.75k| { 1406| 2.75k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.75k| } _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| 9.49k| { 1337| 9.49k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 9.49k, False: 0] ------------------ 1338| 9.49k| auto is_leaf = shift_ == BL; 1339| 9.49k| auto child = node_->inner()[offset_hint]; 1340| 9.49k| return is_leaf ------------------ | Branch (1340:16): [True: 7.12k, False: 2.36k] ------------------ 1341| 9.49k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 9.49k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 9.49k| } _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.36k| { 208| 9.36k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.36k| } _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.40k| { 1406| 5.40k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.40k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 2.83k| { 1311| 2.83k| each_i(v, start, branches, args...); 1312| 2.83k| } _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.55k, False: 1.67k] ------------------ 1267| 13.6k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 11.1k, False: 2.55k] ------------------ 1268| 11.1k| IMMER_PREFETCH(p + 1); 1269| 11.1k| make_full_leaf_pos(*p).visit(v, args...); 1270| 11.1k| } 1271| 2.55k| } else { 1272| 1.67k| auto ss = shift_ - B; 1273| 9.09k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 7.42k, False: 1.67k] ------------------ 1274| 7.42k| make_full_pos(*p, ss).visit(v, args...); 1275| 1.67k| } 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| 403| { 113| 403| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 403| } _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.76k| { 306| 2.76k| return towards_oh_ch_regular( 307| 2.76k| *this, v, idx, offset_hint, count(), args...); 308| 2.76k| } _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.76k|{ 633| 2.76k| constexpr auto B = bits; 634| 2.76k| constexpr auto BL = bits_leaf; 635| 2.76k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.76k, False: 0] ------------------ 636| 2.76k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.76k, False: 0] ------------------ 637| 2.76k| auto is_leaf = p.shift() == BL; 638| 2.76k| auto child = p.node()->inner()[offset_hint]; 639| 2.76k| auto is_full = offset_hint + 1 != count_hint; 640| 2.76k| return is_full ------------------ | Branch (640:12): [True: 1.75k, False: 1.00k] ------------------ 641| 2.76k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 826, False: 931] ------------------ 642| 1.75k| : make_full_pos(child, p.shift() - B) 643| 931| .visit(v, idx, args...)) 644| 2.76k| : (is_leaf ------------------ | Branch (644:19): [True: 660, False: 348] ------------------ 645| 1.00k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.00k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 348| .visit(v, idx, args...)); 648| 2.76k|} _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.57k| { 113| 1.57k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.57k| } _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.89k| { 337| 3.89k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.89k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 1.45k| { 337| 1.45k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.45k| } _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.37k| { 306| 4.37k| return towards_oh_ch_regular( 307| 4.37k| *this, v, idx, offset_hint, count(), args...); 308| 4.37k| } _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.37k|{ 633| 4.37k| constexpr auto B = bits; 634| 4.37k| constexpr auto BL = bits_leaf; 635| 4.37k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.37k, False: 0] ------------------ 636| 4.37k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.37k, False: 0] ------------------ 637| 4.37k| auto is_leaf = p.shift() == BL; 638| 4.37k| auto child = p.node()->inner()[offset_hint]; 639| 4.37k| auto is_full = offset_hint + 1 != count_hint; 640| 4.37k| return is_full ------------------ | Branch (640:12): [True: 1.96k, False: 2.41k] ------------------ 641| 4.37k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 895, False: 1.07k] ------------------ 642| 1.96k| : make_full_pos(child, p.shift() - B) 643| 1.07k| .visit(v, idx, args...)) 644| 4.37k| : (is_leaf ------------------ | Branch (644:19): [True: 1.75k, False: 660] ------------------ 645| 2.41k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.41k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 660| .visit(v, idx, args...)); 648| 4.37k|} _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.56k| { 113| 2.56k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.56k| } _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.25k| { 337| 3.25k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.25k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 2.76k| { 286| 2.76k| return each_right_regular(*this, v, start, args...); 287| 2.76k| } _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.76k|{ 598| 2.76k| constexpr auto B = bits; 599| 2.76k| constexpr auto BL = bits_leaf; 600| | 601| 2.76k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 1.48k, False: 1.27k] ------------------ 602| 1.48k| auto n = p.node()->inner() + start; 603| 1.48k| auto last = p.count() - 1; 604| 1.48k| auto e = p.node()->inner() + last; 605| 1.48k| if (n <= e) { ------------------ | Branch (605:13): [True: 826, False: 660] ------------------ 606| 2.81k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.99k, False: 826] ------------------ 607| 1.99k| IMMER_PREFETCH(n + 1); 608| 1.99k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.99k| } 610| 826| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 826| } 612| 1.48k| } else { 613| 1.27k| auto n = p.node()->inner() + start; 614| 1.27k| auto last = p.count() - 1; 615| 1.27k| auto e = p.node()->inner() + last; 616| 1.27k| auto ss = p.shift() - B; 617| 1.27k| if (n <= e) { ------------------ | Branch (617:13): [True: 931, False: 348] ------------------ 618| 2.18k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.25k, False: 931] ------------------ 619| 1.25k| make_full_pos(*n, ss).visit(v, args...); 620| 931| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 931| } 622| 1.27k| } 623| 2.76k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 7.13k| { 928| 7.13k| return towards_oh_ch_regular( 929| 7.13k| *this, v, idx, offset_hint, count(), args...); 930| 7.13k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 7.13k|{ 633| 7.13k| constexpr auto B = bits; 634| 7.13k| constexpr auto BL = bits_leaf; 635| 7.13k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.13k, False: 0] ------------------ 636| 7.13k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.13k, False: 0] ------------------ 637| 7.13k| auto is_leaf = p.shift() == BL; 638| 7.13k| auto child = p.node()->inner()[offset_hint]; 639| 7.13k| auto is_full = offset_hint + 1 != count_hint; 640| 7.13k| return is_full ------------------ | Branch (640:12): [True: 2.67k, False: 4.46k] ------------------ 641| 7.13k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 982, False: 1.68k] ------------------ 642| 2.67k| : make_full_pos(child, p.shift() - B) 643| 1.68k| .visit(v, idx, args...)) 644| 7.13k| : (is_leaf ------------------ | Branch (644:19): [True: 918, False: 3.54k] ------------------ 645| 4.46k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.46k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.54k| .visit(v, idx, args...)); 648| 7.13k|} _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.70k| { 928| 6.70k| return towards_oh_ch_regular( 929| 6.70k| *this, v, idx, offset_hint, count(), args...); 930| 6.70k| } _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.70k|{ 633| 6.70k| constexpr auto B = bits; 634| 6.70k| constexpr auto BL = bits_leaf; 635| 6.70k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.70k, False: 0] ------------------ 636| 6.70k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.70k, False: 0] ------------------ 637| 6.70k| auto is_leaf = p.shift() == BL; 638| 6.70k| auto child = p.node()->inner()[offset_hint]; 639| 6.70k| auto is_full = offset_hint + 1 != count_hint; 640| 6.70k| return is_full ------------------ | Branch (640:12): [True: 3.30k, False: 3.40k] ------------------ 641| 6.70k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.34k, False: 1.96k] ------------------ 642| 3.30k| : make_full_pos(child, p.shift() - B) 643| 1.96k| .visit(v, idx, args...)) 644| 6.70k| : (is_leaf ------------------ | Branch (644:19): [True: 810, False: 2.59k] ------------------ 645| 3.40k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.40k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.59k| .visit(v, idx, args...)); 648| 6.70k|} _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.5k| { 868| 11.5k| return each_right_regular(*this, v, start, args...); 869| 11.5k| } _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.5k|{ 598| 11.5k| constexpr auto B = bits; 599| 11.5k| constexpr auto BL = bits_leaf; 600| | 601| 11.5k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 3.51k, False: 7.99k] ------------------ 602| 3.51k| auto n = p.node()->inner() + start; 603| 3.51k| auto last = p.count() - 1; 604| 3.51k| auto e = p.node()->inner() + last; 605| 3.51k| if (n <= e) { ------------------ | Branch (605:13): [True: 1.90k, False: 1.61k] ------------------ 606| 3.88k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.97k, False: 1.90k] ------------------ 607| 1.97k| IMMER_PREFETCH(n + 1); 608| 1.97k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.97k| } 610| 1.90k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 1.90k| } 612| 7.99k| } else { 613| 7.99k| auto n = p.node()->inner() + start; 614| 7.99k| auto last = p.count() - 1; 615| 7.99k| auto e = p.node()->inner() + last; 616| 7.99k| auto ss = p.shift() - B; 617| 7.99k| if (n <= e) { ------------------ | Branch (617:13): [True: 4.45k, False: 3.54k] ------------------ 618| 5.75k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.30k, False: 4.45k] ------------------ 619| 1.30k| make_full_pos(*n, ss).visit(v, args...); 620| 4.45k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 4.45k| } 622| 7.99k| } 623| 11.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 19.6k| { 1814| 19.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 19.6k| } _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.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: 11.1k, False: 1.33k] ------------------ 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_Lb0ELb1EEEJRNSA_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_Lb0ELb1EEEJRNSA_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: 11.1k, False: 1.33k] | 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: 2.80k, False: 9.70k] ------------------ 1726| 12.5k| ? make_leaf_sub_pos(child, next_size) 1727| 2.80k| .visit(v, next_idx, args...) 1728| 12.5k| : visit_maybe_relaxed_sub( 1729| 9.70k| 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_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 2.80k| { 145| 2.80k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.80k| } _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.70k|{ 1839| 9.70k| assert(node); ------------------ | Branch (1839:5): [True: 9.70k, False: 0] ------------------ 1840| 9.70k| auto relaxed = node->relaxed(); 1841| 9.70k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.57k, False: 5.13k] ------------------ 1842| 4.57k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.57k, False: 0] ------------------ 1843| 4.57k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.57k| .visit(v, std::forward(args)...); 1845| 5.13k| } else { 1846| 5.13k| return make_regular_sub_pos(node, shift, size) 1847| 5.13k| .visit(v, std::forward(args)...); 1848| 5.13k| } 1849| 9.70k|} _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.57k| { 1814| 4.57k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.57k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 5.13k| { 1037| 5.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.13k| } _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.57k| { 1037| 9.57k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 9.57k| } _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: 9.91k, False: 2.59k] ------------------ 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: 9.91k, False: 2.59k] | 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.15k, False: 7.34k] ------------------ 1726| 12.5k| ? make_leaf_sub_pos(child, next_size) 1727| 5.15k| .visit(v, next_idx, args...) 1728| 12.5k| : visit_maybe_relaxed_sub( 1729| 7.34k| 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.15k| { 145| 5.15k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.15k| } _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.34k|{ 1839| 7.34k| assert(node); ------------------ | Branch (1839:5): [True: 7.34k, False: 0] ------------------ 1840| 7.34k| auto relaxed = node->relaxed(); 1841| 7.34k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.44k, False: 2.89k] ------------------ 1842| 4.44k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.44k, False: 0] ------------------ 1843| 4.44k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.44k| .visit(v, std::forward(args)...); 1845| 4.44k| } else { 1846| 2.89k| return make_regular_sub_pos(node, shift, size) 1847| 2.89k| .visit(v, std::forward(args)...); 1848| 2.89k| } 1849| 7.34k|} _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.44k| { 1814| 4.44k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.44k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 2.89k| { 1037| 2.89k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.89k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 23.8k| { 1654| 23.8k| assert(start > 0); ------------------ | Branch (1654:9): [True: 23.8k, False: 0] ------------------ 1655| 23.8k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 23.8k, False: 0] ------------------ 1656| 23.8k| auto s = relaxed_->d.sizes[start - 1]; 1657| 23.8k| auto p = node_->inner(); 1658| 23.8k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 3.75k, False: 20.0k] ------------------ 1659| 16.3k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 12.5k, False: 3.75k] ------------------ 1660| 12.5k| IMMER_PREFETCH(p + i + 1); 1661| 12.5k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 12.5k| .visit(v, args...); 1663| 12.5k| s = relaxed_->d.sizes[i]; 1664| 12.5k| assert(s); ------------------ | Branch (1664:17): [True: 12.5k, False: 0] ------------------ 1665| 12.5k| } 1666| 20.0k| } else { 1667| 20.0k| auto ss = shift_ - B; 1668| 89.0k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 68.9k, False: 20.0k] ------------------ 1669| 68.9k| visit_maybe_relaxed_sub( 1670| 68.9k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 68.9k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 68.9k, False: 0] ------------------ 1673| 68.9k| } 1674| 20.0k| } 1675| 23.8k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 11.5k| { 1037| 11.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 11.5k| } _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.37k| { 928| 4.37k| return towards_oh_ch_regular( 929| 4.37k| *this, v, idx, offset_hint, count(), args...); 930| 4.37k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 4.37k|{ 633| 4.37k| constexpr auto B = bits; 634| 4.37k| constexpr auto BL = bits_leaf; 635| 4.37k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.37k, False: 0] ------------------ 636| 4.37k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.37k, False: 0] ------------------ 637| 4.37k| auto is_leaf = p.shift() == BL; 638| 4.37k| auto child = p.node()->inner()[offset_hint]; 639| 4.37k| auto is_full = offset_hint + 1 != count_hint; 640| 4.37k| return is_full ------------------ | Branch (640:12): [True: 3.68k, False: 696] ------------------ 641| 4.37k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 920, False: 2.76k] ------------------ 642| 3.68k| : make_full_pos(child, p.shift() - B) 643| 2.76k| .visit(v, idx, args...)) 644| 4.37k| : (is_leaf ------------------ | Branch (644:19): [True: 696, False: 0] ------------------ 645| 696| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 696| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 4.37k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 1.33k| { 208| 1.33k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.33k| } _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.09k| { 1406| 3.09k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.09k| } _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| 747| { 1337| 747| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 747, False: 0] ------------------ 1338| 747| auto is_leaf = shift_ == BL; 1339| 747| auto child = node_->inner()[offset_hint]; 1340| 747| return is_leaf ------------------ | Branch (1340:16): [True: 415, False: 332] ------------------ 1341| 747| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 747| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 747| } _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| 696| { 113| 696| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 696| } _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| 929| { 145| 929| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 929| } _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| 65.4k|{ 1839| 65.4k| assert(node); ------------------ | Branch (1839:5): [True: 65.4k, False: 0] ------------------ 1840| 65.4k| auto relaxed = node->relaxed(); 1841| 65.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 59.5k, False: 5.94k] ------------------ 1842| 59.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 59.5k, False: 0] ------------------ 1843| 59.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 59.5k| .visit(v, std::forward(args)...); 1845| 59.5k| } else { 1846| 5.94k| return make_regular_sub_pos(node, shift, size) 1847| 5.94k| .visit(v, std::forward(args)...); 1848| 5.94k| } 1849| 65.4k|} _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| 59.5k| { 1814| 59.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 59.5k| } _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: 374] ------------------ 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: 374] | 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: 505] ------------------ 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: 505] | 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.32k, False: 1.15k] ------------------ 1842| 2.32k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.32k, False: 0] ------------------ 1843| 2.32k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.32k| .visit(v, std::forward(args)...); 1845| 2.32k| } else { 1846| 1.15k| return make_regular_sub_pos(node, shift, size) 1847| 1.15k| .visit(v, std::forward(args)...); 1848| 1.15k| } 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.32k| { 1814| 2.32k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.32k| } _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.15k| { 1037| 1.15k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.15k| } _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.42k| { 947| 1.42k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 1.42k| } _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.42k|{ 654| 1.42k| constexpr auto B = bits; 655| 1.42k| constexpr auto BL = bits_leaf; 656| 1.42k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 1.42k, False: 0] ------------------ 657| 1.42k| auto is_leaf = p.shift() == BL; 658| 1.42k| auto child = p.node()->inner()[offset_hint]; 659| 1.42k| auto lsize = offset_hint << p.shift(); 660| 1.42k| auto size = p.this_size(); 661| 1.42k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 1.42k| return is_full ------------------ | Branch (662:12): [True: 627, False: 801] ------------------ 663| 1.42k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 627] ------------------ 664| 627| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 627| : make_full_pos(child, p.shift() - B) 666| 627| .visit(v, idx - lsize, args...)) 667| 1.42k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 801] ------------------ 668| 801| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 801| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 801| .visit(v, idx - lsize, args...)); 672| 1.42k|} _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| 627| { 1406| 627| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 627| } _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: 816, False: 571] ------------------ 1354| 1.38k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 1.38k| : make_full_pos(child, shift_ - B) 1356| 571| .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.84k| { 208| 2.84k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.84k| } _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.56k| { 1406| 1.56k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.56k| } _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.69k| { 1349| 3.69k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 3.69k, False: 0] ------------------ 1350| 3.69k| auto is_leaf = shift_ == BL; 1351| 3.69k| auto child = node_->inner()[offset_hint]; 1352| 3.69k| auto lsize = size_t{offset_hint} << shift_; 1353| 3.69k| return is_leaf ------------------ | Branch (1353:16): [True: 3.17k, False: 514] ------------------ 1354| 3.69k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 3.69k| : make_full_pos(child, shift_ - B) 1356| 514| .visit(v, idx - lsize, args...); 1357| 3.69k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 6.97k| { 208| 6.97k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.97k| } _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.72k| { 1406| 1.72k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.72k| } _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| 801| { 1037| 801| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 801| } _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| 3.02k| { 947| 3.02k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.02k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_22slice_left_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 3.02k|{ 654| 3.02k| constexpr auto B = bits; 655| 3.02k| constexpr auto BL = bits_leaf; 656| 3.02k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.02k, False: 0] ------------------ 657| 3.02k| auto is_leaf = p.shift() == BL; 658| 3.02k| auto child = p.node()->inner()[offset_hint]; 659| 3.02k| auto lsize = offset_hint << p.shift(); 660| 3.02k| auto size = p.this_size(); 661| 3.02k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.02k| return is_full ------------------ | Branch (662:12): [True: 3.02k, False: 0] ------------------ 663| 3.02k| ? (is_leaf ------------------ | Branch (663:19): [True: 2.03k, False: 989] ------------------ 664| 3.02k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.02k| : make_full_pos(child, p.shift() - B) 666| 989| .visit(v, idx - lsize, args...)) 667| 3.02k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 3.02k|} _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.00k| { 947| 5.00k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 5.00k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_22slice_left_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 5.00k|{ 654| 5.00k| constexpr auto B = bits; 655| 5.00k| constexpr auto BL = bits_leaf; 656| 5.00k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 5.00k, False: 0] ------------------ 657| 5.00k| auto is_leaf = p.shift() == BL; 658| 5.00k| auto child = p.node()->inner()[offset_hint]; 659| 5.00k| auto lsize = offset_hint << p.shift(); 660| 5.00k| auto size = p.this_size(); 661| 5.00k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 5.00k| return is_full ------------------ | Branch (662:12): [True: 5.00k, False: 0] ------------------ 663| 5.00k| ? (is_leaf ------------------ | Branch (663:19): [True: 3.79k, False: 1.21k] ------------------ 664| 5.00k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 5.00k| : make_full_pos(child, p.shift() - B) 666| 1.21k| .visit(v, idx - lsize, args...)) 667| 5.00k| : (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.00k|} _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.24k| { 874| 5.24k| return each_left_regular(*this, v, last, args...); 875| 5.24k| } _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.24k|{ 576| 5.24k| constexpr auto B = bits; 577| 5.24k| constexpr auto BL = bits_leaf; 578| 5.24k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 5.24k, False: 0] ------------------ 579| 5.24k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 2.03k, False: 3.21k] ------------------ 580| 2.03k| auto n = p.node()->inner(); 581| 2.03k| auto e = n + last; 582| 5.49k| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.46k, False: 2.03k] ------------------ 583| 3.46k| IMMER_PREFETCH(n + 1); 584| 3.46k| make_full_leaf_pos(*n).visit(v, args...); 585| 3.46k| } 586| 3.21k| } else { 587| 3.21k| auto n = p.node()->inner(); 588| 3.21k| auto e = n + last; 589| 3.21k| auto ss = p.shift() - B; 590| 5.58k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 2.37k, False: 3.21k] ------------------ 591| 2.37k| make_full_pos(*n, ss).visit(v, args...); 592| 3.21k| } 593| 5.24k|} _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| 171k| { 1706| 171k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 171k, False: 0] ------------------ 1707| 171k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 40.8k, False: 130k] ------------------ 1708| 171k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 171k| } _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| 171k| { 1718| 171k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 171k, False: 0] ------------------ 1719| 171k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 40.8k, False: 130k] | Branch (1719:9): [True: 171k, False: 0] ------------------ 1720| 171k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 171k| auto child = node_->inner()[offset_hint]; 1722| 171k| auto is_leaf = shift_ == BL; 1723| 171k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 171k| auto next_idx = idx - left_size_hint; 1725| 171k| return is_leaf ------------------ | Branch (1725:16): [True: 3.83k, False: 167k] ------------------ 1726| 171k| ? make_leaf_sub_pos(child, next_size) 1727| 3.83k| .visit(v, next_idx, args...) 1728| 171k| : visit_maybe_relaxed_sub( 1729| 167k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 171k| } _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.83k| { 145| 3.83k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.83k| } _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| 167k|{ 1839| 167k| assert(node); ------------------ | Branch (1839:5): [True: 167k, False: 0] ------------------ 1840| 167k| auto relaxed = node->relaxed(); 1841| 167k| if (relaxed) { ------------------ | Branch (1841:9): [True: 166k, False: 1.64k] ------------------ 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| 1.64k| return make_regular_sub_pos(node, shift, size) 1847| 1.64k| .visit(v, std::forward(args)...); 1848| 1.64k| } 1849| 167k|} _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| 166k| { 1814| 166k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 166k| } _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.64k| { 1037| 1.64k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.64k| } _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| 134k| { 1706| 134k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 134k, False: 0] ------------------ 1707| 134k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 71.7k, False: 63.1k] ------------------ 1708| 134k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 134k| } _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| 134k| { 1718| 134k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 134k, False: 0] ------------------ 1719| 134k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 71.7k, False: 63.1k] | Branch (1719:9): [True: 134k, False: 0] ------------------ 1720| 134k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 134k| auto child = node_->inner()[offset_hint]; 1722| 134k| auto is_leaf = shift_ == BL; 1723| 134k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 134k| auto next_idx = idx - left_size_hint; 1725| 134k| return is_leaf ------------------ | Branch (1725:16): [True: 49.6k, False: 85.2k] ------------------ 1726| 134k| ? make_leaf_sub_pos(child, next_size) 1727| 49.6k| .visit(v, next_idx, args...) 1728| 134k| : visit_maybe_relaxed_sub( 1729| 85.2k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 134k| } _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| 49.6k| { 145| 49.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 49.6k| } _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| 85.2k|{ 1839| 85.2k| assert(node); ------------------ | Branch (1839:5): [True: 85.2k, False: 0] ------------------ 1840| 85.2k| auto relaxed = node->relaxed(); 1841| 85.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 84.1k, False: 1.07k] ------------------ 1842| 84.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 84.1k, False: 0] ------------------ 1843| 84.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 84.1k| .visit(v, std::forward(args)...); 1845| 84.1k| } else { 1846| 1.07k| return make_regular_sub_pos(node, shift, size) 1847| 1.07k| .visit(v, std::forward(args)...); 1848| 1.07k| } 1849| 85.2k|} _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| 84.1k| { 1814| 84.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 84.1k| } _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.07k| { 1037| 1.07k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.07k| } _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.94k| { 1037| 5.94k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.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_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.16k, False: 1.05k] ------------------ 663| 2.22k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.16k] ------------------ 664| 1.16k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.16k| : make_full_pos(child, p.shift() - B) 666| 1.16k| .visit(v, idx - lsize, args...)) 667| 2.22k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.05k] ------------------ 668| 1.05k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.05k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.05k| .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.16k| { 1406| 1.16k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.16k| } _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.05k| { 1037| 1.05k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.05k| } _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.2k|{ 1839| 22.2k| assert(node); ------------------ | Branch (1839:5): [True: 22.2k, False: 0] ------------------ 1840| 22.2k| auto relaxed = node->relaxed(); 1841| 22.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.4k, False: 10.8k] ------------------ 1842| 11.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.4k, False: 0] ------------------ 1843| 11.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.4k| .visit(v, std::forward(args)...); 1845| 11.4k| } else { 1846| 10.8k| return make_regular_sub_pos(node, shift, size) 1847| 10.8k| .visit(v, std::forward(args)...); 1848| 10.8k| } 1849| 22.2k|} _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| 11.4k| { 1814| 11.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.4k| } _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| 11.4k|{ 1839| 11.4k| assert(node); ------------------ | Branch (1839:5): [True: 11.4k, False: 0] ------------------ 1840| 11.4k| auto relaxed = node->relaxed(); 1841| 11.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 8.14k, False: 3.29k] ------------------ 1842| 8.14k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 8.14k, False: 0] ------------------ 1843| 8.14k| return make_relaxed_pos(node, shift, relaxed) 1844| 8.14k| .visit(v, std::forward(args)...); 1845| 8.14k| } else { 1846| 3.29k| return make_regular_sub_pos(node, shift, size) 1847| 3.29k| .visit(v, std::forward(args)...); 1848| 3.29k| } 1849| 11.4k|} _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| 8.14k| { 1814| 8.14k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 8.14k| } _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| 42.9k| { 1794| 42.9k| auto child = node_->inner()[offset]; 1795| 42.9k| auto child_size = size(offset); 1796| 42.9k| auto is_leaf = shift_ == BL; 1797| 42.9k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 18.4k, False: 24.5k] ------------------ 1798| 42.9k| : visit_maybe_relaxed_sub( 1799| 24.5k| child, shift_ - B, child_size, v, args...); 1800| 42.9k| } _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.9k| { 145| 18.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 18.9k| } _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.9k| { 1805| 18.9k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 18.9k, False: 0] ------------------ 1806| 18.9k| auto child = node_->inner()[offset]; 1807| 18.9k| auto child_size = size(offset); 1808| 18.9k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 18.9k| } _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.7k| { 145| 19.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 19.7k| } _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| 24.5k|{ 1839| 24.5k| assert(node); ------------------ | Branch (1839:5): [True: 24.5k, False: 0] ------------------ 1840| 24.5k| auto relaxed = node->relaxed(); 1841| 24.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 21.6k, False: 2.89k] ------------------ 1842| 21.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 21.6k, False: 0] ------------------ 1843| 21.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 21.6k| .visit(v, std::forward(args)...); 1845| 21.6k| } else { 1846| 2.89k| return make_regular_sub_pos(node, shift, size) 1847| 2.89k| .visit(v, std::forward(args)...); 1848| 2.89k| } 1849| 24.5k|} _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| 21.6k| { 1814| 21.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.6k| } _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| 21.6k| { 1794| 21.6k| auto child = node_->inner()[offset]; 1795| 21.6k| auto child_size = size(offset); 1796| 21.6k| auto is_leaf = shift_ == BL; 1797| 21.6k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 21.6k] ------------------ 1798| 21.6k| : visit_maybe_relaxed_sub( 1799| 21.6k| child, shift_ - B, child_size, v, args...); 1800| 21.6k| } _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| 21.6k|{ 1839| 21.6k| assert(node); ------------------ | Branch (1839:5): [True: 21.6k, False: 0] ------------------ 1840| 21.6k| auto relaxed = node->relaxed(); 1841| 21.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 21.2k, False: 339] ------------------ 1842| 21.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 21.2k, False: 0] ------------------ 1843| 21.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 21.2k| .visit(v, std::forward(args)...); 1845| 21.2k| } else { 1846| 339| return make_regular_sub_pos(node, shift, size) 1847| 339| .visit(v, std::forward(args)...); 1848| 339| } 1849| 21.6k|} _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| 21.2k| { 1814| 21.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.2k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 810| { 1037| 810| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 810| } _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.67k| { 1794| 6.67k| auto child = node_->inner()[offset]; 1795| 6.67k| auto child_size = size(offset); 1796| 6.67k| auto is_leaf = shift_ == BL; 1797| 6.67k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 3.96k, False: 2.71k] ------------------ 1798| 6.67k| : visit_maybe_relaxed_sub( 1799| 2.71k| child, shift_ - B, child_size, v, args...); 1800| 6.67k| } _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.96k| { 145| 3.96k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.96k| } _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.96k| { 1026| 3.96k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 3.96k, False: 0] ------------------ 1027| 3.96k| auto child = node_->inner()[idx]; 1028| 3.96k| auto lsize = size(idx); 1029| 3.96k| auto is_full = idx + 1 < count(); 1030| 3.96k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 3.16k, False: 800] ------------------ 1031| 3.96k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 3.96k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 207| 10.8k| { 208| 10.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.8k| } _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.71k|{ 1839| 2.71k| assert(node); ------------------ | Branch (1839:5): [True: 2.71k, False: 0] ------------------ 1840| 2.71k| auto relaxed = node->relaxed(); 1841| 2.71k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.15k, False: 558] ------------------ 1842| 2.15k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.15k, False: 0] ------------------ 1843| 2.15k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.15k| .visit(v, std::forward(args)...); 1845| 2.15k| } else { 1846| 558| return make_regular_sub_pos(node, shift, size) 1847| 558| .visit(v, std::forward(args)...); 1848| 558| } 1849| 2.71k|} _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.15k| { 1814| 2.15k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.15k| } _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.15k| { 1008| 2.15k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.15k, False: 0] ------------------ 1009| 2.15k| auto is_leaf = shift_ == BL; 1010| 2.15k| auto child = node_->inner()[idx]; 1011| 2.15k| auto lsize = size(idx); 1012| 2.15k| auto is_full = idx + 1 < count(); 1013| 2.15k| return is_full ------------------ | Branch (1013:16): [True: 1.68k, False: 471] ------------------ 1014| 2.15k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.68k] ------------------ 1015| 1.68k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.68k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.15k| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 471] ------------------ 1018| 471| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 471| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 471| .visit(v, args...)); 1021| 2.15k| } _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.14k| { 1406| 2.14k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.14k| } _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.02k| { 1794| 9.02k| auto child = node_->inner()[offset]; 1795| 9.02k| auto child_size = size(offset); 1796| 9.02k| auto is_leaf = shift_ == BL; 1797| 9.02k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 7.73k, False: 1.28k] ------------------ 1798| 9.02k| : visit_maybe_relaxed_sub( 1799| 1.28k| child, shift_ - B, child_size, v, args...); 1800| 9.02k| } _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.73k| { 145| 7.73k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.73k| } _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.73k| { 1397| 7.73k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 7.73k, False: 0] ------------------ 1398| 7.73k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 7.73k, False: 0] ------------------ 1399| 7.73k| auto child = node_->inner()[idx]; 1400| 7.73k| return make_full_leaf_pos(child).visit(v, args...); 1401| 7.73k| } _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.28k|{ 1839| 1.28k| assert(node); ------------------ | Branch (1839:5): [True: 1.28k, False: 0] ------------------ 1840| 1.28k| auto relaxed = node->relaxed(); 1841| 1.28k| if (relaxed) { ------------------ | Branch (1841:9): [True: 458, False: 829] ------------------ 1842| 458| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 458, False: 0] ------------------ 1843| 458| return make_relaxed_pos(node, shift, relaxed) 1844| 458| .visit(v, std::forward(args)...); 1845| 829| } else { 1846| 829| return make_regular_sub_pos(node, shift, size) 1847| 829| .visit(v, std::forward(args)...); 1848| 829| } 1849| 1.28k|} _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| 458| { 1814| 458| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 458| } _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| 458| { 1387| 458| assert(idx < count()); ------------------ | Branch (1387:9): [True: 458, False: 0] ------------------ 1388| 458| auto is_leaf = shift_ == BL; 1389| 458| auto child = node_->inner()[idx]; 1390| 458| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 458] ------------------ 1391| 458| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 458| } _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| 829| { 1037| 829| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 829| } _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| 829| { 1387| 829| assert(idx < count()); ------------------ | Branch (1387:9): [True: 829, False: 0] ------------------ 1388| 829| auto is_leaf = shift_ == BL; 1389| 829| auto child = node_->inner()[idx]; 1390| 829| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 829] ------------------ 1391| 829| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 829| } _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.84k| { 1223| 8.84k| auto p = node_->inner(); 1224| 8.84k| auto p2 = other->inner(); 1225| 8.84k| auto e = p + branches; 1226| 8.84k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 5.75k, False: 3.08k] ------------------ 1227| 27.6k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 25.1k, False: 2.46k] ------------------ 1228| 25.1k| IMMER_PREFETCH(p + 1); 1229| 25.1k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 3.28k, False: 21.8k] ------------------ 1230| 3.28k| return false; 1231| 25.1k| } 1232| 5.75k| } else { 1233| 3.08k| auto ss = shift_ - B; 1234| 12.8k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 11.6k, False: 1.16k] ------------------ 1235| 11.6k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 1.92k, False: 9.74k] ------------------ 1236| 1.92k| return false; 1237| 3.08k| } 1238| 3.62k| return true; 1239| 8.84k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 33.8k| { 208| 33.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 33.8k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 25.3k| { 1406| 25.3k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 25.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.24k| { 838| 8.24k| return each_pred_zip_regular(*this, v, other, args...); 839| 8.24k| } _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.24k|{ 393| 8.24k| constexpr auto B = bits; 394| 8.24k| constexpr auto BL = bits_leaf; 395| | 396| 8.24k| auto n = p.node()->inner(); 397| 8.24k| auto n2 = other->inner(); 398| 8.24k| auto last = p.count() - 1; 399| 8.24k| auto e = n + last; 400| 8.24k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.88k, False: 6.35k] ------------------ 401| 4.72k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 3.82k, False: 905] ------------------ 402| 3.82k| IMMER_PREFETCH(n + 1); 403| 3.82k| IMMER_PREFETCH(n2 + 1); 404| 3.82k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 984, False: 2.83k] ------------------ 405| 984| return false; 406| 3.82k| } 407| 905| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 6.35k| } else { 409| 6.35k| auto ss = p.shift() - B; 410| 13.7k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 10.0k, False: 3.71k] ------------------ 411| 10.0k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 2.63k, False: 7.42k] ------------------ 412| 2.63k| return false; 413| 3.71k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 6.35k| } 415| 8.24k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 3.27k| { 113| 3.27k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 3.27k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 4.97k| { 337| 4.97k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.97k| } _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| 4.13k| { 256| 4.13k| return each_pred_zip_regular(*this, v, other, args...); 257| 4.13k| } _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| 4.13k|{ 393| 4.13k| constexpr auto B = bits; 394| 4.13k| constexpr auto BL = bits_leaf; 395| | 396| 4.13k| auto n = p.node()->inner(); 397| 4.13k| auto n2 = other->inner(); 398| 4.13k| auto last = p.count() - 1; 399| 4.13k| auto e = n + last; 400| 4.13k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.60k, False: 1.52k] ------------------ 401| 7.24k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 4.87k, False: 2.37k] ------------------ 402| 4.87k| IMMER_PREFETCH(n + 1); 403| 4.87k| IMMER_PREFETCH(n2 + 1); 404| 4.87k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 237, False: 4.63k] ------------------ 405| 237| return false; 406| 4.87k| } 407| 2.37k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 2.60k| } else { 409| 1.52k| auto ss = p.shift() - B; 410| 4.85k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 3.59k, False: 1.26k] ------------------ 411| 3.59k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 260, False: 3.33k] ------------------ 412| 260| return false; 413| 1.26k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 1.52k| } 415| 4.13k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1386| 5.52k| { 1387| 5.52k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 5.52k, False: 0] ------------------ 1388| 5.52k| auto is_leaf = shift_ == BL; 1389| 5.52k| auto child = node_->inner()[idx]; 1390| 5.52k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 4.54k, False: 974] ------------------ 1391| 5.52k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 5.52k| } _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| 376k| { 208| 376k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 376k| } _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| 6.13M|{ 1839| 6.13M| assert(node); ------------------ | Branch (1839:5): [True: 6.13M, False: 0] ------------------ 1840| 6.13M| auto relaxed = node->relaxed(); 1841| 6.13M| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.73M, False: 403k] ------------------ 1842| 5.73M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.73M, False: 0] ------------------ 1843| 5.73M| return make_relaxed_pos(node, shift, relaxed) 1844| 5.73M| .visit(v, std::forward(args)...); 1845| 5.73M| } else { 1846| 403k| return make_regular_sub_pos(node, shift, size) 1847| 403k| .visit(v, std::forward(args)...); 1848| 403k| } 1849| 6.13M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 5.73M| { 1814| 5.73M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.73M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 5.73M| { 1680| 5.73M| return towards_oh(v, idx, subindex(idx), args...); 1681| 5.73M| } _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.73M| { 1687| 5.73M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 5.73M, False: 0] ------------------ 1688| 5.73M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 4.06M, False: 1.66M] ------------------ 1689| 5.73M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 5.73M| } _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.73M| { 1699| 5.73M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 5.73M| } _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.73M| { 1718| 5.73M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 5.73M, False: 0] ------------------ 1719| 5.73M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 4.06M, False: 1.66M] | Branch (1719:9): [True: 5.73M, False: 0] ------------------ 1720| 5.73M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 5.73M| auto child = node_->inner()[offset_hint]; 1722| 5.73M| auto is_leaf = shift_ == BL; 1723| 5.73M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 5.73M| auto next_idx = idx - left_size_hint; 1725| 5.73M| return is_leaf ------------------ | Branch (1725:16): [True: 1.19M, False: 4.53M] ------------------ 1726| 5.73M| ? make_leaf_sub_pos(child, next_size) 1727| 1.19M| .visit(v, next_idx, args...) 1728| 5.73M| : visit_maybe_relaxed_sub( 1729| 4.53M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 5.73M| } _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.19M| { 145| 1.19M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.19M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 403k| { 1037| 403k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 403k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 403k| { 920| 403k| return towards_oh_ch_regular( 921| 403k| *this, v, idx, index(idx), count(), args...); 922| 403k| } _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| 403k|{ 633| 403k| constexpr auto B = bits; 634| 403k| constexpr auto BL = bits_leaf; 635| 403k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 403k, False: 0] ------------------ 636| 403k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 403k, False: 0] ------------------ 637| 403k| auto is_leaf = p.shift() == BL; 638| 403k| auto child = p.node()->inner()[offset_hint]; 639| 403k| auto is_full = offset_hint + 1 != count_hint; 640| 403k| return is_full ------------------ | Branch (640:12): [True: 337k, False: 66.0k] ------------------ 641| 403k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 70.1k, False: 267k] ------------------ 642| 337k| : make_full_pos(child, p.shift() - B) 643| 267k| .visit(v, idx, args...)) 644| 403k| : (is_leaf ------------------ | Branch (644:19): [True: 13.9k, False: 52.0k] ------------------ 645| 66.0k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 66.0k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 52.0k| .visit(v, idx, args...)); 648| 403k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 384k| { 208| 384k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 384k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 622k| { 1406| 622k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 622k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 622k| { 1323| 622k| return towards_oh(v, idx, index(idx), args...); 1324| 622k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 622k| { 1337| 622k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 622k, False: 0] ------------------ 1338| 622k| auto is_leaf = shift_ == BL; 1339| 622k| auto child = node_->inner()[offset_hint]; 1340| 622k| return is_leaf ------------------ | Branch (1340:16): [True: 302k, False: 320k] ------------------ 1341| 622k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 622k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 622k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 18.9k| { 113| 18.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 18.9k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 59.1k| { 337| 59.1k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 59.1k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 59.1k| { 298| 59.1k| return towards_oh_ch_regular( 299| 59.1k| *this, v, idx, index(idx), count(), args...); 300| 59.1k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_18region_for_visitorIiEEJEEEDcOT_T0_mjjDpOT1_: 632| 59.1k|{ 633| 59.1k| constexpr auto B = bits; 634| 59.1k| constexpr auto BL = bits_leaf; 635| 59.1k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 59.1k, False: 0] ------------------ 636| 59.1k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 59.1k, False: 0] ------------------ 637| 59.1k| auto is_leaf = p.shift() == BL; 638| 59.1k| auto child = p.node()->inner()[offset_hint]; 639| 59.1k| auto is_full = offset_hint + 1 != count_hint; 640| 59.1k| return is_full ------------------ | Branch (640:12): [True: 47.0k, False: 12.0k] ------------------ 641| 59.1k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 12.0k, False: 34.9k] ------------------ 642| 47.0k| : make_full_pos(child, p.shift() - B) 643| 34.9k| .visit(v, idx, args...)) 644| 59.1k| : (is_leaf ------------------ | Branch (644:19): [True: 5.01k, False: 7.05k] ------------------ 645| 12.0k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 12.0k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 7.05k| .visit(v, idx, args...)); 648| 59.1k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1405| 41.6k| { 1406| 41.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 41.6k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1202| 41.6k| { 1203| 41.6k| auto p = node_->inner(); 1204| 41.6k| auto e = p + branches; 1205| 41.6k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 38.0k, False: 3.51k] ------------------ 1206| 337k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 300k, False: 37.1k] ------------------ 1207| 300k| IMMER_PREFETCH(p + 1); 1208| 300k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 921, False: 299k] ------------------ 1209| 921| return false; 1210| 300k| } 1211| 38.0k| } else { 1212| 3.51k| auto ss = shift_ - B; 1213| 29.0k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 25.9k, False: 3.10k] ------------------ 1214| 25.9k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 411, False: 25.5k] ------------------ 1215| 411| return false; 1216| 3.51k| } 1217| 40.2k| return true; 1218| 41.6k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 558| { 1037| 558| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 558| } _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| 558| { 1008| 558| assert(idx < count()); ------------------ | Branch (1008:9): [True: 558, False: 0] ------------------ 1009| 558| auto is_leaf = shift_ == BL; 1010| 558| auto child = node_->inner()[idx]; 1011| 558| auto lsize = size(idx); 1012| 558| auto is_full = idx + 1 < count(); 1013| 558| return is_full ------------------ | Branch (1013:16): [True: 558, False: 0] ------------------ 1014| 558| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 558] ------------------ 1015| 558| ? make_full_leaf_pos(child).visit(v, args...) 1016| 558| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 558| : (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| 558| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 2.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_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1007| 3.34k| { 1008| 3.34k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 3.34k, False: 0] ------------------ 1009| 3.34k| auto is_leaf = shift_ == BL; 1010| 3.34k| auto child = node_->inner()[idx]; 1011| 3.34k| auto lsize = size(idx); 1012| 3.34k| auto is_full = idx + 1 < count(); 1013| 3.34k| return is_full ------------------ | Branch (1013:16): [True: 1.61k, False: 1.73k] ------------------ 1014| 3.34k| ? (is_leaf ------------------ | Branch (1014:23): [True: 1.12k, False: 485] ------------------ 1015| 1.61k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.61k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 3.34k| : (is_leaf ------------------ | Branch (1017:23): [True: 936, False: 800] ------------------ 1018| 1.73k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 1.73k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 800| .visit(v, args...)); 1021| 3.34k| } _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.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_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_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_policyELb0ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 831| 14.0k| { 832| 14.0k| return each_pred_regular(*this, v, args...); 833| 14.0k| } _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| 14.0k|{ 366| 14.0k| constexpr auto B = bits; 367| 14.0k| constexpr auto BL = bits_leaf; 368| 14.0k| auto n = p.node()->inner(); 369| 14.0k| auto last = p.count() - 1; 370| 14.0k| auto e = n + last; 371| 14.0k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 9.59k, False: 4.45k] ------------------ 372| 67.7k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 58.3k, False: 9.34k] ------------------ 373| 58.3k| IMMER_PREFETCH(n + 1); 374| 58.3k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 259, False: 58.1k] ------------------ 375| 259| return false; 376| 58.3k| } 377| 9.34k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 9.59k| } else { 379| 4.45k| auto ss = p.shift() - B; 380| 15.6k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 11.8k, False: 3.82k] ------------------ 381| 11.8k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 634, False: 11.1k] ------------------ 382| 634| return false; 383| 3.82k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 4.45k| } 385| 14.0k|} _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.7k| { 113| 12.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 12.7k| } _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.16k| { 337| 5.16k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 5.16k| } _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.16k| { 250| 5.16k| return each_pred_regular(*this, v, args...); 251| 5.16k| } _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.16k|{ 366| 5.16k| constexpr auto B = bits; 367| 5.16k| constexpr auto BL = bits_leaf; 368| 5.16k| auto n = p.node()->inner(); 369| 5.16k| auto last = p.count() - 1; 370| 5.16k| auto e = n + last; 371| 5.16k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 3.57k, False: 1.59k] ------------------ 372| 15.1k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 11.8k, False: 3.36k] ------------------ 373| 11.8k| IMMER_PREFETCH(n + 1); 374| 11.8k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 207, False: 11.6k] ------------------ 375| 207| return false; 376| 11.8k| } 377| 3.36k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 3.57k| } else { 379| 1.59k| auto ss = p.shift() - B; 380| 3.76k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 2.42k, False: 1.34k] ------------------ 381| 2.42k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 251, False: 2.17k] ------------------ 382| 251| return false; 383| 1.34k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 1.59k| } 385| 5.16k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 2.89k| { 1037| 2.89k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.89k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 2.89k| { 1794| 2.89k| auto child = node_->inner()[offset]; 1795| 2.89k| auto child_size = size(offset); 1796| 2.89k| auto is_leaf = shift_ == BL; 1797| 2.89k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.89k] ------------------ 1798| 2.89k| : visit_maybe_relaxed_sub( 1799| 2.89k| child, shift_ - B, child_size, v, args...); 1800| 2.89k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.89k|{ 1839| 2.89k| assert(node); ------------------ | Branch (1839:5): [True: 2.89k, False: 0] ------------------ 1840| 2.89k| auto relaxed = node->relaxed(); 1841| 2.89k| if (relaxed) { ------------------ | Branch (1841:9): [True: 257, False: 2.63k] ------------------ 1842| 257| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 257, False: 0] ------------------ 1843| 257| return make_relaxed_pos(node, shift, relaxed) 1844| 257| .visit(v, std::forward(args)...); 1845| 2.63k| } else { 1846| 2.63k| return make_regular_sub_pos(node, shift, size) 1847| 2.63k| .visit(v, std::forward(args)...); 1848| 2.63k| } 1849| 2.89k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 257| { 1814| 257| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 257| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1007| 4.43k| { 1008| 4.43k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 4.43k, False: 0] ------------------ 1009| 4.43k| auto is_leaf = shift_ == BL; 1010| 4.43k| auto child = node_->inner()[idx]; 1011| 4.43k| auto lsize = size(idx); 1012| 4.43k| auto is_full = idx + 1 < count(); 1013| 4.43k| return is_full ------------------ | Branch (1013:16): [True: 3.92k, False: 514] ------------------ 1014| 4.43k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.30k, False: 1.62k] ------------------ 1015| 3.92k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 3.92k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.43k| : (is_leaf ------------------ | Branch (1017:23): [True: 514, False: 0] ------------------ 1018| 514| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 514| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 4.43k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 207| 5.92k| { 208| 5.92k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.92k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1804| 5.92k| { 1805| 5.92k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 5.92k, False: 0] ------------------ 1806| 5.92k| auto child = node_->inner()[offset]; 1807| 5.92k| auto child_size = size(offset); 1808| 5.92k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 5.92k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 5.92k| { 145| 5.92k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.92k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1405| 2.03k| { 1406| 2.03k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.03k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 2.03k| { 1794| 2.03k| auto child = node_->inner()[offset]; 1795| 2.03k| auto child_size = size(offset); 1796| 2.03k| auto is_leaf = shift_ == BL; 1797| 2.03k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.03k] ------------------ 1798| 2.03k| : visit_maybe_relaxed_sub( 1799| 2.03k| child, shift_ - B, child_size, v, args...); 1800| 2.03k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.03k|{ 1839| 2.03k| assert(node); ------------------ | Branch (1839:5): [True: 2.03k, False: 0] ------------------ 1840| 2.03k| auto relaxed = node->relaxed(); 1841| 2.03k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.16k, False: 866] ------------------ 1842| 1.16k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.16k, False: 0] ------------------ 1843| 1.16k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.16k| .visit(v, std::forward(args)...); 1845| 1.16k| } else { 1846| 866| return make_regular_sub_pos(node, shift, size) 1847| 866| .visit(v, std::forward(args)...); 1848| 866| } 1849| 2.03k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 1.16k| { 1814| 1.16k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.16k| } _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.03k| { 1387| 4.03k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 4.03k, False: 0] ------------------ 1388| 4.03k| auto is_leaf = shift_ == BL; 1389| 4.03k| auto child = node_->inner()[idx]; 1390| 4.03k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 3.62k, False: 411] ------------------ 1391| 4.03k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 4.03k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 866| { 1037| 866| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 866| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1793| 51.7k| { 1794| 51.7k| auto child = node_->inner()[offset]; 1795| 51.7k| auto child_size = size(offset); 1796| 51.7k| auto is_leaf = shift_ == BL; 1797| 51.7k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 21.9k, False: 29.7k] ------------------ 1798| 51.7k| : visit_maybe_relaxed_sub( 1799| 29.7k| child, shift_ - B, child_size, v, args...); 1800| 51.7k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSI_T0_E_EEEDcPSI_jmSK_DpOT1_: 1838| 186k|{ 1839| 186k| assert(node); ------------------ | Branch (1839:5): [True: 186k, False: 0] ------------------ 1840| 186k| auto relaxed = node->relaxed(); 1841| 186k| if (relaxed) { ------------------ | Branch (1841:9): [True: 172k, False: 13.2k] ------------------ 1842| 172k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 172k, False: 0] ------------------ 1843| 172k| return make_relaxed_pos(node, shift, relaxed) 1844| 172k| .visit(v, std::forward(args)...); 1845| 172k| } else { 1846| 13.2k| return make_regular_sub_pos(node, shift, size) 1847| 13.2k| .visit(v, std::forward(args)...); 1848| 13.2k| } 1849| 186k|} _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| 172k| { 1814| 172k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 172k| } _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| 172k| { 1483| 172k| auto p = node_->inner(); 1484| 172k| auto s = size_t{}; 1485| 172k| auto n = count(); 1486| 172k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 151k, False: 21.8k] ------------------ 1487| 1.27M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 1.12M, False: 150k] ------------------ 1488| 1.12M| IMMER_PREFETCH(p + i + 1); 1489| 1.12M| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 291, False: 1.12M] ------------------ 1490| 1.12M| .visit(v, args...)) 1491| 291| return false; 1492| 1.12M| s = relaxed_->d.sizes[i]; 1493| 1.12M| } 1494| 151k| } else { 1495| 21.8k| auto ss = shift_ - B; 1496| 177k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 156k, False: 21.5k] ------------------ 1497| 156k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 383, False: 156k] ------------------ 1498| 156k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 383| return false; 1500| 156k| s = relaxed_->d.sizes[i]; 1501| 156k| } 1502| 21.8k| } 1503| 172k| return true; 1504| 172k| } _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.29k| { 1037| 3.29k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.29k| } _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| 10.8k|{ 1839| 10.8k| assert(node); ------------------ | Branch (1839:5): [True: 10.8k, False: 0] ------------------ 1840| 10.8k| auto relaxed = node->relaxed(); 1841| 10.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.08k, False: 8.75k] ------------------ 1842| 2.08k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.08k, False: 0] ------------------ 1843| 2.08k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.08k| .visit(v, std::forward(args)...); 1845| 8.75k| } else { 1846| 8.75k| return make_regular_sub_pos(node, shift, size) 1847| 8.75k| .visit(v, std::forward(args)...); 1848| 8.75k| } 1849| 10.8k|} _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.08k| { 1814| 2.08k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.08k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1036| 8.75k| { 1037| 8.75k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.75k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcT_DpOT0_: 1036| 10.8k| { 1037| 10.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.8k| } _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.90k| { 145| 7.90k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.90k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2Ev: 114| 2.75M| : size{0} 115| 2.75M| , shift{BL} 116| 2.75M| , root{empty_root()} 117| 2.75M| , tail{empty_tail()} 118| 2.75M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 2.75M, False: 0] ------------------ 120| 2.75M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10empty_rootEv: 61| 2.77M| { 62| 2.77M| static const auto empty_ = [] { 63| 2.77M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 2.77M| static std::aligned_storage_t 65| 2.77M| storage; 66| 2.77M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 2.77M| }(); 68| 2.77M| return empty_->inc(); 69| 2.77M| } _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.75M| { 73| 2.75M| static const auto empty_ = [] { 74| 2.75M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 2.75M| static std::aligned_storage_t 76| 2.75M| storage; 77| 2.75M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 2.75M| }(); 79| 2.75M| return empty_->inc(); 80| 2.75M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10empty_tailEvENKUlvE_clEv: 73| 1| static const auto empty_ = [] { 74| 1| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1| static std::aligned_storage_t 76| 1| storage; 77| 1| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1| }(); _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10check_treeEv: 1372| 5.78M| { 1373| 5.78M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 5.78M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 1.64k, False: 5.78M] | | ------------------ | | 33| 5.78M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 1.64k|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 5.78M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 5.78M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 5.78M] | | ------------------ | | 33| 5.78M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 5.78M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 5.78M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 5.78M] | | ------------------ | | 33| 5.78M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 5.78M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 5.78M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 5.78M] | | ------------------ | | 33| 5.78M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1377| |#if IMMER_DEBUG_DEEP_CHECK 1378| | IMMER_INVALID_STATE_ASSERT(check_root()); 1379| | IMMER_INVALID_STATE_ASSERT(check_tail()); 1380| |#endif 1381| 5.78M| return true; 1382| 5.78M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11tail_offsetEv: 197| 29.4M| { 198| 29.4M| auto r = root->relaxed(); 199| 29.4M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 14.3M, False: 15.0M] | Branch (199:9): [True: 15.0M, False: 0] | Branch (199:9): [True: 29.4M, False: 0] ------------------ 200| 29.4M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 15.0M, False: 14.3M] ------------------ 201| 29.4M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 6.03M, False: 8.30M] ------------------ 202| | /* otherwise */ 203| 14.3M| : 0; 204| 29.4M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9tail_sizeEv: 194| 6.08M| auto tail_size() const { return size - tail_offset(); } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EED2Ev: 184| 5.78M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE3decEv: 192| 5.78M| void dec() const { traverse(dec_visitor()); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8traverseINS1_11dec_visitorEJEEEvT_DpOT0_: 208| 5.78M| { 209| 5.78M| auto tail_off = tail_offset(); 210| 5.78M| auto tail_size = size - tail_off; 211| | 212| 5.78M| if (tail_off) ------------------ | Branch (212:13): [True: 2.86M, False: 2.92M] ------------------ 213| 2.86M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 2.92M| else 215| 2.92M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 5.78M| if (tail_size) ------------------ | Branch (217:13): [True: 3.02M, False: 2.76M] ------------------ 218| 3.02M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 2.76M| else 220| 2.76M| make_empty_leaf_pos(tail).visit(v, args...); 221| 5.78M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_backEi: 500| 270k| { 501| 270k| auto ts = tail_size(); 502| 270k| if (ts < branches) { ------------------ | Branch (502:13): [True: 227k, False: 42.7k] ------------------ 503| 227k| auto new_tail = 504| 227k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 227k| return {size + 1, shift, root->inc(), new_tail}; 506| 227k| } else { 507| 42.7k| using std::get; 508| 42.7k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 42.7k| auto tail_off = tail_offset(); 510| 42.7k| IMMER_TRY { ------------------ | | 49| 42.7k|#define IMMER_TRY try ------------------ 511| 42.7k| auto new_root = 512| 42.7k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 42.7k| tail->inc(); 514| 42.7k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 42.7k| } 516| 42.7k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 42.7k| } 521| 270k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2EmjPNS1_4nodeIiSA_Lj3ELj3EEESE_: 127| 3.02M| : size{sz} 128| 3.02M| , shift{sh} 129| 3.02M| , root{r} 130| 3.02M| , tail{t} 131| 3.02M| { 132| 3.02M|#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.02M| try { 137| 3.02M| check_tree(); 138| 3.02M| } catch (...) { 139| | // This not fully constructed rrbtree owns the nodes already, have 140| | // to dec them. 141| 1.64k| if (r && t) ------------------ | Branch (141:17): [True: 1.64k, False: 0] | Branch (141:22): [True: 1.64k, False: 0] ------------------ 142| 1.64k| dec(); 143| 1.64k| throw; 144| 1.64k| } 145| |#else 146| | assert(check_tree()); 147| |#endif 148| 3.02M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_tailEPNS1_4nodeIiSA_Lj3ELj3EEEjmSE_j: 369| 1.10M| { 370| 1.10M| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 321k, False: 787k] ------------------ 371| 321k| auto new_root = 372| 321k| make_relaxed_pos(root, shift, r) 373| 321k| .visit(push_tail_visitor{}, tail, tail_size); 374| 321k| if (new_root) ------------------ | Branch (374:17): [True: 318k, False: 2.64k] ------------------ 375| 318k| return std::make_tuple(shift, new_root); 376| 2.64k| else { 377| 2.64k| auto new_root = node_t::make_inner_r_n(2); 378| 2.64k| IMMER_TRY { ------------------ | | 49| 2.64k|#define IMMER_TRY try ------------------ 379| 2.64k| auto new_path = node_t::make_path(shift, tail); 380| 2.64k| new_root->inner()[0] = root->inc(); 381| 2.64k| new_root->inner()[1] = new_path; 382| 2.64k| new_root->relaxed()->d.sizes[0] = size; 383| 2.64k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 2.64k| assert(size); ------------------ | Branch (384:21): [True: 2.64k, False: 0] ------------------ 385| 2.64k| assert(tail_size); ------------------ | Branch (385:21): [True: 2.64k, False: 0] ------------------ 386| 2.64k| new_root->relaxed()->d.count = 2u; 387| 2.64k| } 388| 2.64k| 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.64k| return std::make_tuple(shift + B, new_root); 393| 2.64k| } 394| 787k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 6.70k, False: 780k] ------------------ 395| 6.70k| auto new_root = node_t::make_inner_n(2); 396| 6.70k| IMMER_TRY { ------------------ | | 49| 6.70k|#define IMMER_TRY try ------------------ 397| 6.70k| auto new_path = node_t::make_path(shift, tail); 398| 6.70k| new_root->inner()[0] = root->inc(); 399| 6.70k| new_root->inner()[1] = new_path; 400| 6.70k| } 401| 6.70k| 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.70k| return std::make_tuple(shift + B, new_root); 406| 780k| } else if (size) { ------------------ | Branch (406:20): [True: 758k, False: 22.2k] ------------------ 407| 758k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 758k| .visit(push_tail_visitor{}, tail); 409| 758k| return std::make_tuple(shift, new_root); 410| 758k| } else { 411| 22.2k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 22.2k| } 413| 1.10M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2EOSB_: 157| 2.67M| : rrbtree{} 158| 2.67M| { 159| 2.67M| swap(*this, other); 160| 2.67M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEESC_: 176| 5.07M| { 177| 5.07M| using std::swap; 178| 5.07M| swap(x.size, y.size); 179| 5.07M| swap(x.shift, y.shift); 180| 5.07M| swap(x.root, y.root); 181| 5.07M| swap(x.tail, y.tail); 182| 5.07M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEaSEOSB_: 170| 2.40M| { 171| 2.40M| swap(*this, other); 172| 2.40M| return *this; 173| 2.40M| } 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| 143k| { 581| 143k| auto tail_off = tail_offset(); 582| 143k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 98.6k, False: 45.3k] ------------------ 583| 98.6k| auto tail_size = size - tail_off; 584| 98.6k| auto new_tail = 585| 98.6k| make_leaf_sub_pos(tail, tail_size) 586| 98.6k| .visit(update_visitor{}, idx - tail_off, fn); 587| 98.6k| return {size, shift, root->inc(), new_tail}; 588| 98.6k| } else { 589| 45.3k| auto new_root = visit_maybe_relaxed_sub( 590| 45.3k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 45.3k| return {size, shift, new_root, tail->inc()}; 592| 45.3k| } 593| 143k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4takeEm: 647| 21.1k| { 648| 21.1k| auto tail_off = tail_offset(); 649| 21.1k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 3.80k, False: 17.3k] ------------------ 650| 3.80k| return {}; 651| 17.3k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 665, False: 16.6k] ------------------ 652| 665| return *this; 653| 16.6k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 1.96k, False: 14.7k] ------------------ 654| 1.96k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 1.96k| return {new_size, shift, root->inc(), new_tail}; 656| 14.7k| } else { 657| 14.7k| using std::get; 658| 14.7k| auto l = new_size - 1; 659| 14.7k| auto v = slice_right_visitor(); 660| 14.7k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 14.7k| auto new_shift = get<0>(r); 662| 14.7k| auto new_root = get<1>(r); 663| 14.7k| auto new_tail = get<3>(r); 664| 14.7k| if (new_root) { ------------------ | Branch (664:17): [True: 10.2k, False: 4.44k] ------------------ 665| 10.2k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 10.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 10.2k, False: 0] ------------------ 666| 10.2k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 10.2k, False: 0] ------------------ 667| 10.2k| return {new_size, new_shift, new_root, new_tail}; 668| 10.2k| } else { 669| 4.44k| return {new_size, BL, empty_root(), new_tail}; 670| 4.44k| } 671| 14.7k| } 672| 21.1k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2ERKSB_: 151| 13.8k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 13.8k| { 153| 13.8k| inc(); 154| 13.8k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE3incEv: 187| 13.8k| { 188| 13.8k| root->inc(); 189| 13.8k| tail->inc(); 190| 13.8k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4dropEm: 711| 27.7k| { 712| 27.7k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.12k, False: 25.6k] ------------------ 713| 2.12k| return *this; 714| 25.6k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 1.19k, False: 24.4k] ------------------ 715| 1.19k| return {}; 716| 24.4k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 2.05k, False: 22.3k] ------------------ 717| 2.05k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 22.3k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 2.30k, False: 20.0k] ------------------ 719| 2.30k| auto tail_off = tail_offset(); 720| 2.30k| auto new_tail = 721| 2.30k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 2.30k| return {size - elems, BL, empty_root(), new_tail}; 723| 20.0k| } else { 724| 20.0k| using std::get; 725| 20.0k| auto v = slice_left_visitor(); 726| 20.0k| auto r = 727| 20.0k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 20.0k| auto new_root = get<1>(r); 729| 20.0k| auto new_shift = get<0>(r); 730| 20.0k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 20.0k| } 732| 27.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8max_sizeEv: 54| 3.66M| { 55| 3.66M| auto S = sizeof(size_t) * 8; 56| 3.66M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 3.66M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 3.66M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6concatERKSB_: 735| 2.18M| { 736| 2.18M| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 2.18M, False: 0] ------------------ 737| 2.18M| using std::get; 738| 2.18M| if (size == 0) ------------------ | Branch (738:13): [True: 4.67k, False: 2.18M] ------------------ 739| 4.67k| return r; 740| 2.18M| else if (r.size == 0) ------------------ | Branch (740:18): [True: 3.90k, False: 2.17M] ------------------ 741| 3.90k| return *this; 742| 2.17M| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 1.10M, False: 1.06M] ------------------ 743| | // just concat the tail, similar to push_back 744| 1.10M| auto tail_offst = tail_offset(); 745| 1.10M| auto tail_size = size - tail_offst; 746| 1.10M| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 154k, False: 955k] ------------------ 747| 154k| auto new_root = 748| 154k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 154k| tail->inc(); 750| 154k| return {size + r.size, 751| 154k| get<0>(new_root), 752| 154k| get<1>(new_root), 753| 154k| r.tail->inc()}; 754| 955k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 43.3k, False: 911k] ------------------ 755| 43.3k| auto new_tail = 756| 43.3k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 43.3k| return {size + r.size, shift, root->inc(), new_tail}; 758| 911k| } else { 759| 911k| auto remaining = branches - tail_size; 760| 911k| auto add_tail = 761| 911k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 911k| IMMER_TRY { ------------------ | | 49| 911k|#define IMMER_TRY try ------------------ 763| 911k| auto new_tail = 764| 911k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 911k| IMMER_TRY { ------------------ | | 49| 911k|#define IMMER_TRY try ------------------ 766| 911k| auto new_root = push_tail( 767| 911k| root, shift, tail_offst, add_tail, branches); 768| 911k| return {size + r.size, 769| 911k| get<0>(new_root), 770| 911k| get<1>(new_root), 771| 911k| new_tail}; 772| 911k| } 773| 911k| 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| 911k| } 778| 911k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 911k| } 783| 1.10M| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 6.36k, False: 1.06M] ------------------ 784| 6.36k| auto tail_offst = tail_offset(); 785| 6.36k| auto tail_size = size - tail_offst; 786| 6.36k| auto concated = 787| 6.36k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 6.36k| auto new_shift = concated.shift(); 789| 6.36k| auto new_root = concated.node(); 790| 6.36k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 6.36k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 6.36k, False: 0] ------------------ 791| 6.36k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 6.36k, False: 0] ------------------ 792| 6.36k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 1.06M| } else { 794| 1.06M| auto tail_offst = tail_offset(); 795| 1.06M| auto tail_size = size - tail_offst; 796| 1.06M| auto concated = concat_trees(root, 797| 1.06M| shift, 798| 1.06M| tail_offst, 799| 1.06M| tail, 800| 1.06M| tail_size, 801| 1.06M| r.root, 802| 1.06M| r.shift, 803| 1.06M| r.tail_offset()); 804| 1.06M| auto new_shift = concated.shift(); 805| 1.06M| auto new_root = concated.node(); 806| 1.06M| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 1.06M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 1.06M, False: 0] ------------------ 807| 1.06M| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 1.06M, False: 0] ------------------ 808| 1.06M| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 1.06M| } 810| 2.18M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 28.6k| { 479| 28.6k| auto ts = tail_size(); 480| 28.6k| if (ts < branches) { ------------------ | Branch (480:13): [True: 21.7k, False: 6.90k] ------------------ 481| 21.7k| ensure_mutable_tail(e, ts); 482| 21.7k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 21.7k| } else { 484| 6.90k| using std::get; 485| 6.90k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 6.90k| auto tail_off = tail_offset(); 487| 6.90k| IMMER_TRY { ------------------ | | 49| 6.90k|#define IMMER_TRY try ------------------ 488| 6.90k| push_tail_mut(e, tail_off, tail, ts); 489| 6.90k| tail = new_tail; 490| 6.90k| } 491| 6.90k| 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.90k| } 496| 28.6k| ++size; 497| 28.6k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 317k| { 470| 317k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 7.47k, False: 309k] ------------------ 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| 317k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj3ELj3EEEj: 417| 327k| { 418| 327k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 169k, False: 157k] ------------------ 419| 169k| auto new_root = 420| 169k| make_relaxed_pos(root, shift, r) 421| 169k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 169k| if (new_root) { ------------------ | Branch (422:17): [True: 168k, False: 1.23k] ------------------ 423| 168k| root = new_root; 424| 168k| } else { 425| 1.23k| auto new_root = node_t::make_inner_r_e(e); 426| 1.23k| IMMER_TRY { ------------------ | | 49| 1.23k|#define IMMER_TRY try ------------------ 427| 1.23k| auto new_path = node_t::make_path_e(e, shift, tail); 428| 1.23k| new_root->inner()[0] = root; 429| 1.23k| new_root->inner()[1] = new_path; 430| 1.23k| new_root->relaxed()->d.sizes[0] = tail_off; 431| 1.23k| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 1.23k| assert(tail_off); ------------------ | Branch (432:21): [True: 1.23k, False: 0] ------------------ 433| 1.23k| assert(tail_size); ------------------ | Branch (433:21): [True: 1.23k, False: 0] ------------------ 434| 1.23k| new_root->relaxed()->d.count = 2u; 435| 1.23k| root = new_root; 436| 1.23k| shift += B; 437| 1.23k| } 438| 1.23k| 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.23k| } 443| 169k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 1.92k, False: 155k] ------------------ 444| 1.92k| auto new_root = node_t::make_inner_e(e); 445| 1.92k| IMMER_TRY { ------------------ | | 49| 1.92k|#define IMMER_TRY try ------------------ 446| 1.92k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 1.92k| new_root->inner()[0] = root; 448| 1.92k| new_root->inner()[1] = new_path; 449| 1.92k| root = new_root; 450| 1.92k| shift += B; 451| 1.92k| } 452| 1.92k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 155k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 153k, False: 1.95k] ------------------ 457| 153k| auto new_root = 458| 153k| make_regular_sub_pos(root, shift, tail_off) 459| 153k| .visit(push_tail_mut_visitor{}, e, tail); 460| 153k| root = new_root; 461| 153k| } else { 462| 1.95k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 1.95k| dec_empty_regular(root); 464| 1.95k| root = new_root; 465| 1.95k| } 466| 327k| } flex-vector-st.cpp:_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10update_mutIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSG_E0_EEvNS9_5applyIS6_E4type4editEmOSG_: 573| 15.7k| { 574| 15.7k| auto& elem = get_mut(e, idx); 575| 15.7k| elem = std::forward(fn)(std::move(elem)); 576| 15.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 15.7k| { 540| 15.7k| auto tail_off = tail_offset(); 541| 15.7k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 821, False: 14.8k] ------------------ 542| 821| ensure_mutable_tail(e, size - tail_off); 543| 821| return tail->leaf()[(idx - tail_off) & mask]; 544| 14.8k| } else { 545| 14.8k| return visit_maybe_relaxed_sub(root, 546| 14.8k| shift, 547| 14.8k| tail_off, 548| 14.8k| get_mut_visitor{}, 549| 14.8k| idx, 550| 14.8k| e, 551| 14.8k| &root); 552| 14.8k| } 553| 15.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 32.8k| { 607| 32.8k| auto tail_off = tail_offset(); 608| 32.8k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 891, False: 31.9k] ------------------ 609| 891| *this = {}; 610| 31.9k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 737, False: 31.1k] ------------------ 611| 737| return; 612| 31.1k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 590, False: 30.5k] ------------------ 613| 590| auto ts = size - tail_off; 614| 590| auto newts = new_size - tail_off; 615| 590| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 310, False: 280] ------------------ 616| 310| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 310| } else { 618| 280| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 280| dec_leaf(tail, ts); 620| 280| tail = new_tail; 621| 280| } 622| 590| size = new_size; 623| 590| return; 624| 30.5k| } else { 625| 30.5k| using std::get; 626| 30.5k| auto l = new_size - 1; 627| 30.5k| auto v = slice_right_mut_visitor(); 628| 30.5k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 30.5k| auto new_shift = get<0>(r); 630| 30.5k| auto new_root = get<1>(r); 631| 30.5k| auto new_tail = get<3>(r); 632| 30.5k| if (new_root) { ------------------ | Branch (632:17): [True: 24.6k, False: 5.98k] ------------------ 633| 24.6k| root = new_root; 634| 24.6k| shift = new_shift; 635| 24.6k| } else { 636| 5.98k| root = empty_root(); 637| 5.98k| shift = BL; 638| 5.98k| } 639| 30.5k| dec_leaf(tail, size - tail_off); 640| 30.5k| size = new_size; 641| 30.5k| tail = new_tail; 642| 30.5k| return; 643| 30.5k| } 644| 32.8k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 69.5k| { 676| 69.5k| using std::get; 677| 69.5k| auto tail_off = tail_offset(); 678| 69.5k| if (elems == 0) { ------------------ | Branch (678:13): [True: 4.81k, False: 64.6k] ------------------ 679| 4.81k| return; 680| 64.6k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 223, False: 64.4k] ------------------ 681| 223| *this = {}; 682| 64.4k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 218, False: 64.2k] ------------------ 683| 218| dec_inner(root, shift, tail_off); 684| 218| shift = BL; 685| 218| root = empty_root(); 686| 218| size -= elems; 687| 218| return; 688| 64.2k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 929, False: 63.3k] ------------------ 689| 929| auto v = slice_left_mut_visitor(); 690| 929| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 929| .visit(v, elems - tail_off, e)); 692| 929| if (tail_off) { ------------------ | Branch (692:17): [True: 366, False: 563] ------------------ 693| 366| dec_inner(root, shift, tail_off); 694| 366| shift = BL; 695| 366| root = empty_root(); 696| 366| } 697| 929| size -= elems; 698| 929| return; 699| 63.3k| } else { 700| 63.3k| auto v = slice_left_mut_visitor(); 701| 63.3k| auto r = 702| 63.3k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 63.3k| shift = get<0>(r); 704| 63.3k| root = get<1>(r); 705| 63.3k| size -= elems; 706| 63.3k| return; 707| 63.3k| } 708| 69.5k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editERKSB_: 816| 340k| { 817| 340k| assert(&l != &r); ------------------ | Branch (817:9): [True: 340k, False: 0] ------------------ 818| 340k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 340k, False: 0] ------------------ 819| 340k| using std::get; 820| 340k| if (l.size == 0) ------------------ | Branch (820:13): [True: 413, False: 340k] ------------------ 821| 413| l = r; 822| 340k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 928, False: 339k] ------------------ 823| 928| return; 824| 339k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 275k, False: 63.9k] ------------------ 825| | // just concat the tail, similar to push_back 826| 275k| auto tail_offst = l.tail_offset(); 827| 275k| auto tail_size = l.size - tail_offst; 828| 275k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 18.4k, False: 257k] ------------------ 829| 18.4k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 18.4k| l.tail = r.tail->inc(); 831| 18.4k| l.size += r.size; 832| 18.4k| return; 833| 257k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 6.28k, False: 250k] ------------------ 834| 6.28k| l.ensure_mutable_tail(el, tail_size); 835| 6.28k| detail::uninitialized_copy(r.tail->leaf(), 836| 6.28k| r.tail->leaf() + r.size, 837| 6.28k| l.tail->leaf() + tail_size); 838| 6.28k| l.size += r.size; 839| 6.28k| return; 840| 250k| } else { 841| 250k| auto remaining = branches - tail_size; 842| 250k| l.ensure_mutable_tail(el, tail_size); 843| 250k| detail::uninitialized_copy(r.tail->leaf(), 844| 250k| r.tail->leaf() + remaining, 845| 250k| l.tail->leaf() + tail_size); 846| 250k| IMMER_TRY { ------------------ | | 49| 250k|#define IMMER_TRY try ------------------ 847| 250k| auto new_tail = 848| 250k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 250k| IMMER_TRY { ------------------ | | 49| 250k|#define IMMER_TRY try ------------------ 850| 250k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 250k| l.tail = new_tail; 852| 250k| l.size += r.size; 853| 250k| return; 854| 250k| } 855| 250k| 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| 250k| } 860| 250k| 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| 250k| } 865| 275k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 632, False: 63.2k] ------------------ 866| 632| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 632] ------------------ 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| 632| } else { 886| 632| auto tail_offst = l.tail_offset(); 887| 632| auto tail_size = l.size - tail_offst; 888| 632| auto concated = concat_trees( 889| 632| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 632| l = {l.size + r.size, 891| 632| concated.shift(), 892| 632| concated.node(), 893| 632| r.tail->inc()}; 894| 632| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 632, False: 0] ------------------ 895| 632| return; 896| 632| } 897| 63.2k| } else { 898| 63.2k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 63.2k] ------------------ 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| 63.2k| } else { 923| 63.2k| auto tail_offst = l.tail_offset(); 924| 63.2k| auto tail_size = l.size - tail_offst; 925| 63.2k| auto concated = concat_trees(l.root, 926| 63.2k| l.shift, 927| 63.2k| tail_offst, 928| 63.2k| l.tail, 929| 63.2k| tail_size, 930| 63.2k| r.root, 931| 63.2k| r.shift, 932| 63.2k| r.tail_offset()); 933| 63.2k| l = {l.size + r.size, 934| 63.2k| concated.shift(), 935| 63.2k| concated.node(), 936| 63.2k| r.tail->inc()}; 937| 63.2k| } 938| 63.2k| } 939| 340k| } _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.52k| { 943| 4.52k| assert(&l != &r); ------------------ | Branch (943:9): [True: 4.52k, False: 0] ------------------ 944| 4.52k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 4.52k, False: 0] ------------------ 945| 4.52k| using std::get; 946| 4.52k| if (r.size == 0) ------------------ | Branch (946:13): [True: 454, False: 4.07k] ------------------ 947| 454| r = std::move(l); 948| 4.07k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 231, False: 3.84k] ------------------ 949| 231| return; 950| 3.84k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 975, False: 2.86k] ------------------ 951| | // just concat the tail, similar to push_back 952| 975| auto tail_offst = l.tail_offset(); 953| 975| auto tail_size = l.size - tail_offst; 954| 975| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 407, False: 568] ------------------ 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| 407| auto res = 959| 407| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 407| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 407| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 407| return; 965| 568| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 310, False: 258] ------------------ 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| 310| auto new_tail = 974| 310| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 310| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 310| return; 977| 310| } else { 978| | // like the immutable version 979| 258| auto remaining = branches - tail_size; 980| 258| auto add_tail = node_t::copy_leaf_e( 981| 258| er, l.tail, tail_size, r.tail, remaining); 982| 258| IMMER_TRY { ------------------ | | 49| 258|#define IMMER_TRY try ------------------ 983| 258| auto new_tail = 984| 258| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 258| IMMER_TRY { ------------------ | | 49| 258|#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| 258| auto new_root = l.push_tail(l.root, 990| 258| l.shift, 991| 258| tail_offst, 992| 258| add_tail, 993| 258| branches); 994| 258| r = {l.size + r.size, 995| 258| get<0>(new_root), 996| 258| get<1>(new_root), 997| 258| new_tail}; 998| 258| return; 999| 258| } 1000| 258| 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| 258| } 1005| 258| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 258| } 1010| 2.86k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 1.44k, False: 1.42k] ------------------ 1011| 1.44k| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 1.44k] ------------------ 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.44k| } else { 1030| 1.44k| auto tail_offst = l.tail_offset(); 1031| 1.44k| auto tail_size = l.size - tail_offst; 1032| 1.44k| auto concated = concat_trees( 1033| 1.44k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 1.44k| r = {l.size + r.size, 1035| 1.44k| concated.shift(), 1036| 1.44k| concated.node(), 1037| 1.44k| r.tail->inc()}; 1038| 1.44k| return; 1039| 1.44k| } 1040| 1.44k| } else { 1041| 1.42k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.42k] ------------------ 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.42k| } else { 1064| 1.42k| auto tail_offst = l.tail_offset(); 1065| 1.42k| auto tail_size = l.size - tail_offst; 1066| 1.42k| auto concated = concat_trees(l.root, 1067| 1.42k| l.shift, 1068| 1.42k| tail_offst, 1069| 1.42k| l.tail, 1070| 1.42k| tail_size, 1071| 1.42k| r.root, 1072| 1.42k| r.shift, 1073| 1.42k| r.tail_offset()); 1074| 1.42k| r = {l.size + r.size, 1075| 1.42k| concated.shift(), 1076| 1.42k| concated.node(), 1077| 1.42k| r.tail->inc()}; 1078| 1.42k| return; 1079| 1.42k| } 1080| 1.42k| } 1081| 4.52k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 365k| { 1085| 365k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 365k, False: 0] ------------------ 1086| 365k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 365k, False: 0] ------------------ 1087| 365k| using std::get; 1088| 365k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 1.56k, False: 364k] ------------------ 1089| 1.56k| l = r; 1090| 364k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 1.00k, False: 363k] ------------------ 1091| 1.00k| return; 1092| 363k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 53.8k, False: 309k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 53.8k| auto tail_offst = l.tail_offset(); 1095| 53.8k| auto tail_size = l.size - tail_offst; 1096| 53.8k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 16.1k, False: 37.7k] ------------------ 1097| 16.1k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 16.1k| l.tail = r.tail->inc(); 1099| 16.1k| l.size += r.size; 1100| 16.1k| return; 1101| 37.7k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 2.78k, False: 34.9k] ------------------ 1102| 2.78k| l.ensure_mutable_tail(el, tail_size); 1103| 2.78k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 1.11k, False: 1.67k] ------------------ 1104| 1.11k| detail::uninitialized_move(r.tail->leaf(), 1105| 1.11k| r.tail->leaf() + r.size, 1106| 1.11k| 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.78k| l.size += r.size; 1112| 2.78k| 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: 14.3k, False: 20.5k] ------------------ 1117| 14.3k| detail::uninitialized_move(r.tail->leaf(), 1118| 14.3k| r.tail->leaf() + remaining, 1119| 14.3k| l.tail->leaf() + tail_size); 1120| 20.5k| else 1121| 20.5k| detail::uninitialized_copy(r.tail->leaf(), 1122| 20.5k| r.tail->leaf() + remaining, 1123| 20.5k| 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| 309k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.20k, False: 306k] ------------------ 1144| 3.20k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.20k] ------------------ 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.20k| } else { 1165| 3.20k| auto tail_offst = l.tail_offset(); 1166| 3.20k| auto tail_size = l.size - tail_offst; 1167| 3.20k| auto concated = concat_trees( 1168| 3.20k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.20k| l = {l.size + r.size, 1170| 3.20k| concated.shift(), 1171| 3.20k| concated.node(), 1172| 3.20k| r.tail->inc()}; 1173| 3.20k| return; 1174| 3.20k| } 1175| 306k| } else { 1176| 306k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 306k] ------------------ 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| 306k| } else { 1200| 306k| auto tail_offst = l.tail_offset(); 1201| 306k| auto tail_size = l.size - tail_offst; 1202| 306k| auto concated = concat_trees(l.root, 1203| 306k| l.shift, 1204| 306k| tail_offst, 1205| 306k| l.tail, 1206| 306k| tail_size, 1207| 306k| r.root, 1208| 306k| r.shift, 1209| 306k| r.tail_offset()); 1210| 306k| l = {l.size + r.size, 1211| 306k| concated.shift(), 1212| 306k| concated.node(), 1213| 306k| r.tail->inc()}; 1214| 306k| return; 1215| 306k| } 1216| 306k| } 1217| 365k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6equalsERKSB_: 315| 34.1k| { 316| 34.1k| using iter_t = rrbtree_iterator; 317| 34.1k| if (size != other.size) ------------------ | Branch (317:13): [True: 10.6k, False: 23.5k] ------------------ 318| 10.6k| return false; 319| 23.5k| if (size == 0) ------------------ | Branch (319:13): [True: 240, False: 23.3k] ------------------ 320| 240| return true; 321| 23.3k| auto tail_off = tail_offset(); 322| 23.3k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 23.3k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 22.4k, False: 834] | Branch (324:29): [True: 22.2k, 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.2k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 21.7k, False: 526] ------------------ 329| 21.7k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 10.3k, False: 11.3k] ------------------ 330| 21.7k| other.shift, 331| 21.7k| tail_off_other, 332| 21.7k| equals_visitor::rrb{}, 333| 21.7k| iter_t{other}, 334| 21.7k| root, 335| 21.7k| shift, 336| 21.7k| tail_off)) 337| 10.3k| return false; 338| 21.7k| } else { 339| 526| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 209, False: 317] ------------------ 340| 526| shift, 341| 526| tail_off, 342| 526| equals_visitor::rrb{}, 343| 526| iter_t{*this}, 344| 526| other.root, 345| 526| other.shift, 346| 526| tail_off_other)) 347| 209| return false; 348| 526| } 349| 22.2k| } 350| 12.7k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 7.90k, False: 4.83k] ------------------ 351| 12.7k| ? make_leaf_sub_pos(tail, tail_size()) 352| 7.90k| .visit(equals_visitor{}, other.tail) 353| 12.7k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 1.84k, False: 2.99k] ------------------ 354| 4.83k| ? std::equal(tail->leaf(), 355| 1.84k| tail->leaf() + (size - tail_off), 356| 1.84k| other.tail->leaf() + 357| 1.84k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 4.83k| : std::equal(tail->leaf(), 360| 2.99k| tail->leaf() + (size - tail_off), 361| 2.99k| iter_t{other} + tail_off); 362| 23.3k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE10region_forEm: 524| 1.60M| { 525| 1.60M| using std::get; 526| 1.60M| auto tail_off = tail_offset(); 527| 1.60M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 5.06k, False: 1.59M] ------------------ 528| 5.06k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.59M| } else { 530| 1.59M| auto subs = visit_maybe_relaxed_sub( 531| 1.59M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.59M| auto first = idx - get<1>(subs); 533| 1.59M| auto end = first + get<2>(subs); 534| 1.59M| return std::make_tuple(get<0>(subs), first, end); 535| 1.59M| } 536| 1.60M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11dereferenceEv: 90| 11.8M| { 91| 11.8M| using std::get; 92| 11.8M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 68.0k, False: 11.7M] | Branch (92:35): [True: 1.53M, False: 10.2M] ------------------ 93| 1.60M| curr_ = v_->region_for(i_); 94| 11.8M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 11.8M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7advanceEl: 74| 232k| { 75| 232k| using std::get; 76| 232k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 295, False: 232k] | Branch (76:9): [True: 232k, False: 0] | Branch (76:9): [True: 232k, False: 0] ------------------ 77| 232k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 232k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 232k, False: 0] ------------------ 78| 232k| i_ += n; 79| 232k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9incrementEv: 60| 10.3M| { 61| 10.3M| using std::get; 62| 10.3M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 10.3M, False: 0] ------------------ 63| 10.3M| ++i_; 64| 10.3M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2ERKNS1_7rrbtreeIiSA_Lj3ELj3EEE: 39| 25.2k| : v_{&v} 40| 25.2k| , i_{0} 41| 25.2k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 25.2k| { 43| 25.2k| } _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| 16.6k| { 32| 16.6k| return Deriv::visit_inner(std::forward(args)...); 33| 16.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| 57.1k| { 32| 57.1k| return Deriv::visit_inner(std::forward(args)...); 33| 57.1k| } _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| 812| { 38| 812| return Deriv::visit_inner(std::forward(args)...); 39| 812| } _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.17k| { 38| 4.17k| return Deriv::visit_inner(std::forward(args)...); 39| 4.17k| } _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.87k| { 38| 6.87k| return Deriv::visit_inner(std::forward(args)...); 39| 6.87k| } _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| 855| { 38| 855| return Deriv::visit_inner(std::forward(args)...); 39| 855| } _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.91k| { 38| 1.91k| return Deriv::visit_inner(std::forward(args)...); 39| 1.91k| } _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.6k| { 38| 11.6k| return Deriv::visit_inner(std::forward(args)...); 39| 11.6k| } _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.6k| { 44| 11.6k| return Deriv::visit_node(std::forward(args)...); 45| 11.6k| } _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| 8.84k| { 32| 8.84k| return Deriv::visit_inner(std::forward(args)...); 33| 8.84k| } _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| 8.84k| { 44| 8.84k| return Deriv::visit_node(std::forward(args)...); 45| 8.84k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE10visit_leafIJRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 49| 13.9M| { 50| 13.9M| return Deriv::visit_node(std::forward(args)...); 51| 13.9M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 31| 162M| { 32| 162M| return Deriv::visit_inner(std::forward(args)...); 33| 162M| } _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| 162M| { 44| 162M| return Deriv::visit_node(std::forward(args)...); 45| 162M| } _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| 162M| { 32| 162M| return Deriv::visit_inner(std::forward(args)...); 33| 162M| } _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.6k| { 32| 53.6k| return Deriv::visit_inner(std::forward(args)...); 33| 53.6k| } _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| 303| { 38| 303| return Deriv::visit_inner(std::forward(args)...); 39| 303| } _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| 903| { 38| 903| return Deriv::visit_inner(std::forward(args)...); 39| 903| } _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.12M| { 50| 5.12M| return Deriv::visit_node(std::forward(args)...); 51| 5.12M| } _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| 679k| { 38| 679k| return Deriv::visit_inner(std::forward(args)...); 39| 679k| } _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| 679k| { 44| 679k| return Deriv::visit_node(std::forward(args)...); 45| 679k| } _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| 679k| { 38| 679k| return Deriv::visit_inner(std::forward(args)...); 39| 679k| } _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.72M| { 38| 3.72M| return Deriv::visit_inner(std::forward(args)...); 39| 3.72M| } _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.72M| { 44| 3.72M| return Deriv::visit_node(std::forward(args)...); 45| 3.72M| } _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.72M| { 38| 3.72M| return Deriv::visit_inner(std::forward(args)...); 39| 3.72M| } _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.78k| { 38| 2.78k| return Deriv::visit_inner(std::forward(args)...); 39| 2.78k| } _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.78k| { 44| 2.78k| return Deriv::visit_node(std::forward(args)...); 45| 2.78k| } _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.40M| { 32| 1.40M| return Deriv::visit_inner(std::forward(args)...); 33| 1.40M| } _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.40M| { 44| 1.40M| return Deriv::visit_node(std::forward(args)...); 45| 1.40M| } _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.39M| { 32| 1.39M| return Deriv::visit_inner(std::forward(args)...); 33| 1.39M| } _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.39M| { 44| 1.39M| return Deriv::visit_node(std::forward(args)...); 45| 1.39M| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 31| 3.97M| { 32| 3.97M| return Deriv::visit_inner(std::forward(args)...); 33| 3.97M| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_: 37| 4.98k| { 38| 4.98k| return Deriv::visit_inner(std::forward(args)...); 39| 4.98k| } _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.10M| { 32| 1.10M| return Deriv::visit_inner(std::forward(args)...); 33| 1.10M| } _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| 348k| { 38| 348k| return Deriv::visit_inner(std::forward(args)...); 39| 348k| } _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.59k| { 38| 2.59k| return Deriv::visit_inner(std::forward(args)...); 39| 2.59k| } _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| 36.1k| { 38| 36.1k| return Deriv::visit_inner(std::forward(args)...); 39| 36.1k| } _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| 18.4k| { 38| 18.4k| return Deriv::visit_inner(std::forward(args)...); 39| 18.4k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 37| 16.7k| { 38| 16.7k| return Deriv::visit_inner(std::forward(args)...); 39| 16.7k| } _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.44M| { 38| 1.44M| return Deriv::visit_inner(std::forward(args)...); 39| 1.44M| } _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.0M| { 32| 11.0M| return Deriv::visit_inner(std::forward(args)...); 33| 11.0M| } _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| 3.17k| { 38| 3.17k| return Deriv::visit_inner(std::forward(args)...); 39| 3.17k| } _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| 33.6k| { 32| 33.6k| return Deriv::visit_inner(std::forward(args)...); 33| 33.6k| } _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.79k| { 38| 3.79k| return Deriv::visit_inner(std::forward(args)...); 39| 3.79k| } _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| 223| { 32| 223| return Deriv::visit_inner(std::forward(args)...); 33| 223| } _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.91k| { 32| 2.91k| return Deriv::visit_inner(std::forward(args)...); 33| 2.91k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 31| 10.9M| { 32| 10.9M| return Deriv::visit_inner(std::forward(args)...); 33| 10.9M| } _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| 15.0k| { 38| 15.0k| return Deriv::visit_inner(std::forward(args)...); 39| 15.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 15.0k| { 44| 15.0k| return Deriv::visit_node(std::forward(args)...); 45| 15.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 24.3k| { 38| 24.3k| return Deriv::visit_inner(std::forward(args)...); 39| 24.3k| } _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.3k| { 44| 24.3k| return Deriv::visit_node(std::forward(args)...); 45| 24.3k| } _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.67k| { 32| 6.67k| return Deriv::visit_inner(std::forward(args)...); 33| 6.67k| } _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.67k| { 44| 6.67k| return Deriv::visit_node(std::forward(args)...); 45| 6.67k| } _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.6k| { 38| 17.6k| return Deriv::visit_inner(std::forward(args)...); 39| 17.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_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 17.6k| { 44| 17.6k| return Deriv::visit_node(std::forward(args)...); 45| 17.6k| } _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| 11.4k| { 32| 11.4k| return Deriv::visit_inner(std::forward(args)...); 33| 11.4k| } _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| 11.4k| { 44| 11.4k| return Deriv::visit_node(std::forward(args)...); 45| 11.4k| } _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| 21.6k| { 32| 21.6k| return Deriv::visit_inner(std::forward(args)...); 33| 21.6k| } _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.15k| { 32| 2.15k| return Deriv::visit_inner(std::forward(args)...); 33| 2.15k| } _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| 458| { 32| 458| return Deriv::visit_inner(std::forward(args)...); 33| 458| } _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| 829| { 38| 829| return Deriv::visit_inner(std::forward(args)...); 39| 829| } _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.73M| { 32| 5.73M| return Deriv::visit_inner(std::forward(args)...); 33| 5.73M| } _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| 403k| { 38| 403k| return Deriv::visit_inner(std::forward(args)...); 39| 403k| } _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| 622k| { 38| 622k| return Deriv::visit_inner(std::forward(args)...); 39| 622k| } _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| 59.1k| { 38| 59.1k| return Deriv::visit_inner(std::forward(args)...); 39| 59.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj3ELj3EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 41.6k| { 38| 41.6k| return Deriv::visit_inner(std::forward(args)...); 39| 41.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 558| { 38| 558| return Deriv::visit_inner(std::forward(args)...); 39| 558| } _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| 14.0k| { 38| 14.0k| return Deriv::visit_inner(std::forward(args)...); 39| 14.0k| } _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.16k| { 38| 5.16k| return Deriv::visit_inner(std::forward(args)...); 39| 5.16k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 2.89k| { 38| 2.89k| return Deriv::visit_inner(std::forward(args)...); 39| 2.89k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 2.03k| { 38| 2.03k| return Deriv::visit_inner(std::forward(args)...); 39| 2.03k| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj3ELj3EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 31| 172k| { 32| 172k| return Deriv::visit_inner(std::forward(args)...); 33| 172k| } _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| 10.8k| { 38| 10.8k| return Deriv::visit_inner(std::forward(args)...); 39| 10.8k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 43| 10.8k| { 44| 10.8k| return Deriv::visit_node(std::forward(args)...); 45| 10.8k| } _ZN5immer6detail15auto_const_castINS_22unsafe_refcount_policyEEERT_RKS3_: 143| 745M|{ 144| 745M| return const_cast(x); 145| 745M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 438M| { 114| 438M| check_base(); 115| 438M| auto* base = static_cast(this); 116| 438M| return reinterpret_cast(base + 1); 117| 438M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 438M| { 135| 438M| static_assert(std::is_standard_layout::value && 136| 438M| !std::is_empty::value, 137| 438M| "Please add 'true' if the derived class is emtpy"); 138| 438M| } _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| 48.3M|{ 330| 48.3M| std::forward(f)(empty_t{}); 331| 48.3M|} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 2.92M|{ 189| 2.92M| return first + n; 190| 2.92M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6leaf_tEiLb1EE15get_storage_ptrEv: 75| 19.2M| { 76| 19.2M| check_base(); 77| 19.2M| return reinterpret_cast(this); 78| 19.2M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6leaf_tEiLb1EE10check_baseEv: 94| 19.2M| { 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.2M| static_assert(std::is_standard_layout::value, 100| 19.2M| "Please remove 'true' if the derived class is non emtpy"); 101| 19.2M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 4.31M|{ 237| 4.31M| return std::copy(first, last, out); 238| 4.31M|} _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| 157k|{ 345| 157k| return std::forward(f2)(empty_t{}); 346| 157k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 76.9M|{ 324| 76.9M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 3.66M, False: 73.2M] ------------------ 325| 76.9M|} _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| 212k|{ 345| 212k| return std::forward(f2)(empty_t{}); 346| 212k|} _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| 160k|{ 330| 160k| std::forward(f)(empty_t{}); 331| 160k|} _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.8k|{ 345| 19.8k| return std::forward(f2)(empty_t{}); 346| 19.8k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 310|{ 189| 310| return first + n; 190| 310|} _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| 171k|{ 345| 171k| return std::forward(f2)(empty_t{}); 346| 171k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 15.4k|{ 211| 15.4k| return std::copy(first, last, out); 212| 15.4k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.54M|{ 30| 1.54M| return x; 31| 1.54M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 15.5k|{ 261| 15.5k| auto ptr = Heap::allocate(sizeof(T)); 262| 15.5k| IMMER_TRY { ------------------ | | 49| 15.5k|#define IMMER_TRY try ------------------ 263| 15.5k| return new (ptr) T(std::forward(args)...); 264| 15.5k| } 265| 15.5k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 15.5k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2Ev: 96| 81.3k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_backEi: 246| 270k| { 247| 270k| return impl_.push_back(std::move(value)); 248| 270k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj3ELj3EEE: 536| 2.64M| : impl_(std::move(impl)) 537| 2.64M| { 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.64M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4sizeEv: 181| 4.74M| 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| 143k| { 324| 143k| return impl_.update(index, std::forward(fn)); 325| 143k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4takeEm: 350| 21.1k| { 351| 21.1k| return impl_.take(elems); 352| 21.1k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4dropEm: 376| 27.7k| { 377| 27.7k| return impl_.drop(elems); 378| 27.7k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE8max_sizeEv: 90| 1.47M| constexpr static size_type max_size() { return impl_t::max_size(); } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEESB_: 403| 2.18M| { 404| 2.18M| return l.impl_.concat(r.impl_); 405| 2.18M| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9push_backEi: 251| 28.6k| { 252| 28.6k| return push_back_move(move_t{}, std::move(value)); 253| 28.6k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 28.6k| { 548| 28.6k| impl_.push_back_mut({}, std::move(value)); 549| 28.6k| return std::move(*this); 550| 28.6k| } flex-vector-st.cpp:_ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEDcmOSE_: 329| 15.7k| { 330| 15.7k| return update_move(move_t{}, index, std::forward(fn)); 331| 15.7k| } flex-vector-st.cpp:_ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11update_moveIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEOS9_NSt3__117integral_constantIbLb1EEEmOSE_: 568| 15.7k| { 569| 15.7k| impl_.update_mut({}, index, std::forward(fn)); 570| 15.7k| return std::move(*this); 571| 15.7k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4takeEm: 355| 32.8k| { 356| 32.8k| return take_move(move_t{}, elems); 357| 32.8k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 32.8k| { 580| 32.8k| impl_.take_mut({}, elems); 581| 32.8k| return std::move(*this); 582| 32.8k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE4dropEm: 381| 69.5k| { 382| 69.5k| return drop_move(move_t{}, elems); 383| 69.5k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 69.5k| { 590| 69.5k| impl_.drop_mut({}, elems); 591| 69.5k| return std::move(*this); 592| 69.5k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEERKS9_: 409| 340k| { 410| 340k| return concat_move(move_t{}, std::move(l), r); 411| 340k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 340k| { 601| 340k| concat_mut_l(l.impl_, {}, r.impl_); 602| 340k| return std::move(l); 603| 340k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEEOS9_: 415| 4.52k| { 416| 4.52k| return concat_move(move_t{}, l, std::move(r)); 417| 4.52k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 4.52k| { 607| 4.52k| concat_mut_r(l.impl_, r.impl_, {}); 608| 4.52k| return std::move(r); 609| 4.52k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEESA_: 421| 365k| { 422| 365k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 365k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 365k| { 613| 365k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 365k| return std::move(l); 615| 365k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EEeqERKS9_: 222| 34.1k| { 223| 34.1k| return impl_.equals(other.impl_); 224| 34.1k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE5eraseEm: 480| 3.69k| { 481| 3.69k| return take(pos) + drop(pos + 1); 482| 3.69k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb0ELb1EEELj3ELj3EE6insertEmi: 442| 15.5k| { 443| 15.5k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 15.5k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 104M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 56.6M| { 28| 56.6M| return ::operator new(size); 29| 56.6M| } _ZN5immer8cpp_heap8allocateIJNS_10norefs_tagEEEEPvmDpT_: 27| 48.2M| { 28| 48.2M| return ::operator new(size); 29| 48.2M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 15.5k| { 50| 15.5k| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 15.5k| new (p) std::size_t{size}; 52| 15.5k| return ((char*) p) + extra_size; 53| 15.5k| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 15.5k| { 58| 15.5k| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 15.5k| assert(*p == size); ------------------ | Branch (59:9): [True: 15.5k, False: 0] ------------------ 60| 15.5k| Base::deallocate(size + extra_size, p, tags...); 61| 15.5k| } _ZN5immer15refcount_policyC2Ev: 28| 15.5k| : refcount{1} {}; _ZN5immer15refcount_policy3decEv: 36| 15.5k| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer22unsafe_refcount_policyC2Ev: 27| 104M| : refcount{1} {}; _ZN5immer22unsafe_refcount_policy3incEv: 33| 318M| void inc() { ++refcount; } _ZN5immer22unsafe_refcount_policy3decEv: 34| 423M| bool dec() { return --refcount == 0; } _ZN5immer22unsafe_refcount_policy6uniqueEv: 35| 3.19M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee5ownedEv: 36| 104M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee10can_mutateENS6_4editE: 35| 187k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeaSENS6_4editE: 34| 842k| ownee& operator=(edit) { return *this; };