LLVMFuzzerTestOneInput: 24| 10.3k|{ 25| 10.3k| constexpr auto var_count = 8; 26| 10.3k| constexpr auto bits = 3; 27| | 28| 10.3k| using vector_t = immer::flex_vector; 29| 10.3k| using size_t = std::uint8_t; 30| | 31| 10.3k| auto vars = std::array{}; 32| | 33| 10.3k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 34| 10.3k| auto is_valid_var_neq = [](auto other) { 35| 10.3k| return [=](auto idx) { 36| 10.3k| return idx >= 0 && idx < var_count && idx != other; 37| 10.3k| }; 38| 10.3k| }; 39| 10.3k| auto is_valid_index = [](auto& v) { 40| 10.3k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 10.3k| }; 42| 10.3k| auto is_valid_size = [](auto& v) { 43| 10.3k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 10.3k| }; 45| 10.3k| auto can_concat = [](auto&& v1, auto&& v2) { 46| 10.3k| return v1.size() + v2.size() < vector_t::max_size(); 47| 10.3k| }; 48| 10.3k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 10.3k| return v.size() < (1 << 15); 51| 10.3k| }; 52| 10.3k| return fuzzer_input{data, size}.run([&](auto& in) { 53| 10.3k| enum ops 54| 10.3k| { 55| 10.3k| op_push_back, 56| 10.3k| op_update, 57| 10.3k| op_take, 58| 10.3k| op_drop, 59| 10.3k| op_concat, 60| 10.3k| op_push_back_move, 61| 10.3k| op_update_move, 62| 10.3k| op_take_move, 63| 10.3k| op_drop_move, 64| 10.3k| op_concat_move_l, 65| 10.3k| op_concat_move_r, 66| 10.3k| op_concat_move_lr, 67| 10.3k| op_insert, 68| 10.3k| op_erase, 69| 10.3k| op_compare, 70| 10.3k| }; 71| 10.3k| auto src = read(in, is_valid_var); 72| 10.3k| auto dst = read(in, is_valid_var); 73| 10.3k| switch (read(in)) { 74| 10.3k| case op_push_back: { 75| 10.3k| vars[dst] = vars[src].push_back(42); 76| 10.3k| break; 77| 10.3k| } 78| 10.3k| case op_update: { 79| 10.3k| auto idx = read(in, is_valid_index(vars[src])); 80| 10.3k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 10.3k| break; 82| 10.3k| } 83| 10.3k| case op_take: { 84| 10.3k| auto idx = read(in, is_valid_size(vars[src])); 85| 10.3k| vars[dst] = vars[src].take(idx); 86| 10.3k| break; 87| 10.3k| } 88| 10.3k| case op_drop: { 89| 10.3k| auto idx = read(in, is_valid_size(vars[src])); 90| 10.3k| vars[dst] = vars[src].drop(idx); 91| 10.3k| break; 92| 10.3k| } 93| 10.3k| case op_concat: { 94| 10.3k| auto src2 = read(in, is_valid_var); 95| 10.3k| if (can_concat(vars[src], vars[src2])) 96| 10.3k| vars[dst] = vars[src] + vars[src2]; 97| 10.3k| break; 98| 10.3k| } 99| 10.3k| case op_push_back_move: { 100| 10.3k| vars[dst] = std::move(vars[src]).push_back(21); 101| 10.3k| break; 102| 10.3k| } 103| 10.3k| case op_update_move: { 104| 10.3k| auto idx = read(in, is_valid_index(vars[src])); 105| 10.3k| vars[dst] = 106| 10.3k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 10.3k| break; 108| 10.3k| } 109| 10.3k| case op_take_move: { 110| 10.3k| auto idx = read(in, is_valid_size(vars[src])); 111| 10.3k| vars[dst] = std::move(vars[src]).take(idx); 112| 10.3k| break; 113| 10.3k| } 114| 10.3k| case op_drop_move: { 115| 10.3k| auto idx = read(in, is_valid_size(vars[src])); 116| 10.3k| vars[dst] = std::move(vars[src]).drop(idx); 117| 10.3k| break; 118| 10.3k| } 119| 10.3k| case op_concat_move_l: { 120| 10.3k| auto src2 = read(in, is_valid_var_neq(src)); 121| 10.3k| if (can_concat(vars[src], vars[src2])) 122| 10.3k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 10.3k| break; 124| 10.3k| } 125| 10.3k| case op_concat_move_r: { 126| 10.3k| auto src2 = read(in, is_valid_var_neq(src)); 127| 10.3k| if (can_concat(vars[src], vars[src2])) 128| 10.3k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 10.3k| break; 130| 10.3k| } 131| 10.3k| case op_concat_move_lr: { 132| 10.3k| auto src2 = read(in, is_valid_var_neq(src)); 133| 10.3k| if (can_concat(vars[src], vars[src2])) 134| 10.3k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 10.3k| break; 136| 10.3k| } 137| 10.3k| case op_compare: { 138| 10.3k| using std::swap; 139| 10.3k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 140| 10.3k| swap(vars[src], vars[dst]); 141| 10.3k| break; 142| 10.3k| } 143| 10.3k| case op_erase: { 144| 10.3k| auto idx = read(in, is_valid_index(vars[src])); 145| 10.3k| vars[dst] = vars[src].erase(idx); 146| 10.3k| break; 147| 10.3k| } 148| 10.3k| case op_insert: { 149| 10.3k| auto idx = read(in, is_valid_size(vars[src])); 150| 10.3k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 10.3k| break; 152| 10.3k| } 153| 10.3k| default: 154| 10.3k| break; 155| 10.3k| }; 156| 10.3k| return true; 157| 10.3k| }); 158| 10.3k|} flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 52| 2.59M| return fuzzer_input{data, size}.run([&](auto& in) { 53| 2.59M| enum ops 54| 2.59M| { 55| 2.59M| op_push_back, 56| 2.59M| op_update, 57| 2.59M| op_take, 58| 2.59M| op_drop, 59| 2.59M| op_concat, 60| 2.59M| op_push_back_move, 61| 2.59M| op_update_move, 62| 2.59M| op_take_move, 63| 2.59M| op_drop_move, 64| 2.59M| op_concat_move_l, 65| 2.59M| op_concat_move_r, 66| 2.59M| op_concat_move_lr, 67| 2.59M| op_insert, 68| 2.59M| op_erase, 69| 2.59M| op_compare, 70| 2.59M| }; 71| 2.59M| auto src = read(in, is_valid_var); 72| 2.59M| auto dst = read(in, is_valid_var); 73| 2.59M| switch (read(in)) { 74| 341k| case op_push_back: { ------------------ | Branch (74:9): [True: 341k, False: 2.25M] ------------------ 75| 341k| vars[dst] = vars[src].push_back(42); 76| 341k| break; 77| 0| } 78| 167k| case op_update: { ------------------ | Branch (78:9): [True: 167k, False: 2.42M] ------------------ 79| 167k| auto idx = read(in, is_valid_index(vars[src])); 80| 167k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 167k| break; 82| 0| } 83| 1.87k| case op_take: { ------------------ | Branch (83:9): [True: 1.87k, False: 2.58M] ------------------ 84| 1.87k| auto idx = read(in, is_valid_size(vars[src])); 85| 1.87k| vars[dst] = vars[src].take(idx); 86| 1.87k| break; 87| 0| } 88| 17.3k| case op_drop: { ------------------ | Branch (88:9): [True: 17.3k, False: 2.57M] ------------------ 89| 17.3k| auto idx = read(in, is_valid_size(vars[src])); 90| 17.3k| vars[dst] = vars[src].drop(idx); 91| 17.3k| break; 92| 0| } 93| 689k| case op_concat: { ------------------ | Branch (93:9): [True: 689k, False: 1.90M] ------------------ 94| 689k| auto src2 = read(in, is_valid_var); 95| 689k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (95:17): [True: 675k, False: 13.7k] ------------------ 96| 675k| vars[dst] = vars[src] + vars[src2]; 97| 689k| break; 98| 0| } 99| 23.7k| case op_push_back_move: { ------------------ | Branch (99:9): [True: 23.7k, False: 2.56M] ------------------ 100| 23.7k| vars[dst] = std::move(vars[src]).push_back(21); 101| 23.7k| break; 102| 0| } 103| 35.0k| case op_update_move: { ------------------ | Branch (103:9): [True: 35.0k, False: 2.55M] ------------------ 104| 35.0k| auto idx = read(in, is_valid_index(vars[src])); 105| 35.0k| vars[dst] = 106| 35.0k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 35.0k| break; 108| 0| } 109| 31.7k| case op_take_move: { ------------------ | Branch (109:9): [True: 31.7k, False: 2.55M] ------------------ 110| 31.7k| auto idx = read(in, is_valid_size(vars[src])); 111| 31.7k| vars[dst] = std::move(vars[src]).take(idx); 112| 31.7k| break; 113| 0| } 114| 68.6k| case op_drop_move: { ------------------ | Branch (114:9): [True: 68.6k, False: 2.52M] ------------------ 115| 68.6k| auto idx = read(in, is_valid_size(vars[src])); 116| 68.6k| vars[dst] = std::move(vars[src]).drop(idx); 117| 68.6k| break; 118| 0| } 119| 200k| case op_concat_move_l: { ------------------ | Branch (119:9): [True: 200k, False: 2.39M] ------------------ 120| 200k| auto src2 = read(in, is_valid_var_neq(src)); 121| 200k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (121:17): [True: 198k, False: 2.33k] ------------------ 122| 198k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 200k| break; 124| 0| } 125| 4.20k| case op_concat_move_r: { ------------------ | Branch (125:9): [True: 4.20k, False: 2.58M] ------------------ 126| 4.20k| auto src2 = read(in, is_valid_var_neq(src)); 127| 4.20k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (127:17): [True: 3.81k, False: 386] ------------------ 128| 3.81k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 4.20k| break; 130| 0| } 131| 866k| case op_concat_move_lr: { ------------------ | Branch (131:9): [True: 866k, False: 1.72M] ------------------ 132| 866k| auto src2 = read(in, is_valid_var_neq(src)); 133| 866k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (133:17): [True: 856k, False: 9.35k] ------------------ 134| 856k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 866k| break; 136| 0| } 137| 88.7k| case op_compare: { ------------------ | Branch (137:9): [True: 88.7k, False: 2.50M] ------------------ 138| 88.7k| using std::swap; 139| 88.7k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (139:17): [True: 76.1k, False: 12.5k] | Branch (139:43): [True: 5.55k, False: 70.5k] ------------------ 140| 5.55k| swap(vars[src], vars[dst]); 141| 88.7k| break; 142| 0| } 143| 6.38k| case op_erase: { ------------------ | Branch (143:9): [True: 6.38k, False: 2.58M] ------------------ 144| 6.38k| auto idx = read(in, is_valid_index(vars[src])); 145| 6.38k| vars[dst] = vars[src].erase(idx); 146| 6.38k| break; 147| 0| } 148| 15.4k| case op_insert: { ------------------ | Branch (148:9): [True: 15.4k, False: 2.57M] ------------------ 149| 15.4k| auto idx = read(in, is_valid_size(vars[src])); 150| 15.4k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 15.4k| break; 152| 0| } 153| 24.1k| default: ------------------ | Branch (153:9): [True: 24.1k, False: 2.56M] ------------------ 154| 24.1k| break; 155| 2.59M| }; 156| 2.58M| return true; 157| 2.59M| }); flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 33| 6.25M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (33:48): [True: 6.04M, False: 204k] | Branch (33:60): [True: 5.85M, False: 194k] ------------------ flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_ENKUlSC_E_clIhEEDaSC_: 40| 237k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (40:39): [True: 237k, False: 0] | Branch (40:51): [True: 208k, False: 28.6k] ------------------ flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_: 39| 208k| auto is_valid_index = [](auto& v) { 40| 208k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 208k| }; flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 80| 167k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_ENKUlSC_E_clIhEEDaSC_: 43| 149k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (43:39): [True: 149k, False: 0] | Branch (43:51): [True: 134k, False: 14.7k] ------------------ flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_: 42| 135k| auto is_valid_size = [](auto& v) { 43| 135k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 135k| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_4clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEESC_EEDaOT_OT0_: 45| 1.76M| auto can_concat = [](auto&& v1, auto&& v2) { 46| 1.76M| return v1.size() + v2.size() < vector_t::max_size(); 47| 1.76M| }; flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 106| 35.0k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 35| 1.12M| return [=](auto idx) { 36| 1.12M| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (36:20): [True: 1.11M, False: 11.0k] | Branch (36:32): [True: 1.09M, False: 18.0k] | Branch (36:51): [True: 1.07M, False: 27.2k] ------------------ 37| 1.12M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 34| 1.07M| auto is_valid_var_neq = [](auto other) { 35| 1.07M| return [=](auto idx) { 36| 1.07M| return idx >= 0 && idx < var_count && idx != other; 37| 1.07M| }; 38| 1.07M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 48| 88.7k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 88.7k| return v.size() < (1 << 15); 51| 88.7k| }; flex-vector-bo.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 10.3k| { 51| 10.3k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 6, False: 10.3k] ------------------ 52| 6| return 0; 53| 10.3k| try { 54| 2.59M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.58M, False: 10.3k] ------------------ 55| 2.58M| continue; 56| 10.3k| } catch (const no_more_input&) { 57| 10.3k| }; 58| 10.3k| return 0; 59| 10.3k| } flex-vector-bo.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 5.86M|{ 71| 5.86M| auto x = read(fz); 72| 6.26M| while (!cond(x)) ------------------ | Branch (72:12): [True: 399k, False: 5.86M] ------------------ 73| 399k| x = read(fz); 74| 5.86M| return x; 75| 5.86M|} _Z4readIcERKT_R12fuzzer_input: 64| 9.97M|{ 65| 9.97M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 9.97M|} _ZN12fuzzer_input4nextEmm: 40| 10.3M| { 41| 10.3M| auto& p = const_cast(reinterpret_cast(data_)); 42| 10.3M| auto r = std::align(align, size, p, size_); 43| 10.3M| if (r == nullptr) ------------------ | Branch (43:13): [True: 10.3k, False: 10.3M] ------------------ 44| 10.3k| throw no_more_input{}; 45| 10.3M| return next(size); 46| 10.3M| } _ZN12fuzzer_input4nextEm: 30| 10.3M| { 31| 10.3M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 10.3M] ------------------ 32| 0| throw no_more_input{}; 33| 10.3M| auto r = data_; 34| 10.3M| data_ += size; 35| 10.3M| size_ -= size; 36| 10.3M| return r; 37| 10.3M| } flex-vector-bo.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS2_13memory_policyINS2_11heap_policyINS2_8cpp_heapEEENS2_22unsafe_refcount_policyENS2_14no_lock_policyENS2_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_: 70| 208k|{ 71| 208k| auto x = read(fz); 72| 237k| while (!cond(x)) ------------------ | Branch (72:12): [True: 28.6k, False: 208k] ------------------ 73| 28.6k| x = read(fz); 74| 208k| return x; 75| 208k|} _Z4readIhERKT_R12fuzzer_input: 64| 387k|{ 65| 387k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 387k|} flex-vector-bo.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS2_13memory_policyINS2_11heap_policyINS2_8cpp_heapEEENS2_22unsafe_refcount_policyENS2_14no_lock_policyENS2_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_: 70| 135k|{ 71| 135k| auto x = read(fz); 72| 149k| while (!cond(x)) ------------------ | Branch (72:12): [True: 14.7k, False: 135k] ------------------ 73| 14.7k| x = read(fz); 74| 135k| return x; 75| 135k|} flex-vector-bo.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 1.07M|{ 71| 1.07M| auto x = read(fz); 72| 1.12M| while (!cond(x)) ------------------ | Branch (72:12): [True: 56.3k, False: 1.07M] ------------------ 73| 56.3k| x = read(fz); 74| 1.07M| return x; 75| 1.07M|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 15.4k| : impl_{detail::make(std::forward(arg))} 86| 15.4k| { 87| 15.4k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 15.4k| : value(std::forward(args)...) 48| 15.4k| { 49| 15.4k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 15.4k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 15.4k| IMMER_NODISCARD const T& get() const { return impl_->value; } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEED2Ev: 131| 15.4k| { 132| 15.4k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 15.4k, False: 0] | Branch (132:22): [True: 15.4k, False: 0] ------------------ 133| 15.4k| impl_->~holder(); 134| 15.4k| heap::deallocate(sizeof(holder), impl_); 135| 15.4k| } 136| 15.4k| } _ZN5immer6detail3csl3getINS_22unsafe_refcount_policyEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEES3_NS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11impl_data_tENS1_6memberIS3_NS1_7inheritINSC_5applyISA_E4type5owneeEvE4typeEE4typeEE4typeE: 170| 456M| { 171| 456M| return x.get_(type_t{}); 172| 456M| } _ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11impl_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_IS9_EEDcNS1_6type_tIT_EE: 184| 456M| { 185| 456M| return n.get_(t); 186| 456M| } _ZNK5immer6detail3csl6memberINS_22unsafe_refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 456M| const T& get_(type_t) const { return d; } _ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEEEDcRNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_22unsafe_refcount_policyENS_14no_lock_policyES3_Lb1ELb1EEELj3ELj3EE11impl_data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE: 165| 36.6M| { 166| 36.6M| return x.get_(type_t{}); 167| 36.6M| } _ZN5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11impl_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE: 179| 36.6M| { 180| 36.6M| return n.get_(t); 181| 36.6M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 36.6M| T& get_(type_t) { return *this; } _ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_22unsafe_refcount_policyENS_14no_lock_policyES3_Lb1ELb1EEELj3ELj3EE11impl_data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE: 170| 294k| { 171| 294k| return x.get_(type_t{}); 172| 294k| } _ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11impl_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE: 184| 294k| { 185| 294k| return n.get_(t); 186| 294k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 294k| 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_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EdeEv: 99| 9.72M| 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_policyELb1ELb1EEELj3ELj3EEEEEDcOT_: 22| 9.72M| { 23| 9.72M| return x.dereference(); 24| 9.72M| } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_E7derivedEv: 86| 9.81M| { 87| 9.81M| static_assert(std::is_base_of::value, 88| 9.81M| "must pass a derived thing"); 89| 9.81M| return *static_cast(this); 90| 9.81M| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EpLEl: 151| 183k| { 152| 183k| access_t::advance(derived(), n); 153| 183k| return derived(); 154| 183k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEElEEDcOT_T0_: 46| 183k| { 47| 183k| return x.advance(d); 48| 183k| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_E7derivedEv: 92| 17.3M| { 93| 17.3M| static_assert(std::is_base_of::value, 94| 17.3M| "must pass a derived thing"); 95| 17.3M| return *static_cast(this); 96| 17.3M| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EppEv: 119| 8.50M| { 120| 8.50M| access_t::increment(derived()); 121| 8.50M| return derived(); 122| 8.50M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDcOT_: 28| 8.50M| { 29| 8.50M| return x.increment(); 30| 8.50M| } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EplISI_TnNSD_9enable_ifIXsrT_16is_random_accessEbE4typeELb1EEESC_l: 164| 96.3k| { 165| 96.3k| auto tmp = derived(); 166| 96.3k| return tmp += n; 167| 96.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17make_inner_n_intoEPvmj: 213| 1.38M| { 214| 1.38M| assert(n <= branches); ------------------ | Branch (214:9): [True: 1.38M, False: 0] ------------------ 215| 1.38M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 1.38M, False: 0] ------------------ 216| 1.38M| auto p = new (buffer) node_t; 217| 1.38M| p->impl.d.data.inner.relaxed = nullptr; 218| 1.38M|#if IMMER_TAGGED_NODE 219| 1.38M| p->impl.d.kind = node_t::kind_t::inner; 220| 1.38M|#endif 221| 1.38M| return p; 222| 1.38M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14sizeof_inner_nEj: 145| 38.4M| { 146| 38.4M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 38.4M, Folded] ------------------ 147| 38.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 956| 118M| { 957| 118M| refs(this).inc(); 958| 118M| return this; 959| 118M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4refsEPKSB_: 203| 456M| { 204| 456M| return auto_const_cast(get(x->impl)); 205| 456M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE16make_leaf_n_intoEPvmj: 330| 1.21M| { 331| 1.21M| assert(n <= branches); ------------------ | Branch (331:9): [True: 1.21M, False: 0] ------------------ 332| 1.21M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 1.21M, False: 0] ------------------ 333| 1.21M| auto p = new (buffer) node_t; 334| 1.21M|#if IMMER_TAGGED_NODE 335| 1.21M| p->impl.d.kind = node_t::kind_t::leaf; 336| 1.21M|#endif 337| 1.21M| return p; 338| 1.21M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13sizeof_leaf_nEj: 160| 5.25M| { 161| 5.25M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 5.25M, Folded] ------------------ 162| 5.25M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7relaxedEv: 172| 650M| { 173| 650M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 650M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 650M, False: 0] ------------------ 174| 650M| return impl.d.data.inner.relaxed; 175| 650M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4kindEv: 168| 992M| kind_t kind() const { return impl.d.kind; } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3decEv: 967| 244M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5innerEv: 184| 284M| { 185| 284M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 284M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 284M, False: 0] ------------------ 186| 284M| return impl.d.data.inner.get_storage_ptr(); 187| 284M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14delete_inner_rEPSB_j: 832| 32.9M| { 833| 32.9M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 32.9M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 32.9M, False: 0] ------------------ 834| 32.9M| auto r = p->relaxed(); 835| 32.9M| assert(r); ------------------ | Branch (835:9): [True: 32.9M, False: 0] ------------------ 836| 32.9M| static_if([&](auto) { 837| 32.9M| if (node_t::refs(r).dec()) 838| 32.9M| heap::deallocate(node_t::ownee(r).owned() 839| 32.9M| ? node_t::max_sizeof_relaxed 840| 32.9M| : node_t::sizeof_relaxed_n(n), 841| 32.9M| r); 842| 32.9M| }); 843| 32.9M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 32.9M] ------------------ 844| 32.9M| : node_t::sizeof_inner_r_n(n), 845| 32.9M| p); 846| 32.9M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPSB_: 210| 36.6M| static ownee_t& ownee(node_t* x) { return get(x->impl); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE16sizeof_inner_r_nEj: 150| 65.7M| { 151| 65.7M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 65.7M, Folded] ------------------ 152| 65.7M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11delete_leafEPSB_j: 861| 1.61M| { 862| 1.61M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 68| 1.61M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (862:9): [True: 1.61M, False: 0] ------------------ 863| 1.61M| detail::destroy_n(p->leaf(), n); 864| 1.61M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (864:26): [True: 0, False: 1.61M] ------------------ 865| 1.61M| : node_t::sizeof_leaf_n(n), 866| 1.61M| p); 867| 1.61M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4leafEv: 190| 11.4M| { 191| 11.4M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 11.4M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 11.4M, False: 0] ------------------ 192| 11.4M| return impl.d.data.leaf.get_storage_ptr(); 193| 11.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12delete_innerEPSB_j: 808| 1.46M| { 809| 1.46M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 1.46M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 1.46M, False: 0] ------------------ 810| 1.46M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 1.46M, False: 0] ------------------ 811| 1.46M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 1.46M] ------------------ 812| 1.46M| : node_t::sizeof_inner_n(n), 813| 1.46M| p); 814| 1.46M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 289k| { 795| 289k| auto dst = copy_leaf_n(n + 1, src, n); 796| 289k| IMMER_TRY { ------------------ | | 49| 289k|#define IMMER_TRY try ------------------ 797| 289k| new (dst->leaf() + n) T(std::forward(x)); 798| 289k| } 799| 289k| 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| 289k| return dst; 805| 289k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_nEjPSB_j: 696| 289k| { 697| 289k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 289k, False: 0] ------------------ 698| 289k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 289k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 289k, False: 0] ------------------ 699| 289k| auto dst = make_leaf_n(allocn); 700| 289k| IMMER_TRY { ------------------ | | 49| 289k|#define IMMER_TRY try ------------------ 701| 289k| detail::uninitialized_copy( 702| 289k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 289k| } 704| 289k| 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| 289k| return dst; 709| 289k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nEj: 341| 1.21M| { 342| 1.21M| assert(n <= branches); ------------------ | Branch (342:9): [True: 1.21M, False: 0] ------------------ 343| 1.21M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 1.21M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 1.21M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nIiEEPSB_jOT_: 470| 52.0k| { 471| 52.0k| assert(n >= 1); ------------------ | Branch (471:9): [True: 52.0k, False: 0] ------------------ 472| 52.0k| auto p = make_leaf_n(n); 473| 52.0k| IMMER_TRY { ------------------ | | 49| 52.0k|#define IMMER_TRY try ------------------ 474| 52.0k| new (p->leaf()) T(std::forward(x)); 475| 52.0k| } 476| 52.0k| 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| 52.0k| return p; 481| 52.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13do_copy_innerEPSB_SC_j: 558| 1.26M| { 559| 1.26M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 1.26M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 1.26M, False: 0] ------------------ 560| 1.26M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 1.26M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 1.26M, False: 0] ------------------ 561| 1.26M| auto p = src->inner(); 562| 1.26M| inc_nodes(p, n); 563| 1.26M| std::copy(p, p + n, dst->inner()); 564| 1.26M| return dst; 565| 1.26M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9inc_nodesEPPSB_j: 970| 24.9M| { 971| 114M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 89.9M, False: 24.9M] ------------------ 972| 89.9M| refs(*i).inc(); 973| 24.9M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14copy_inner_r_nEjPSB_j: 588| 185k| { 589| 185k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 185k, False: 0] ------------------ 590| 185k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 185k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 185k, False: 0] ------------------ 591| 185k| auto dst = make_inner_r_n(allocn); 592| 185k| return do_copy_inner_r(dst, src, n); 593| 185k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15do_copy_inner_rEPSB_SC_j: 610| 243k| { 611| 243k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 243k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 243k, False: 0] ------------------ 612| 243k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 243k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 243k, False: 0] ------------------ 613| 243k| auto src_r = src->relaxed(); 614| 243k| auto dst_r = dst->relaxed(); 615| 243k| inc_nodes(src->inner(), n); 616| 243k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 243k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 243k| dst_r->d.count = n; 619| 243k| return dst; 620| 243k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_nEj: 243| 32.7M| { 244| 32.7M| assert(n <= branches); ------------------ | Branch (244:9): [True: 32.7M, False: 0] ------------------ 245| 32.7M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 32.7M| auto mr = static_cast(nullptr); 247| 32.7M| if (embed_relaxed) { ------------------ | Branch (247:13): [True: 32.7M, Folded] ------------------ 248| 32.7M| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 32.7M| } else { 250| 0| IMMER_TRY { ------------------ | | 49| 0|#define IMMER_TRY try ------------------ 251| 0| mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{}); 252| 0| } 253| 0| 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| 0| } 258| 32.7M| auto p = new (mp) node_t; 259| 32.7M| auto r = new (mr) relaxed_t; 260| 32.7M| r->d.count = 0; 261| 32.7M| p->impl.d.data.inner.relaxed = r; 262| 32.7M|#if IMMER_TAGGED_NODE 263| 32.7M| p->impl.d.kind = node_t::kind_t::inner; 264| 32.7M|#endif 265| 32.7M| return p; 266| 32.7M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9make_pathEjPSB_: 498| 463k| { 499| 463k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 463k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 463k, False: 0] ------------------ 500| 463k| if (shift == endshift) ------------------ | Branch (500:13): [True: 385k, False: 77.3k] ------------------ 501| 385k| return node; 502| 77.3k| else { 503| 77.3k| auto n = node_t::make_inner_n(1); 504| 77.3k| IMMER_TRY { ------------------ | | 49| 77.3k|#define IMMER_TRY try ------------------ 505| 77.3k| n->inner()[0] = make_path(shift - B, node); 506| 77.3k| } 507| 77.3k| 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| 77.3k| return n; 512| 77.3k| } 513| 463k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_nEj: 224| 1.38M| { 225| 1.38M| assert(n <= branches); ------------------ | Branch (225:9): [True: 1.38M, False: 0] ------------------ 226| 1.38M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 1.38M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 1.38M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_j: 666| 180k| { 667| 180k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 180k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 180k, False: 0] ------------------ 668| 180k| auto dst = make_leaf_n(n); 669| 180k| IMMER_TRY { ------------------ | | 49| 180k|#define IMMER_TRY try ------------------ 670| 180k| detail::uninitialized_copy( 671| 180k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 180k| } 673| 180k| 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| 180k| return dst; 678| 180k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_nEjPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeE: 269| 210k| { 270| 210k| return static_if( 271| 210k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 210k| [&](auto) { 273| 210k| auto p = 274| 210k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 210k| assert(r->d.count >= n); 276| 210k| node_t::refs(r).inc(); 277| 210k| p->impl.d.data.inner.relaxed = r; 278| 210k|#if IMMER_TAGGED_NODE 279| 210k| p->impl.d.kind = node_t::kind_t::inner; 280| 210k|#endif 281| 210k| return p; 282| 210k| }); 283| 210k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_nEjPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeEENKUlT_E_clINS0_7empty_tEEEDaSI_: 271| 210k| [&](auto) { return node_t::make_inner_r_n(n); }, _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE24do_copy_inner_replace_srEPSB_SC_jjSC_: 652| 210k| { 653| 210k| if (embed_relaxed) ------------------ | Branch (653:13): [True: 210k, Folded] ------------------ 654| 210k| return do_copy_inner_replace_r(dst, src, n, offset, child); 655| 0| else { 656| 0| auto p = src->inner(); 657| 0| inc_nodes(p, offset); 658| 0| inc_nodes(p + offset + 1, n - offset - 1); 659| 0| std::copy(p, p + n, dst->inner()); 660| 0| dst->inner()[offset] = child; 661| 0| return dst; 662| 0| } 663| 210k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE23do_copy_inner_replace_rEPSB_SC_jjSC_: 624| 210k| { 625| 210k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 210k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (625:9): [True: 210k, False: 0] ------------------ 626| 210k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 210k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (626:9): [True: 210k, False: 0] ------------------ 627| 210k| auto src_r = src->relaxed(); 628| 210k| auto dst_r = dst->relaxed(); 629| 210k| auto p = src->inner(); 630| 210k| inc_nodes(p, offset); 631| 210k| inc_nodes(p + offset + 1, n - offset - 1); 632| 210k| std::copy(src->inner(), src->inner() + n, dst->inner()); 633| 210k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 634| 210k| dst_r->d.count = n; 635| 210k| dst->inner()[offset] = child; 636| 210k| return dst; 637| 210k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 71.3k| { 570| 71.3k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 71.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 71.3k, False: 0] ------------------ 571| 71.3k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 71.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 71.3k, False: 0] ------------------ 572| 71.3k| auto p = src->inner(); 573| 71.3k| inc_nodes(p, offset); 574| 71.3k| inc_nodes(p + offset + 1, n - offset - 1); 575| 71.3k| std::copy(p, p + n, dst->inner()); 576| 71.3k| dst->inner()[offset] = child; 577| 71.3k| return dst; 578| 71.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_nEjPSB_j: 543| 10.8k| { 544| 10.8k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 10.8k, False: 0] ------------------ 545| 10.8k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 10.8k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 10.8k, False: 0] ------------------ 546| 10.8k| auto dst = make_inner_n(allocn); 547| 10.8k| return do_copy_inner(dst, src, n); 548| 10.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_rEPSB_j: 581| 3.60k| { 582| 3.60k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 3.60k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 3.60k, False: 0] ------------------ 583| 3.60k| auto dst = make_inner_r_n(n); 584| 3.60k| return do_copy_inner_r(dst, src, n); 585| 3.60k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13compute_shiftEv: 977| 3.72M| { 978| 3.72M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 334k, False: 3.38M] ------------------ 979| 334k| return endshift; 980| 3.38M| else 981| 3.38M| return B + inner()[0]->compute_shift(); 982| 3.72M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5checkEjm: 986| 334k| { 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| 334k| return true; 1023| 334k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jj: 778| 297k| { 779| 297k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 297k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 297k, False: 0] ------------------ 780| 297k| auto dst = make_leaf_n(last - idx); 781| 297k| IMMER_TRY { ------------------ | | 49| 297k|#define IMMER_TRY try ------------------ 782| 297k| detail::uninitialized_copy( 783| 297k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 297k| } 785| 297k| 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| 297k| return dst; 790| 297k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jSC_j: 712| 283k| { 713| 283k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 283k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 283k, False: 0] ------------------ 714| 283k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 283k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 283k, False: 0] ------------------ 715| 283k| auto dst = make_leaf_n(n1 + n2); 716| 283k| IMMER_TRY { ------------------ | | 49| 283k|#define IMMER_TRY try ------------------ 717| 283k| detail::uninitialized_copy( 718| 283k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 283k| } 720| 283k| 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| 283k| IMMER_TRY { ------------------ | | 49| 283k|#define IMMER_TRY try ------------------ 725| 283k| detail::uninitialized_copy( 726| 283k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 283k| } 728| 283k| 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| 283k| return dst; 734| 283k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 2.63M| { 871| 2.63M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 2.33M, False: 294k] | Branch (871:39): [True: 0, False: 294k] ------------------ 872| 2.63M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPKSB_: 207| 294k| { 208| 294k| return get(x->impl); 209| 294k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 46.7k| { 682| 46.7k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 46.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 46.7k, False: 0] ------------------ 683| 46.7k| auto dst = make_leaf_e(e); 684| 46.7k| IMMER_TRY { ------------------ | | 49| 46.7k|#define IMMER_TRY try ------------------ 685| 46.7k| detail::uninitialized_copy( 686| 46.7k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 46.7k| } 688| 46.7k| 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| 46.7k| return dst; 693| 46.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 406k| { 349| 406k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 406k| ownee(p) = e; 351| 406k|#if IMMER_TAGGED_NODE 352| 406k| p->impl.d.kind = node_t::kind_t::leaf; 353| 406k|#endif 354| 406k| return p; 355| 406k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 9.56k| { 486| 9.56k| auto p = make_leaf_e(e); 487| 9.56k| IMMER_TRY { ------------------ | | 49| 9.56k|#define IMMER_TRY try ------------------ 488| 9.56k| new (p->leaf()) T(std::forward(x)); 489| 9.56k| } 490| 9.56k| 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| 9.56k| return p; 495| 9.56k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 180k| { 931| 180k| auto src_r = relaxed(); 932| 180k| return static_if( 933| 180k| [&](auto) { return src_r; }, 934| 180k| [&](auto) { 935| 180k| if (node_t::refs(src_r).unique() || 936| 180k| node_t::ownee(src_r).can_mutate(e)) 937| 180k| return src_r; 938| 180k| else { 939| 180k| auto dst_r = 940| 180k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 180k| if (src_r) { 942| 180k| std::copy( 943| 180k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 180k| if (node_t::refs(src_r).dec()) 945| 180k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 180k| src_r); 947| 180k| } 948| 180k| dst_r->d.count = n; 949| 180k| node_t::ownee(dst_r) = e; 950| 180k| return impl.d.data.inner.relaxed = dst_r; 951| 180k| } 952| 180k| }); 953| 180k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEjENKUlT_E_clINS0_7empty_tEEEDaSG_: 933| 180k| [&](auto) { return src_r; }, _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14copy_inner_r_eENS9_5applyIS6_E4type4editEPSB_j: 596| 19.7k| { 597| 19.7k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 19.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (597:9): [True: 19.7k, False: 0] ------------------ 598| 19.7k| auto dst = make_inner_r_e(e); 599| 19.7k| return do_copy_inner_r(dst, src, n); 600| 19.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 286| 162k| { 287| 162k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 162k| auto mr = static_cast(nullptr); 289| 162k| if (embed_relaxed) { ------------------ | Branch (289:13): [True: 162k, Folded] ------------------ 290| 162k| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 162k| } else { 292| 0| IMMER_TRY { ------------------ | | 49| 0|#define IMMER_TRY try ------------------ 293| 0| mr = heap::allocate(max_sizeof_relaxed, norefs_tag{}); 294| 0| } 295| 0| IMMER_CATCH (...) { 296| 0| heap::deallocate(max_sizeof_inner_r, mp); 297| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 298| 0| } 299| 0| } 300| 162k| auto p = new (mp) node_t; 301| 162k| auto r = new (mr) relaxed_t; 302| 162k| ownee(p) = e; 303| 162k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 162k| r->d.count = 0; 305| 162k| p->impl.d.data.inner.relaxed = r; 306| 162k|#if IMMER_TAGGED_NODE 307| 162k| p->impl.d.kind = node_t::kind_t::inner; 308| 162k|#endif 309| 162k| return p; 310| 162k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_path_eENS9_5applyIS6_E4type4editEjPSB_: 516| 399k| { 517| 399k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 399k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 399k, False: 0] ------------------ 518| 399k| if (shift == endshift) ------------------ | Branch (518:13): [True: 346k, False: 53.1k] ------------------ 519| 346k| return node; 520| 53.1k| else { 521| 53.1k| auto n = node_t::make_inner_e(e); 522| 53.1k| IMMER_TRY { ------------------ | | 49| 53.1k|#define IMMER_TRY try ------------------ 523| 53.1k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 53.1k| } 525| 53.1k| 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| 53.1k| return n; 530| 53.1k| } 531| 399k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 84.2k| { 232| 84.2k| auto m = heap::allocate(max_sizeof_inner); 233| 84.2k| auto p = new (m) node_t; 234| 84.2k| ownee(p) = e; 235| 84.2k| p->impl.d.data.inner.relaxed = nullptr; 236| 84.2k|#if IMMER_TAGGED_NODE 237| 84.2k| p->impl.d.kind = node_t::kind_t::inner; 238| 84.2k|#endif 239| 84.2k| return p; 240| 84.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 19.7k| { 552| 19.7k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 19.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 19.7k, False: 0] ------------------ 553| 19.7k| auto dst = make_inner_e(e); 554| 19.7k| return do_copy_inner(dst, src, n); 555| 19.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 34.8k| { 604| 34.8k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 34.8k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 34.8k, False: 0] ------------------ 605| 34.8k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 34.8k| return do_copy_inner_sr(dst, src, n); 607| 34.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeE: 313| 34.8k| { 314| 34.8k| return static_if( 315| 34.8k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 34.8k| [&](auto) { 317| 34.8k| auto p = 318| 34.8k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 34.8k| node_t::refs(r).inc(); 320| 34.8k| p->impl.d.data.inner.relaxed = r; 321| 34.8k| node_t::ownee(p) = e; 322| 34.8k|#if IMMER_TAGGED_NODE 323| 34.8k| p->impl.d.kind = node_t::kind_t::inner; 324| 34.8k|#endif 325| 34.8k| return p; 326| 34.8k| }); 327| 34.8k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeEENKUlT_E_clINS0_7empty_tEEEDaSM_: 315| 34.8k| [&](auto) { return node_t::make_inner_r_e(e); }, _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE16do_copy_inner_srEPSB_SC_j: 640| 34.8k| { 641| 34.8k| if (embed_relaxed) ------------------ | Branch (641:13): [True: 34.8k, Folded] ------------------ 642| 34.8k| return do_copy_inner_r(dst, src, n); 643| 0| else { 644| 0| inc_nodes(src->inner(), n); 645| 0| std::copy(src->inner(), src->inner() + n, dst->inner()); 646| 0| return dst; 647| 0| } 648| 34.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 349k| { 764| 349k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 349k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 349k, False: 0] ------------------ 765| 349k| auto dst = make_leaf_e(e); 766| 349k| IMMER_TRY { ------------------ | | 49| 349k|#define IMMER_TRY try ------------------ 767| 349k| detail::uninitialized_copy( 768| 349k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 349k| } 770| 349k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 349k| return dst; 775| 349k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 209k| { 878| 209k| auto src_r = relaxed(); 879| 209k| return static_if( 880| 209k| [&](auto) { return src_r; }, 881| 209k| [&](auto) { 882| 209k| if (node_t::refs(src_r).unique() || 883| 209k| node_t::ownee(src_r).can_mutate(e)) 884| 209k| return src_r; 885| 209k| else { 886| 209k| auto dst_r = impl.d.data.inner.relaxed = 887| 209k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 209k| if (src_r) { 889| 209k| auto n = dst_r->d.count = src_r->d.count; 890| 209k| std::copy( 891| 209k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 209k| if (node_t::refs(src_r).dec()) 893| 209k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 209k| src_r); 895| 209k| } 896| 209k| node_t::ownee(dst_r) = e; 897| 209k| return dst_r; 898| 209k| } 899| 209k| }); 900| 209k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editEENKUlT_E_clINS0_7empty_tEEEDaSG_: 880| 209k| [&](auto) { return src_r; }, _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j: 738| 500| { 739| 500| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 500|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 500, False: 0] ------------------ 740| 500| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 500|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 500, False: 0] ------------------ 741| 500| auto dst = make_leaf_e(e); 742| 500| IMMER_TRY { ------------------ | | 49| 500|#define IMMER_TRY try ------------------ 743| 500| detail::uninitialized_copy( 744| 500| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 500| } 746| 500| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 500| IMMER_TRY { ------------------ | | 49| 500|#define IMMER_TRY try ------------------ 751| 500| detail::uninitialized_copy( 752| 500| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 500| } 754| 500| 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| 500| return dst; 760| 500| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 523| 164M| { 524| 164M| using node_t = node_type; 525| 164M| auto node = p.node(); 526| 164M| if (node->dec()) { ------------------ | Branch (526:13): [True: 32.9M, False: 131M] ------------------ 527| 32.9M| p.each(this_t{}); 528| 32.9M| node_t::delete_inner_r(node, p.count()); 529| 32.9M| } 530| 164M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 14.2M| { 535| 14.2M| using node_t = node_type; 536| 14.2M| auto node = p.node(); 537| 14.2M| if (node->dec()) { ------------------ | Branch (537:13): [True: 451k, False: 13.7M] ------------------ 538| 451k| p.each(this_t{}); 539| 451k| node_t::delete_inner(node, p.count()); 540| 451k| } 541| 14.2M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.76M| { 546| 1.76M| using node_t = node_type; 547| 1.76M| auto node = p.node(); 548| 1.76M| if (node->dec()) { ------------------ | Branch (548:13): [True: 577k, False: 1.18M] ------------------ 549| 577k| node_t::delete_leaf(node, p.count()); 550| 577k| } 551| 1.76M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 411k| { 546| 411k| using node_t = node_type; 547| 411k| auto node = p.node(); 548| 411k| if (node->dec()) { ------------------ | Branch (548:13): [True: 49.5k, False: 362k] ------------------ 549| 49.5k| node_t::delete_leaf(node, p.count()); 550| 49.5k| } 551| 411k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 3.03M| { 535| 3.03M| using node_t = node_type; 536| 3.03M| auto node = p.node(); 537| 3.03M| if (node->dec()) { ------------------ | Branch (537:13): [True: 97.9k, False: 2.93M] ------------------ 538| 97.9k| p.each(this_t{}); 539| 97.9k| node_t::delete_inner(node, p.count()); 540| 97.9k| } 541| 3.03M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 962k| { 535| 962k| using node_t = node_type; 536| 962k| auto node = p.node(); 537| 962k| if (node->dec()) { ------------------ | Branch (537:13): [True: 909k, False: 53.3k] ------------------ 538| 909k| p.each(this_t{}); 539| 909k| node_t::delete_inner(node, p.count()); 540| 909k| } 541| 962k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 1.50M| { 535| 1.50M| using node_t = node_type; 536| 1.50M| auto node = p.node(); 537| 1.50M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 1.50M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 1.50M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 56.8M| { 546| 56.8M| using node_t = node_type; 547| 56.8M| auto node = p.node(); 548| 56.8M| if (node->dec()) { ------------------ | Branch (548:13): [True: 991k, False: 55.8M] ------------------ 549| 991k| node_t::delete_leaf(node, p.count()); 550| 991k| } 551| 56.8M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.36M| { 546| 1.36M| using node_t = node_type; 547| 1.36M| auto node = p.node(); 548| 1.36M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 1.36M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 1.36M| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_SI_j: 791| 187k| { 792| 187k| auto level = pos.shift(); 793| 187k| auto idx = pos.count() - 1; 794| 187k| auto children = pos.size(idx); 795| 187k| auto new_idx = 796| 187k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 13.5k, False: 174k] | Branch (796:47): [True: 681, False: 173k] ------------------ 797| 187k| auto new_child = static_cast(nullptr); 798| 187k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 3.99k, False: 183k] ------------------ 799| 3.99k| return nullptr; 800| 183k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 173k, False: 10.1k] ------------------ 801| 173k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 173k| if (!new_child) { ------------------ | Branch (802:17): [True: 4.39k, False: 169k] ------------------ 803| 4.39k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 2.04k, False: 2.35k] ------------------ 804| 2.04k| new_child = node_t::make_path(level - B, tail); 805| 2.35k| else 806| 2.35k| return nullptr; 807| 4.39k| } 808| 173k| } else 809| 10.1k| new_child = node_t::make_path(level - B, tail); 810| 181k| IMMER_TRY { ------------------ | | 49| 181k|#define IMMER_TRY try ------------------ 811| 181k| auto count = new_idx + 1; 812| 181k| auto new_parent = 813| 181k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 181k| auto new_relaxed = new_parent->relaxed(); 815| 181k| new_parent->inner()[new_idx] = new_child; 816| 181k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 181k| new_relaxed->d.count = count; 818| 181k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 181k, False: 0] ------------------ 819| 181k| return new_parent; 820| 181k| } 821| 181k| 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| 181k| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_SJ_DpOT0_: 834| 39.2k| { 835| 39.2k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 39.2k, False: 0] ------------------ 836| 39.2k| auto idx = pos.index(pos.size() - 1); 837| 39.2k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 39.2k| auto count = new_idx + 1; 839| 39.2k| auto new_parent = node_t::make_inner_n(count); 840| 39.2k| IMMER_TRY { ------------------ | | 49| 39.2k|#define IMMER_TRY try ------------------ 841| 39.2k| new_parent->inner()[new_idx] = 842| 39.2k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 29.0k, False: 10.2k] ------------------ 843| | /* otherwise */ 844| 39.2k| : node_t::make_path(pos.shift() - B, tail); 845| 39.2k| } 846| 39.2k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 39.2k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 39.2k| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_SI_DpOT0_: 834| 866k| { 835| 866k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 866k, False: 0] ------------------ 836| 866k| auto idx = pos.index(pos.size() - 1); 837| 866k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 866k| auto count = new_idx + 1; 839| 866k| auto new_parent = node_t::make_inner_n(count); 840| 866k| IMMER_TRY { ------------------ | | 49| 866k|#define IMMER_TRY try ------------------ 841| 866k| new_parent->inner()[new_idx] = 842| 866k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 542k, False: 323k] ------------------ 843| | /* otherwise */ 844| 866k| : node_t::make_path(pos.shift() - B, tail); 845| 866k| } 846| 866k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 866k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 866k| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_jm: 562| 427|{ 563| 427| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 427|} _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_SI_DpOT0_: 834| 315k| { 835| 315k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 315k, False: 0] ------------------ 836| 315k| auto idx = pos.index(pos.size() - 1); 837| 315k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 315k| auto count = new_idx + 1; 839| 315k| auto new_parent = node_t::make_inner_n(count); 840| 315k| IMMER_TRY { ------------------ | | 49| 315k|#define IMMER_TRY try ------------------ 841| 315k| new_parent->inner()[new_idx] = 842| 315k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 294k, False: 20.8k] ------------------ 843| | /* otherwise */ 844| 315k| : node_t::make_path(pos.shift() - B, tail); 845| 315k| } 846| 315k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 315k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 315k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 116k| { 503| 116k| auto offset = pos.index(idx); 504| 116k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 116k| IMMER_TRY { ------------------ | | 49| 116k|#define IMMER_TRY try ------------------ 506| 116k| node->leaf()[offset] = 507| 116k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 116k| return node; 509| 116k| } 510| 116k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 116k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_relaxedIRNS1_11relaxed_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 466| 210k| { 467| 210k| auto offset = pos.index(idx); 468| 210k| auto count = pos.count(); 469| 210k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 210k| IMMER_TRY { ------------------ | | 49| 210k|#define IMMER_TRY try ------------------ 471| 210k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 210k| node_t::do_copy_inner_replace_sr( 473| 210k| node, pos.node(), count, offset, child); 474| 210k| return node; 475| 210k| } 476| 210k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 210k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 50.3k| { 485| 50.3k| auto offset = pos.index(idx); 486| 50.3k| auto count = pos.count(); 487| 50.3k| auto node = node_t::make_inner_n(count); 488| 50.3k| IMMER_TRY { ------------------ | | 49| 50.3k|#define IMMER_TRY try ------------------ 489| 50.3k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 50.3k| node_t::do_copy_inner_replace( 491| 50.3k| node, pos.node(), count, offset, child); 492| 50.3k| return node; 493| 50.3k| } 494| 50.3k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 50.3k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 15.6k| { 503| 15.6k| auto offset = pos.index(idx); 504| 15.6k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 15.6k| IMMER_TRY { ------------------ | | 49| 15.6k|#define IMMER_TRY try ------------------ 506| 15.6k| node->leaf()[offset] = 507| 15.6k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 15.6k| return node; 509| 15.6k| } 510| 15.6k| 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.6k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_8full_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 13.6k| { 485| 13.6k| auto offset = pos.index(idx); 486| 13.6k| auto count = pos.count(); 487| 13.6k| auto node = node_t::make_inner_n(count); 488| 13.6k| IMMER_TRY { ------------------ | | 49| 13.6k|#define IMMER_TRY try ------------------ 489| 13.6k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 13.6k| node_t::do_copy_inner_replace( 491| 13.6k| node, pos.node(), count, offset, child); 492| 13.6k| return node; 493| 13.6k| } 494| 13.6k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 13.6k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_8leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 34.6k| { 503| 34.6k| auto offset = pos.index(idx); 504| 34.6k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 34.6k| IMMER_TRY { ------------------ | | 49| 34.6k|#define IMMER_TRY try ------------------ 506| 34.6k| node->leaf()[offset] = 507| 34.6k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 34.6k| return node; 509| 34.6k| } 510| 34.6k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 34.6k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_11regular_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 7.37k| { 485| 7.37k| auto offset = pos.index(idx); 486| 7.37k| auto count = pos.count(); 487| 7.37k| auto node = node_t::make_inner_n(count); 488| 7.37k| IMMER_TRY { ------------------ | | 49| 7.37k|#define IMMER_TRY try ------------------ 489| 7.37k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 7.37k| node_t::do_copy_inner_replace( 491| 7.37k| node, pos.node(), count, offset, child); 492| 7.37k| return node; 493| 7.37k| } 494| 7.37k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 7.37k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1096| 30.9k| { 1097| 30.9k| auto idx = pos.index(last); 1098| 30.9k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 30.9k, Folded] | Branch (1098:25): [True: 24.1k, False: 6.85k] ------------------ 1099| 24.1k| return pos.towards_oh(this_t{}, last, idx); 1100| 24.1k| } else { 1101| 6.85k| using std::get; 1102| 6.85k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 6.85k| auto next = get<1>(subs); 1104| 6.85k| auto ts = get<2>(subs); 1105| 6.85k| auto tail = get<3>(subs); 1106| 6.85k| IMMER_TRY { ------------------ | | 49| 6.85k|#define IMMER_TRY try ------------------ 1107| 6.85k| if (next) { ------------------ | Branch (1107:21): [True: 3.69k, False: 3.16k] ------------------ 1108| 3.69k| auto count = idx + 1; 1109| 3.69k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 3.69k| auto newr = newn->relaxed(); 1111| 3.69k| newn->inner()[idx] = next; 1112| 3.69k| newr->d.sizes[idx] = last + 1 - ts; 1113| 3.69k| newr->d.count = count; 1114| 3.69k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 3.69k, False: 0] ------------------ 1115| 3.69k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 3.69k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 3.16k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 3.16k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 3.16k, Folded] | Branch (1118:40): [True: 1.71k, False: 1.44k] | Branch (1118:52): [True: 1.07k, False: 645] ------------------ 1119| 1.07k| auto newn = pos.node()->inner()[0]; 1120| 1.07k| return std::make_tuple( 1121| 1.07k| pos.shift() - B, newn->inc(), ts, tail); 1122| 2.09k| } else { 1123| 2.09k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 2.09k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 2.09k| } 1126| 6.85k| } 1127| 6.85k| 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.85k| } 1138| 30.9k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 1.70k| { 1182| 1.70k| auto old_tail_size = pos.count(); 1183| 1.70k| auto new_tail_size = pos.index(last) + 1; 1184| 1.70k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 417, False: 1.28k] ------------------ 1185| 1.70k| ? pos.node()->inc() 1186| 1.70k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.70k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.70k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 4.08k| { 1182| 4.08k| auto old_tail_size = pos.count(); 1183| 4.08k| auto new_tail_size = pos.index(last) + 1; 1184| 4.08k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.36k, False: 2.72k] ------------------ 1185| 4.08k| ? pos.node()->inc() 1186| 4.08k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 4.08k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 4.08k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1096| 3.34k| { 1097| 3.34k| auto idx = pos.index(last); 1098| 3.34k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 3.34k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 3.34k| } else { 1101| 3.34k| using std::get; 1102| 3.34k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 3.34k| auto next = get<1>(subs); 1104| 3.34k| auto ts = get<2>(subs); 1105| 3.34k| auto tail = get<3>(subs); 1106| 3.34k| IMMER_TRY { ------------------ | | 49| 3.34k|#define IMMER_TRY try ------------------ 1107| 3.34k| if (next) { ------------------ | Branch (1107:21): [True: 663, False: 2.67k] ------------------ 1108| 663| auto count = idx + 1; 1109| 663| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 663| auto newr = newn->relaxed(); 1111| 663| newn->inner()[idx] = next; 1112| 663| newr->d.sizes[idx] = last + 1 - ts; 1113| 663| newr->d.count = count; 1114| 663| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 663, False: 0] ------------------ 1115| 663| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 2.67k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 1.16k, False: 1.51k] ------------------ 1117| 1.16k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 1.51k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 1.51k] | 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.51k| } else { 1123| 1.51k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.51k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.51k| } 1126| 3.34k| } 1127| 3.34k| 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.34k| } 1138| 3.34k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.76k| { 1143| 2.76k| auto idx = pos.index(last); 1144| 2.76k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.76k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.76k| } else { 1147| 2.76k| using std::get; 1148| 2.76k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.76k| auto next = get<1>(subs); 1150| 2.76k| auto ts = get<2>(subs); 1151| 2.76k| auto tail = get<3>(subs); 1152| 2.76k| IMMER_TRY { ------------------ | | 49| 2.76k|#define IMMER_TRY try ------------------ 1153| 2.76k| if (next) { ------------------ | Branch (1153:21): [True: 1.58k, False: 1.18k] ------------------ 1154| 1.58k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.58k| newn->inner()[idx] = next; 1156| 1.58k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.58k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 587, False: 594] ------------------ 1158| 587| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 594| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 594] | 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| 594| } else { 1164| 594| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 594| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 594| } 1167| 2.76k| } 1168| 2.76k| 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.76k| } 1177| 2.76k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 6.18k| { 1182| 6.18k| auto old_tail_size = pos.count(); 1183| 6.18k| auto new_tail_size = pos.index(last) + 1; 1184| 6.18k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.63k, False: 4.54k] ------------------ 1185| 6.18k| ? pos.node()->inc() 1186| 6.18k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 6.18k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 6.18k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.03k| { 1143| 2.03k| auto idx = pos.index(last); 1144| 2.03k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.03k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.03k| } else { 1147| 2.03k| using std::get; 1148| 2.03k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.03k| auto next = get<1>(subs); 1150| 2.03k| auto ts = get<2>(subs); 1151| 2.03k| auto tail = get<3>(subs); 1152| 2.03k| IMMER_TRY { ------------------ | | 49| 2.03k|#define IMMER_TRY try ------------------ 1153| 2.03k| if (next) { ------------------ | Branch (1153:21): [True: 236, False: 1.80k] ------------------ 1154| 236| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 236| newn->inner()[idx] = next; 1156| 236| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.80k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 451, False: 1.35k] ------------------ 1158| 451| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.35k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.35k] | 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.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| 2.03k| } 1168| 2.03k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 2.03k| } 1177| 2.03k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 2.63k| { 1182| 2.63k| auto old_tail_size = pos.count(); 1183| 2.63k| auto new_tail_size = pos.index(last) + 1; 1184| 2.63k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.26k, False: 1.37k] ------------------ 1185| 2.63k| ? pos.node()->inc() 1186| 2.63k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.63k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.63k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.82k| { 1143| 2.82k| auto idx = pos.index(last); 1144| 2.82k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.82k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.82k| } else { 1147| 2.82k| using std::get; 1148| 2.82k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.82k| auto next = get<1>(subs); 1150| 2.82k| auto ts = get<2>(subs); 1151| 2.82k| auto tail = get<3>(subs); 1152| 2.82k| IMMER_TRY { ------------------ | | 49| 2.82k|#define IMMER_TRY try ------------------ 1153| 2.82k| if (next) { ------------------ | Branch (1153:21): [True: 666, False: 2.15k] ------------------ 1154| 666| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 666| newn->inner()[idx] = next; 1156| 666| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.15k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 870, False: 1.28k] ------------------ 1158| 870| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.28k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.28k] | 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.28k| } else { 1164| 1.28k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.28k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.28k| } 1167| 2.82k| } 1168| 2.82k| 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.82k| } 1177| 2.82k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_j: 556| 39.5k|{ 557| 39.5k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 39.5k|} _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 8.41k| { 1143| 8.41k| auto idx = pos.index(last); 1144| 8.41k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 8.41k, Folded] | Branch (1144:25): [True: 5.73k, False: 2.68k] ------------------ 1145| 5.73k| return pos.towards_oh(this_t{}, last, idx); 1146| 5.73k| } else { 1147| 2.68k| using std::get; 1148| 2.68k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.68k| auto next = get<1>(subs); 1150| 2.68k| auto ts = get<2>(subs); 1151| 2.68k| auto tail = get<3>(subs); 1152| 2.68k| IMMER_TRY { ------------------ | | 49| 2.68k|#define IMMER_TRY try ------------------ 1153| 2.68k| if (next) { ------------------ | Branch (1153:21): [True: 634, False: 2.04k] ------------------ 1154| 634| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 634| newn->inner()[idx] = next; 1156| 634| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.04k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.04k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.04k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.04k, Folded] | Branch (1159:40): [True: 1.14k, False: 905] | Branch (1159:52): [True: 606, False: 537] ------------------ 1160| 606| auto newn = pos.node()->inner()[0]; 1161| 606| return std::make_tuple( 1162| 606| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.44k| } else { 1164| 1.44k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.44k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.44k| } 1167| 2.68k| } 1168| 2.68k| 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.68k| } 1177| 8.41k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 1.61k| { 1182| 1.61k| auto old_tail_size = pos.count(); 1183| 1.61k| auto new_tail_size = pos.index(last) + 1; 1184| 1.61k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 539, False: 1.07k] ------------------ 1185| 1.61k| ? pos.node()->inc() 1186| 1.61k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.61k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.61k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 5.68k| { 1143| 5.68k| auto idx = pos.index(last); 1144| 5.68k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 5.68k, Folded] | Branch (1144:25): [True: 2.31k, False: 3.37k] ------------------ 1145| 2.31k| return pos.towards_oh(this_t{}, last, idx); 1146| 3.37k| } else { 1147| 3.37k| using std::get; 1148| 3.37k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.37k| auto next = get<1>(subs); 1150| 3.37k| auto ts = get<2>(subs); 1151| 3.37k| auto tail = get<3>(subs); 1152| 3.37k| IMMER_TRY { ------------------ | | 49| 3.37k|#define IMMER_TRY try ------------------ 1153| 3.37k| if (next) { ------------------ | Branch (1153:21): [True: 421, False: 2.95k] ------------------ 1154| 421| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 421| newn->inner()[idx] = next; 1156| 421| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.95k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.95k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.95k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.95k, Folded] | Branch (1159:40): [True: 791, False: 2.15k] | Branch (1159:52): [True: 324, False: 467] ------------------ 1160| 324| auto newn = pos.node()->inner()[0]; 1161| 324| return std::make_tuple( 1162| 324| pos.shift() - B, newn->inc(), ts, tail); 1163| 2.62k| } else { 1164| 2.62k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 2.62k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 2.62k| } 1167| 3.37k| } 1168| 3.37k| 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.37k| } 1177| 5.68k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 746| { 1182| 746| auto old_tail_size = pos.count(); 1183| 746| auto new_tail_size = pos.index(last) + 1; 1184| 746| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 338, False: 408] ------------------ 1185| 746| ? pos.node()->inc() 1186| 746| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 746| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 746| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 26.5k| { 1415| 26.5k| auto idx = pos.subindex(first); 1416| 26.5k| auto count = pos.count(); 1417| 26.5k| auto left_size = pos.size_before(idx); 1418| 26.5k| auto child_size = pos.size_sbh(idx, left_size); 1419| 26.5k| auto dropped_size = first; 1420| 26.5k| auto child_dropped_size = dropped_size - left_size; 1421| 26.5k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 26.5k, Folded] | Branch (1421:25): [True: 24.6k, False: 1.88k] | Branch (1421:45): [True: 3.58k, False: 21.0k] ------------------ 1422| 3.58k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 22.9k| } else { 1424| 22.9k| using std::get; 1425| 22.9k| auto n = pos.node(); 1426| 22.9k| auto newc = count - idx; 1427| 22.9k| auto newn = node_t::make_inner_r_n(newc); 1428| 22.9k| IMMER_TRY { ------------------ | | 49| 22.9k|#define IMMER_TRY try ------------------ 1429| 22.9k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 22.9k| auto newr = newn->relaxed(); 1431| 22.9k| newr->d.count = count - idx; 1432| 22.9k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 22.9k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 22.9k, False: 0] ------------------ 1434| 22.9k| pos.copy_sizes(idx + 1, 1435| 22.9k| newr->d.count - 1, 1436| 22.9k| newr->d.sizes[0], 1437| 22.9k| newr->d.sizes + 1); 1438| 22.9k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 22.9k, False: 0] ------------------ 1439| 22.9k| pos.size() - dropped_size); 1440| 22.9k| newn->inner()[0] = get<1>(subs); 1441| 22.9k| std::copy(n->inner() + idx + 1, 1442| 22.9k| n->inner() + count, 1443| 22.9k| newn->inner() + 1); 1444| 22.9k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 22.9k| return std::make_tuple(pos.shift(), newn); 1446| 22.9k| } 1447| 22.9k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 22.9k| } 1452| 26.5k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 21.1k| { 1457| 21.1k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 21.1k| return std::make_tuple(0, n); 1459| 21.1k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 104k| { 1415| 104k| auto idx = pos.subindex(first); 1416| 104k| auto count = pos.count(); 1417| 104k| auto left_size = pos.size_before(idx); 1418| 104k| auto child_size = pos.size_sbh(idx, left_size); 1419| 104k| auto dropped_size = first; 1420| 104k| auto child_dropped_size = dropped_size - left_size; 1421| 104k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 104k] | 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| 104k| } else { 1424| 104k| using std::get; 1425| 104k| auto n = pos.node(); 1426| 104k| auto newc = count - idx; 1427| 104k| auto newn = node_t::make_inner_r_n(newc); 1428| 104k| IMMER_TRY { ------------------ | | 49| 104k|#define IMMER_TRY try ------------------ 1429| 104k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 104k| auto newr = newn->relaxed(); 1431| 104k| newr->d.count = count - idx; 1432| 104k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 104k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 104k, False: 0] ------------------ 1434| 104k| pos.copy_sizes(idx + 1, 1435| 104k| newr->d.count - 1, 1436| 104k| newr->d.sizes[0], 1437| 104k| newr->d.sizes + 1); 1438| 104k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 104k, False: 0] ------------------ 1439| 104k| pos.size() - dropped_size); 1440| 104k| newn->inner()[0] = get<1>(subs); 1441| 104k| std::copy(n->inner() + idx + 1, 1442| 104k| n->inner() + count, 1443| 104k| newn->inner() + 1); 1444| 104k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 104k| return std::make_tuple(pos.shift(), newn); 1446| 104k| } 1447| 104k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 104k| } 1452| 104k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 1.79k| { 1415| 1.79k| auto idx = pos.subindex(first); 1416| 1.79k| auto count = pos.count(); 1417| 1.79k| auto left_size = pos.size_before(idx); 1418| 1.79k| auto child_size = pos.size_sbh(idx, left_size); 1419| 1.79k| auto dropped_size = first; 1420| 1.79k| auto child_dropped_size = dropped_size - left_size; 1421| 1.79k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 1.79k] | 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| 1.79k| } else { 1424| 1.79k| using std::get; 1425| 1.79k| auto n = pos.node(); 1426| 1.79k| auto newc = count - idx; 1427| 1.79k| auto newn = node_t::make_inner_r_n(newc); 1428| 1.79k| IMMER_TRY { ------------------ | | 49| 1.79k|#define IMMER_TRY try ------------------ 1429| 1.79k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 1.79k| auto newr = newn->relaxed(); 1431| 1.79k| newr->d.count = count - idx; 1432| 1.79k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 1.79k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 1.79k, False: 0] ------------------ 1434| 1.79k| pos.copy_sizes(idx + 1, 1435| 1.79k| newr->d.count - 1, 1436| 1.79k| newr->d.sizes[0], 1437| 1.79k| newr->d.sizes + 1); 1438| 1.79k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 1.79k, False: 0] ------------------ 1439| 1.79k| pos.size() - dropped_size); 1440| 1.79k| newn->inner()[0] = get<1>(subs); 1441| 1.79k| std::copy(n->inner() + idx + 1, 1442| 1.79k| n->inner() + count, 1443| 1.79k| newn->inner() + 1); 1444| 1.79k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 1.79k| return std::make_tuple(pos.shift(), newn); 1446| 1.79k| } 1447| 1.79k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 1.79k| } 1452| 1.79k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 10.0k| { 1457| 10.0k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 10.0k| return std::make_tuple(0, n); 1459| 10.0k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE11visit_innerIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 7.69k| { 1415| 7.69k| auto idx = pos.subindex(first); 1416| 7.69k| auto count = pos.count(); 1417| 7.69k| auto left_size = pos.size_before(idx); 1418| 7.69k| auto child_size = pos.size_sbh(idx, left_size); 1419| 7.69k| auto dropped_size = first; 1420| 7.69k| auto child_dropped_size = dropped_size - left_size; 1421| 7.69k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 7.69k] | 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| 7.69k| } else { 1424| 7.69k| using std::get; 1425| 7.69k| auto n = pos.node(); 1426| 7.69k| auto newc = count - idx; 1427| 7.69k| auto newn = node_t::make_inner_r_n(newc); 1428| 7.69k| IMMER_TRY { ------------------ | | 49| 7.69k|#define IMMER_TRY try ------------------ 1429| 7.69k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 7.69k| auto newr = newn->relaxed(); 1431| 7.69k| newr->d.count = count - idx; 1432| 7.69k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 7.69k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 7.69k, False: 0] ------------------ 1434| 7.69k| pos.copy_sizes(idx + 1, 1435| 7.69k| newr->d.count - 1, 1436| 7.69k| newr->d.sizes[0], 1437| 7.69k| newr->d.sizes + 1); 1438| 7.69k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 7.69k, False: 0] ------------------ 1439| 7.69k| pos.size() - dropped_size); 1440| 7.69k| newn->inner()[0] = get<1>(subs); 1441| 7.69k| std::copy(n->inner() + idx + 1, 1442| 7.69k| n->inner() + count, 1443| 7.69k| newn->inner() + 1); 1444| 7.69k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 7.69k| return std::make_tuple(pos.shift(), newn); 1446| 7.69k| } 1447| 7.69k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 7.69k| } 1452| 7.69k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 9.72k| { 1415| 9.72k| auto idx = pos.subindex(first); 1416| 9.72k| auto count = pos.count(); 1417| 9.72k| auto left_size = pos.size_before(idx); 1418| 9.72k| auto child_size = pos.size_sbh(idx, left_size); 1419| 9.72k| auto dropped_size = first; 1420| 9.72k| auto child_dropped_size = dropped_size - left_size; 1421| 9.72k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 9.72k, Folded] | Branch (1421:25): [True: 6.71k, False: 3.01k] | Branch (1421:45): [True: 2.24k, False: 4.47k] ------------------ 1422| 2.24k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 7.48k| } else { 1424| 7.48k| using std::get; 1425| 7.48k| auto n = pos.node(); 1426| 7.48k| auto newc = count - idx; 1427| 7.48k| auto newn = node_t::make_inner_r_n(newc); 1428| 7.48k| IMMER_TRY { ------------------ | | 49| 7.48k|#define IMMER_TRY try ------------------ 1429| 7.48k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 7.48k| auto newr = newn->relaxed(); 1431| 7.48k| newr->d.count = count - idx; 1432| 7.48k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 7.48k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 7.48k, False: 0] ------------------ 1434| 7.48k| pos.copy_sizes(idx + 1, 1435| 7.48k| newr->d.count - 1, 1436| 7.48k| newr->d.sizes[0], 1437| 7.48k| newr->d.sizes + 1); 1438| 7.48k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 7.48k, False: 0] ------------------ 1439| 7.48k| pos.size() - dropped_size); 1440| 7.48k| newn->inner()[0] = get<1>(subs); 1441| 7.48k| std::copy(n->inner() + idx + 1, 1442| 7.48k| n->inner() + count, 1443| 7.48k| newn->inner() + 1); 1444| 7.48k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 7.48k| return std::make_tuple(pos.shift(), newn); 1446| 7.48k| } 1447| 7.48k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 7.48k| } 1452| 9.72k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE11visit_innerIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 737| { 1415| 737| auto idx = pos.subindex(first); 1416| 737| auto count = pos.count(); 1417| 737| auto left_size = pos.size_before(idx); 1418| 737| auto child_size = pos.size_sbh(idx, left_size); 1419| 737| auto dropped_size = first; 1420| 737| auto child_dropped_size = dropped_size - left_size; 1421| 737| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 737, Folded] | Branch (1421:25): [True: 273, False: 464] | Branch (1421:45): [True: 0, False: 273] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 737| } else { 1424| 737| using std::get; 1425| 737| auto n = pos.node(); 1426| 737| auto newc = count - idx; 1427| 737| auto newn = node_t::make_inner_r_n(newc); 1428| 737| IMMER_TRY { ------------------ | | 49| 737|#define IMMER_TRY try ------------------ 1429| 737| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 737| auto newr = newn->relaxed(); 1431| 737| newr->d.count = count - idx; 1432| 737| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 737| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 737, False: 0] ------------------ 1434| 737| pos.copy_sizes(idx + 1, 1435| 737| newr->d.count - 1, 1436| 737| newr->d.sizes[0], 1437| 737| newr->d.sizes + 1); 1438| 737| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 737, False: 0] ------------------ 1439| 737| pos.size() - dropped_size); 1440| 737| newn->inner()[0] = get<1>(subs); 1441| 737| std::copy(n->inner() + idx + 1, 1442| 737| n->inner() + count, 1443| 737| newn->inner() + 1); 1444| 737| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 737| return std::make_tuple(pos.shift(), newn); 1446| 737| } 1447| 737| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 737| } 1452| 737| } _ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11relaxed_posIT_EEPSE_jSG_jm: 2001| 7.72k|{ 2002| 7.72k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 7.72k| .visit(concat_trees_left_visitor{}, 2004| 7.72k| empty_leaf_pos{}, 2005| 7.72k| rroot, 2006| 7.72k| rshift, 2007| 7.72k| rsize) 2008| 7.72k| .realize(); 2009| 7.72k|} _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_25singleton_regular_sub_posISC_EENS1_14empty_leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 7.72k| { 1972| 7.72k| return visit_maybe_relaxed_sub( 1973| 7.72k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 7.72k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 5.56k| { 1959| 5.56k| return concat_inners(lpos, tpos, rpos); 1960| 5.56k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 24.9k|{ 1873| 24.9k| auto lshift = lpos.shift(); 1874| 24.9k| auto rshift = rpos.shift(); 1875| 24.9k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 24.9k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 24.9k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 19.7k, False: 5.27k] ------------------ 1879| 19.7k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 19.7k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 19.7k| } else { 1882| 5.27k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 5.27k, False: 0] ------------------ 1883| 5.27k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 5.27k] | Branch (1883:9): [True: 5.27k, False: 0] | Branch (1883:9): [True: 5.27k, False: 0] ------------------ 1884| 5.27k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 5.27k| return concat_rebalance(lpos, cpos, rpos); 1886| 5.27k| } 1887| 24.9k|} _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8each_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1512| 12.8M| { 1513| 12.8M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.05M, False: 11.8M] ------------------ 1514| 1.05M| auto s = size_t{}; 1515| 4.20M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.15M, False: 1.05M] ------------------ 1516| 3.15M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.15M| s = sizes_[i]; 1518| 3.15M| } 1519| 11.8M| } else { 1520| 31.8M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 20.0M, False: 11.8M] ------------------ 1521| 20.0M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 20.0M| .visit(v, args...); 1523| 11.8M| } 1524| 12.8M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 7.80M| { 1734| 7.80M| auto count = p.count(); 1735| 7.80M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 7.80M, False: 0] ------------------ 1736| 7.80M| plan.counts[plan.n++] = count; 1737| 7.80M| plan.total += count; 1738| 7.80M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 107M| { 1734| 107M| auto count = p.count(); 1735| 107M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 107M, False: 0] ------------------ 1736| 107M| plan.counts[plan.n++] = count; 1737| 107M| plan.total += count; 1738| 107M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE7shuffleEj: 1762| 12.8M| { 1763| | // gcc seems to not really understand this code... :( 1764| 12.8M|#if !defined(_MSC_VER) 1765| 12.8M|#pragma GCC diagnostic push 1766| 12.8M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 12.8M|#endif 1768| 12.8M| constexpr count_t rrb_extras = 2; 1769| 12.8M| constexpr count_t rrb_invariant = 1; 1770| 12.8M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 1.05M, False: 11.8M] ------------------ 1771| 12.8M| const auto branches = count_t{1} << bits; 1772| 12.8M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 12.8M| count_t i = 0; 1774| 15.9M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 3.09M, False: 12.8M] ------------------ 1775| | // skip ok nodes 1776| 6.84M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 3.75M, False: 3.09M] ------------------ 1777| 3.75M| i++; 1778| 3.09M| assert(i < n); ------------------ | Branch (1778:13): [True: 3.09M, False: 0] ------------------ 1779| | // short node, redistribute 1780| 3.09M| auto remaining = counts[i]; 1781| 11.7M| do { 1782| 11.7M| auto next = counts[i + 1]; 1783| 11.7M| auto count = std::min(remaining + next, branches); 1784| 11.7M| counts[i] = count; 1785| 11.7M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 11.7M, False: 0] ------------------ 1786| 11.7M| remaining += next - count; 1787| 11.7M| ++i; 1788| 11.7M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 8.63M, False: 3.09M] ------------------ 1789| | // remove node 1790| 3.09M| std::move(counts + i + 1, counts + n, counts + i); 1791| 3.09M| --n; 1792| 3.09M| --i; 1793| 3.09M| } 1794| 12.8M|#if !defined(_MSC_VER) 1795| 12.8M|#pragma GCC diagnostic pop 1796| 12.8M|#endif 1797| 12.8M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1478| 25.7M| auto shift() const { return shift_; } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPjj: 1577| 12.8M| : curr_{counts} 1578| 12.8M| , n_{n} 1579| 12.8M| , result_{ 1580| 12.8M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 12.8M| { 1582| 12.8M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_m: 1481| 12.8M| : shift_{s} 1482| 12.8M| , count_{1} 1483| 12.8M| , nodes_{n0} 1484| 12.8M| , sizes_{s0} 1485| 12.8M| { 1486| 12.8M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8each_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1512| 12.8M| { 1513| 12.8M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.05M, False: 11.8M] ------------------ 1514| 1.05M| auto s = size_t{}; 1515| 4.20M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.15M, False: 1.05M] ------------------ 1516| 3.15M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.15M| s = sizes_[i]; 1518| 3.15M| } 1519| 11.8M| } else { 1520| 31.8M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 20.0M, False: 11.8M] ------------------ 1521| 20.0M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 20.0M| .visit(v, args...); 1523| 11.8M| } 1524| 12.8M| } _ZN5immer6detail4rbts21concat_merger_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1721| 7.80M| { 1722| 7.80M| merger.merge_leaf(p); 1723| 7.80M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_: 1614| 7.80M| { 1615| 7.80M| auto from = p.node(); 1616| 7.80M| auto from_size = p.size(); 1617| 7.80M| auto from_count = p.count(); 1618| 7.80M| assert(from_size); ------------------ | Branch (1618:9): [True: 7.80M, False: 0] ------------------ 1619| 7.80M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 7.69M, False: 114k] | Branch (1619:21): [True: 7.64M, False: 47.0k] ------------------ 1620| 7.64M| add_child(from, from_size); 1621| 7.64M| from->inc(); 1622| 7.64M| } else { 1623| 161k| auto from_offset = count_t{}; 1624| 161k| auto from_data = from->leaf(); 1625| 223k| do { 1626| 223k| if (!to_) { ------------------ | Branch (1626:21): [True: 109k, False: 114k] ------------------ 1627| 109k| to_ = node_t::make_leaf_n(*curr_); 1628| 109k| to_offset_ = 0; 1629| 109k| } 1630| 223k| auto data = to_->leaf(); 1631| 223k| auto to_copy = 1632| 223k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 223k| detail::uninitialized_copy(from_data + from_offset, 1634| 223k| from_data + from_offset + to_copy, 1635| 223k| data + to_offset_); 1636| 223k| to_offset_ += to_copy; 1637| 223k| from_offset += to_copy; 1638| 223k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 109k, False: 114k] ------------------ 1639| 109k| add_child(to_, to_offset_); 1640| 109k| to_ = nullptr; 1641| 109k| } 1642| 223k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 62.3k, False: 161k] ------------------ 1643| 161k| } 1644| 7.80M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9add_childEPSC_m: 1589| 122M| { 1590| 122M| assert(size); ------------------ | Branch (1590:9): [True: 122M, False: 0] ------------------ 1591| 122M| ++curr_; 1592| 122M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 122M| auto relaxed = parent->relaxed(); 1594| 122M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 8.25M, False: 114M] ------------------ 1595| 8.25M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 8.25M, False: 0] ------------------ 1596| 8.25M| n_ -= branches; 1597| 8.25M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 8.25M| relaxed = parent->relaxed(); 1599| 8.25M| result_.nodes_[result_.count_] = parent; 1600| 8.25M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 8.25M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 8.25M, False: 0] ------------------ 1602| 8.25M| ++result_.count_; 1603| 8.25M| } 1604| 122M| auto idx = relaxed->d.count++; 1605| 122M| result_.sizes_[result_.count_ - 1] += size; 1606| 122M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 122M, False: 0] ------------------ 1607| 122M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 101M, False: 21.1M] ------------------ 1608| 122M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 122M, False: 0] ------------------ 1609| 122M| parent->inner()[idx] = p; 1610| 122M| }; _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 107M| { 1716| 107M| merger.merge_inner(p); 1717| 107M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 107M| { 1649| 107M| auto from = p.node(); 1650| 107M| auto from_size = p.size(); 1651| 107M| auto from_count = p.count(); 1652| 107M| assert(from_size); ------------------ | Branch (1652:9): [True: 107M, False: 0] ------------------ 1653| 107M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 97.9M, False: 10.0M] | Branch (1653:21): [True: 95.4M, False: 2.48M] ------------------ 1654| 95.4M| add_child(from, from_size); 1655| 95.4M| from->inc(); 1656| 95.4M| } else { 1657| 12.4M| auto from_offset = count_t{}; 1658| 12.4M| auto from_data = from->inner(); 1659| 19.4M| do { 1660| 19.4M| if (!to_) { ------------------ | Branch (1660:21): [True: 9.44M, False: 10.0M] ------------------ 1661| 9.44M| to_ = node_t::make_inner_r_n(*curr_); 1662| 9.44M| to_offset_ = 0; 1663| 9.44M| to_size_ = 0; 1664| 9.44M| } 1665| 19.4M| auto data = to_->inner(); 1666| 19.4M| auto to_copy = 1667| 19.4M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 19.4M| std::copy(from_data + from_offset, 1669| 19.4M| from_data + from_offset + to_copy, 1670| 19.4M| data + to_offset_); 1671| 19.4M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 19.4M| auto sizes = to_->relaxed()->d.sizes; 1673| 19.4M| p.copy_sizes( 1674| 19.4M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 19.4M| to_offset_ += to_copy; 1676| 19.4M| from_offset += to_copy; 1677| 19.4M| to_size_ = sizes[to_offset_ - 1]; 1678| 19.4M| assert(to_size_); ------------------ | Branch (1678:17): [True: 19.4M, False: 0] ------------------ 1679| 19.4M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 9.44M, False: 10.0M] ------------------ 1680| 9.44M| to_->relaxed()->d.count = to_offset_; 1681| 9.44M| add_child(to_, to_size_); 1682| 9.44M| to_ = nullptr; 1683| 9.44M| } 1684| 19.4M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 6.96M, False: 12.4M] ------------------ 1685| 12.4M| } 1686| 107M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6finishEv: 1689| 12.8M| { 1690| 12.8M| assert(!to_); ------------------ | Branch (1690:9): [True: 12.8M, False: 0] ------------------ 1691| 12.8M| return result_; 1692| 12.8M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8each_subINS1_11dec_visitorEJEEEvT_DpOT0_: 1512| 12.8M| { 1513| 12.8M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.05M, False: 11.8M] ------------------ 1514| 1.05M| auto s = size_t{}; 1515| 4.20M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.15M, False: 1.05M] ------------------ 1516| 3.15M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.15M| s = sizes_[i]; 1518| 3.15M| } 1519| 11.8M| } else { 1520| 31.8M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 20.0M, False: 11.8M] ------------------ 1521| 20.0M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 20.0M| .visit(v, args...); 1523| 11.8M| } 1524| 12.8M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_mSE_m: 1503| 1.04M| : shift_{s} 1504| 1.04M| , count_{3} 1505| 1.04M| , nodes_{n0, n1, n2} 1506| 1.04M| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 1.04M| { 1508| 1.04M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_m: 1489| 7.72k| : shift_{s} 1490| 7.72k| , count_{2} 1491| 7.72k| , nodes_{n0, n1} 1492| 7.72k| , sizes_{s0, s0 + s1} 1493| 7.72k| { 1494| 7.72k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 19.4k| { 1918| 19.4k| return concat_inners(lpos, tpos, rpos); 1919| 19.4k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 290| { 1918| 290| return concat_inners(lpos, tpos, rpos); 1919| 290| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 2.45k|{ 1873| 2.45k| auto lshift = lpos.shift(); 1874| 2.45k| auto rshift = rpos.shift(); 1875| 2.45k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.45k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.45k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 599, False: 1.85k] ------------------ 1879| 599| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 599| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.85k| } else { 1882| 1.85k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.85k, False: 0] ------------------ 1883| 1.85k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.85k] | Branch (1883:9): [True: 1.85k, False: 0] | Branch (1883:9): [True: 1.85k, False: 0] ------------------ 1884| 1.85k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.85k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.85k| } 1887| 2.45k|} _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_8full_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 920| { 1918| 920| return concat_inners(lpos, tpos, rpos); 1919| 920| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 920|{ 1873| 920| auto lshift = lpos.shift(); 1874| 920| auto rshift = rpos.shift(); 1875| 920| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 920] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 920| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 321, False: 599] ------------------ 1879| 321| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 321| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 599| } else { 1882| 599| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 599, False: 0] ------------------ 1883| 599| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 599] | Branch (1883:9): [True: 599, False: 0] | Branch (1883:9): [True: 599, False: 0] ------------------ 1884| 599| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 599| return concat_rebalance(lpos, cpos, rpos); 1886| 599| } 1887| 920|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 719|{ 1824| 719| auto plan = concat_rebalance_plan{}; 1825| 719| plan.fill(lpos, cpos, rpos); 1826| 719| plan.shuffle(cpos.shift()); 1827| 719| IMMER_TRY { ------------------ | | 49| 719|#define IMMER_TRY try ------------------ 1828| 719| return plan.merge(lpos, cpos, rpos); 1829| 719| } 1830| 719| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 719|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISH_EEEEvOT_OT0_OT1_: 1752| 719| { 1753| 719| assert(n == 0u); ------------------ | Branch (1753:9): [True: 719, False: 0] ------------------ 1754| 719| assert(total == 0u); ------------------ | Branch (1754:9): [True: 719, False: 0] ------------------ 1755| 719| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 719| lpos.each_left_sub(visitor_t{}, *this); 1757| 719| cpos.each_sub(visitor_t{}, *this); 1758| 719| rpos.each_right_sub(visitor_t{}, *this); 1759| 719| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 5.30M| { 1734| 5.30M| auto count = p.count(); 1735| 5.30M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 5.30M, False: 0] ------------------ 1736| 5.30M| plan.counts[plan.n++] = count; 1737| 5.30M| plan.total += count; 1738| 5.30M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 528k| { 1734| 528k| auto count = p.count(); 1735| 528k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 528k, False: 0] ------------------ 1736| 528k| plan.counts[plan.n++] = count; 1737| 528k| plan.total += count; 1738| 528k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 719| { 1803| 719| using node_t = node_type; 1804| 719| using merger_t = concat_merger; 1805| 719| using visitor_t = concat_merger_visitor; 1806| 719| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 719| IMMER_TRY { ------------------ | | 49| 719|#define IMMER_TRY try ------------------ 1808| 719| lpos.each_left_sub(visitor_t{}, merger); 1809| 719| cpos.each_sub(visitor_t{}, merger); 1810| 719| rpos.each_right_sub(visitor_t{}, merger); 1811| 719| cpos.each_sub(dec_visitor{}); 1812| 719| return merger.finish(); 1813| 719| } 1814| 719| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 719| } _ZN5immer6detail4rbts21concat_merger_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1721| 5.30M| { 1722| 5.30M| merger.merge_leaf(p); 1723| 5.30M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10merge_leafIRNS1_13full_leaf_posISC_EEEEvOT_: 1614| 5.30M| { 1615| 5.30M| auto from = p.node(); 1616| 5.30M| auto from_size = p.size(); 1617| 5.30M| auto from_count = p.count(); 1618| 5.30M| assert(from_size); ------------------ | Branch (1618:9): [True: 5.30M, False: 0] ------------------ 1619| 5.30M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 5.30M, False: 0] | Branch (1619:21): [True: 5.30M, False: 0] ------------------ 1620| 5.30M| add_child(from, from_size); 1621| 5.30M| from->inc(); 1622| 5.30M| } 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.30M| } _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 528k| { 1716| 528k| merger.merge_inner(p); 1717| 528k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 528k| { 1649| 528k| auto from = p.node(); 1650| 528k| auto from_size = p.size(); 1651| 528k| auto from_count = p.count(); 1652| 528k| assert(from_size); ------------------ | Branch (1652:9): [True: 528k, False: 0] ------------------ 1653| 528k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 528k, False: 0] | Branch (1653:21): [True: 528k, False: 0] ------------------ 1654| 528k| add_child(from, from_size); 1655| 528k| from->inc(); 1656| 528k| } 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| 528k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 599| { 1945| 599| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 599| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 2.45k| { 1925| 2.45k| return concat_leafs(lpos, tpos, rpos); 1926| 2.45k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_13full_leaf_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 2.45k|{ 1839| 2.45k| static_assert(Node::bits >= 2, ""); 1840| 2.45k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 2.45k, False: 0] ------------------ 1841| 2.45k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 2.45k, False: 0] ------------------ 1842| 2.45k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 2.45k, False: 0] ------------------ 1843| 2.45k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 2.45k] ------------------ 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| 2.45k| else 1854| 2.45k| return { 1855| 2.45k| Node::bits_leaf, 1856| 2.45k| lpos.node()->inc(), 1857| 2.45k| lpos.count(), 1858| 2.45k| rpos.node()->inc(), 1859| 2.45k| rpos.count(), 1860| 2.45k| }; 1861| 2.45k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 599|{ 1824| 599| auto plan = concat_rebalance_plan{}; 1825| 599| plan.fill(lpos, cpos, rpos); 1826| 599| plan.shuffle(cpos.shift()); 1827| 599| IMMER_TRY { ------------------ | | 49| 599|#define IMMER_TRY try ------------------ 1828| 599| return plan.merge(lpos, cpos, rpos); 1829| 599| } 1830| 599| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 599|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 599| { 1753| 599| assert(n == 0u); ------------------ | Branch (1753:9): [True: 599, False: 0] ------------------ 1754| 599| assert(total == 0u); ------------------ | Branch (1754:9): [True: 599, False: 0] ------------------ 1755| 599| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 599| lpos.each_left_sub(visitor_t{}, *this); 1757| 599| cpos.each_sub(visitor_t{}, *this); 1758| 599| rpos.each_right_sub(visitor_t{}, *this); 1759| 599| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 599| { 1803| 599| using node_t = node_type; 1804| 599| using merger_t = concat_merger; 1805| 599| using visitor_t = concat_merger_visitor; 1806| 599| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 599| IMMER_TRY { ------------------ | | 49| 599|#define IMMER_TRY try ------------------ 1808| 599| lpos.each_left_sub(visitor_t{}, merger); 1809| 599| cpos.each_sub(visitor_t{}, merger); 1810| 599| rpos.each_right_sub(visitor_t{}, merger); 1811| 599| cpos.each_sub(dec_visitor{}); 1812| 599| return merger.finish(); 1813| 599| } 1814| 599| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 599| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 1.56k|{ 1824| 1.56k| auto plan = concat_rebalance_plan{}; 1825| 1.56k| plan.fill(lpos, cpos, rpos); 1826| 1.56k| plan.shuffle(cpos.shift()); 1827| 1.56k| IMMER_TRY { ------------------ | | 49| 1.56k|#define IMMER_TRY try ------------------ 1828| 1.56k| return plan.merge(lpos, cpos, rpos); 1829| 1.56k| } 1830| 1.56k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.56k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISH_EEEEvOT_OT0_OT1_: 1752| 1.56k| { 1753| 1.56k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.56k, False: 0] ------------------ 1754| 1.56k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.56k, False: 0] ------------------ 1755| 1.56k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.56k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.56k| cpos.each_sub(visitor_t{}, *this); 1758| 1.56k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.56k| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 3.77M| { 1734| 3.77M| auto count = p.count(); 1735| 3.77M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 3.77M, False: 0] ------------------ 1736| 3.77M| plan.counts[plan.n++] = count; 1737| 3.77M| plan.total += count; 1738| 3.77M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 1.56k| { 1803| 1.56k| using node_t = node_type; 1804| 1.56k| using merger_t = concat_merger; 1805| 1.56k| using visitor_t = concat_merger_visitor; 1806| 1.56k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.56k| IMMER_TRY { ------------------ | | 49| 1.56k|#define IMMER_TRY try ------------------ 1808| 1.56k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.56k| cpos.each_sub(visitor_t{}, merger); 1810| 1.56k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.56k| cpos.each_sub(dec_visitor{}); 1812| 1.56k| return merger.finish(); 1813| 1.56k| } 1814| 1.56k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.56k| } _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 3.77M| { 1716| 3.77M| merger.merge_inner(p); 1717| 3.77M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_: 1648| 3.77M| { 1649| 3.77M| auto from = p.node(); 1650| 3.77M| auto from_size = p.size(); 1651| 3.77M| auto from_count = p.count(); 1652| 3.77M| assert(from_size); ------------------ | Branch (1652:9): [True: 3.77M, False: 0] ------------------ 1653| 3.77M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 2.16M, False: 1.60M] | Branch (1653:21): [True: 2.16M, False: 0] ------------------ 1654| 2.16M| add_child(from, from_size); 1655| 2.16M| from->inc(); 1656| 2.16M| } else { 1657| 1.60M| auto from_offset = count_t{}; 1658| 1.60M| auto from_data = from->inner(); 1659| 3.21M| do { 1660| 3.21M| if (!to_) { ------------------ | Branch (1660:21): [True: 1.60M, False: 1.60M] ------------------ 1661| 1.60M| to_ = node_t::make_inner_r_n(*curr_); 1662| 1.60M| to_offset_ = 0; 1663| 1.60M| to_size_ = 0; 1664| 1.60M| } 1665| 3.21M| auto data = to_->inner(); 1666| 3.21M| auto to_copy = 1667| 3.21M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 3.21M| std::copy(from_data + from_offset, 1669| 3.21M| from_data + from_offset + to_copy, 1670| 3.21M| data + to_offset_); 1671| 3.21M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 3.21M| auto sizes = to_->relaxed()->d.sizes; 1673| 3.21M| p.copy_sizes( 1674| 3.21M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 3.21M| to_offset_ += to_copy; 1676| 3.21M| from_offset += to_copy; 1677| 3.21M| to_size_ = sizes[to_offset_ - 1]; 1678| 3.21M| assert(to_size_); ------------------ | Branch (1678:17): [True: 3.21M, False: 0] ------------------ 1679| 3.21M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 1.60M, False: 1.60M] ------------------ 1680| 1.60M| to_->relaxed()->d.count = to_offset_; 1681| 1.60M| add_child(to_, to_size_); 1682| 1.60M| to_ = nullptr; 1683| 1.60M| } 1684| 3.21M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.60M, False: 1.60M] ------------------ 1685| 1.60M| } 1686| 3.77M| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 1.85k| { 1945| 1.85k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 1.85k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 5.27k| { 1925| 5.27k| return concat_leafs(lpos, tpos, rpos); 1926| 5.27k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 5.27k|{ 1839| 5.27k| static_assert(Node::bits >= 2, ""); 1840| 5.27k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 5.27k, False: 0] ------------------ 1841| 5.27k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 5.27k, False: 0] ------------------ 1842| 5.27k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 5.27k, False: 0] ------------------ 1843| 5.27k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 5.27k] ------------------ 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| 5.27k| else 1854| 5.27k| return { 1855| 5.27k| Node::bits_leaf, 1856| 5.27k| lpos.node()->inc(), 1857| 5.27k| lpos.count(), 1858| 5.27k| rpos.node()->inc(), 1859| 5.27k| rpos.count(), 1860| 5.27k| }; 1861| 5.27k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 1.85k|{ 1824| 1.85k| auto plan = concat_rebalance_plan{}; 1825| 1.85k| plan.fill(lpos, cpos, rpos); 1826| 1.85k| plan.shuffle(cpos.shift()); 1827| 1.85k| IMMER_TRY { ------------------ | | 49| 1.85k|#define IMMER_TRY try ------------------ 1828| 1.85k| return plan.merge(lpos, cpos, rpos); 1829| 1.85k| } 1830| 1.85k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.85k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_: 1752| 1.85k| { 1753| 1.85k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.85k, False: 0] ------------------ 1754| 1.85k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.85k, False: 0] ------------------ 1755| 1.85k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.85k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.85k| cpos.each_sub(visitor_t{}, *this); 1758| 1.85k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.85k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 1.85k| { 1803| 1.85k| using node_t = node_type; 1804| 1.85k| using merger_t = concat_merger; 1805| 1.85k| using visitor_t = concat_merger_visitor; 1806| 1.85k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.85k| IMMER_TRY { ------------------ | | 49| 1.85k|#define IMMER_TRY try ------------------ 1808| 1.85k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.85k| cpos.each_sub(visitor_t{}, merger); 1810| 1.85k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.85k| cpos.each_sub(dec_visitor{}); 1812| 1.85k| return merger.finish(); 1813| 1.85k| } 1814| 1.85k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.85k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 68.2k|{ 1824| 68.2k| auto plan = concat_rebalance_plan{}; 1825| 68.2k| plan.fill(lpos, cpos, rpos); 1826| 68.2k| plan.shuffle(cpos.shift()); 1827| 68.2k| IMMER_TRY { ------------------ | | 49| 68.2k|#define IMMER_TRY try ------------------ 1828| 68.2k| return plan.merge(lpos, cpos, rpos); 1829| 68.2k| } 1830| 68.2k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 68.2k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISH_EEEEvOT_OT0_OT1_: 1752| 68.2k| { 1753| 68.2k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 68.2k, False: 0] ------------------ 1754| 68.2k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 68.2k, False: 0] ------------------ 1755| 68.2k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 68.2k| lpos.each_left_sub(visitor_t{}, *this); 1757| 68.2k| cpos.each_sub(visitor_t{}, *this); 1758| 68.2k| rpos.each_right_sub(visitor_t{}, *this); 1759| 68.2k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 68.2k| { 1803| 68.2k| using node_t = node_type; 1804| 68.2k| using merger_t = concat_merger; 1805| 68.2k| using visitor_t = concat_merger_visitor; 1806| 68.2k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 68.2k| IMMER_TRY { ------------------ | | 49| 68.2k|#define IMMER_TRY try ------------------ 1808| 68.2k| lpos.each_left_sub(visitor_t{}, merger); 1809| 68.2k| cpos.each_sub(visitor_t{}, merger); 1810| 68.2k| rpos.each_right_sub(visitor_t{}, merger); 1811| 68.2k| cpos.each_sub(dec_visitor{}); 1812| 68.2k| return merger.finish(); 1813| 68.2k| } 1814| 68.2k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 68.2k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 5.27k| { 1945| 5.27k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 5.27k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 5.27k|{ 1824| 5.27k| auto plan = concat_rebalance_plan{}; 1825| 5.27k| plan.fill(lpos, cpos, rpos); 1826| 5.27k| plan.shuffle(cpos.shift()); 1827| 5.27k| IMMER_TRY { ------------------ | | 49| 5.27k|#define IMMER_TRY try ------------------ 1828| 5.27k| return plan.merge(lpos, cpos, rpos); 1829| 5.27k| } 1830| 5.27k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 5.27k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEEvOT_OT0_OT1_: 1752| 5.27k| { 1753| 5.27k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 5.27k, False: 0] ------------------ 1754| 5.27k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 5.27k, False: 0] ------------------ 1755| 5.27k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 5.27k| lpos.each_left_sub(visitor_t{}, *this); 1757| 5.27k| cpos.each_sub(visitor_t{}, *this); 1758| 5.27k| rpos.each_right_sub(visitor_t{}, *this); 1759| 5.27k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 5.27k| { 1803| 5.27k| using node_t = node_type; 1804| 5.27k| using merger_t = concat_merger; 1805| 5.27k| using visitor_t = concat_merger_visitor; 1806| 5.27k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 5.27k| IMMER_TRY { ------------------ | | 49| 5.27k|#define IMMER_TRY try ------------------ 1808| 5.27k| lpos.each_left_sub(visitor_t{}, merger); 1809| 5.27k| cpos.each_sub(visitor_t{}, merger); 1810| 5.27k| rpos.each_right_sub(visitor_t{}, merger); 1811| 5.27k| cpos.each_sub(dec_visitor{}); 1812| 5.27k| return merger.finish(); 1813| 5.27k| } 1814| 5.27k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 5.27k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 2.16k| { 1959| 2.16k| return concat_inners(lpos, tpos, rpos); 1960| 2.16k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7realizeEv: 1527| 1.05M| { 1528| 1.05M| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 47.0k, False: 1.00M] ------------------ 1529| 47.0k| IMMER_TRY { ------------------ | | 49| 47.0k|#define IMMER_TRY try ------------------ 1530| 47.0k| auto result = node_t::make_inner_r_n(count_); 1531| 47.0k| auto r = result->relaxed(); 1532| 47.0k| r->d.count = count_; 1533| 47.0k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 47.0k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 47.0k| return {result, shift_, r}; 1536| 47.0k| } 1537| 47.0k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 1.00M| } else { 1542| 1.00M| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 1.00M, False: 0] ------------------ 1543| 1.00M| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 1.00M| } 1545| 1.05M| } _ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11relaxed_posIT_EEPSE_jmSG_jSG_jm: 1986| 1.04M|{ 1987| 1.04M| return visit_maybe_relaxed_sub(lroot, 1988| 1.04M| lshift, 1989| 1.04M| lsize, 1990| 1.04M| concat_trees_left_visitor{}, 1991| 1.04M| make_leaf_pos(ltail, ltcount), 1992| 1.04M| rroot, 1993| 1.04M| rshift, 1994| 1.04M| rsize) 1995| 1.04M| .realize(); 1996| 1.04M|} _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_11relaxed_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 1.02M| { 1972| 1.02M| return visit_maybe_relaxed_sub( 1973| 1.02M| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 1.02M| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_11relaxed_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 1.01M| { 1959| 1.01M| return concat_inners(lpos, tpos, rpos); 1960| 1.01M| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 11.3M|{ 1873| 11.3M| auto lshift = lpos.shift(); 1874| 11.3M| auto rshift = rpos.shift(); 1875| 11.3M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 3.22M, False: 8.13M] ------------------ 1876| 3.22M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 3.22M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 8.13M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 40.1k, False: 8.09M] ------------------ 1879| 40.1k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 40.1k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 8.09M| } else { 1882| 8.09M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 8.09M, False: 0] ------------------ 1883| 8.09M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 8.09M] | Branch (1883:9): [True: 8.09M, False: 0] | Branch (1883:9): [True: 8.09M, False: 0] ------------------ 1884| 8.09M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 8.09M| return concat_rebalance(lpos, cpos, rpos); 1886| 8.09M| } 1887| 11.3M|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 3.21M| { 1898| 3.21M| return concat_inners(lpos, tpos, rpos); 1899| 3.21M| } _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 4.20k| { 1898| 4.20k| return concat_inners(lpos, tpos, rpos); 1899| 4.20k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 1.06M|{ 1873| 1.06M| auto lshift = lpos.shift(); 1874| 1.06M| auto rshift = rpos.shift(); 1875| 1.06M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.21k, False: 1.06M] ------------------ 1876| 2.21k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.21k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.06M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 8.34k, False: 1.05M] ------------------ 1879| 8.34k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 8.34k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.05M| } else { 1882| 1.05M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.05M, False: 0] ------------------ 1883| 1.05M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.05M] | Branch (1883:9): [True: 1.05M, False: 0] | Branch (1883:9): [True: 1.05M, False: 0] ------------------ 1884| 1.05M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.05M| return concat_rebalance(lpos, cpos, rpos); 1886| 1.05M| } 1887| 1.06M|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_: 1823| 3.10k|{ 1824| 3.10k| auto plan = concat_rebalance_plan{}; 1825| 3.10k| plan.fill(lpos, cpos, rpos); 1826| 3.10k| plan.shuffle(cpos.shift()); 1827| 3.10k| IMMER_TRY { ------------------ | | 49| 3.10k|#define IMMER_TRY try ------------------ 1828| 3.10k| return plan.merge(lpos, cpos, rpos); 1829| 3.10k| } 1830| 3.10k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.10k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_: 1752| 3.10k| { 1753| 3.10k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.10k, False: 0] ------------------ 1754| 3.10k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.10k, False: 0] ------------------ 1755| 3.10k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.10k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.10k| cpos.each_sub(visitor_t{}, *this); 1758| 3.10k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.10k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 3.10k| { 1803| 3.10k| using node_t = node_type; 1804| 3.10k| using merger_t = concat_merger; 1805| 3.10k| using visitor_t = concat_merger_visitor; 1806| 3.10k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.10k| IMMER_TRY { ------------------ | | 49| 3.10k|#define IMMER_TRY try ------------------ 1808| 3.10k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.10k| cpos.each_sub(visitor_t{}, merger); 1810| 3.10k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.10k| cpos.each_sub(dec_visitor{}); 1812| 3.10k| return merger.finish(); 1813| 3.10k| } 1814| 3.10k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.10k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 1.05M| { 1918| 1.05M| return concat_inners(lpos, tpos, rpos); 1919| 1.05M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 328k| { 1918| 328k| return concat_inners(lpos, tpos, rpos); 1919| 328k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 340k|{ 1873| 340k| auto lshift = lpos.shift(); 1874| 340k| auto rshift = rpos.shift(); 1875| 340k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 895, False: 339k] ------------------ 1876| 895| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 895| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 339k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 352, False: 338k] ------------------ 1879| 352| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 352| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 338k| } else { 1882| 338k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 338k, False: 0] ------------------ 1883| 338k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 338k] | Branch (1883:9): [True: 338k, False: 0] | Branch (1883:9): [True: 338k, False: 0] ------------------ 1884| 338k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 338k| return concat_rebalance(lpos, cpos, rpos); 1886| 338k| } 1887| 340k|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 1.33k| { 1898| 1.33k| return concat_inners(lpos, tpos, rpos); 1899| 1.33k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_8full_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 26.2k| { 1918| 26.2k| return concat_inners(lpos, tpos, rpos); 1919| 26.2k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 26.2k|{ 1873| 26.2k| auto lshift = lpos.shift(); 1874| 26.2k| auto rshift = rpos.shift(); 1875| 26.2k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 26.2k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 26.2k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 202, False: 26.0k] ------------------ 1879| 202| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 202| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 26.0k| } else { 1882| 26.0k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 26.0k, False: 0] ------------------ 1883| 26.0k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 26.0k] | Branch (1883:9): [True: 26.0k, False: 0] | Branch (1883:9): [True: 26.0k, False: 0] ------------------ 1884| 26.0k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 26.0k| return concat_rebalance(lpos, cpos, rpos); 1886| 26.0k| } 1887| 26.2k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 20.3k| { 1945| 20.3k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 20.3k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 357k| { 1925| 357k| return concat_leafs(lpos, tpos, rpos); 1926| 357k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_13full_leaf_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 357k|{ 1839| 357k| static_assert(Node::bits >= 2, ""); 1840| 357k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 357k, False: 0] ------------------ 1841| 357k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 357k, False: 0] ------------------ 1842| 357k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 357k, False: 0] ------------------ 1843| 357k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 357k, False: 0] ------------------ 1844| 357k| return { 1845| 357k| Node::bits_leaf, 1846| 357k| lpos.node()->inc(), 1847| 357k| lpos.count(), 1848| 357k| tpos.node()->inc(), 1849| 357k| tpos.count(), 1850| 357k| rpos.node()->inc(), 1851| 357k| rpos.count(), 1852| 357k| }; 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| 357k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 7.14k| { 1938| 7.14k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 7.14k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 26.0k|{ 1824| 26.0k| auto plan = concat_rebalance_plan{}; 1825| 26.0k| plan.fill(lpos, cpos, rpos); 1826| 26.0k| plan.shuffle(cpos.shift()); 1827| 26.0k| IMMER_TRY { ------------------ | | 49| 26.0k|#define IMMER_TRY try ------------------ 1828| 26.0k| return plan.merge(lpos, cpos, rpos); 1829| 26.0k| } 1830| 26.0k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 26.0k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 26.0k| { 1753| 26.0k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 26.0k, False: 0] ------------------ 1754| 26.0k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 26.0k, False: 0] ------------------ 1755| 26.0k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 26.0k| lpos.each_left_sub(visitor_t{}, *this); 1757| 26.0k| cpos.each_sub(visitor_t{}, *this); 1758| 26.0k| rpos.each_right_sub(visitor_t{}, *this); 1759| 26.0k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 26.0k| { 1803| 26.0k| using node_t = node_type; 1804| 26.0k| using merger_t = concat_merger; 1805| 26.0k| using visitor_t = concat_merger_visitor; 1806| 26.0k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 26.0k| IMMER_TRY { ------------------ | | 49| 26.0k|#define IMMER_TRY try ------------------ 1808| 26.0k| lpos.each_left_sub(visitor_t{}, merger); 1809| 26.0k| cpos.each_sub(visitor_t{}, merger); 1810| 26.0k| rpos.each_right_sub(visitor_t{}, merger); 1811| 26.0k| cpos.each_sub(dec_visitor{}); 1812| 26.0k| return merger.finish(); 1813| 26.0k| } 1814| 26.0k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 26.0k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 337k| { 1945| 337k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 337k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 688k| { 1925| 688k| return concat_leafs(lpos, tpos, rpos); 1926| 688k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 688k|{ 1839| 688k| static_assert(Node::bits >= 2, ""); 1840| 688k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 688k, False: 0] ------------------ 1841| 688k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 688k, False: 0] ------------------ 1842| 688k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 688k, False: 0] ------------------ 1843| 688k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 688k, False: 0] ------------------ 1844| 688k| return { 1845| 688k| Node::bits_leaf, 1846| 688k| lpos.node()->inc(), 1847| 688k| lpos.count(), 1848| 688k| tpos.node()->inc(), 1849| 688k| tpos.count(), 1850| 688k| rpos.node()->inc(), 1851| 688k| rpos.count(), 1852| 688k| }; 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| 688k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 18.5k| { 1938| 18.5k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 18.5k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EEOT0_OT1_OT2_: 1823| 338k|{ 1824| 338k| auto plan = concat_rebalance_plan{}; 1825| 338k| plan.fill(lpos, cpos, rpos); 1826| 338k| plan.shuffle(cpos.shift()); 1827| 338k| IMMER_TRY { ------------------ | | 49| 338k|#define IMMER_TRY try ------------------ 1828| 338k| return plan.merge(lpos, cpos, rpos); 1829| 338k| } 1830| 338k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 338k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EEvOT_OT0_OT1_: 1752| 338k| { 1753| 338k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 338k, False: 0] ------------------ 1754| 338k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 338k, False: 0] ------------------ 1755| 338k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 338k| lpos.each_left_sub(visitor_t{}, *this); 1757| 338k| cpos.each_sub(visitor_t{}, *this); 1758| 338k| rpos.each_right_sub(visitor_t{}, *this); 1759| 338k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSN_OT1_: 1802| 338k| { 1803| 338k| using node_t = node_type; 1804| 338k| using merger_t = concat_merger; 1805| 338k| using visitor_t = concat_merger_visitor; 1806| 338k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 338k| IMMER_TRY { ------------------ | | 49| 338k|#define IMMER_TRY try ------------------ 1808| 338k| lpos.each_left_sub(visitor_t{}, merger); 1809| 338k| cpos.each_sub(visitor_t{}, merger); 1810| 338k| rpos.each_right_sub(visitor_t{}, merger); 1811| 338k| cpos.each_sub(dec_visitor{}); 1812| 338k| return merger.finish(); 1813| 338k| } 1814| 338k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 338k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 688k| { 1945| 688k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 688k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 1.37M| { 1938| 1.37M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.37M| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 1.05M|{ 1824| 1.05M| auto plan = concat_rebalance_plan{}; 1825| 1.05M| plan.fill(lpos, cpos, rpos); 1826| 1.05M| plan.shuffle(cpos.shift()); 1827| 1.05M| IMMER_TRY { ------------------ | | 49| 1.05M|#define IMMER_TRY try ------------------ 1828| 1.05M| return plan.merge(lpos, cpos, rpos); 1829| 1.05M| } 1830| 1.05M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.05M|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEEvOT_OT0_OT1_: 1752| 1.05M| { 1753| 1.05M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.05M, False: 0] ------------------ 1754| 1.05M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.05M, False: 0] ------------------ 1755| 1.05M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.05M| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.05M| cpos.each_sub(visitor_t{}, *this); 1758| 1.05M| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.05M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 1.05M| { 1803| 1.05M| using node_t = node_type; 1804| 1.05M| using merger_t = concat_merger; 1805| 1.05M| using visitor_t = concat_merger_visitor; 1806| 1.05M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.05M| IMMER_TRY { ------------------ | | 49| 1.05M|#define IMMER_TRY try ------------------ 1808| 1.05M| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.05M| cpos.each_sub(visitor_t{}, merger); 1810| 1.05M| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.05M| cpos.each_sub(dec_visitor{}); 1812| 1.05M| return merger.finish(); 1813| 1.05M| } 1814| 1.05M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.05M| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_: 1823| 3.28M|{ 1824| 3.28M| auto plan = concat_rebalance_plan{}; 1825| 3.28M| plan.fill(lpos, cpos, rpos); 1826| 3.28M| plan.shuffle(cpos.shift()); 1827| 3.28M| IMMER_TRY { ------------------ | | 49| 3.28M|#define IMMER_TRY try ------------------ 1828| 3.28M| return plan.merge(lpos, cpos, rpos); 1829| 3.28M| } 1830| 3.28M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.28M|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_: 1752| 3.28M| { 1753| 3.28M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.28M, False: 0] ------------------ 1754| 3.28M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.28M, False: 0] ------------------ 1755| 3.28M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.28M| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.28M| cpos.each_sub(visitor_t{}, *this); 1758| 3.28M| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.28M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 3.28M| { 1803| 3.28M| using node_t = node_type; 1804| 3.28M| using merger_t = concat_merger; 1805| 3.28M| using visitor_t = concat_merger_visitor; 1806| 3.28M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.28M| IMMER_TRY { ------------------ | | 49| 3.28M|#define IMMER_TRY try ------------------ 1808| 3.28M| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.28M| cpos.each_sub(visitor_t{}, merger); 1810| 3.28M| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.28M| cpos.each_sub(dec_visitor{}); 1812| 3.28M| return merger.finish(); 1813| 3.28M| } 1814| 3.28M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.28M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 7.12M| { 1918| 7.12M| return concat_inners(lpos, tpos, rpos); 1919| 7.12M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 703| { 1918| 703| return concat_inners(lpos, tpos, rpos); 1919| 703| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 82.2k|{ 1873| 82.2k| auto lshift = lpos.shift(); 1874| 82.2k| auto rshift = rpos.shift(); 1875| 82.2k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 63.9k, False: 18.3k] ------------------ 1876| 63.9k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 63.9k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 63.9k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 614, False: 17.7k] ------------------ 1879| 614| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 614| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 17.7k| } else { 1882| 17.7k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 17.7k, False: 0] ------------------ 1883| 17.7k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 17.7k] | Branch (1883:9): [True: 17.7k, False: 0] | Branch (1883:9): [True: 17.7k, False: 0] ------------------ 1884| 17.7k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 17.7k| return concat_rebalance(lpos, cpos, rpos); 1886| 17.7k| } 1887| 82.2k|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 63.4k| { 1898| 63.4k| return concat_inners(lpos, tpos, rpos); 1899| 63.4k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_8full_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 1.86k| { 1918| 1.86k| return concat_inners(lpos, tpos, rpos); 1919| 1.86k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 1.86k|{ 1873| 1.86k| auto lshift = lpos.shift(); 1874| 1.86k| auto rshift = rpos.shift(); 1875| 1.86k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 1.86k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.86k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 196, False: 1.66k] ------------------ 1879| 196| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 196| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.66k| } else { 1882| 1.66k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.66k, False: 0] ------------------ 1883| 1.66k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.66k] | Branch (1883:9): [True: 1.66k, False: 0] | Branch (1883:9): [True: 1.66k, False: 0] ------------------ 1884| 1.66k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.66k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.66k| } 1887| 1.86k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 231| { 1938| 231| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 231| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 1.66k|{ 1824| 1.66k| auto plan = concat_rebalance_plan{}; 1825| 1.66k| plan.fill(lpos, cpos, rpos); 1826| 1.66k| plan.shuffle(cpos.shift()); 1827| 1.66k| IMMER_TRY { ------------------ | | 49| 1.66k|#define IMMER_TRY try ------------------ 1828| 1.66k| return plan.merge(lpos, cpos, rpos); 1829| 1.66k| } 1830| 1.66k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.66k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 1.66k| { 1753| 1.66k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.66k, False: 0] ------------------ 1754| 1.66k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.66k, False: 0] ------------------ 1755| 1.66k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.66k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.66k| cpos.each_sub(visitor_t{}, *this); 1758| 1.66k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.66k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 1.66k| { 1803| 1.66k| using node_t = node_type; 1804| 1.66k| using merger_t = concat_merger; 1805| 1.66k| using visitor_t = concat_merger_visitor; 1806| 1.66k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.66k| IMMER_TRY { ------------------ | | 49| 1.66k|#define IMMER_TRY try ------------------ 1808| 1.66k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.66k| cpos.each_sub(visitor_t{}, merger); 1810| 1.66k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.66k| cpos.each_sub(dec_visitor{}); 1812| 1.66k| return merger.finish(); 1813| 1.66k| } 1814| 1.66k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.66k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 822| { 1938| 822| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 822| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 17.7k|{ 1824| 17.7k| auto plan = concat_rebalance_plan{}; 1825| 17.7k| plan.fill(lpos, cpos, rpos); 1826| 17.7k| plan.shuffle(cpos.shift()); 1827| 17.7k| IMMER_TRY { ------------------ | | 49| 17.7k|#define IMMER_TRY try ------------------ 1828| 17.7k| return plan.merge(lpos, cpos, rpos); 1829| 17.7k| } 1830| 17.7k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 17.7k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_: 1752| 17.7k| { 1753| 17.7k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 17.7k, False: 0] ------------------ 1754| 17.7k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 17.7k, False: 0] ------------------ 1755| 17.7k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 17.7k| lpos.each_left_sub(visitor_t{}, *this); 1757| 17.7k| cpos.each_sub(visitor_t{}, *this); 1758| 17.7k| rpos.each_right_sub(visitor_t{}, *this); 1759| 17.7k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 17.7k| { 1803| 17.7k| using node_t = node_type; 1804| 17.7k| using merger_t = concat_merger; 1805| 17.7k| using visitor_t = concat_merger_visitor; 1806| 17.7k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 17.7k| IMMER_TRY { ------------------ | | 49| 17.7k|#define IMMER_TRY try ------------------ 1808| 17.7k| lpos.each_left_sub(visitor_t{}, merger); 1809| 17.7k| cpos.each_sub(visitor_t{}, merger); 1810| 17.7k| rpos.each_right_sub(visitor_t{}, merger); 1811| 17.7k| cpos.each_sub(dec_visitor{}); 1812| 17.7k| return merger.finish(); 1813| 17.7k| } 1814| 17.7k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 17.7k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 7.08M| { 1938| 7.08M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 7.08M| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EEOT0_OT1_OT2_: 1823| 8.09M|{ 1824| 8.09M| auto plan = concat_rebalance_plan{}; 1825| 8.09M| plan.fill(lpos, cpos, rpos); 1826| 8.09M| plan.shuffle(cpos.shift()); 1827| 8.09M| IMMER_TRY { ------------------ | | 49| 8.09M|#define IMMER_TRY try ------------------ 1828| 8.09M| return plan.merge(lpos, cpos, rpos); 1829| 8.09M| } 1830| 8.09M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 8.09M|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EEvOT_OT0_OT1_: 1752| 8.09M| { 1753| 8.09M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 8.09M, False: 0] ------------------ 1754| 8.09M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 8.09M, False: 0] ------------------ 1755| 8.09M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 8.09M| lpos.each_left_sub(visitor_t{}, *this); 1757| 8.09M| cpos.each_sub(visitor_t{}, *this); 1758| 8.09M| rpos.each_right_sub(visitor_t{}, *this); 1759| 8.09M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSN_OT1_: 1802| 8.09M| { 1803| 8.09M| using node_t = node_type; 1804| 8.09M| using merger_t = concat_merger; 1805| 8.09M| using visitor_t = concat_merger_visitor; 1806| 8.09M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 8.09M| IMMER_TRY { ------------------ | | 49| 8.09M|#define IMMER_TRY try ------------------ 1808| 8.09M| lpos.each_left_sub(visitor_t{}, merger); 1809| 8.09M| cpos.each_sub(visitor_t{}, merger); 1810| 8.09M| rpos.each_right_sub(visitor_t{}, merger); 1811| 8.09M| cpos.each_sub(dec_visitor{}); 1812| 8.09M| return merger.finish(); 1813| 8.09M| } 1814| 8.09M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 8.09M| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 18.1k| { 1959| 18.1k| return concat_inners(lpos, tpos, rpos); 1960| 18.1k| } _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 16.9k| { 1972| 16.9k| return visit_maybe_relaxed_sub( 1973| 16.9k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 16.9k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 6.80k| { 1959| 6.80k| return concat_inners(lpos, tpos, rpos); 1960| 6.80k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 10.1k| { 1959| 10.1k| return concat_inners(lpos, tpos, rpos); 1960| 10.1k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j: 680| 177k| { 681| 177k| auto node = pos.node(); 682| 177k| auto level = pos.shift(); 683| 177k| auto idx = pos.count() - 1; 684| 177k| auto children = pos.size(idx); 685| 177k| auto new_idx = 686| 177k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 2.86k, False: 174k] | Branch (686:47): [True: 445, False: 173k] ------------------ 687| 177k| auto new_child = static_cast(nullptr); 688| 177k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 177k, Folded] | Branch (688:38): [True: 173k, False: 3.21k] ------------------ 689| | 690| 177k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 752, False: 176k] ------------------ 691| 752| return nullptr; 692| 176k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 173k, False: 2.55k] ------------------ 693| 173k| new_child = 694| 173k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 171k, False: 2.50k] ------------------ 695| 173k| : pos.last_oh_csh( 696| 2.50k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 173k| if (!new_child) { ------------------ | Branch (697:17): [True: 1.18k, False: 172k] ------------------ 698| 1.18k| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 359, False: 827] ------------------ 699| 359| new_child = node_t::make_path_e(e, level - B, tail); 700| 827| else 701| 827| return nullptr; 702| 1.18k| } 703| 173k| } else 704| 2.55k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 175k| if (mutate) { ------------------ | Branch (706:13): [True: 172k, False: 2.86k] ------------------ 707| 172k| auto count = new_idx + 1; 708| 172k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 172k| node->inner()[new_idx] = new_child; 710| 172k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 172k| relaxed->d.count = count; 712| 172k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 172k, False: 0] ------------------ 713| 172k| return node; 714| 172k| } else { 715| 2.86k| IMMER_TRY { ------------------ | | 49| 2.86k|#define IMMER_TRY try ------------------ 716| 2.86k| auto count = new_idx + 1; 717| 2.86k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 2.86k| auto relaxed = new_node->relaxed(); 719| 2.86k| new_node->inner()[new_idx] = new_child; 720| 2.86k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 2.86k| relaxed->d.count = count; 722| 2.86k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 2.86k, False: 0] ------------------ 723| 2.86k| if (Mutating) ------------------ | Branch (723:21): [True: 2.86k, Folded] ------------------ 724| 2.86k| pos.visit(dec_visitor{}); 725| 2.86k| return new_node; 726| 2.86k| } 727| 2.86k| IMMER_CATCH (...) { 728| 0| auto shift = pos.shift(); 729| 0| auto size = new_idx == idx ? children + ts : ts; ------------------ | Branch (729:30): [True: 0, False: 0] ------------------ 730| 0| if (shift > BL) { ------------------ | Branch (730:21): [True: 0, False: 0] ------------------ 731| 0| tail->inc(); 732| 0| dec_inner(new_child, shift - B, size); 733| 0| } 734| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 735| 0| } 736| 2.86k| } 737| 175k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_: 741| 157k| { 742| 157k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 157k, False: 0] ------------------ 743| 157k| auto node = pos.node(); 744| 157k| auto idx = pos.index(pos.size() - 1); 745| 157k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 157k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 157k, Folded] | Branch (746:36): [True: 155k, False: 1.07k] ------------------ 747| 157k| if (mutate) { ------------------ | Branch (747:13): [True: 155k, False: 1.07k] ------------------ 748| 155k| node->inner()[new_idx] = 749| 155k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 153k, False: 2.78k] ------------------ 750| | /* otherwise */ 751| 155k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 155k| return node; 753| 155k| } else { 754| 1.07k| auto new_parent = node_t::make_inner_e(e); 755| 1.07k| IMMER_TRY { ------------------ | | 49| 1.07k|#define IMMER_TRY try ------------------ 756| 1.07k| new_parent->inner()[new_idx] = 757| 1.07k| idx == new_idx ------------------ | Branch (757:21): [True: 769, False: 301] ------------------ 758| 1.07k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.07k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.07k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.07k| if (Mutating) ------------------ | Branch (762:21): [True: 1.07k, Folded] ------------------ 763| 1.07k| pos.visit(dec_visitor{}); 764| 1.07k| return new_parent; 765| 1.07k| } 766| 1.07k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 1.07k| } 771| 157k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 1.03M| { 742| 1.03M| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.03M, False: 0] ------------------ 743| 1.03M| auto node = pos.node(); 744| 1.03M| auto idx = pos.index(pos.size() - 1); 745| 1.03M| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.03M| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 1.03M, Folded] | Branch (746:36): [True: 1.03M, False: 2.18k] ------------------ 747| 1.03M| if (mutate) { ------------------ | Branch (747:13): [True: 1.03M, False: 2.18k] ------------------ 748| 1.03M| node->inner()[new_idx] = 749| 1.03M| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 711k, False: 321k] ------------------ 750| | /* otherwise */ 751| 1.03M| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 1.03M| return node; 753| 1.03M| } else { 754| 2.18k| auto new_parent = node_t::make_inner_e(e); 755| 2.18k| IMMER_TRY { ------------------ | | 49| 2.18k|#define IMMER_TRY try ------------------ 756| 2.18k| new_parent->inner()[new_idx] = 757| 2.18k| idx == new_idx ------------------ | Branch (757:21): [True: 1.32k, False: 862] ------------------ 758| 2.18k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 2.18k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 2.18k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 2.18k| if (Mutating) ------------------ | Branch (762:21): [True: 2.18k, Folded] ------------------ 763| 2.18k| pos.visit(dec_visitor{}); 764| 2.18k| return new_parent; 765| 2.18k| } 766| 2.18k| 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.18k| } 771| 1.03M| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 4.56k| { 742| 4.56k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 4.56k, False: 0] ------------------ 743| 4.56k| auto node = pos.node(); 744| 4.56k| auto idx = pos.index(pos.size() - 1); 745| 4.56k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 4.56k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 4.56k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 4.56k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 4.56k] ------------------ 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| 4.56k| } else { 754| 4.56k| auto new_parent = node_t::make_inner_e(e); 755| 4.56k| IMMER_TRY { ------------------ | | 49| 4.56k|#define IMMER_TRY try ------------------ 756| 4.56k| new_parent->inner()[new_idx] = 757| 4.56k| idx == new_idx ------------------ | Branch (757:21): [True: 1.59k, False: 2.96k] ------------------ 758| 4.56k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 4.56k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 4.56k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 4.56k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 4.56k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 4.56k| return new_parent; 765| 4.56k| } 766| 4.56k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 4.56k| } 771| 4.56k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j: 680| 8.71k| { 681| 8.71k| auto node = pos.node(); 682| 8.71k| auto level = pos.shift(); 683| 8.71k| auto idx = pos.count() - 1; 684| 8.71k| auto children = pos.size(idx); 685| 8.71k| auto new_idx = 686| 8.71k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 961, False: 7.75k] | Branch (686:47): [True: 486, False: 7.26k] ------------------ 687| 8.71k| auto new_child = static_cast(nullptr); 688| 8.71k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 8.71k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 8.71k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 655, False: 8.05k] ------------------ 691| 655| return nullptr; 692| 8.05k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 7.26k, False: 792] ------------------ 693| 7.26k| new_child = 694| 7.26k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 7.26k] ------------------ 695| 7.26k| : pos.last_oh_csh( 696| 7.26k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 7.26k| if (!new_child) { ------------------ | Branch (697:17): [True: 778, False: 6.48k] ------------------ 698| 778| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 316, False: 462] ------------------ 699| 316| new_child = node_t::make_path_e(e, level - B, tail); 700| 462| else 701| 462| return nullptr; 702| 778| } 703| 7.26k| } else 704| 792| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 7.59k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 7.59k] ------------------ 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| 7.59k| } else { 715| 7.59k| IMMER_TRY { ------------------ | | 49| 7.59k|#define IMMER_TRY try ------------------ 716| 7.59k| auto count = new_idx + 1; 717| 7.59k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 7.59k| auto relaxed = new_node->relaxed(); 719| 7.59k| new_node->inner()[new_idx] = new_child; 720| 7.59k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 7.59k| relaxed->d.count = count; 722| 7.59k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 7.59k, False: 0] ------------------ 723| 7.59k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 7.59k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 7.59k| return new_node; 726| 7.59k| } 727| 7.59k| 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| 7.59k| } 737| 7.59k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_: 741| 1.06k| { 742| 1.06k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.06k, False: 0] ------------------ 743| 1.06k| auto node = pos.node(); 744| 1.06k| auto idx = pos.index(pos.size() - 1); 745| 1.06k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.06k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 1.06k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 1.06k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 1.06k] ------------------ 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| 1.06k| } else { 754| 1.06k| auto new_parent = node_t::make_inner_e(e); 755| 1.06k| IMMER_TRY { ------------------ | | 49| 1.06k|#define IMMER_TRY try ------------------ 756| 1.06k| new_parent->inner()[new_idx] = 757| 1.06k| idx == new_idx ------------------ | Branch (757:21): [True: 560, False: 501] ------------------ 758| 1.06k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.06k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.06k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.06k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 1.06k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 1.06k| return new_parent; 765| 1.06k| } 766| 1.06k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 1.06k| } 771| 1.06k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 180k| { 742| 180k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 180k, False: 0] ------------------ 743| 180k| auto node = pos.node(); 744| 180k| auto idx = pos.index(pos.size() - 1); 745| 180k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 180k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 180k, Folded] | Branch (746:36): [True: 179k, False: 634] ------------------ 747| 180k| if (mutate) { ------------------ | Branch (747:13): [True: 179k, False: 634] ------------------ 748| 179k| node->inner()[new_idx] = 749| 179k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 170k, False: 8.69k] ------------------ 750| | /* otherwise */ 751| 179k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 179k| return node; 753| 179k| } else { 754| 634| auto new_parent = node_t::make_inner_e(e); 755| 634| IMMER_TRY { ------------------ | | 49| 634|#define IMMER_TRY try ------------------ 756| 634| new_parent->inner()[new_idx] = 757| 634| idx == new_idx ------------------ | Branch (757:21): [True: 315, False: 319] ------------------ 758| 634| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 634| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 634| node_t::do_copy_inner(new_parent, node, new_idx); 762| 634| if (Mutating) ------------------ | Branch (762:21): [True: 634, Folded] ------------------ 763| 634| pos.visit(dec_visitor{}); 764| 634| return new_parent; 765| 634| } 766| 634| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 634| } 771| 180k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_: 580| 1.96k|{ 581| 1.96k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 1.96k|} _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_relaxedIRNS1_11relaxed_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 595| 134k| { 596| 134k| auto offset = pos.index(idx); 597| 134k| auto count = pos.count(); 598| 134k| auto node = pos.node(); 599| 134k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 99.6k, False: 34.8k] ------------------ 600| 99.6k| return pos.towards_oh( 601| 99.6k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 99.6k| } else { 603| 34.8k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 34.8k| IMMER_TRY { ------------------ | | 49| 34.8k|#define IMMER_TRY try ------------------ 605| 34.8k| auto& res = pos.towards_oh( 606| 34.8k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 34.8k| pos.visit(dec_visitor{}); 608| 34.8k| *location = new_node; 609| 34.8k| return res; 610| 34.8k| } 611| 34.8k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 34.8k| } 616| 134k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 20.2k| { 653| 20.2k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 20.2k, False: 0] ------------------ 654| 20.2k| auto node = pos.node(); 655| 20.2k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 2.37k, False: 17.8k] ------------------ 656| 2.37k| return node->leaf()[pos.index(idx)]; 657| 17.8k| } else { 658| 17.8k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 17.8k| pos.visit(dec_visitor{}); 660| 17.8k| *location = new_node; 661| 17.8k| return new_node->leaf()[pos.index(idx)]; 662| 17.8k| } 663| 20.2k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 4.76k| { 622| 4.76k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 4.76k, False: 0] ------------------ 623| 4.76k| auto offset = pos.index(idx); 624| 4.76k| auto count = pos.count(); 625| 4.76k| auto node = pos.node(); 626| 4.76k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 2.94k, False: 1.81k] ------------------ 627| 2.94k| return pos.towards_oh_ch( 628| 2.94k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 2.94k| } else { 630| 1.81k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.81k| IMMER_TRY { ------------------ | | 49| 1.81k|#define IMMER_TRY try ------------------ 632| 1.81k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.81k| idx, 634| 1.81k| offset, 635| 1.81k| count, 636| 1.81k| e, 637| 1.81k| &new_node->inner()[offset]); 638| 1.81k| pos.visit(dec_visitor{}); 639| 1.81k| *location = new_node; 640| 1.81k| return res; 641| 1.81k| } 642| 1.81k| 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.81k| } 647| 4.76k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 2.90k| { 653| 2.90k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 2.90k, False: 0] ------------------ 654| 2.90k| auto node = pos.node(); 655| 2.90k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.19k, False: 1.71k] ------------------ 656| 1.19k| return node->leaf()[pos.index(idx)]; 657| 1.71k| } else { 658| 1.71k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 1.71k| pos.visit(dec_visitor{}); 660| 1.71k| *location = new_node; 661| 1.71k| return new_node->leaf()[pos.index(idx)]; 662| 1.71k| } 663| 2.90k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_8full_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 2.17k| { 622| 2.17k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.17k, False: 0] ------------------ 623| 2.17k| auto offset = pos.index(idx); 624| 2.17k| auto count = pos.count(); 625| 2.17k| auto node = pos.node(); 626| 2.17k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.18k, False: 992] ------------------ 627| 1.18k| return pos.towards_oh_ch( 628| 1.18k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.18k| } else { 630| 992| auto new_node = node_t::copy_inner_e(e, node, count); 631| 992| IMMER_TRY { ------------------ | | 49| 992|#define IMMER_TRY try ------------------ 632| 992| auto& res = pos.towards_oh_ch(this_t{}, 633| 992| idx, 634| 992| offset, 635| 992| count, 636| 992| e, 637| 992| &new_node->inner()[offset]); 638| 992| pos.visit(dec_visitor{}); 639| 992| *location = new_node; 640| 992| return res; 641| 992| } 642| 992| 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| 992| } 647| 2.17k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_8leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 1.86k| { 653| 1.86k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 1.86k, False: 0] ------------------ 654| 1.86k| auto node = pos.node(); 655| 1.86k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.30k, False: 559] ------------------ 656| 1.30k| return node->leaf()[pos.index(idx)]; 657| 1.30k| } else { 658| 559| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 559| pos.visit(dec_visitor{}); 660| 559| *location = new_node; 661| 559| return new_node->leaf()[pos.index(idx)]; 662| 559| } 663| 1.86k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_11regular_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 1.75k| { 622| 1.75k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 1.75k, False: 0] ------------------ 623| 1.75k| auto offset = pos.index(idx); 624| 1.75k| auto count = pos.count(); 625| 1.75k| auto node = pos.node(); 626| 1.75k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.35k, False: 408] ------------------ 627| 1.35k| return pos.towards_oh_ch( 628| 1.35k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.35k| } else { 630| 408| auto new_node = node_t::copy_inner_e(e, node, count); 631| 408| IMMER_TRY { ------------------ | | 49| 408|#define IMMER_TRY try ------------------ 632| 408| auto& res = pos.towards_oh_ch(this_t{}, 633| 408| idx, 634| 408| offset, 635| 408| count, 636| 408| e, 637| 408| &new_node->inner()[offset]); 638| 408| pos.visit(dec_visitor{}); 639| 408| *location = new_node; 640| 408| return res; 641| 408| } 642| 408| 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| 408| } 647| 1.75k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 31.0k| { 914| 31.0k| auto idx = pos.index(last); 915| 31.0k| auto node = pos.node(); 916| 31.0k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 31.0k, Folded] | Branch (916:35): [True: 22.3k, False: 8.73k] ------------------ 917| 31.0k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 31.0k, Folded] | Branch (917:25): [True: 18.5k, False: 12.4k] ------------------ 918| 18.5k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 14.4k, False: 4.11k] ------------------ 919| 18.5k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 18.5k| if (Mutating) ------------------ | Branch (920:17): [True: 18.5k, Folded] ------------------ 921| 18.5k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 18.5k| return res; 923| 18.5k| } else { 924| 12.4k| using std::get; 925| 12.4k| auto subs = 926| 12.4k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 7.86k, False: 4.62k] ------------------ 927| 12.4k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 12.4k| auto next = get<1>(subs); 929| 12.4k| auto ts = get<2>(subs); 930| 12.4k| auto tail = get<3>(subs); 931| 12.4k| IMMER_TRY { ------------------ | | 49| 12.4k|#define IMMER_TRY try ------------------ 932| 12.4k| if (next) { ------------------ | Branch (932:21): [True: 9.22k, False: 3.26k] ------------------ 933| 9.22k| if (mutate) { ------------------ | Branch (933:25): [True: 5.92k, False: 3.29k] ------------------ 934| 5.92k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 5.92k| pos.each_right(dec_visitor{}, idx + 1); 936| 5.92k| node->inner()[idx] = next; 937| 5.92k| nodr->d.sizes[idx] = last + 1 - ts; 938| 5.92k| nodr->d.count = idx + 1; 939| 5.92k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 5.92k, False: 0] ------------------ 940| 5.92k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 5.92k| } else { 942| 3.29k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 3.29k| auto newr = newn->relaxed(); 944| 3.29k| newn->inner()[idx] = next; 945| 3.29k| newr->d.sizes[idx] = last + 1 - ts; 946| 3.29k| newr->d.count = idx + 1; 947| 3.29k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 3.29k, False: 0] ------------------ 948| 3.29k| if (Mutating) ------------------ | Branch (948:29): [True: 3.29k, Folded] ------------------ 949| 3.29k| pos.visit(dec_visitor{}); 950| 3.29k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 3.29k| } 952| 9.22k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 3.26k] ------------------ 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| 3.26k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 3.26k, Folded] | Branch (956:40): [True: 2.43k, False: 828] | Branch (956:52): [True: 1.75k, False: 689] ------------------ 957| 1.75k| auto newn = pos.node()->inner()[0]; 958| 1.75k| if (!mutate) ------------------ | Branch (958:25): [True: 809, False: 941] ------------------ 959| 809| newn->inc(); 960| 1.75k| if (Mutating) ------------------ | Branch (960:25): [True: 1.75k, Folded] ------------------ 961| 1.75k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 1.75k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.75k| } else { 964| 1.51k| if (mutate) { ------------------ | Branch (964:25): [True: 1.00k, False: 514] ------------------ 965| 1.00k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.00k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.00k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.00k| } else { 969| 514| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 514| if (Mutating) ------------------ | Branch (970:29): [True: 514, Folded] ------------------ 971| 514| pos.visit(dec_visitor{}); 972| 514| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 514| } 974| 1.51k| } 975| 12.4k| } 976| 12.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| 12.4k| } 987| 31.0k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 869| { 1060| 869| auto old_tail_size = pos.count(); 1061| 869| auto new_tail_size = pos.index(last) + 1; 1062| 869| auto node = pos.node(); 1063| 869| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 869, Folded] | Branch (1063:42): [True: 261, False: 608] ------------------ 1064| 869| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 211, False: 658] ------------------ 1065| 211| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 211] ------------------ 1066| 0| node->inc(); 1067| 211| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 658| } else if (mutate) { ------------------ | Branch (1068:20): [True: 253, False: 405] ------------------ 1069| 253| detail::destroy_n(node->leaf() + new_tail_size, 1070| 253| old_tail_size - new_tail_size); 1071| 253| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 405| } else { 1073| 405| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 405| if (Mutating) ------------------ | Branch (1074:17): [True: 405, Folded] ------------------ 1075| 405| pos.visit(dec_visitor{}); 1076| 405| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 405| } 1078| 869| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 966| { 1060| 966| auto old_tail_size = pos.count(); 1061| 966| auto new_tail_size = pos.index(last) + 1; 1062| 966| auto node = pos.node(); 1063| 966| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 966] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 966| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 382, False: 584] ------------------ 1065| 382| if (!Mutating) ------------------ | Branch (1065:17): [True: 382, Folded] ------------------ 1066| 382| node->inc(); 1067| 382| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 584| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 584] ------------------ 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| 584| } else { 1073| 584| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 584| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 584] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 584| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 584| } 1078| 966| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 11.6k| { 914| 11.6k| auto idx = pos.index(last); 915| 11.6k| auto node = pos.node(); 916| 11.6k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 11.6k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 11.6k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 11.6k, Folded] | Branch (917:25): [True: 9.73k, False: 1.93k] ------------------ 918| 9.73k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 9.73k] ------------------ 919| 9.73k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 9.73k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 9.73k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 9.73k| return res; 923| 9.73k| } else { 924| 1.93k| using std::get; 925| 1.93k| auto subs = 926| 1.93k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 1.93k] ------------------ 927| 1.93k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 1.93k| auto next = get<1>(subs); 929| 1.93k| auto ts = get<2>(subs); 930| 1.93k| auto tail = get<3>(subs); 931| 1.93k| IMMER_TRY { ------------------ | | 49| 1.93k|#define IMMER_TRY try ------------------ 932| 1.93k| if (next) { ------------------ | Branch (932:21): [True: 882, False: 1.05k] ------------------ 933| 882| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 882] ------------------ 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| 882| } else { 942| 882| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 882| auto newr = newn->relaxed(); 944| 882| newn->inner()[idx] = next; 945| 882| newr->d.sizes[idx] = last + 1 - ts; 946| 882| newr->d.count = idx + 1; 947| 882| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 882, False: 0] ------------------ 948| 882| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 882] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 882| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 882| } 952| 1.05k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 1.05k] ------------------ 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.05k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 1.05k, Folded] | Branch (956:40): [True: 637, False: 418] | Branch (956:52): [True: 334, False: 303] ------------------ 957| 334| auto newn = pos.node()->inner()[0]; 958| 334| if (!mutate) ------------------ | Branch (958:25): [True: 334, False: 0] ------------------ 959| 334| newn->inc(); 960| 334| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 334] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 334| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 721| } else { 964| 721| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 721] ------------------ 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| 721| } else { 969| 721| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 721| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 721] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 721| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 721| } 974| 721| } 975| 1.93k| } 976| 1.93k| 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| 1.93k| } 987| 11.6k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 1.21k| { 992| 1.21k| auto idx = pos.index(last); 993| 1.21k| auto node = pos.node(); 994| 1.21k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.21k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.21k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.21k, Folded] | Branch (995:25): [True: 292, False: 919] ------------------ 996| 292| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 292] ------------------ 997| 292| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 292| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 292] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 292| return res; 1001| 919| } else { 1002| 919| using std::get; 1003| 919| auto subs = 1004| 919| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 919] ------------------ 1005| 919| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 919| auto next = get<1>(subs); 1007| 919| auto ts = get<2>(subs); 1008| 919| auto tail = get<3>(subs); 1009| 919| IMMER_TRY { ------------------ | | 49| 919|#define IMMER_TRY try ------------------ 1010| 919| if (next) { ------------------ | Branch (1010:21): [True: 266, False: 653] ------------------ 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| 653| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 653] ------------------ 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| 653| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 653, Folded] | Branch (1026:40): [True: 398, False: 255] | Branch (1026:52): [True: 195, False: 203] ------------------ 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| 458| } else { 1034| 458| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 458] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 458| } else { 1038| 458| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 458| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 458] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 458| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 458| } 1043| 458| } 1044| 919| } 1045| 919| 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| 919| } 1055| 1.21k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.95k| { 1060| 1.95k| auto old_tail_size = pos.count(); 1061| 1.95k| auto new_tail_size = pos.index(last) + 1; 1062| 1.95k| auto node = pos.node(); 1063| 1.95k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.95k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.95k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.24k, False: 704] ------------------ 1065| 1.24k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.24k, Folded] ------------------ 1066| 1.24k| node->inc(); 1067| 1.24k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.24k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 704] ------------------ 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| 704| } else { 1073| 704| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 704| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 704] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 704| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 704| } 1078| 1.95k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE13visit_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: 618, False: 1.21k] ------------------ 996| 618| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 618] ------------------ 997| 618| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 618| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 618] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 618| return res; 1001| 1.21k| } else { 1002| 1.21k| using std::get; 1003| 1.21k| auto subs = 1004| 1.21k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.21k] ------------------ 1005| 1.21k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.21k| auto next = get<1>(subs); 1007| 1.21k| auto ts = get<2>(subs); 1008| 1.21k| auto tail = get<3>(subs); 1009| 1.21k| IMMER_TRY { ------------------ | | 49| 1.21k|#define IMMER_TRY try ------------------ 1010| 1.21k| if (next) { ------------------ | Branch (1010:21): [True: 269, False: 950] ------------------ 1011| 269| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 269] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 269| } else { 1016| 269| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 269| newn->inner()[idx] = next; 1018| 269| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 269] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 269| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 269| } 1022| 950| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 950] ------------------ 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| 950| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 950, Folded] | Branch (1026:40): [True: 559, False: 391] | Branch (1026:52): [True: 230, False: 329] ------------------ 1027| 230| auto newn = pos.node()->inner()[0]; 1028| 230| if (!mutate) ------------------ | Branch (1028:25): [True: 230, False: 0] ------------------ 1029| 230| newn->inc(); 1030| 230| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 230] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 230| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 720| } else { 1034| 720| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 720] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 720| } else { 1038| 720| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 720| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 720] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 720| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 720| } 1043| 720| } 1044| 1.21k| } 1045| 1.21k| 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.21k| } 1055| 1.83k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 3.24k| { 1060| 3.24k| auto old_tail_size = pos.count(); 1061| 3.24k| auto new_tail_size = pos.index(last) + 1; 1062| 3.24k| auto node = pos.node(); 1063| 3.24k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 3.24k, Folded] | Branch (1063:42): [True: 330, False: 2.91k] ------------------ 1064| 3.24k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.67k, False: 1.56k] ------------------ 1065| 1.67k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.67k] ------------------ 1066| 0| node->inc(); 1067| 1.67k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.67k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 326, False: 1.24k] ------------------ 1069| 326| detail::destroy_n(node->leaf() + new_tail_size, 1070| 326| old_tail_size - new_tail_size); 1071| 326| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.24k| } else { 1073| 1.24k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.24k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.24k, Folded] ------------------ 1075| 1.24k| pos.visit(dec_visitor{}); 1076| 1.24k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.24k| } 1078| 3.24k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.72k| { 992| 3.72k| auto idx = pos.index(last); 993| 3.72k| auto node = pos.node(); 994| 3.72k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.72k, Folded] | Branch (994:35): [True: 1.50k, False: 2.22k] ------------------ 995| 3.72k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.72k] | 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.72k| } else { 1002| 3.72k| using std::get; 1003| 3.72k| auto subs = 1004| 3.72k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 1.50k, False: 2.22k] ------------------ 1005| 3.72k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.72k| auto next = get<1>(subs); 1007| 3.72k| auto ts = get<2>(subs); 1008| 3.72k| auto tail = get<3>(subs); 1009| 3.72k| IMMER_TRY { ------------------ | | 49| 3.72k|#define IMMER_TRY try ------------------ 1010| 3.72k| if (next) { ------------------ | Branch (1010:21): [True: 985, False: 2.74k] ------------------ 1011| 985| if (mutate) { ------------------ | Branch (1011:25): [True: 464, False: 521] ------------------ 1012| 464| node->inner()[idx] = next; 1013| 464| pos.each_right(dec_visitor{}, idx + 1); 1014| 464| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 521| } else { 1016| 521| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 521| newn->inner()[idx] = next; 1018| 521| if (Mutating) ------------------ | Branch (1018:29): [True: 521, Folded] ------------------ 1019| 521| pos.visit(dec_visitor{}); 1020| 521| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 521| } 1022| 2.74k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 864, False: 1.87k] ------------------ 1023| 864| if (Mutating) ------------------ | Branch (1023:25): [True: 864, Folded] ------------------ 1024| 864| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 864| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.87k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.87k] | 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.87k| } else { 1034| 1.87k| if (mutate) { ------------------ | Branch (1034:25): [True: 429, False: 1.44k] ------------------ 1035| 429| pos.each_right(dec_visitor{}, idx + 1); 1036| 429| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.44k| } else { 1038| 1.44k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.44k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.44k, Folded] ------------------ 1040| 1.44k| pos.visit(dec_visitor{}); 1041| 1.44k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.44k| } 1043| 1.87k| } 1044| 3.72k| } 1045| 3.72k| 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.72k| } 1055| 3.72k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 3.36k| { 879| 3.36k| using node_t = node_type; 880| 3.36k| auto node = p.node(); 881| 3.36k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.95k, False: 1.40k] ------------------ 882| 1.95k| p.each_right(dec_t{}, idx); 883| 1.95k| node_t::delete_inner(node, p.count()); 884| 1.95k| } 885| 3.36k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 10.1k| { 1060| 10.1k| auto old_tail_size = pos.count(); 1061| 10.1k| auto new_tail_size = pos.index(last) + 1; 1062| 10.1k| auto node = pos.node(); 1063| 10.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 10.1k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 10.1k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 4.27k, False: 5.87k] ------------------ 1065| 4.27k| if (!Mutating) ------------------ | Branch (1065:17): [True: 4.27k, Folded] ------------------ 1066| 4.27k| node->inc(); 1067| 4.27k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 5.87k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 5.87k] ------------------ 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| 5.87k| } else { 1073| 5.87k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 5.87k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 5.87k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 5.87k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 5.87k| } 1078| 10.1k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 5.12k| { 992| 5.12k| auto idx = pos.index(last); 993| 5.12k| auto node = pos.node(); 994| 5.12k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 5.12k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 5.12k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 5.12k] | 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.12k| } else { 1002| 5.12k| using std::get; 1003| 5.12k| auto subs = 1004| 5.12k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 5.12k] ------------------ 1005| 5.12k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.12k| auto next = get<1>(subs); 1007| 5.12k| auto ts = get<2>(subs); 1008| 5.12k| auto tail = get<3>(subs); 1009| 5.12k| IMMER_TRY { ------------------ | | 49| 5.12k|#define IMMER_TRY try ------------------ 1010| 5.12k| if (next) { ------------------ | Branch (1010:21): [True: 631, False: 4.49k] ------------------ 1011| 631| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 631] ------------------ 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| 631| } else { 1016| 631| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 631| newn->inner()[idx] = next; 1018| 631| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 631] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 631| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 631| } 1022| 4.49k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 943, False: 3.55k] ------------------ 1023| 943| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 943] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 943| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.55k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 3.55k] | 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.55k| } else { 1034| 3.55k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 3.55k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 3.55k| } else { 1038| 3.55k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 3.55k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 3.55k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 3.55k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 3.55k| } 1043| 3.55k| } 1044| 5.12k| } 1045| 5.12k| 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.12k| } 1055| 5.12k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 412| { 1060| 412| auto old_tail_size = pos.count(); 1061| 412| auto new_tail_size = pos.index(last) + 1; 1062| 412| auto node = pos.node(); 1063| 412| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 412] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 412| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 194, False: 218] ------------------ 1065| 194| if (!Mutating) ------------------ | Branch (1065:17): [True: 194, Folded] ------------------ 1066| 194| node->inc(); 1067| 194| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 218| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 218] ------------------ 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| 218| } else { 1073| 218| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 218| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 218] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 218| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 218| } 1078| 412| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.37k| { 1060| 1.37k| auto old_tail_size = pos.count(); 1061| 1.37k| auto new_tail_size = pos.index(last) + 1; 1062| 1.37k| auto node = pos.node(); 1063| 1.37k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.37k, Folded] | Branch (1063:42): [True: 208, False: 1.16k] ------------------ 1064| 1.37k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 607, False: 765] ------------------ 1065| 607| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 607] ------------------ 1066| 0| node->inc(); 1067| 607| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 765| } else if (mutate) { ------------------ | Branch (1068:20): [True: 207, False: 558] ------------------ 1069| 207| detail::destroy_n(node->leaf() + new_tail_size, 1070| 207| old_tail_size - new_tail_size); 1071| 207| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 558| } else { 1073| 558| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 558| if (Mutating) ------------------ | Branch (1074:17): [True: 558, Folded] ------------------ 1075| 558| pos.visit(dec_visitor{}); 1076| 558| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 558| } 1078| 1.37k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.68k| { 992| 3.68k| auto idx = pos.index(last); 993| 3.68k| auto node = pos.node(); 994| 3.68k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.68k, Folded] | Branch (994:35): [True: 2.75k, False: 937] ------------------ 995| 3.68k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.68k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.68k| } else { 1002| 3.68k| using std::get; 1003| 3.68k| auto subs = 1004| 3.68k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.75k, False: 937] ------------------ 1005| 3.68k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.68k| auto next = get<1>(subs); 1007| 3.68k| auto ts = get<2>(subs); 1008| 3.68k| auto tail = get<3>(subs); 1009| 3.68k| IMMER_TRY { ------------------ | | 49| 3.68k|#define IMMER_TRY try ------------------ 1010| 3.68k| if (next) { ------------------ | Branch (1010:21): [True: 1.76k, False: 1.92k] ------------------ 1011| 1.76k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.29k, False: 471] ------------------ 1012| 1.29k| node->inner()[idx] = next; 1013| 1.29k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.29k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.29k| } else { 1016| 471| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 471| newn->inner()[idx] = next; 1018| 471| if (Mutating) ------------------ | Branch (1018:29): [True: 471, Folded] ------------------ 1019| 471| pos.visit(dec_visitor{}); 1020| 471| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 471| } 1022| 1.92k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.15k, False: 770] ------------------ 1023| 1.15k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.15k, Folded] ------------------ 1024| 1.15k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.15k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.15k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 770] | 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| 770| } else { 1034| 770| if (mutate) { ------------------ | Branch (1034:25): [True: 523, False: 247] ------------------ 1035| 523| pos.each_right(dec_visitor{}, idx + 1); 1036| 523| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 523| } else { 1038| 247| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 247| if (Mutating) ------------------ | Branch (1039:29): [True: 247, Folded] ------------------ 1040| 247| pos.visit(dec_visitor{}); 1041| 247| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 247| } 1043| 770| } 1044| 3.68k| } 1045| 3.68k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.68k| } 1055| 3.68k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 1.15k| { 879| 1.15k| using node_t = node_type; 880| 1.15k| auto node = p.node(); 881| 1.15k| if (node->dec()) { ------------------ | Branch (881:13): [True: 937, False: 219] ------------------ 882| 937| p.each_right(dec_t{}, idx); 883| 937| node_t::delete_inner(node, p.count()); 884| 937| } 885| 1.15k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 2.18k| { 1060| 2.18k| auto old_tail_size = pos.count(); 1061| 2.18k| auto new_tail_size = pos.index(last) + 1; 1062| 2.18k| auto node = pos.node(); 1063| 2.18k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.18k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.18k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 413, False: 1.77k] ------------------ 1065| 413| if (!Mutating) ------------------ | Branch (1065:17): [True: 413, Folded] ------------------ 1066| 413| node->inc(); 1067| 413| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.77k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 1.77k] ------------------ 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.77k| } else { 1073| 1.77k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.77k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 1.77k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 1.77k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.77k| } 1078| 2.18k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.26k| { 992| 3.26k| auto idx = pos.index(last); 993| 3.26k| auto node = pos.node(); 994| 3.26k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.26k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.26k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.26k] | 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.26k| } else { 1002| 3.26k| using std::get; 1003| 3.26k| auto subs = 1004| 3.26k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.26k] ------------------ 1005| 3.26k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.26k| auto next = get<1>(subs); 1007| 3.26k| auto ts = get<2>(subs); 1008| 3.26k| auto tail = get<3>(subs); 1009| 3.26k| IMMER_TRY { ------------------ | | 49| 3.26k|#define IMMER_TRY try ------------------ 1010| 3.26k| if (next) { ------------------ | Branch (1010:21): [True: 1.02k, False: 2.24k] ------------------ 1011| 1.02k| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 1.02k] ------------------ 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| 1.02k| } else { 1016| 1.02k| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 1.02k| newn->inner()[idx] = next; 1018| 1.02k| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 1.02k] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 1.02k| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 1.02k| } 1022| 2.24k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 686, False: 1.55k] ------------------ 1023| 686| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 686] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 686| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.55k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.55k] | 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.55k| } else { 1034| 1.55k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.55k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.55k| } else { 1038| 1.55k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.55k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.55k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.55k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.55k| } 1043| 1.55k| } 1044| 3.26k| } 1045| 3.26k| 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.26k| } 1055| 3.26k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 867| 20.8k| { 868| 20.8k| using node_t = node_type; 869| 20.8k| auto node = p.node(); 870| 20.8k| if (node->dec()) { ------------------ | Branch (870:13): [True: 15.6k, False: 5.19k] ------------------ 871| 15.6k| p.each_right(dec_t{}, idx); 872| 15.6k| node_t::delete_inner_r(node, p.count()); 873| 15.6k| } 874| 20.8k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.79k| { 1060| 1.79k| auto old_tail_size = pos.count(); 1061| 1.79k| auto new_tail_size = pos.index(last) + 1; 1062| 1.79k| auto node = pos.node(); 1063| 1.79k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.79k, Folded] | Branch (1063:42): [True: 361, False: 1.43k] ------------------ 1064| 1.79k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 466, False: 1.33k] ------------------ 1065| 466| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 466] ------------------ 1066| 0| node->inc(); 1067| 466| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.33k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 308, False: 1.02k] ------------------ 1069| 308| detail::destroy_n(node->leaf() + new_tail_size, 1070| 308| old_tail_size - new_tail_size); 1071| 308| 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.79k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 2.76k| { 914| 2.76k| auto idx = pos.index(last); 915| 2.76k| auto node = pos.node(); 916| 2.76k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 2.76k, Folded] | Branch (916:35): [True: 1.50k, False: 1.26k] ------------------ 917| 2.76k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 2.76k] | 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| 2.76k| } else { 924| 2.76k| using std::get; 925| 2.76k| auto subs = 926| 2.76k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 1.50k, False: 1.26k] ------------------ 927| 2.76k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 2.76k| auto next = get<1>(subs); 929| 2.76k| auto ts = get<2>(subs); 930| 2.76k| auto tail = get<3>(subs); 931| 2.76k| IMMER_TRY { ------------------ | | 49| 2.76k|#define IMMER_TRY try ------------------ 932| 2.76k| if (next) { ------------------ | Branch (932:21): [True: 980, False: 1.78k] ------------------ 933| 980| if (mutate) { ------------------ | Branch (933:25): [True: 503, False: 477] ------------------ 934| 503| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 503| pos.each_right(dec_visitor{}, idx + 1); 936| 503| node->inner()[idx] = next; 937| 503| nodr->d.sizes[idx] = last + 1 - ts; 938| 503| nodr->d.count = idx + 1; 939| 503| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 503, False: 0] ------------------ 940| 503| return std::make_tuple(pos.shift(), node, ts, tail); 941| 503| } else { 942| 477| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 477| auto newr = newn->relaxed(); 944| 477| newn->inner()[idx] = next; 945| 477| newr->d.sizes[idx] = last + 1 - ts; 946| 477| newr->d.count = idx + 1; 947| 477| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 477, False: 0] ------------------ 948| 477| if (Mutating) ------------------ | Branch (948:29): [True: 477, Folded] ------------------ 949| 477| pos.visit(dec_visitor{}); 950| 477| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 477| } 952| 1.78k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 506, False: 1.28k] ------------------ 953| 506| if (Mutating) ------------------ | Branch (953:25): [True: 506, Folded] ------------------ 954| 506| pos.visit(dec_right_visitor{}, count_t{1}); 955| 506| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.28k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.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): [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.28k| } else { 964| 1.28k| if (mutate) { ------------------ | Branch (964:25): [True: 763, False: 519] ------------------ 965| 763| pos.each_right(dec_visitor{}, idx + 1); 966| 763| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 763| return std::make_tuple(pos.shift(), node, ts, tail); 968| 763| } else { 969| 519| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 519| if (Mutating) ------------------ | Branch (970:29): [True: 519, Folded] ------------------ 971| 519| pos.visit(dec_visitor{}); 972| 519| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 519| } 974| 1.28k| } 975| 2.76k| } 976| 2.76k| 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.76k| } 987| 2.76k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 4.80k| { 992| 4.80k| auto idx = pos.index(last); 993| 4.80k| auto node = pos.node(); 994| 4.80k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.80k, Folded] | Branch (994:35): [True: 3.60k, False: 1.20k] ------------------ 995| 4.80k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.80k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 4.80k| } else { 1002| 4.80k| using std::get; 1003| 4.80k| auto subs = 1004| 4.80k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.60k, False: 1.20k] ------------------ 1005| 4.80k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.80k| auto next = get<1>(subs); 1007| 4.80k| auto ts = get<2>(subs); 1008| 4.80k| auto tail = get<3>(subs); 1009| 4.80k| IMMER_TRY { ------------------ | | 49| 4.80k|#define IMMER_TRY try ------------------ 1010| 4.80k| if (next) { ------------------ | Branch (1010:21): [True: 3.45k, False: 1.35k] ------------------ 1011| 3.45k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.87k, False: 571] ------------------ 1012| 2.87k| node->inner()[idx] = next; 1013| 2.87k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.87k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.87k| } else { 1016| 571| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 571| newn->inner()[idx] = next; 1018| 571| if (Mutating) ------------------ | Branch (1018:29): [True: 571, Folded] ------------------ 1019| 571| pos.visit(dec_visitor{}); 1020| 571| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 571| } 1022| 3.45k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 640, False: 716] ------------------ 1023| 640| if (Mutating) ------------------ | Branch (1023:25): [True: 640, Folded] ------------------ 1024| 640| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 640| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 716| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 716] | 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| 716| } else { 1034| 716| if (mutate) { ------------------ | Branch (1034:25): [True: 364, False: 352] ------------------ 1035| 364| pos.each_right(dec_visitor{}, idx + 1); 1036| 364| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 364| } else { 1038| 352| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 352| if (Mutating) ------------------ | Branch (1039:29): [True: 352, Folded] ------------------ 1040| 352| pos.visit(dec_visitor{}); 1041| 352| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 352| } 1043| 716| } 1044| 4.80k| } 1045| 4.80k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 4.80k| } 1055| 4.80k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 10.1k| { 879| 10.1k| using node_t = node_type; 880| 10.1k| auto node = p.node(); 881| 10.1k| if (node->dec()) { ------------------ | Branch (881:13): [True: 6.96k, False: 3.20k] ------------------ 882| 6.96k| p.each_right(dec_t{}, idx); 883| 6.96k| node_t::delete_inner(node, p.count()); 884| 6.96k| } 885| 10.1k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 4.69k| { 1060| 4.69k| auto old_tail_size = pos.count(); 1061| 4.69k| auto new_tail_size = pos.index(last) + 1; 1062| 4.69k| auto node = pos.node(); 1063| 4.69k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 4.69k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 4.69k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.10k, False: 3.58k] ------------------ 1065| 1.10k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.10k, Folded] ------------------ 1066| 1.10k| node->inc(); 1067| 1.10k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 3.58k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 3.58k] ------------------ 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| 3.58k| } else { 1073| 3.58k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 3.58k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 3.58k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 3.58k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 3.58k| } 1078| 4.69k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 3.81k| { 914| 3.81k| auto idx = pos.index(last); 915| 3.81k| auto node = pos.node(); 916| 3.81k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 3.81k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 3.81k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 3.81k] | 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| 3.81k| } else { 924| 3.81k| using std::get; 925| 3.81k| auto subs = 926| 3.81k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 3.81k] ------------------ 927| 3.81k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 3.81k| auto next = get<1>(subs); 929| 3.81k| auto ts = get<2>(subs); 930| 3.81k| auto tail = get<3>(subs); 931| 3.81k| IMMER_TRY { ------------------ | | 49| 3.81k|#define IMMER_TRY try ------------------ 932| 3.81k| if (next) { ------------------ | Branch (932:21): [True: 706, False: 3.11k] ------------------ 933| 706| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 706] ------------------ 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| 706| } else { 942| 706| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 706| auto newr = newn->relaxed(); 944| 706| newn->inner()[idx] = next; 945| 706| newr->d.sizes[idx] = last + 1 - ts; 946| 706| newr->d.count = idx + 1; 947| 706| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 706, False: 0] ------------------ 948| 706| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 706] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 706| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 706| } 952| 3.11k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 959, False: 2.15k] ------------------ 953| 959| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 959] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 959| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 2.15k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 2.15k] | 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.15k| } else { 964| 2.15k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 2.15k] ------------------ 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.15k| } else { 969| 2.15k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 2.15k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 2.15k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 2.15k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 2.15k| } 974| 2.15k| } 975| 3.81k| } 976| 3.81k| 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| 3.81k| } 987| 3.81k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.13k| { 992| 3.13k| auto idx = pos.index(last); 993| 3.13k| auto node = pos.node(); 994| 3.13k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.13k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.13k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.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): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.13k| } else { 1002| 3.13k| using std::get; 1003| 3.13k| auto subs = 1004| 3.13k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.13k] ------------------ 1005| 3.13k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.13k| auto next = get<1>(subs); 1007| 3.13k| auto ts = get<2>(subs); 1008| 3.13k| auto tail = get<3>(subs); 1009| 3.13k| IMMER_TRY { ------------------ | | 49| 3.13k|#define IMMER_TRY try ------------------ 1010| 3.13k| if (next) { ------------------ | Branch (1010:21): [True: 2.14k, False: 992] ------------------ 1011| 2.14k| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 2.14k] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.14k| } else { 1016| 2.14k| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 2.14k| newn->inner()[idx] = next; 1018| 2.14k| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 2.14k] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 2.14k| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 2.14k| } 1022| 2.14k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 627, False: 365] ------------------ 1023| 627| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 627] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 627| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 627| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 365] | 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| 365| } else { 1034| 365| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 365] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 365| } else { 1038| 365| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 365| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 365] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 365| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 365| } 1043| 365| } 1044| 3.13k| } 1045| 3.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| 3.13k| } 1055| 3.13k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 12.5k| { 992| 12.5k| auto idx = pos.index(last); 993| 12.5k| auto node = pos.node(); 994| 12.5k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 12.5k, Folded] | Branch (994:35): [True: 8.44k, False: 4.08k] ------------------ 995| 12.5k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 12.5k, Folded] | Branch (995:25): [True: 7.54k, False: 4.98k] ------------------ 996| 7.54k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 5.13k, False: 2.40k] ------------------ 997| 7.54k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 7.54k| if (Mutating) ------------------ | Branch (998:17): [True: 7.54k, Folded] ------------------ 999| 7.54k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 7.54k| return res; 1001| 7.54k| } else { 1002| 4.98k| using std::get; 1003| 4.98k| auto subs = 1004| 4.98k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.30k, False: 1.67k] ------------------ 1005| 4.98k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.98k| auto next = get<1>(subs); 1007| 4.98k| auto ts = get<2>(subs); 1008| 4.98k| auto tail = get<3>(subs); 1009| 4.98k| IMMER_TRY { ------------------ | | 49| 4.98k|#define IMMER_TRY try ------------------ 1010| 4.98k| if (next) { ------------------ | Branch (1010:21): [True: 1.15k, False: 3.82k] ------------------ 1011| 1.15k| if (mutate) { ------------------ | Branch (1011:25): [True: 560, False: 593] ------------------ 1012| 560| node->inner()[idx] = next; 1013| 560| pos.each_right(dec_visitor{}, idx + 1); 1014| 560| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 593| } else { 1016| 593| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 593| newn->inner()[idx] = next; 1018| 593| if (Mutating) ------------------ | Branch (1018:29): [True: 593, Folded] ------------------ 1019| 593| pos.visit(dec_visitor{}); 1020| 593| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 593| } 1022| 3.82k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 3.82k] ------------------ 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.82k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 3.82k, Folded] | Branch (1026:40): [True: 3.40k, False: 423] | Branch (1026:52): [True: 1.99k, False: 1.41k] ------------------ 1027| 1.99k| auto newn = pos.node()->inner()[0]; 1028| 1.99k| if (!mutate) ------------------ | Branch (1028:25): [True: 522, False: 1.47k] ------------------ 1029| 522| newn->inc(); 1030| 1.99k| if (Mutating) ------------------ | Branch (1030:25): [True: 1.99k, Folded] ------------------ 1031| 1.99k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 1.99k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.99k| } else { 1034| 1.83k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.27k, False: 564] ------------------ 1035| 1.27k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.27k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.27k| } else { 1038| 564| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 564| if (Mutating) ------------------ | Branch (1039:29): [True: 564, Folded] ------------------ 1040| 564| pos.visit(dec_visitor{}); 1041| 564| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 564| } 1043| 1.83k| } 1044| 4.98k| } 1045| 4.98k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 4.98k| } 1055| 12.5k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.59k| { 1060| 1.59k| auto old_tail_size = pos.count(); 1061| 1.59k| auto new_tail_size = pos.index(last) + 1; 1062| 1.59k| auto node = pos.node(); 1063| 1.59k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.59k, Folded] | Branch (1063:42): [True: 628, False: 962] ------------------ 1064| 1.59k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 267, False: 1.32k] ------------------ 1065| 267| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 267] ------------------ 1066| 0| node->inc(); 1067| 267| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.32k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 627, False: 696] ------------------ 1069| 627| detail::destroy_n(node->leaf() + new_tail_size, 1070| 627| old_tail_size - new_tail_size); 1071| 627| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 696| } else { 1073| 696| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 696| if (Mutating) ------------------ | Branch (1074:17): [True: 696, Folded] ------------------ 1075| 696| pos.visit(dec_visitor{}); 1076| 696| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 696| } 1078| 1.59k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.81k| { 992| 3.81k| auto idx = pos.index(last); 993| 3.81k| auto node = pos.node(); 994| 3.81k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.81k, Folded] | Branch (994:35): [True: 1.91k, False: 1.90k] ------------------ 995| 3.81k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.81k, Folded] | Branch (995:25): [True: 1.92k, False: 1.89k] ------------------ 996| 1.92k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 1.03k, False: 886] ------------------ 997| 1.92k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 1.92k| if (Mutating) ------------------ | Branch (998:17): [True: 1.92k, Folded] ------------------ 999| 1.92k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 1.92k| return res; 1001| 1.92k| } else { 1002| 1.89k| using std::get; 1003| 1.89k| auto subs = 1004| 1.89k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 874, False: 1.01k] ------------------ 1005| 1.89k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.89k| auto next = get<1>(subs); 1007| 1.89k| auto ts = get<2>(subs); 1008| 1.89k| auto tail = get<3>(subs); 1009| 1.89k| IMMER_TRY { ------------------ | | 49| 1.89k|#define IMMER_TRY try ------------------ 1010| 1.89k| if (next) { ------------------ | Branch (1010:21): [True: 475, False: 1.41k] ------------------ 1011| 475| if (mutate) { ------------------ | Branch (1011:25): [True: 200, False: 275] ------------------ 1012| 200| node->inner()[idx] = next; 1013| 200| pos.each_right(dec_visitor{}, idx + 1); 1014| 200| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 275| } else { 1016| 275| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 275| newn->inner()[idx] = next; 1018| 275| if (Mutating) ------------------ | Branch (1018:29): [True: 275, Folded] ------------------ 1019| 275| pos.visit(dec_visitor{}); 1020| 275| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 275| } 1022| 1.41k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.41k] ------------------ 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.41k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.41k, Folded] | Branch (1026:40): [True: 811, False: 604] | Branch (1026:52): [True: 573, False: 238] ------------------ 1027| 573| auto newn = pos.node()->inner()[0]; 1028| 573| if (!mutate) ------------------ | Branch (1028:25): [True: 260, False: 313] ------------------ 1029| 260| newn->inc(); 1030| 573| if (Mutating) ------------------ | Branch (1030:25): [True: 573, Folded] ------------------ 1031| 573| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 573| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 842| } else { 1034| 842| if (mutate) { ------------------ | Branch (1034:25): [True: 361, False: 481] ------------------ 1035| 361| pos.each_right(dec_visitor{}, idx + 1); 1036| 361| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 481| } else { 1038| 481| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 481| if (Mutating) ------------------ | Branch (1039:29): [True: 481, Folded] ------------------ 1040| 481| pos.visit(dec_visitor{}); 1041| 481| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 481| } 1043| 842| } 1044| 1.89k| } 1045| 1.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| 1.89k| } 1055| 3.81k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 773| { 1060| 773| auto old_tail_size = pos.count(); 1061| 773| auto new_tail_size = pos.index(last) + 1; 1062| 773| auto node = pos.node(); 1063| 773| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 773, Folded] | Branch (1063:42): [True: 253, False: 520] ------------------ 1064| 773| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 200, False: 573] ------------------ 1065| 200| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 200] ------------------ 1066| 0| node->inc(); 1067| 200| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 573| } else if (mutate) { ------------------ | Branch (1068:20): [True: 253, False: 320] ------------------ 1069| 253| detail::destroy_n(node->leaf() + new_tail_size, 1070| 253| old_tail_size - new_tail_size); 1071| 253| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 320| } else { 1073| 320| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 320| if (Mutating) ------------------ | Branch (1074:17): [True: 320, Folded] ------------------ 1075| 320| pos.visit(dec_visitor{}); 1076| 320| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 320| } 1078| 773| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 943| { 1378| 943| auto node = pos.node(); 1379| 943| auto idx = pos.index(first); 1380| 943| auto count = pos.count(); 1381| 943| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 943| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 666, False: 277] ------------------ 1384| 943| if (mutate) { ------------------ | Branch (1384:13): [True: 666, False: 277] ------------------ 1385| 666| auto data = node->leaf(); 1386| 666| auto newcount = count - idx; 1387| 666| std::move(data + idx, data + count, data); 1388| 666| detail::destroy_n(data + newcount, idx); 1389| 666| return std::make_tuple(0, node); 1390| 666| } 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| 943| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 59.3k| { 1247| 59.3k| auto idx = pos.subindex(first); 1248| 59.3k| auto count = pos.count(); 1249| 59.3k| auto node = pos.node(); 1250| 59.3k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 59.3k, Folded] | Branch (1250:47): [True: 52.1k, False: 7.12k] ------------------ 1251| 59.3k| auto left_size = pos.size_before(idx); 1252| 59.3k| auto child_size = pos.size_sbh(idx, left_size); 1253| 59.3k| auto dropped_size = first; 1254| 59.3k| auto child_dropped_size = dropped_size - left_size; 1255| 59.3k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 59.3k, Folded] | Branch (1255:25): [True: 57.2k, False: 2.02k] | Branch (1255:45): [True: 4.81k, False: 52.4k] ------------------ 1256| 4.81k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 2.17k, False: 2.63k] ------------------ 1257| 4.81k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 4.81k| if (mutate) ------------------ | Branch (1258:17): [True: 2.17k, False: 2.63k] ------------------ 1259| 2.17k| pos.visit(dec_left_visitor{}, idx); 1260| 2.63k| else if (Mutating) ------------------ | Branch (1260:22): [True: 2.63k, Folded] ------------------ 1261| 2.63k| pos.visit(dec_visitor{}); 1262| 4.81k| return r; 1263| 54.4k| } else { 1264| 54.4k| using std::get; 1265| 54.4k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 50.0k, False: 4.48k] ------------------ 1266| 54.4k| : node_t::make_inner_r_e(e); 1267| 54.4k| auto newr = newn->relaxed(); 1268| 54.4k| auto newcount = count - idx; 1269| 54.4k| auto new_child_size = child_size - child_dropped_size; 1270| 54.4k| IMMER_TRY { ------------------ | | 49| 54.4k|#define IMMER_TRY try ------------------ 1271| 54.4k| auto subs = 1272| 54.4k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 50.0k, False: 4.48k] ------------------ 1273| 54.4k| : pos.towards_sub_oh( 1274| 4.48k| no_collapse_no_mut_t{}, first, idx, e); 1275| 54.4k| if (mutate) ------------------ | Branch (1275:21): [True: 50.0k, False: 4.48k] ------------------ 1276| 50.0k| pos.each_left(dec_visitor{}, idx); 1277| 54.4k| pos.copy_sizes( 1278| 54.4k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 54.4k| std::copy(node->inner() + idx + 1, 1280| 54.4k| node->inner() + count, 1281| 54.4k| newn->inner() + 1); 1282| 54.4k| newn->inner()[0] = get<1>(subs); 1283| 54.4k| newr->d.sizes[0] = new_child_size; 1284| 54.4k| newr->d.count = newcount; 1285| 54.4k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 54.4k, False: 0] ------------------ 1286| 54.4k| if (!mutate) { ------------------ | Branch (1286:21): [True: 4.48k, False: 50.0k] ------------------ 1287| 4.48k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 4.48k| if (Mutating) ------------------ | Branch (1288:25): [True: 4.48k, Folded] ------------------ 1289| 4.48k| pos.visit(dec_visitor{}); 1290| 4.48k| } 1291| 54.4k| return std::make_tuple(pos.shift(), newn); 1292| 54.4k| } 1293| 54.4k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 54.4k| } 1299| 59.3k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 2.17k| { 1247| 2.17k| auto idx = pos.subindex(first); 1248| 2.17k| auto count = pos.count(); 1249| 2.17k| auto node = pos.node(); 1250| 2.17k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.17k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.17k| auto left_size = pos.size_before(idx); 1252| 2.17k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.17k| auto dropped_size = first; 1254| 2.17k| auto child_dropped_size = dropped_size - left_size; 1255| 2.17k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.17k, Folded] | Branch (1255:25): [True: 978, False: 1.20k] | Branch (1255:45): [True: 721, False: 257] ------------------ 1256| 721| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 721] ------------------ 1257| 721| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 721| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 721] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 721| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 721] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 721| return r; 1263| 1.45k| } else { 1264| 1.45k| using std::get; 1265| 1.45k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.45k] ------------------ 1266| 1.45k| : node_t::make_inner_r_e(e); 1267| 1.45k| auto newr = newn->relaxed(); 1268| 1.45k| auto newcount = count - idx; 1269| 1.45k| auto new_child_size = child_size - child_dropped_size; 1270| 1.45k| IMMER_TRY { ------------------ | | 49| 1.45k|#define IMMER_TRY try ------------------ 1271| 1.45k| auto subs = 1272| 1.45k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.45k] ------------------ 1273| 1.45k| : pos.towards_sub_oh( 1274| 1.45k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.45k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.45k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.45k| pos.copy_sizes( 1278| 1.45k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.45k| std::copy(node->inner() + idx + 1, 1280| 1.45k| node->inner() + count, 1281| 1.45k| newn->inner() + 1); 1282| 1.45k| newn->inner()[0] = get<1>(subs); 1283| 1.45k| newr->d.sizes[0] = new_child_size; 1284| 1.45k| newr->d.count = newcount; 1285| 1.45k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.45k, False: 0] ------------------ 1286| 1.45k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.45k, False: 0] ------------------ 1287| 1.45k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.45k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.45k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.45k| } 1291| 1.45k| return std::make_tuple(pos.shift(), newn); 1292| 1.45k| } 1293| 1.45k| 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.45k| } 1299| 2.17k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.19k| { 1304| 2.19k| auto idx = pos.subindex(first); 1305| 2.19k| auto count = pos.count(); 1306| 2.19k| auto node = pos.node(); 1307| 2.19k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.19k] ------------------ 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): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.19k| auto left_size = pos.size_before(idx); 1313| 2.19k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.19k| auto dropped_size = first; 1315| 2.19k| auto child_dropped_size = dropped_size - left_size; 1316| 2.19k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.19k, Folded] | Branch (1316:25): [True: 964, False: 1.23k] | Branch (1316:45): [True: 575, False: 389] ------------------ 1317| 575| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 575] ------------------ 1318| 575| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 575| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 575] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 575| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 575] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 575| return r; 1324| 1.61k| } else { 1325| 1.61k| 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.61k| auto newcount = count - idx; 1330| 1.61k| auto newn = 1331| 1.61k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.61k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.61k| : node_t::make_inner_r_e(e); 1336| 1.61k| auto newr = newn->relaxed(); 1337| 1.61k| IMMER_TRY { ------------------ | | 49| 1.61k|#define IMMER_TRY try ------------------ 1338| 1.61k| auto subs = 1339| 1.61k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.61k] ------------------ 1340| 1.61k| : pos.towards_sub_oh( 1341| 1.61k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.61k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.61k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.61k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.61k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.61k, False: 0] ------------------ 1346| 1.61k| pos.copy_sizes( 1347| 1.61k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.61k| newr->d.count = newcount; 1349| 1.61k| newn->inner()[0] = get<1>(subs); 1350| 1.61k| std::copy(node->inner() + idx + 1, 1351| 1.61k| node->inner() + count, 1352| 1.61k| newn->inner() + 1); 1353| 1.61k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.61k, False: 0] ------------------ 1354| 1.61k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.61k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.61k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.61k| } 1358| 1.61k| return std::make_tuple(pos.shift(), newn); 1359| 1.61k| } 1360| 1.61k| 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.61k| } 1373| 2.19k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 493| { 1304| 493| auto idx = pos.subindex(first); 1305| 493| auto count = pos.count(); 1306| 493| auto node = pos.node(); 1307| 493| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 493] ------------------ 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): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 493| auto left_size = pos.size_before(idx); 1313| 493| auto child_size = pos.size_sbh(idx, left_size); 1314| 493| auto dropped_size = first; 1315| 493| auto child_dropped_size = dropped_size - left_size; 1316| 493| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 493, Folded] | Branch (1316:25): [True: 199, False: 294] | Branch (1316:45): [True: 0, False: 199] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 493| } else { 1325| 493| 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| 493| auto newcount = count - idx; 1330| 493| auto newn = 1331| 493| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 493] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 493| : node_t::make_inner_r_e(e); 1336| 493| auto newr = newn->relaxed(); 1337| 493| IMMER_TRY { ------------------ | | 49| 493|#define IMMER_TRY try ------------------ 1338| 493| auto subs = 1339| 493| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 493] ------------------ 1340| 493| : pos.towards_sub_oh( 1341| 493| no_collapse_no_mut_t{}, first, idx, e); 1342| 493| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 493] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 493| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 493| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 493, False: 0] ------------------ 1346| 493| pos.copy_sizes( 1347| 493| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 493| newr->d.count = newcount; 1349| 493| newn->inner()[0] = get<1>(subs); 1350| 493| std::copy(node->inner() + idx + 1, 1351| 493| node->inner() + count, 1352| 493| newn->inner() + 1); 1353| 493| if (!mutate) { ------------------ | Branch (1353:21): [True: 493, False: 0] ------------------ 1354| 493| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 493| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 493] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 493| } 1358| 493| return std::make_tuple(pos.shift(), newn); 1359| 493| } 1360| 493| 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| 493| } 1373| 493| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 8.05k| { 1378| 8.05k| auto node = pos.node(); 1379| 8.05k| auto idx = pos.index(first); 1380| 8.05k| auto count = pos.count(); 1381| 8.05k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 8.05k] ------------------ 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| 8.05k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 8.05k] ------------------ 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| 8.05k| } else { 1391| 8.05k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 8.05k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 8.05k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 8.05k| return std::make_tuple(0, newn); 1395| 8.05k| } 1396| 8.05k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.25k| { 1304| 2.25k| auto idx = pos.subindex(first); 1305| 2.25k| auto count = pos.count(); 1306| 2.25k| auto node = pos.node(); 1307| 2.25k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.25k] ------------------ 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): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.25k| auto left_size = pos.size_before(idx); 1313| 2.25k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.25k| auto dropped_size = first; 1315| 2.25k| auto child_dropped_size = dropped_size - left_size; 1316| 2.25k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.25k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 2.25k| } else { 1325| 2.25k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 2.25k| auto newcount = count - idx; 1330| 2.25k| auto newn = 1331| 2.25k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.25k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.25k| : node_t::make_inner_r_e(e); 1336| 2.25k| auto newr = newn->relaxed(); 1337| 2.25k| IMMER_TRY { ------------------ | | 49| 2.25k|#define IMMER_TRY try ------------------ 1338| 2.25k| auto subs = 1339| 2.25k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.25k] ------------------ 1340| 2.25k| : pos.towards_sub_oh( 1341| 2.25k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.25k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.25k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.25k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.25k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.25k, False: 0] ------------------ 1346| 2.25k| pos.copy_sizes( 1347| 2.25k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.25k| newr->d.count = newcount; 1349| 2.25k| newn->inner()[0] = get<1>(subs); 1350| 2.25k| std::copy(node->inner() + idx + 1, 1351| 2.25k| node->inner() + count, 1352| 2.25k| newn->inner() + 1); 1353| 2.25k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.25k, False: 0] ------------------ 1354| 2.25k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.25k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.25k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.25k| } 1358| 2.25k| return std::make_tuple(pos.shift(), newn); 1359| 2.25k| } 1360| 2.25k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 2.25k| } 1373| 2.25k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 4.53k| { 1378| 4.53k| auto node = pos.node(); 1379| 4.53k| auto idx = pos.index(first); 1380| 4.53k| auto count = pos.count(); 1381| 4.53k| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 4.53k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 2.00k, False: 2.53k] ------------------ 1384| 4.53k| if (mutate) { ------------------ | Branch (1384:13): [True: 2.00k, False: 2.53k] ------------------ 1385| 2.00k| auto data = node->leaf(); 1386| 2.00k| auto newcount = count - idx; 1387| 2.00k| std::move(data + idx, data + count, data); 1388| 2.00k| detail::destroy_n(data + newcount, idx); 1389| 2.00k| return std::make_tuple(0, node); 1390| 2.53k| } else { 1391| 2.53k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.53k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.53k, Folded] ------------------ 1393| 2.53k| pos.visit(dec_visitor{}); 1394| 2.53k| return std::make_tuple(0, newn); 1395| 2.53k| } 1396| 4.53k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.20k| { 1304| 2.20k| auto idx = pos.subindex(first); 1305| 2.20k| auto count = pos.count(); 1306| 2.20k| auto node = pos.node(); 1307| 2.20k| auto mutate = Mutating ------------------ | Branch (1307:23): [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| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.20k| auto left_size = pos.size_before(idx); 1313| 2.20k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.20k| auto dropped_size = first; 1315| 2.20k| auto child_dropped_size = dropped_size - left_size; 1316| 2.20k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.20k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [True: 0, Folded] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 2.20k| } else { 1325| 2.20k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 2.20k| auto newcount = count - idx; 1330| 2.20k| auto newn = 1331| 2.20k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.20k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.20k| : node_t::make_inner_r_e(e); 1336| 2.20k| auto newr = newn->relaxed(); 1337| 2.20k| IMMER_TRY { ------------------ | | 49| 2.20k|#define IMMER_TRY try ------------------ 1338| 2.20k| auto subs = 1339| 2.20k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.20k] ------------------ 1340| 2.20k| : pos.towards_sub_oh( 1341| 2.20k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.20k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.20k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.20k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.20k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.20k, False: 0] ------------------ 1346| 2.20k| pos.copy_sizes( 1347| 2.20k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.20k| newr->d.count = newcount; 1349| 2.20k| newn->inner()[0] = get<1>(subs); 1350| 2.20k| std::copy(node->inner() + idx + 1, 1351| 2.20k| node->inner() + count, 1352| 2.20k| newn->inner() + 1); 1353| 2.20k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.20k, False: 0] ------------------ 1354| 2.20k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.20k| if (Mutating) ------------------ | Branch (1355:25): [True: 2.20k, Folded] ------------------ 1356| 2.20k| pos.visit(dec_visitor{}); 1357| 2.20k| } 1358| 2.20k| return std::make_tuple(pos.shift(), newn); 1359| 2.20k| } 1360| 2.20k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 2.20k| } 1373| 2.20k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 47.1k| { 1378| 47.1k| auto node = pos.node(); 1379| 47.1k| auto idx = pos.index(first); 1380| 47.1k| auto count = pos.count(); 1381| 47.1k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 47.1k] ------------------ 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| 47.1k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 47.1k] ------------------ 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| 47.1k| } else { 1391| 47.1k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 47.1k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 47.1k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 47.1k| return std::make_tuple(0, newn); 1395| 47.1k| } 1396| 47.1k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.07k| { 1304| 2.07k| auto idx = pos.subindex(first); 1305| 2.07k| auto count = pos.count(); 1306| 2.07k| auto node = pos.node(); 1307| 2.07k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.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): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.07k| auto left_size = pos.size_before(idx); 1313| 2.07k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.07k| auto dropped_size = first; 1315| 2.07k| auto child_dropped_size = dropped_size - left_size; 1316| 2.07k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.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| 2.07k| } else { 1325| 2.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| 2.07k| auto newcount = count - idx; 1330| 2.07k| auto newn = 1331| 2.07k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.07k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.07k| : node_t::make_inner_r_e(e); 1336| 2.07k| auto newr = newn->relaxed(); 1337| 2.07k| IMMER_TRY { ------------------ | | 49| 2.07k|#define IMMER_TRY try ------------------ 1338| 2.07k| auto subs = 1339| 2.07k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.07k] ------------------ 1340| 2.07k| : pos.towards_sub_oh( 1341| 2.07k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.07k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.07k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.07k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.07k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.07k, False: 0] ------------------ 1346| 2.07k| pos.copy_sizes( 1347| 2.07k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.07k| newr->d.count = newcount; 1349| 2.07k| newn->inner()[0] = get<1>(subs); 1350| 2.07k| std::copy(node->inner() + idx + 1, 1351| 2.07k| node->inner() + count, 1352| 2.07k| newn->inner() + 1); 1353| 2.07k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.07k, False: 0] ------------------ 1354| 2.07k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.07k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.07k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.07k| } 1358| 2.07k| return std::make_tuple(pos.shift(), newn); 1359| 2.07k| } 1360| 2.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| 2.07k| } 1373| 2.07k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 1198| 2.17k| { 1199| 2.17k| using node_t = node_type; 1200| 2.17k| auto node = p.node(); 1201| 2.17k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 2.17k, False: 0] ------------------ 1202| 2.17k| p.each_left(dec_t{}, idx); 1203| 2.17k| node_t::delete_inner_r(node, p.count()); 1204| 2.17k| } 1205| 2.17k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 203k| { 1247| 203k| auto idx = pos.subindex(first); 1248| 203k| auto count = pos.count(); 1249| 203k| auto node = pos.node(); 1250| 203k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 203k, Folded] | Branch (1250:47): [True: 159k, False: 43.2k] ------------------ 1251| 203k| auto left_size = pos.size_before(idx); 1252| 203k| auto child_size = pos.size_sbh(idx, left_size); 1253| 203k| auto dropped_size = first; 1254| 203k| auto child_dropped_size = dropped_size - left_size; 1255| 203k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 203k] | 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| 203k| } else { 1264| 203k| using std::get; 1265| 203k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 159k, False: 43.2k] ------------------ 1266| 203k| : node_t::make_inner_r_e(e); 1267| 203k| auto newr = newn->relaxed(); 1268| 203k| auto newcount = count - idx; 1269| 203k| auto new_child_size = child_size - child_dropped_size; 1270| 203k| IMMER_TRY { ------------------ | | 49| 203k|#define IMMER_TRY try ------------------ 1271| 203k| auto subs = 1272| 203k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 159k, False: 43.2k] ------------------ 1273| 203k| : pos.towards_sub_oh( 1274| 43.2k| no_collapse_no_mut_t{}, first, idx, e); 1275| 203k| if (mutate) ------------------ | Branch (1275:21): [True: 159k, False: 43.2k] ------------------ 1276| 159k| pos.each_left(dec_visitor{}, idx); 1277| 203k| pos.copy_sizes( 1278| 203k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 203k| std::copy(node->inner() + idx + 1, 1280| 203k| node->inner() + count, 1281| 203k| newn->inner() + 1); 1282| 203k| newn->inner()[0] = get<1>(subs); 1283| 203k| newr->d.sizes[0] = new_child_size; 1284| 203k| newr->d.count = newcount; 1285| 203k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 203k, False: 0] ------------------ 1286| 203k| if (!mutate) { ------------------ | Branch (1286:21): [True: 43.2k, False: 159k] ------------------ 1287| 43.2k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 43.2k| if (Mutating) ------------------ | Branch (1288:25): [True: 43.2k, Folded] ------------------ 1289| 43.2k| pos.visit(dec_visitor{}); 1290| 43.2k| } 1291| 203k| return std::make_tuple(pos.shift(), newn); 1292| 203k| } 1293| 203k| 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| 203k| } 1299| 203k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 47.7k| { 1247| 47.7k| auto idx = pos.subindex(first); 1248| 47.7k| auto count = pos.count(); 1249| 47.7k| auto node = pos.node(); 1250| 47.7k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 47.7k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 47.7k| auto left_size = pos.size_before(idx); 1252| 47.7k| auto child_size = pos.size_sbh(idx, left_size); 1253| 47.7k| auto dropped_size = first; 1254| 47.7k| auto child_dropped_size = dropped_size - left_size; 1255| 47.7k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 47.7k] | 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| 47.7k| } else { 1264| 47.7k| using std::get; 1265| 47.7k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 47.7k] ------------------ 1266| 47.7k| : node_t::make_inner_r_e(e); 1267| 47.7k| auto newr = newn->relaxed(); 1268| 47.7k| auto newcount = count - idx; 1269| 47.7k| auto new_child_size = child_size - child_dropped_size; 1270| 47.7k| IMMER_TRY { ------------------ | | 49| 47.7k|#define IMMER_TRY try ------------------ 1271| 47.7k| auto subs = 1272| 47.7k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 47.7k] ------------------ 1273| 47.7k| : pos.towards_sub_oh( 1274| 47.7k| no_collapse_no_mut_t{}, first, idx, e); 1275| 47.7k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 47.7k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 47.7k| pos.copy_sizes( 1278| 47.7k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 47.7k| std::copy(node->inner() + idx + 1, 1280| 47.7k| node->inner() + count, 1281| 47.7k| newn->inner() + 1); 1282| 47.7k| newn->inner()[0] = get<1>(subs); 1283| 47.7k| newr->d.sizes[0] = new_child_size; 1284| 47.7k| newr->d.count = newcount; 1285| 47.7k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 47.7k, False: 0] ------------------ 1286| 47.7k| if (!mutate) { ------------------ | Branch (1286:21): [True: 47.7k, False: 0] ------------------ 1287| 47.7k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 47.7k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 47.7k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 47.7k| } 1291| 47.7k| return std::make_tuple(pos.shift(), newn); 1292| 47.7k| } 1293| 47.7k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 47.7k| } 1299| 47.7k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.60k| { 1304| 2.60k| auto idx = pos.subindex(first); 1305| 2.60k| auto count = pos.count(); 1306| 2.60k| auto node = pos.node(); 1307| 2.60k| 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| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.60k| auto left_size = pos.size_before(idx); 1313| 2.60k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.60k| auto dropped_size = first; 1315| 2.60k| auto child_dropped_size = dropped_size - left_size; 1316| 2.60k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.60k, Folded] | Branch (1316:25): [True: 1.60k, False: 998] | Branch (1316:45): [True: 934, False: 669] ------------------ 1317| 934| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 934] ------------------ 1318| 934| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 934| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 934] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 934| else if (Mutating) ------------------ | Branch (1321:22): [True: 934, Folded] ------------------ 1322| 934| pos.visit(dec_visitor{}); 1323| 934| return r; 1324| 1.66k| } else { 1325| 1.66k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.66k| auto newcount = count - idx; 1330| 1.66k| auto newn = 1331| 1.66k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.66k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.66k| : node_t::make_inner_r_e(e); 1336| 1.66k| auto newr = newn->relaxed(); 1337| 1.66k| IMMER_TRY { ------------------ | | 49| 1.66k|#define IMMER_TRY try ------------------ 1338| 1.66k| auto subs = 1339| 1.66k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.66k] ------------------ 1340| 1.66k| : pos.towards_sub_oh( 1341| 1.66k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.66k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.66k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.66k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.66k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.66k, False: 0] ------------------ 1346| 1.66k| pos.copy_sizes( 1347| 1.66k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.66k| newr->d.count = newcount; 1349| 1.66k| newn->inner()[0] = get<1>(subs); 1350| 1.66k| std::copy(node->inner() + idx + 1, 1351| 1.66k| node->inner() + count, 1352| 1.66k| newn->inner() + 1); 1353| 1.66k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.66k, False: 0] ------------------ 1354| 1.66k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.66k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.66k, Folded] ------------------ 1356| 1.66k| pos.visit(dec_visitor{}); 1357| 1.66k| } 1358| 1.66k| return std::make_tuple(pos.shift(), newn); 1359| 1.66k| } 1360| 1.66k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.66k| } 1373| 2.60k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 12.5k| { 350| 12.5k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 12.5k, False: 0] ------------------ 351| 12.5k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 11.7k, False: 861] ------------------ 352| 12.5k| ? visit_maybe_relaxed_sub(rootl, 353| 11.7k| shiftl, 354| 11.7k| sizel, 355| 11.7k| this_t{}, 356| 11.7k| posr, 357| 11.7k| first, 358| 11.7k| size_t{}) 359| 12.5k| : posr.first_sub_inner( 360| 861| rrb{}, first, rootl, shiftl, sizel); 361| 12.5k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 33.0k| { 383| 33.0k| auto nl = posl.node(); 384| 33.0k| auto nr = posr.node(); 385| 33.0k| if (nl == nr) ------------------ | Branch (385:13): [True: 10.4k, False: 22.6k] ------------------ 386| 10.4k| return true; 387| 22.6k| auto cl = posl.count(); 388| 22.6k| auto cr = posr.count(); 389| 22.6k| assert(cr > 0); ------------------ | Branch (389:9): [True: 22.6k, False: 0] ------------------ 390| 22.6k| auto sbr = size_t{}; 391| 22.6k| auto i = count_t{}; 392| 22.6k| auto j = count_t{}; 393| 124k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 110k, False: 13.2k] ------------------ 394| 110k| auto sbl = posl.size_before(i); 395| 197k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 178k, False: 19.5k] | Branch (395:34): [True: 86.7k, False: 91.3k] ------------------ 396| 86.7k| ; 397| 110k| auto res = 398| 110k| sbl == sbr ------------------ | Branch (398:17): [True: 54.6k, False: 56.2k] ------------------ 399| 110k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 110k| : posl.nth_sub(i, 401| 56.2k| for_each_chunk_p_visitor{}, 402| 56.2k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 110k| if (!res) ------------------ | Branch (403:17): [True: 9.35k, False: 101k] ------------------ 404| 9.35k| return false; 405| 110k| } 406| 13.2k| return true; 407| 22.6k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 26.0k| { 337| 26.0k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 26.0k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 26.6k| { 428| 26.6k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 16.8k, False: 9.81k] ------------------ 429| 16.8k| return true; 430| 9.81k| auto cl = posl.count(); 431| 9.81k| auto cr = posr.count(); 432| 9.81k| auto mp = std::min(cl, cr); 433| 9.81k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 8.45k, False: 1.36k] ------------------ 434| 9.81k| posl.node()->leaf() + mp, 435| 9.81k| posr.node()->leaf()) && 436| 8.45k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 8.02k, False: 439] ------------------ 437| 8.45k| posl.node()->leaf() + posl.count(), 438| 8.45k| first + (idx + mp)); 439| 26.6k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 24.3k| { 330| 24.3k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 24.3k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIX12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 412| 4.13k| { 413| 4.13k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.13k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 4.13k| { 383| 4.13k| auto nl = posl.node(); 384| 4.13k| auto nr = posr.node(); 385| 4.13k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.13k] ------------------ 386| 0| return true; 387| 4.13k| auto cl = posl.count(); 388| 4.13k| auto cr = posr.count(); 389| 4.13k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.13k, False: 0] ------------------ 390| 4.13k| auto sbr = size_t{}; 391| 4.13k| auto i = count_t{}; 392| 4.13k| auto j = count_t{}; 393| 15.0k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 13.0k, False: 1.99k] ------------------ 394| 13.0k| auto sbl = posl.size_before(i); 395| 22.1k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 18.4k, False: 3.69k] | Branch (395:34): [True: 9.01k, False: 9.38k] ------------------ 396| 9.01k| ; 397| 13.0k| auto res = 398| 13.0k| sbl == sbr ------------------ | Branch (398:17): [True: 7.97k, False: 5.10k] ------------------ 399| 13.0k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 13.0k| : posl.nth_sub(i, 401| 5.10k| for_each_chunk_p_visitor{}, 402| 5.10k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 13.0k| if (!res) ------------------ | Branch (403:17): [True: 2.14k, False: 10.9k] ------------------ 404| 2.14k| return false; 405| 13.0k| } 406| 1.99k| return true; 407| 4.13k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 5.21k| { 337| 5.21k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 5.21k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_12leaf_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 12.4k| { 428| 12.4k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 7.78k, False: 4.63k] ------------------ 429| 7.78k| return true; 430| 4.63k| auto cl = posl.count(); 431| 4.63k| auto cr = posr.count(); 432| 4.63k| auto mp = std::min(cl, cr); 433| 4.63k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 4.30k, False: 333] ------------------ 434| 4.63k| posl.node()->leaf() + mp, 435| 4.63k| posr.node()->leaf()) && 436| 4.30k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 4.01k, False: 288] ------------------ 437| 4.30k| posl.node()->leaf() + posl.count(), 438| 4.30k| first + (idx + mp)); 439| 12.4k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 1.94k| { 330| 1.94k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 1.94k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIX12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 412| 2.23k| { 413| 2.23k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.23k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 2.23k| { 383| 2.23k| auto nl = posl.node(); 384| 2.23k| auto nr = posr.node(); 385| 2.23k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.23k] ------------------ 386| 0| return true; 387| 2.23k| auto cl = posl.count(); 388| 2.23k| auto cr = posr.count(); 389| 2.23k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.23k, False: 0] ------------------ 390| 2.23k| auto sbr = size_t{}; 391| 2.23k| auto i = count_t{}; 392| 2.23k| auto j = count_t{}; 393| 17.1k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 15.5k, False: 1.63k] ------------------ 394| 15.5k| auto sbl = posl.size_before(i); 395| 27.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 24.0k, False: 3.71k] | Branch (395:34): [True: 12.2k, False: 11.8k] ------------------ 396| 12.2k| ; 397| 15.5k| auto res = 398| 15.5k| sbl == sbr ------------------ | Branch (398:17): [True: 9.33k, False: 6.22k] ------------------ 399| 15.5k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 15.5k| : posl.nth_sub(i, 401| 6.22k| for_each_chunk_p_visitor{}, 402| 6.22k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 15.5k| if (!res) ------------------ | Branch (403:17): [True: 596, False: 14.9k] ------------------ 404| 596| return false; 405| 15.5k| } 406| 1.63k| return true; 407| 2.23k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 7.85k| { 337| 7.85k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 7.85k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 606| { 330| 606| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 606| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 873| { 330| 873| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 873| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 419| 1.69k| { 420| 1.69k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.69k, False: 0] ------------------ 421| 1.69k| ? this_t::visit_regular(posl, posr.node()) 422| 1.69k| : this_t::visit_regular(posr, posl.node()); 423| 1.69k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 14.2k| { 444| 14.2k| auto node = pos.node(); 445| 14.2k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 9.55k, False: 4.67k] | Branch (445:33): [True: 2.75k, False: 1.92k] ------------------ 446| 14.2k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 29.6k| { 451| 29.6k| auto node = pos.node(); 452| 29.6k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 19.5k, False: 10.0k] | Branch (452:33): [True: 7.43k, False: 2.60k] ------------------ 453| 10.0k| node->leaf() + pos.count(), 454| 10.0k| other->leaf()); 455| 29.6k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 12.5k| { 444| 12.5k| auto node = pos.node(); 445| 12.5k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 7.07k, False: 5.51k] | Branch (445:33): [True: 2.21k, False: 3.30k] ------------------ 446| 12.5k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 2.88k| { 451| 2.88k| auto node = pos.node(); 452| 2.88k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.42k, False: 1.46k] | Branch (452:33): [True: 504, False: 961] ------------------ 453| 1.46k| node->leaf() + pos.count(), 454| 1.46k| other->leaf()); 455| 2.88k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 3.04k| { 444| 3.04k| auto node = pos.node(); 445| 3.04k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 289, False: 2.75k] | Branch (445:33): [True: 1.38k, False: 1.36k] ------------------ 446| 3.04k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 284k| { 113| 284k| auto data = as_const(pos.node()->leaf()); 114| 284k| return fn(data, data + pos.count()); 115| 284k| } _ZZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_ENUlSE_T0_E_clIPKiSK_EEDaSE_SG_: 367| 1.20M| return [iter](auto f, auto e) mutable { 368| 1.20M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 86.7k, False: 1.11M] ------------------ 369| 86.7k| iter += e - f; 370| 86.7k| return true; 371| 86.7k| } 372| 9.59M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 8.48M, False: 1.11M] ------------------ 373| 8.48M| if (*f != *iter) ------------------ | Branch (373:21): [True: 5.06k, False: 8.47M] ------------------ 374| 5.06k| return false; 375| 1.11M| return true; 376| 1.11M| }; _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 4.41M| { 54| 4.41M| return pos.towards(this_t{}, idx); 55| 4.41M| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 958k| { 60| 958k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 958k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 318k| { 54| 318k| return pos.towards(this_t{}, idx); 55| 318k| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 299k| { 60| 299k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 299k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 348k| { 54| 348k| return pos.towards(this_t{}, idx); 55| 348k| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 18.7k| { 60| 18.7k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 18.7k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 37.3k| { 54| 37.3k| return pos.towards(this_t{}, idx); 55| 37.3k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 27.1k| { 107| 27.1k| return pos.each_pred(this_t{}, fn); 108| 27.1k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 819| { 330| 819| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 819| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSM_OT1_m: 419| 9.92k| { 420| 9.92k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 9.92k, False: 0] ------------------ 421| 9.92k| ? this_t::visit_regular(posl, posr.node()) 422| 9.92k| : this_t::visit_regular(posr, posl.node()); 423| 9.92k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 908k| { 113| 908k| auto data = as_const(pos.node()->leaf()); 114| 908k| return fn(data, data + pos.count()); 115| 908k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 15.0k| { 107| 15.0k| return pos.each_pred(this_t{}, fn); 108| 15.0k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 12.5k| { 113| 12.5k| auto data = as_const(pos.node()->leaf()); 114| 12.5k| return fn(data, data + pos.count()); 115| 12.5k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 4.76k| { 107| 4.76k| return pos.each_pred(this_t{}, fn); 108| 4.76k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 4.86k| { 330| 4.86k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 4.86k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 3.73k| { 383| 3.73k| auto nl = posl.node(); 384| 3.73k| auto nr = posr.node(); 385| 3.73k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 3.73k] ------------------ 386| 0| return true; 387| 3.73k| auto cl = posl.count(); 388| 3.73k| auto cr = posr.count(); 389| 3.73k| assert(cr > 0); ------------------ | Branch (389:9): [True: 3.73k, False: 0] ------------------ 390| 3.73k| auto sbr = size_t{}; 391| 3.73k| auto i = count_t{}; 392| 3.73k| auto j = count_t{}; 393| 15.3k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 13.5k, False: 1.85k] ------------------ 394| 13.5k| auto sbl = posl.size_before(i); 395| 21.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 18.9k, False: 2.80k] | Branch (395:34): [True: 8.29k, False: 10.6k] ------------------ 396| 8.29k| ; 397| 13.5k| auto res = 398| 13.5k| sbl == sbr ------------------ | Branch (398:17): [True: 7.84k, False: 5.65k] ------------------ 399| 13.5k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 13.5k| : posl.nth_sub(i, 401| 5.65k| for_each_chunk_p_visitor{}, 402| 5.65k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 13.5k| if (!res) ------------------ | Branch (403:17): [True: 1.88k, False: 11.6k] ------------------ 404| 1.88k| return false; 405| 13.5k| } 406| 1.85k| return true; 407| 3.73k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 11.7k| { 337| 11.7k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 11.7k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_13full_leaf_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 11.7k| { 428| 11.7k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 8.93k, False: 2.82k] ------------------ 429| 8.93k| return true; 430| 2.82k| auto cl = posl.count(); 431| 2.82k| auto cr = posr.count(); 432| 2.82k| auto mp = std::min(cl, cr); 433| 2.82k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 2.52k, False: 299] ------------------ 434| 2.82k| posl.node()->leaf() + mp, 435| 2.82k| posr.node()->leaf()) && 436| 2.52k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.52k, False: 0] ------------------ 437| 2.52k| posl.node()->leaf() + posl.count(), 438| 2.52k| first + (idx + mp)); 439| 11.7k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 4.72k| { 330| 4.72k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 4.72k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 2.05k| { 383| 2.05k| auto nl = posl.node(); 384| 2.05k| auto nr = posr.node(); 385| 2.05k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.05k] ------------------ 386| 0| return true; 387| 2.05k| auto cl = posl.count(); 388| 2.05k| auto cr = posr.count(); 389| 2.05k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.05k, False: 0] ------------------ 390| 2.05k| auto sbr = size_t{}; 391| 2.05k| auto i = count_t{}; 392| 2.05k| auto j = count_t{}; 393| 15.7k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 14.3k, False: 1.37k] ------------------ 394| 14.3k| auto sbl = posl.size_before(i); 395| 26.0k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 25.0k, False: 1.05k] | Branch (395:34): [True: 11.6k, False: 13.3k] ------------------ 396| 11.6k| ; 397| 14.3k| auto res = 398| 14.3k| sbl == sbr ------------------ | Branch (398:17): [True: 9.17k, False: 5.22k] ------------------ 399| 14.3k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 14.3k| : posl.nth_sub(i, 401| 5.22k| for_each_chunk_p_visitor{}, 402| 5.22k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 14.3k| if (!res) ------------------ | Branch (403:17): [True: 684, False: 13.7k] ------------------ 404| 684| return false; 405| 14.3k| } 406| 1.37k| return true; 407| 2.05k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 419| 2.66k| { 420| 2.66k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 2.66k, False: 0] ------------------ 421| 2.66k| ? this_t::visit_regular(posl, posr.node()) 422| 2.66k| : this_t::visit_regular(posr, posl.node()); 423| 2.66k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 136k| { 107| 136k| return pos.each_pred(this_t{}, fn); 108| 136k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 366| 78.4k| { 367| 78.4k| return [iter](auto f, auto e) mutable { 368| 78.4k| if (f == &*iter) { 369| 78.4k| iter += e - f; 370| 78.4k| return true; 371| 78.4k| } 372| 78.4k| for (; f != e; ++f, ++iter) 373| 78.4k| if (*f != *iter) 374| 78.4k| return false; 375| 78.4k| return true; 376| 78.4k| }; 377| 78.4k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 1.12k| { 350| 1.12k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 1.12k, False: 0] ------------------ 351| 1.12k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 861, False: 261] ------------------ 352| 1.12k| ? visit_maybe_relaxed_sub(rootl, 353| 861| shiftl, 354| 861| sizel, 355| 861| this_t{}, 356| 861| posr, 357| 861| first, 358| 861| size_t{}) 359| 1.12k| : posr.first_sub_inner( 360| 261| rrb{}, first, rootl, shiftl, sizel); 361| 1.12k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 8.79k| { 350| 8.79k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 8.79k, False: 0] ------------------ 351| 8.79k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 8.79k, False: 0] ------------------ 352| 8.79k| ? visit_maybe_relaxed_sub(rootl, 353| 8.79k| shiftl, 354| 8.79k| sizel, 355| 8.79k| this_t{}, 356| 8.79k| posr, 357| 8.79k| first, 358| 8.79k| size_t{}) 359| 8.79k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 8.79k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 6.54k| { 451| 6.54k| auto node = pos.node(); 452| 6.54k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.78k, False: 4.76k] | Branch (452:33): [True: 1.99k, False: 2.76k] ------------------ 453| 4.76k| node->leaf() + pos.count(), 454| 4.76k| other->leaf()); 455| 6.54k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_11dec_visitorEJEEEDcPT_jmT0_DpOT1_: 1838| 158M|{ 1839| 158M| assert(node); ------------------ | Branch (1839:5): [True: 158M, False: 0] ------------------ 1840| 158M| auto relaxed = node->relaxed(); 1841| 158M| if (relaxed) { ------------------ | Branch (1841:9): [True: 144M, False: 14.2M] ------------------ 1842| 144M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 144M, False: 0] ------------------ 1843| 144M| return make_relaxed_pos(node, shift, relaxed) 1844| 144M| .visit(v, std::forward(args)...); 1845| 144M| } else { 1846| 14.2M| return make_regular_sub_pos(node, shift, size) 1847| 14.2M| .visit(v, std::forward(args)...); 1848| 14.2M| } 1849| 158M|} _ZN5immer6detail4rbts16make_relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11relaxed_posIT_EEPSE_jPNSE_9relaxed_tE: 1828| 407M|{ 1829| 407M| assert(node); ------------------ | Branch (1829:5): [True: 407M, False: 0] ------------------ 1830| 407M| assert(relaxed); ------------------ | Branch (1830:5): [True: 407M, False: 0] ------------------ 1831| 407M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 407M, False: 0] ------------------ 1832| 407M| return {node, shift, relaxed}; 1833| 407M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 164M| { 1814| 164M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 164M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1431| 275M| node_t* node() const { return node_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 1476| 32.9M| { 1477| 32.9M| each_left(v, relaxed_->d.count, args...); 1478| 32.9M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 33.1M| { 1624| 33.1M| auto p = node_->inner(); 1625| 33.1M| auto s = size_t{}; 1626| 33.1M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 7.22M, False: 25.9M] ------------------ 1627| 58.8M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 51.6M, False: 7.22M] ------------------ 1628| 51.6M| IMMER_PREFETCH(p + i + 1); 1629| 51.6M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 51.6M| .visit(v, args...); 1631| 51.6M| s = relaxed_->d.sizes[i]; 1632| 51.6M| assert(s); ------------------ | Branch (1632:17): [True: 51.6M, False: 0] ------------------ 1633| 51.6M| } 1634| 25.9M| } else { 1635| 25.9M| auto ss = shift_ - B; 1636| 182M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 156M, False: 25.9M] ------------------ 1637| 156M| visit_maybe_relaxed_sub( 1638| 156M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 156M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 156M, False: 0] ------------------ 1641| 156M| } 1642| 25.9M| } 1643| 33.1M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1430| 250M| 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_policyELb1ELb1EEELj3ELj3EEEEENS1_15regular_sub_posIT_EEPSE_jm: 1044| 24.7M|{ 1045| 24.7M| assert(node); ------------------ | Branch (1045:5): [True: 24.7M, False: 0] ------------------ 1046| 24.7M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 24.7M, False: 0] ------------------ 1047| 24.7M| assert(size > 0); ------------------ | Branch (1047:5): [True: 24.7M, False: 0] ------------------ 1048| 24.7M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 24.7M, False: 0] ------------------ 1049| 24.7M| return {node, shift, size}; 1050| 24.7M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1036| 14.2M| { 1037| 14.2M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 14.2M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 785| 24.6M| node_t* node() const { return node_; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 825| 451k| { 826| 451k| return each_regular(*this, v, args...); 827| 451k| } _ZN5immer6detail4rbts12each_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_DpOT1_: 343| 451k|{ 344| 451k| constexpr auto B = bits; 345| 451k| constexpr auto BL = bits_leaf; 346| 451k| auto n = p.node()->inner(); 347| 451k| auto last = p.count() - 1; 348| 451k| auto e = n + last; 349| 451k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 89.8k, False: 361k] ------------------ 350| 229k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 139k, False: 89.8k] ------------------ 351| 139k| IMMER_PREFETCH(n + 1); 352| 139k| make_full_leaf_pos(*n).visit(v, args...); 353| 139k| } 354| 89.8k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 361k| } else { 356| 361k| auto ss = p.shift() - B; 357| 1.35M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 993k, False: 361k] ------------------ 358| 993k| make_full_pos(*n, ss).visit(v, args...); 359| 361k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 361k| } 361| 451k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 787| 9.72M| 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_policyELb1ELb1EEELj3ELj3EEEEENS1_13full_leaf_posIT_EEPSE_: 214| 13.4M|{ 215| 13.4M| assert(node); ------------------ | Branch (215:5): [True: 13.4M, False: 0] ------------------ 216| 13.4M| return {node}; 217| 13.4M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 1.76M| { 208| 1.76M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.76M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 199| 8.15M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 198| 12.2M| count_t count() const { return branches; } _ZN5immer6detail4rbts13make_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_8leaf_posIT_EEPSE_m: 119| 1.53M|{ 120| 1.53M| assert(node); ------------------ | Branch (120:5): [True: 1.53M, False: 0] ------------------ 121| 1.53M| assert(size > 0); ------------------ | Branch (121:5): [True: 1.53M, False: 0] ------------------ 122| 1.53M| return {node, size}; 123| 1.53M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 786| 7.09M| size_t size() const { return size_; } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 112| 411k| { 113| 411k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 411k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 104| 1.53M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 103| 2.21M| 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_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 107| 2.28M| 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_policyELb1ELb1EEELj3ELj3EEEEENS1_8full_posIT_EEPSE_j: 1412| 4.56M|{ 1413| 4.56M| assert(node); ------------------ | Branch (1413:5): [True: 4.56M, False: 0] ------------------ 1414| 4.56M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 4.56M, False: 0] ------------------ 1415| 4.56M| return {node, shift}; 1416| 4.56M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 3.03M| { 1406| 3.03M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.03M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1159| 3.63M| node_t* node() const { return node_; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 1185| 97.9k| { 1186| 97.9k| auto p = node_->inner(); 1187| 97.9k| auto e = p + branches; 1188| 97.9k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 85.6k, False: 12.3k] ------------------ 1189| 770k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 684k, False: 85.6k] ------------------ 1190| 684k| IMMER_PREFETCH(p + 1); 1191| 684k| make_full_leaf_pos(*p).visit(v, args...); 1192| 684k| } 1193| 85.6k| } else { 1194| 12.3k| auto ss = shift_ - B; 1195| 111k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 98.8k, False: 12.3k] ------------------ 1196| 98.8k| make_full_pos(*p, ss).visit(v, args...); 1197| 12.3k| } 1198| 97.9k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1158| 1.21M| count_t count() const { return branches; } _ZN5immer6detail4rbts16make_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11regular_posIT_EEPSE_jm: 690| 2.92M|{ 691| 2.92M| assert(node); ------------------ | Branch (691:5): [True: 2.92M, False: 0] ------------------ 692| 2.92M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 2.92M, False: 0] ------------------ 693| 2.92M| assert(size > 0); ------------------ | Branch (693:5): [True: 2.92M, False: 0] ------------------ 694| 2.92M| return {node, shift, size}; 695| 2.92M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 962k| { 337| 962k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 962k| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 231| 5.12M| node_t* node() const { return node_; } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 243| 909k| { 244| 909k| return each_regular(*this, v, args...); 245| 909k| } _ZN5immer6detail4rbts12each_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_DpOT1_: 343| 909k|{ 344| 909k| constexpr auto B = bits; 345| 909k| constexpr auto BL = bits_leaf; 346| 909k| auto n = p.node()->inner(); 347| 909k| auto last = p.count() - 1; 348| 909k| auto e = n + last; 349| 909k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 317k, False: 591k] ------------------ 350| 1.23M| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 919k, False: 317k] ------------------ 351| 919k| IMMER_PREFETCH(n + 1); 352| 919k| make_full_leaf_pos(*n).visit(v, args...); 353| 919k| } 354| 317k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 591k| } else { 356| 591k| auto ss = p.shift() - B; 357| 2.52M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 1.92M, False: 591k] ------------------ 358| 1.92M| make_full_pos(*n, ss).visit(v, args...); 359| 591k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 591k| } 361| 909k|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 233| 4.76M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 232| 7.90M| size_t size() const { return size_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 230| 3.20M| 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_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 234| 7.13M| 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_policyELb1ELb1EEELj3ELj3EEEE5countEv: 784| 18.6M| 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_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 789| 21.9M| 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_policyELb1ELb1EEELj3ELj3EEEEENS1_17empty_regular_posIT_EEPSE_: 64| 1.50M|{ 65| 1.50M| return {node}; 66| 1.50M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 1.50M| { 58| 1.50M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 1.50M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 41| 1.50M| 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_policyELb1ELb1EEELj3ELj3EEEEENS1_12leaf_sub_posIT_EEPSE_j: 151| 76.3M|{ 152| 76.3M| assert(node); ------------------ | Branch (152:5): [True: 76.3M, False: 0] ------------------ 153| 76.3M| assert(count <= branches); ------------------ | Branch (153:5): [True: 76.3M, False: 0] ------------------ 154| 76.3M| return {node, count}; 155| 76.3M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 56.8M| { 145| 56.8M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 56.8M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 136| 68.6M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 135| 20.4M| 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_policyELb1ELb1EEELj3ELj3EEEEENS1_14empty_leaf_posIT_EEPSE_: 88| 1.36M|{ 89| 1.36M| assert(node); ------------------ | Branch (89:5): [True: 1.36M, False: 0] ------------------ 90| 1.36M| return {node}; 91| 1.36M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 1.36M| { 82| 1.36M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 1.36M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 75| 1.36M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 74| 7.72k| count_t count() const { return 0; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_DpOT0_: 1813| 187k| { 1814| 187k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 187k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1433| 25.8M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEj: 1443| 12.3M| { 1444| 12.3M| return size_sbh(offset, size_before(offset)); 1445| 12.3M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1448| 12.7M| { 1449| 12.7M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 12.7M, False: 0] ------------------ 1450| 12.7M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 12.7M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 1438| 45.7M| { 1439| 45.7M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 30.0M, False: 15.7M] ------------------ 1440| 45.7M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11last_oh_cshINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_jmDpOT0_: 1737| 173k| { 1738| 173k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 173k, False: 0] ------------------ 1739| 173k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 173k, False: 0] ------------------ 1740| 173k| auto child = node_->inner()[offset_hint]; 1741| 173k| auto is_leaf = shift_ == BL; 1742| 173k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 173k] ------------------ 1743| 173k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 173k| : visit_maybe_relaxed_sub( 1745| 173k| child, shift_ - B, child_size_hint, v, args...); 1746| 173k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcPT_jmT0_DpOT1_: 1838| 173k|{ 1839| 173k| assert(node); ------------------ | Branch (1839:5): [True: 173k, False: 0] ------------------ 1840| 173k| auto relaxed = node->relaxed(); 1841| 173k| if (relaxed) { ------------------ | Branch (1841:9): [True: 134k, False: 39.2k] ------------------ 1842| 134k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 134k, False: 0] ------------------ 1843| 134k| return make_relaxed_pos(node, shift, relaxed) 1844| 134k| .visit(v, std::forward(args)...); 1845| 134k| } else { 1846| 39.2k| return make_regular_sub_pos(node, shift, size) 1847| 39.2k| .visit(v, std::forward(args)...); 1848| 39.2k| } 1849| 173k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_DpOT0_: 1036| 39.2k| { 1037| 39.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 39.2k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 788| 2.21M| 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_policyELb1ELb1EEELj3ELj3EEEE7last_ohINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_jDpOT0_: 952| 323k| { 953| 323k| return last_oh_regular(*this, v, offset_hint, args...); 954| 323k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_: 677| 323k|{ 678| 323k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 323k, False: 0] ------------------ 679| 323k| constexpr auto B = bits; 680| 323k| constexpr auto BL = bits_leaf; 681| 323k| auto child = p.node()->inner()[offset_hint]; 682| 323k| auto is_leaf = p.shift() == BL; 683| 323k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 323k] ------------------ 684| 323k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 323k| .visit(v, args...); 686| 323k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 336| 866k| { 337| 866k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 866k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7last_ohINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_jDpOT0_: 330| 542k| { 331| 542k| return last_oh_regular(*this, v, offset_hint, args...); 332| 542k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_: 677| 542k|{ 678| 542k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 542k, False: 0] ------------------ 679| 542k| constexpr auto B = bits; 680| 542k| constexpr auto BL = bits_leaf; 681| 542k| auto child = p.node()->inner()[offset_hint]; 682| 542k| auto is_leaf = p.shift() == BL; 683| 542k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 542k] ------------------ 684| 542k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 542k| .visit(v, args...); 686| 542k|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1432| 108M| 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_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 1036| 315k| { 1037| 315k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 315k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_DpOT0_: 144| 68.9k| { 145| 68.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 68.9k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 139| 1.18M| count_t index(size_t idx) const { return idx & mask; } flex-vector-bo.cpp:_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSJ_E_EEEDcPSJ_jmT0_DpOT1_: 1838| 261k|{ 1839| 261k| assert(node); ------------------ | Branch (1839:5): [True: 261k, False: 0] ------------------ 1840| 261k| auto relaxed = node->relaxed(); 1841| 261k| if (relaxed) { ------------------ | Branch (1841:9): [True: 210k, False: 50.3k] ------------------ 1842| 210k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 210k, False: 0] ------------------ 1843| 210k| return make_relaxed_pos(node, shift, relaxed) 1844| 210k| .visit(v, std::forward(args)...); 1845| 210k| } else { 1846| 50.3k| return make_regular_sub_pos(node, shift, size) 1847| 50.3k| .visit(v, std::forward(args)...); 1848| 50.3k| } 1849| 261k|} flex-vector-bo.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1813| 210k| { 1814| 210k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 210k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 1454| 15.8M| { 1455| 15.8M| auto offset = idx >> shift_; 1456| 22.0M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 6.22M, False: 15.8M] ------------------ 1457| 6.22M| ++offset; 1458| 15.8M| return offset; 1459| 15.8M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7relaxedEv: 1435| 210k| relaxed_t* relaxed() const { return relaxed_; } flex-vector-bo.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjDpOT0_: 1686| 210k| { 1687| 210k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 210k, False: 0] ------------------ 1688| 210k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 27.4k, False: 183k] ------------------ 1689| 210k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 210k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjmDpOT0_: 1698| 210k| { 1699| 210k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 210k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjmDpOT0_: 1717| 210k| { 1718| 210k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 210k, False: 0] ------------------ 1719| 210k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 27.4k, False: 183k] | Branch (1719:9): [True: 210k, False: 0] ------------------ 1720| 210k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 210k| auto child = node_->inner()[offset_hint]; 1722| 210k| auto is_leaf = shift_ == BL; 1723| 210k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 210k| auto next_idx = idx - left_size_hint; 1725| 210k| return is_leaf ------------------ | Branch (1725:16): [True: 47.7k, False: 163k] ------------------ 1726| 210k| ? make_leaf_sub_pos(child, next_size) 1727| 47.7k| .visit(v, next_idx, args...) 1728| 210k| : visit_maybe_relaxed_sub( 1729| 163k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 210k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 144| 47.7k| { 145| 47.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 47.7k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1036| 50.3k| { 1037| 50.3k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 50.3k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 938| 50.3k| { 939| 50.3k| return towards_oh_ch_regular( 940| 50.3k| *this, v, idx, offset_hint, count(), args...); 941| 50.3k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 50.3k|{ 633| 50.3k| constexpr auto B = bits; 634| 50.3k| constexpr auto BL = bits_leaf; 635| 50.3k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 50.3k, False: 0] ------------------ 636| 50.3k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 50.3k, False: 0] ------------------ 637| 50.3k| auto is_leaf = p.shift() == BL; 638| 50.3k| auto child = p.node()->inner()[offset_hint]; 639| 50.3k| auto is_full = offset_hint + 1 != count_hint; 640| 50.3k| return is_full ------------------ | Branch (640:12): [True: 9.99k, False: 40.3k] ------------------ 641| 50.3k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.01k, False: 7.98k] ------------------ 642| 9.99k| : make_full_pos(child, p.shift() - B) 643| 7.98k| .visit(v, idx, args...)) 644| 50.3k| : (is_leaf ------------------ | Branch (644:19): [True: 33.2k, False: 7.07k] ------------------ 645| 40.3k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 40.3k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 7.07k| .visit(v, idx, args...)); 648| 50.3k|} flex-vector-bo.cpp:_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 207| 15.6k| { 208| 15.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 15.6k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 202| 361k| count_t index(size_t idx) const { return idx & mask; } flex-vector-bo.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1405| 13.6k| { 1406| 13.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 13.6k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 1162| 784k| count_t index(size_t idx) const { return (idx >> shift_) & mask; } flex-vector-bo.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 1329| 13.6k| { 1330| 13.6k| return towards_oh(v, idx, offset_hint, args...); 1331| 13.6k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjDpOT0_: 1336| 13.6k| { 1337| 13.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 13.6k, False: 0] ------------------ 1338| 13.6k| auto is_leaf = shift_ == BL; 1339| 13.6k| auto child = node_->inner()[offset_hint]; 1340| 13.6k| return is_leaf ------------------ | Branch (1340:16): [True: 9.44k, False: 4.18k] ------------------ 1341| 13.6k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 13.6k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 13.6k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 112| 34.6k| { 113| 34.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 34.6k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 336| 7.37k| { 337| 7.37k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 7.37k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 316| 7.37k| { 317| 7.37k| return towards_oh_ch_regular( 318| 7.37k| *this, v, idx, offset_hint, count(), args...); 319| 7.37k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 7.37k|{ 633| 7.37k| constexpr auto B = bits; 634| 7.37k| constexpr auto BL = bits_leaf; 635| 7.37k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.37k, False: 0] ------------------ 636| 7.37k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.37k, False: 0] ------------------ 637| 7.37k| auto is_leaf = p.shift() == BL; 638| 7.37k| auto child = p.node()->inner()[offset_hint]; 639| 7.37k| auto is_full = offset_hint + 1 != count_hint; 640| 7.37k| return is_full ------------------ | Branch (640:12): [True: 5.69k, False: 1.68k] ------------------ 641| 7.37k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 4.22k, False: 1.46k] ------------------ 642| 5.69k| : make_full_pos(child, p.shift() - B) 643| 1.46k| .visit(v, idx, args...)) 644| 7.37k| : (is_leaf ------------------ | Branch (644:19): [True: 1.38k, False: 296] ------------------ 645| 1.68k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.68k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 296| .visit(v, idx, args...)); 648| 7.37k|} _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 39.4k|{ 1839| 39.4k| assert(node); ------------------ | Branch (1839:5): [True: 39.4k, False: 0] ------------------ 1840| 39.4k| auto relaxed = node->relaxed(); 1841| 39.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 30.9k, False: 8.41k] ------------------ 1842| 30.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 30.9k, False: 0] ------------------ 1843| 30.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 30.9k| .visit(v, std::forward(args)...); 1845| 30.9k| } else { 1846| 8.41k| return make_regular_sub_pos(node, shift, size) 1847| 8.41k| .visit(v, std::forward(args)...); 1848| 8.41k| } 1849| 39.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 30.9k| { 1814| 30.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 30.9k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1686| 24.1k| { 1687| 24.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 24.1k, False: 0] ------------------ 1688| 24.1k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 24.1k] ------------------ 1689| 24.1k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 24.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1698| 24.1k| { 1699| 24.1k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 24.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 24.1k| { 1718| 24.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 24.1k, False: 0] ------------------ 1719| 24.1k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 24.1k] | Branch (1719:9): [True: 24.1k, False: 0] ------------------ 1720| 24.1k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 24.1k| auto child = node_->inner()[offset_hint]; 1722| 24.1k| auto is_leaf = shift_ == BL; 1723| 24.1k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 24.1k| auto next_idx = idx - left_size_hint; 1725| 24.1k| return is_leaf ------------------ | Branch (1725:16): [True: 1.70k, False: 22.4k] ------------------ 1726| 24.1k| ? make_leaf_sub_pos(child, next_size) 1727| 1.70k| .visit(v, next_idx, args...) 1728| 24.1k| : visit_maybe_relaxed_sub( 1729| 22.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 24.1k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 144| 1.70k| { 145| 1.70k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.70k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1686| 10.1k| { 1687| 10.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 10.1k, False: 0] ------------------ 1688| 10.1k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 8.71k, False: 1.48k] ------------------ 1689| 10.1k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 10.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1698| 10.1k| { 1699| 10.1k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 10.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 10.1k| { 1718| 10.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 10.1k, False: 0] ------------------ 1719| 10.1k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 8.71k, False: 1.48k] | Branch (1719:9): [True: 10.1k, False: 0] ------------------ 1720| 10.1k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 10.1k| auto child = node_->inner()[offset_hint]; 1722| 10.1k| auto is_leaf = shift_ == BL; 1723| 10.1k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 10.1k| auto next_idx = idx - left_size_hint; 1725| 10.1k| return is_leaf ------------------ | Branch (1725:16): [True: 4.08k, False: 6.10k] ------------------ 1726| 10.1k| ? make_leaf_sub_pos(child, next_size) 1727| 4.08k| .visit(v, next_idx, args...) 1728| 10.1k| : visit_maybe_relaxed_sub( 1729| 6.10k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 10.1k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 4.08k| { 145| 4.08k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.08k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 6.10k|{ 1839| 6.10k| assert(node); ------------------ | Branch (1839:5): [True: 6.10k, False: 0] ------------------ 1840| 6.10k| auto relaxed = node->relaxed(); 1841| 6.10k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.34k, False: 2.76k] ------------------ 1842| 3.34k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.34k, False: 0] ------------------ 1843| 3.34k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.34k| .visit(v, std::forward(args)...); 1845| 3.34k| } else { 1846| 2.76k| return make_regular_sub_pos(node, shift, size) 1847| 2.76k| .visit(v, std::forward(args)...); 1848| 2.76k| } 1849| 6.10k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 3.34k| { 1814| 3.34k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.34k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 2.76k| { 1037| 2.76k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.76k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 927| 5.44k| { 928| 5.44k| return towards_oh_ch_regular( 929| 5.44k| *this, v, idx, offset_hint, count(), args...); 930| 5.44k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 5.44k|{ 633| 5.44k| constexpr auto B = bits; 634| 5.44k| constexpr auto BL = bits_leaf; 635| 5.44k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.44k, False: 0] ------------------ 636| 5.44k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.44k, False: 0] ------------------ 637| 5.44k| auto is_leaf = p.shift() == BL; 638| 5.44k| auto child = p.node()->inner()[offset_hint]; 639| 5.44k| auto is_full = offset_hint + 1 != count_hint; 640| 5.44k| return is_full ------------------ | Branch (640:12): [True: 1.73k, False: 3.71k] ------------------ 641| 5.44k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.08k, False: 652] ------------------ 642| 1.73k| : make_full_pos(child, p.shift() - B) 643| 652| .visit(v, idx, args...)) 644| 5.44k| : (is_leaf ------------------ | Branch (644:19): [True: 1.32k, False: 2.38k] ------------------ 645| 3.71k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.71k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.38k| .visit(v, idx, args...)); 648| 5.44k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 207| 6.18k| { 208| 6.18k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.18k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1405| 2.03k| { 1406| 2.03k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.03k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1336| 5.41k| { 1337| 5.41k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 5.41k, False: 0] ------------------ 1338| 5.41k| auto is_leaf = shift_ == BL; 1339| 5.41k| auto child = node_->inner()[offset_hint]; 1340| 5.41k| return is_leaf ------------------ | Branch (1340:16): [True: 4.42k, False: 989] ------------------ 1341| 5.41k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 5.41k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 5.41k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1161| 60.9k| shift_t shift() const { return shift_; } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 112| 2.63k| { 113| 2.63k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.63k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 336| 2.82k| { 337| 2.82k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.82k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 305| 2.82k| { 306| 2.82k| return towards_oh_ch_regular( 307| 2.82k| *this, v, idx, offset_hint, count(), args...); 308| 2.82k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 2.82k|{ 633| 2.82k| constexpr auto B = bits; 634| 2.82k| constexpr auto BL = bits_leaf; 635| 2.82k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.82k, False: 0] ------------------ 636| 2.82k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.82k, False: 0] ------------------ 637| 2.82k| auto is_leaf = p.shift() == BL; 638| 2.82k| auto child = p.node()->inner()[offset_hint]; 639| 2.82k| auto is_full = offset_hint + 1 != count_hint; 640| 2.82k| return is_full ------------------ | Branch (640:12): [True: 1.07k, False: 1.74k] ------------------ 641| 2.82k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 680, False: 398] ------------------ 642| 1.07k| : make_full_pos(child, p.shift() - B) 643| 398| .visit(v, idx, args...)) 644| 2.82k| : (is_leaf ------------------ | Branch (644:19): [True: 1.30k, False: 436] ------------------ 645| 1.74k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.74k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 436| .visit(v, idx, args...)); 648| 2.82k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1036| 8.41k| { 1037| 8.41k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.41k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 927| 5.73k| { 928| 5.73k| return towards_oh_ch_regular( 929| 5.73k| *this, v, idx, offset_hint, count(), args...); 930| 5.73k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb1EEEJEEEDcOT_T0_mjjDpOT1_: 632| 5.73k|{ 633| 5.73k| constexpr auto B = bits; 634| 5.73k| constexpr auto BL = bits_leaf; 635| 5.73k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.73k, False: 0] ------------------ 636| 5.73k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.73k, False: 0] ------------------ 637| 5.73k| auto is_leaf = p.shift() == BL; 638| 5.73k| auto child = p.node()->inner()[offset_hint]; 639| 5.73k| auto is_full = offset_hint + 1 != count_hint; 640| 5.73k| return is_full ------------------ | Branch (640:12): [True: 4.98k, False: 746] ------------------ 641| 5.73k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 953, False: 4.03k] ------------------ 642| 4.98k| : make_full_pos(child, p.shift() - B) 643| 4.03k| .visit(v, idx, args...)) 644| 5.73k| : (is_leaf ------------------ | Branch (644:19): [True: 746, False: 0] ------------------ 645| 746| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 746| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.73k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 207| 1.61k| { 208| 1.61k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.61k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1405| 5.68k| { 1406| 5.68k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.68k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1336| 2.31k| { 1337| 2.31k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.31k, False: 0] ------------------ 1338| 2.31k| auto is_leaf = shift_ == BL; 1339| 2.31k| auto child = node_->inner()[offset_hint]; 1340| 2.31k| return is_leaf ------------------ | Branch (1340:16): [True: 660, False: 1.65k] ------------------ 1341| 2.31k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.31k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.31k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 746| { 113| 746| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 746| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 34.7k|{ 1839| 34.7k| assert(node); ------------------ | Branch (1839:5): [True: 34.7k, False: 0] ------------------ 1840| 34.7k| auto relaxed = node->relaxed(); 1841| 34.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 26.5k, False: 8.21k] ------------------ 1842| 26.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 26.5k, False: 0] ------------------ 1843| 26.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 26.5k| .visit(v, std::forward(args)...); 1845| 26.5k| } else { 1846| 8.21k| return make_regular_sub_pos(node, shift, size) 1847| 8.21k| .visit(v, std::forward(args)...); 1848| 8.21k| } 1849| 34.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 26.5k| { 1814| 26.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 26.5k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1434| 4.85M| 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_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1705| 3.58k| { 1706| 3.58k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.58k, False: 0] ------------------ 1707| 3.58k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.27k, False: 304] ------------------ 1708| 3.58k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.58k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 3.58k| { 1718| 3.58k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.58k, False: 0] ------------------ 1719| 3.58k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.27k, False: 304] | Branch (1719:9): [True: 3.58k, False: 0] ------------------ 1720| 3.58k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.58k| auto child = node_->inner()[offset_hint]; 1722| 3.58k| auto is_leaf = shift_ == BL; 1723| 3.58k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.58k| auto next_idx = idx - left_size_hint; 1725| 3.58k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.58k] ------------------ 1726| 3.58k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.58k| : visit_maybe_relaxed_sub( 1729| 3.58k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.58k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1705| 127k| { 1706| 127k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 127k, False: 0] ------------------ 1707| 127k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 39.8k, False: 87.5k] ------------------ 1708| 127k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 127k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 127k| { 1718| 127k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 127k, False: 0] ------------------ 1719| 127k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 39.8k, False: 87.5k] | Branch (1719:9): [True: 127k, False: 0] ------------------ 1720| 127k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 127k| auto child = node_->inner()[offset_hint]; 1722| 127k| auto is_leaf = shift_ == BL; 1723| 127k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 127k| auto next_idx = idx - left_size_hint; 1725| 127k| return is_leaf ------------------ | Branch (1725:16): [True: 21.1k, False: 106k] ------------------ 1726| 127k| ? make_leaf_sub_pos(child, next_size) 1727| 21.1k| .visit(v, next_idx, args...) 1728| 127k| : visit_maybe_relaxed_sub( 1729| 106k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 127k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 21.1k| { 145| 21.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 21.1k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 106k|{ 1839| 106k| assert(node); ------------------ | Branch (1839:5): [True: 106k, False: 0] ------------------ 1840| 106k| auto relaxed = node->relaxed(); 1841| 106k| if (relaxed) { ------------------ | Branch (1841:9): [True: 104k, False: 1.79k] ------------------ 1842| 104k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 104k, False: 0] ------------------ 1843| 104k| return make_relaxed_pos(node, shift, relaxed) 1844| 104k| .visit(v, std::forward(args)...); 1845| 104k| } else { 1846| 1.79k| return make_regular_sub_pos(node, shift, size) 1847| 1.79k| .visit(v, std::forward(args)...); 1848| 1.79k| } 1849| 106k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 104k| { 1814| 104k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 104k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 1.79k| { 1037| 1.79k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.79k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 791| 1.69M| { 792| 1.69M| return size_t{offset} << shift_; 793| 1.69M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 803| 20.5k| { 804| 20.5k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 20.5k, False: 0] ------------------ 805| 20.5k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 7.70k, False: 12.8k] ------------------ 806| 20.5k| : size_t{1} << shift_; 807| 20.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 946| 9.28k| { 947| 9.28k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 9.28k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_18slice_left_visitorISD_Lb0EEEJEEEDcOT_T0_mjDpOT1_: 653| 9.28k|{ 654| 9.28k| constexpr auto B = bits; 655| 9.28k| constexpr auto BL = bits_leaf; 656| 9.28k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 9.28k, False: 0] ------------------ 657| 9.28k| auto is_leaf = p.shift() == BL; 658| 9.28k| auto child = p.node()->inner()[offset_hint]; 659| 9.28k| auto lsize = offset_hint << p.shift(); 660| 9.28k| auto size = p.this_size(); 661| 9.28k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 9.28k| return is_full ------------------ | Branch (662:12): [True: 9.28k, False: 0] ------------------ 663| 9.28k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.56k, False: 4.72k] ------------------ 664| 9.28k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 9.28k| : make_full_pos(child, p.shift() - B) 666| 4.72k| .visit(v, idx - lsize, args...)) 667| 9.28k| : (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| 9.28k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9this_sizeEv: 794| 20.5k| size_t this_size() const { return size_; } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 207| 10.0k| { 208| 10.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.0k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 1405| 7.69k| { 1406| 7.69k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 7.69k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1163| 11.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_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 1170| 51.7k| { 1171| 51.7k| return size_t{offset} << shift_; 1172| 51.7k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1166| 11.1k| { 1167| 11.1k| return size_t{1} << shift_; 1168| 11.1k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1348| 8.43k| { 1349| 8.43k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 8.43k, False: 0] ------------------ 1350| 8.43k| auto is_leaf = shift_ == BL; 1351| 8.43k| auto child = node_->inner()[offset_hint]; 1352| 8.43k| auto lsize = size_t{offset_hint} << shift_; 1353| 8.43k| return is_leaf ------------------ | Branch (1353:16): [True: 5.45k, False: 2.97k] ------------------ 1354| 8.43k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 8.43k| : make_full_pos(child, shift_ - B) 1356| 2.97k| .visit(v, idx - lsize, args...); 1357| 8.43k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1175| 11.1k| { 1176| 11.1k| auto e = sizes + n; 1177| 62.9k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 51.7k, False: 11.1k] ------------------ 1178| 51.7k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 51.7k, False: 0] ------------------ 1180| 51.7k| } 1181| 11.1k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1160| 536k| 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_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 810| 3.23M| { 811| 3.23M| if (n) { ------------------ | Branch (811:13): [True: 3.22M, False: 3.95k] ------------------ 812| 3.22M| auto last = offset + n - 1; 813| 3.22M| auto e = sizes + n - 1; 814| 12.9M| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 9.67M, False: 3.22M] ------------------ 815| 9.67M| init = *sizes = init + (size_t{1} << shift_); 816| 9.67M| assert(init); ------------------ | Branch (816:17): [True: 9.67M, False: 0] ------------------ 817| 9.67M| } 818| 3.22M| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 3.22M, False: 0] ------------------ 820| 3.22M| } 821| 3.23M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEj: 797| 3.25M| { 798| 3.25M| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 1.62M, False: 1.62M] ------------------ 799| 3.25M| : size_t{1} << shift_; 800| 3.25M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1462| 19.8M| { 1463| 19.8M| auto e = sizes + n; 1464| 19.8M| auto prev = size_before(offset); 1465| 19.8M| auto these = relaxed_->d.sizes + offset; 1466| 91.5M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 71.6M, False: 19.8M] ------------------ 1467| 71.6M| auto this_size = *these; 1468| 71.6M| init = *sizes = init + (this_size - prev); 1469| 71.6M| assert(init); ------------------ | Branch (1469:13): [True: 71.6M, False: 0] ------------------ 1470| 71.6M| prev = this_size; 1471| 71.6M| } 1472| 19.8M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1036| 8.21k| { 1037| 8.21k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.21k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 946| 2.24k| { 947| 2.24k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.24k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_18slice_left_visitorISD_Lb1EEEJEEEDcOT_T0_mjDpOT1_: 653| 2.24k|{ 654| 2.24k| constexpr auto B = bits; 655| 2.24k| constexpr auto BL = bits_leaf; 656| 2.24k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.24k, False: 0] ------------------ 657| 2.24k| auto is_leaf = p.shift() == BL; 658| 2.24k| auto child = p.node()->inner()[offset_hint]; 659| 2.24k| auto lsize = offset_hint << p.shift(); 660| 2.24k| auto size = p.this_size(); 661| 2.24k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.24k| return is_full ------------------ | Branch (662:12): [True: 737, False: 1.50k] ------------------ 663| 2.24k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 737] ------------------ 664| 737| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 737| : make_full_pos(child, p.shift() - B) 666| 737| .visit(v, idx - lsize, args...)) 667| 2.24k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.50k] ------------------ 668| 1.50k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.50k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.50k| .visit(v, idx - lsize, args...)); 672| 2.24k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1405| 737| { 1406| 737| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 737| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1036| 1.50k| { 1037| 1.50k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.50k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaPT_j: 766| 7.72k|{ 767| 7.72k| assert(leaf); ------------------ | Branch (767:5): [True: 7.72k, False: 0] ------------------ 768| 7.72k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 7.72k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 7.72k, False: 0] ------------------ 769| 7.72k| assert(count > 0); ------------------ | Branch (769:5): [True: 7.72k, False: 0] ------------------ 770| 7.72k| return singleton_regular_sub_pos{leaf, count}; 771| 7.72k|} _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_14empty_leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 759| 7.72k| { 760| 7.72k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 7.72k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 7.72k|{ 1839| 7.72k| assert(node); ------------------ | Branch (1839:5): [True: 7.72k, False: 0] ------------------ 1840| 7.72k| auto relaxed = node->relaxed(); 1841| 7.72k| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.56k, False: 2.16k] ------------------ 1842| 5.56k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.56k, False: 0] ------------------ 1843| 5.56k| return make_relaxed_pos(node, shift, relaxed) 1844| 5.56k| .visit(v, std::forward(args)...); 1845| 5.56k| } else { 1846| 2.16k| return make_regular_sub_pos(node, shift, size) 1847| 2.16k| .visit(v, std::forward(args)...); 1848| 2.16k| } 1849| 7.72k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1813| 5.56k| { 1814| 5.56k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.56k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 735| 28.3k| shift_t shift() const { return BL; } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 744| 7.72k| { 745| 7.72k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 144| 7.80M| { 145| 7.80M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.80M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 1813| 107M| { 1814| 107M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 107M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 707| 3.28M| { 708| 3.28M| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 744| 7.72k| { 745| 7.72k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 144| 7.80M| { 145| 7.80M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.80M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 137| 7.80M| size_t size() const { return count_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1813| 107M| { 1814| 107M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 107M| } _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_policyELb1ELb1EEELj3ELj3EEEEEEEEvT_DpOT0_: 707| 3.28M| { 708| 3.28M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1762| 19.7k| { 1763| 19.7k| auto child = node_->inner()[0]; 1764| 19.7k| auto child_size = relaxed_->d.sizes[0]; 1765| 19.7k| auto is_leaf = shift_ == BL; 1766| 19.7k| assert(child_size); ------------------ | Branch (1766:9): [True: 19.7k, False: 0] ------------------ 1767| 19.7k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 19.7k] ------------------ 1768| 19.7k| : visit_maybe_relaxed_sub( 1769| 19.7k| child, shift_ - B, child_size, v, args...); 1770| 19.7k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 76| 7.72k| shift_t shift() const { return 0; } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 138| 3.85M| 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_policyELb1ELb1EEELj3ELj3EEENS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 19.7k|{ 1839| 19.7k| assert(node); ------------------ | Branch (1839:5): [True: 19.7k, False: 0] ------------------ 1840| 19.7k| auto relaxed = node->relaxed(); 1841| 19.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 19.4k, False: 290] ------------------ 1842| 19.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 19.4k, False: 0] ------------------ 1843| 19.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 19.4k| .visit(v, std::forward(args)...); 1845| 19.4k| } else { 1846| 290| return make_regular_sub_pos(node, shift, size) 1847| 290| .visit(v, std::forward(args)...); 1848| 290| } 1849| 19.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1813| 19.4k| { 1814| 19.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 19.4k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1036| 290| { 1037| 290| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 290| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 970| 599| { 971| 599| auto is_leaf = shift_ == BL; 972| 599| auto child = node_->inner()[0]; 973| 599| auto is_full = size_ >= (size_t{1} << shift_); 974| 599| return is_full ------------------ | Branch (974:16): [True: 599, False: 0] ------------------ 975| 599| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 599] ------------------ 976| 599| ? make_full_leaf_pos(child).visit(v, args...) 977| 599| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 599| : (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| 599| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 201| 360k| shift_t shift() const { return 0; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1405| 920| { 1406| 920| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 920| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1361| 321| { 1362| 321| auto is_leaf = shift_ == BL; 1363| 321| auto child = node_->inner()[0]; 1364| 321| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 321] ------------------ 1365| 321| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 321| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 711| 70.5k| { 712| 70.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1304| 29.0k| { 1305| 29.0k| each_i(v, 1, branches, args...); 1306| 29.0k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jjDpOT0_: 1263| 29.0k| { 1264| 29.0k| auto p = node_->inner() + i; 1265| 29.0k| auto e = node_->inner() + n; 1266| 29.0k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 20.9k, False: 8.09k] ------------------ 1267| 167k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 146k, False: 20.9k] ------------------ 1268| 146k| IMMER_PREFETCH(p + 1); 1269| 146k| make_full_leaf_pos(*p).visit(v, args...); 1270| 146k| } 1271| 20.9k| } else { 1272| 8.09k| auto ss = shift_ - B; 1273| 64.7k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 56.6k, False: 8.09k] ------------------ 1274| 56.6k| make_full_pos(*p, ss).visit(v, args...); 1275| 8.09k| } 1276| 29.0k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 207| 5.30M| { 208| 5.30M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.30M| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 1405| 528k| { 1406| 528k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 528k| } _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_policyELb1ELb1EEELj3ELj3EEEEEEEEvT_DpOT0_: 711| 70.5k| { 712| 70.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1304| 29.0k| { 1305| 29.0k| each_i(v, 1, branches, args...); 1306| 29.0k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jjDpOT0_: 1263| 29.0k| { 1264| 29.0k| auto p = node_->inner() + i; 1265| 29.0k| auto e = node_->inner() + n; 1266| 29.0k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 20.9k, False: 8.09k] ------------------ 1267| 167k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 146k, False: 20.9k] ------------------ 1268| 146k| IMMER_PREFETCH(p + 1); 1269| 146k| make_full_leaf_pos(*p).visit(v, args...); 1270| 146k| } 1271| 20.9k| } else { 1272| 8.09k| auto ss = shift_ - B; 1273| 64.7k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 56.6k, False: 8.09k] ------------------ 1274| 56.6k| make_full_pos(*p, ss).visit(v, args...); 1275| 8.09k| } 1276| 29.0k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 207| 5.30M| { 208| 5.30M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.30M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 200| 5.30M| size_t size() const { return branches; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1405| 528k| { 1406| 528k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 528k| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 753| 599| { 754| 599| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 599| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 144| 599| { 145| 599| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 599| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1370| 599| { 1371| 599| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 599, False: 0] ------------------ 1372| 599| auto child = node_->inner()[0]; 1373| 599| return make_full_leaf_pos(child).visit(v, args...); 1374| 599| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 207| 2.45k| { 208| 2.45k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.45k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 906| 360k| { 907| 360k| if (count() > 1) ------------------ | Branch (907:13): [True: 348k, False: 11.1k] ------------------ 908| 348k| each_right_sub_(v, 1, args...); 909| 360k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE15each_right_sub_INS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 879| 348k| { 880| 348k| auto last = count() - 1; 881| 348k| auto lsize = size_ - (last << shift_); 882| 348k| auto n = node()->inner() + i; 883| 348k| auto e = node()->inner() + last; 884| 348k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 327k, False: 20.9k] ------------------ 885| 2.28M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 1.95M, False: 327k] ------------------ 886| 1.95M| IMMER_PREFETCH(n + 1); 887| 1.95M| make_full_leaf_pos(*n).visit(v, args...); 888| 1.95M| } 889| 327k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 327k| } else { 891| 20.9k| auto ss = shift_ - B; 892| 60.4k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 39.5k, False: 20.9k] ------------------ 893| 39.5k| make_full_pos(*n, ss).visit(v, args...); 894| 20.9k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 20.9k| } 896| 348k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 1036| 3.77M| { 1037| 3.77M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.77M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 906| 360k| { 907| 360k| if (count() > 1) ------------------ | Branch (907:13): [True: 348k, False: 11.1k] ------------------ 908| 348k| each_right_sub_(v, 1, args...); 909| 360k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE15each_right_sub_INS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 879| 348k| { 880| 348k| auto last = count() - 1; 881| 348k| auto lsize = size_ - (last << shift_); 882| 348k| auto n = node()->inner() + i; 883| 348k| auto e = node()->inner() + last; 884| 348k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 327k, False: 20.9k] ------------------ 885| 2.28M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 1.95M, False: 327k] ------------------ 886| 1.95M| IMMER_PREFETCH(n + 1); 887| 1.95M| make_full_leaf_pos(*n).visit(v, args...); 888| 1.95M| } 889| 327k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 327k| } else { 891| 20.9k| auto ss = shift_ - B; 892| 60.4k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 39.5k, False: 20.9k] ------------------ 893| 39.5k| make_full_pos(*n, ss).visit(v, args...); 894| 20.9k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 20.9k| } 896| 348k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1036| 3.77M| { 1037| 3.77M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.77M| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 753| 1.85k| { 754| 1.85k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 1.85k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 144| 1.85k| { 145| 1.85k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.85k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 986| 1.85k| { 987| 1.85k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 1.85k, False: 0] ------------------ 988| 1.85k| auto child = node_->inner()[0]; 989| 1.85k| auto is_full = size_ >= branches; 990| 1.85k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 1.85k, False: 0] ------------------ 991| 1.85k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 1.85k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 144| 5.27k| { 145| 5.27k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.27k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1647| 9.21M| { 1648| 9.21M| each_right(v, 1, std::forward(args)...); 1649| 9.21M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 1653| 9.21M| { 1654| 9.21M| assert(start > 0); ------------------ | Branch (1654:9): [True: 9.21M, False: 0] ------------------ 1655| 9.21M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 9.21M, False: 0] ------------------ 1656| 9.21M| auto s = relaxed_->d.sizes[start - 1]; 1657| 9.21M| auto p = node_->inner(); 1658| 9.21M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 694k, False: 8.52M] ------------------ 1659| 3.41M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 2.72M, False: 694k] ------------------ 1660| 2.72M| IMMER_PREFETCH(p + i + 1); 1661| 2.72M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 2.72M| .visit(v, args...); 1663| 2.72M| s = relaxed_->d.sizes[i]; 1664| 2.72M| assert(s); ------------------ | Branch (1664:17): [True: 2.72M, False: 0] ------------------ 1665| 2.72M| } 1666| 8.52M| } else { 1667| 8.52M| auto ss = shift_ - B; 1668| 61.6M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 53.1M, False: 8.52M] ------------------ 1669| 53.1M| visit_maybe_relaxed_sub( 1670| 53.1M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 53.1M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 53.1M, False: 0] ------------------ 1673| 53.1M| } 1674| 8.52M| } 1675| 9.21M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcPT_jmT0_DpOT1_: 1838| 91.6M|{ 1839| 91.6M| assert(node); ------------------ | Branch (1839:5): [True: 91.6M, False: 0] ------------------ 1840| 91.6M| auto relaxed = node->relaxed(); 1841| 91.6M| if (relaxed) { ------------------ | Branch (1841:9): [True: 87.9M, False: 3.75M] ------------------ 1842| 87.9M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 87.9M, False: 0] ------------------ 1843| 87.9M| return make_relaxed_pos(node, shift, relaxed) 1844| 87.9M| .visit(v, std::forward(args)...); 1845| 87.9M| } else { 1846| 3.75M| return make_regular_sub_pos(node, shift, size) 1847| 3.75M| .visit(v, std::forward(args)...); 1848| 3.75M| } 1849| 91.6M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1647| 9.21M| { 1648| 9.21M| each_right(v, 1, std::forward(args)...); 1649| 9.21M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 1653| 9.21M| { 1654| 9.21M| assert(start > 0); ------------------ | Branch (1654:9): [True: 9.21M, False: 0] ------------------ 1655| 9.21M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 9.21M, False: 0] ------------------ 1656| 9.21M| auto s = relaxed_->d.sizes[start - 1]; 1657| 9.21M| auto p = node_->inner(); 1658| 9.21M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 694k, False: 8.52M] ------------------ 1659| 3.41M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 2.72M, False: 694k] ------------------ 1660| 2.72M| IMMER_PREFETCH(p + i + 1); 1661| 2.72M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 2.72M| .visit(v, args...); 1663| 2.72M| s = relaxed_->d.sizes[i]; 1664| 2.72M| assert(s); ------------------ | Branch (1664:17): [True: 2.72M, False: 0] ------------------ 1665| 2.72M| } 1666| 8.52M| } else { 1667| 8.52M| auto ss = shift_ - B; 1668| 61.6M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 53.1M, False: 8.52M] ------------------ 1669| 53.1M| visit_maybe_relaxed_sub( 1670| 53.1M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 53.1M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 53.1M, False: 0] ------------------ 1673| 53.1M| } 1674| 8.52M| } 1675| 9.21M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 91.6M|{ 1839| 91.6M| assert(node); ------------------ | Branch (1839:5): [True: 91.6M, False: 0] ------------------ 1840| 91.6M| auto relaxed = node->relaxed(); 1841| 91.6M| if (relaxed) { ------------------ | Branch (1841:9): [True: 87.9M, False: 3.75M] ------------------ 1842| 87.9M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 87.9M, False: 0] ------------------ 1843| 87.9M| return make_relaxed_pos(node, shift, relaxed) 1844| 87.9M| .visit(v, std::forward(args)...); 1845| 87.9M| } else { 1846| 3.75M| return make_regular_sub_pos(node, shift, size) 1847| 3.75M| .visit(v, std::forward(args)...); 1848| 3.75M| } 1849| 91.6M|} _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 753| 5.27k| { 754| 5.27k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 5.27k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 144| 5.27k| { 145| 5.27k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.27k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1774| 5.27k| { 1775| 5.27k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 5.27k, False: 0] ------------------ 1776| 5.27k| auto child = node_->inner()[0]; 1777| 5.27k| auto child_size = relaxed_->d.sizes[0]; 1778| 5.27k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 5.27k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1036| 2.16k| { 1037| 2.16k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.16k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcPT_jmT0_DpOT1_: 1838| 1.04M|{ 1839| 1.04M| assert(node); ------------------ | Branch (1839:5): [True: 1.04M, False: 0] ------------------ 1840| 1.04M| auto relaxed = node->relaxed(); 1841| 1.04M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.02M, False: 16.9k] ------------------ 1842| 1.02M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.02M, False: 0] ------------------ 1843| 1.02M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.02M| .visit(v, std::forward(args)...); 1845| 1.02M| } else { 1846| 16.9k| return make_regular_sub_pos(node, shift, size) 1847| 16.9k| .visit(v, std::forward(args)...); 1848| 16.9k| } 1849| 1.04M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 1813| 1.02M| { 1814| 1.02M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.02M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 1.02M|{ 1839| 1.02M| assert(node); ------------------ | Branch (1839:5): [True: 1.02M, False: 0] ------------------ 1840| 1.02M| auto relaxed = node->relaxed(); 1841| 1.02M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.01M, False: 18.1k] ------------------ 1842| 1.01M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.01M, False: 0] ------------------ 1843| 1.01M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.01M| .visit(v, std::forward(args)...); 1845| 1.01M| } else { 1846| 18.1k| return make_regular_sub_pos(node, shift, size) 1847| 18.1k| .visit(v, std::forward(args)...); 1848| 18.1k| } 1849| 1.02M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 1.01M| { 1814| 1.01M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.01M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1750| 3.22M| { 1751| 3.22M| auto offset = relaxed_->d.count - 1; 1752| 3.22M| auto child = node_->inner()[offset]; 1753| 3.22M| auto child_size = size(offset); 1754| 3.22M| auto is_leaf = shift_ == BL; 1755| 3.22M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 3.22M] ------------------ 1756| 3.22M| : visit_maybe_relaxed_sub( 1757| 3.22M| child, shift_ - B, child_size, v, args...); 1758| 3.22M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 3.22M|{ 1839| 3.22M| assert(node); ------------------ | Branch (1839:5): [True: 3.22M, False: 0] ------------------ 1840| 3.22M| auto relaxed = node->relaxed(); 1841| 3.22M| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.21M, False: 1.99k] ------------------ 1842| 3.21M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.21M, False: 0] ------------------ 1843| 3.21M| return make_relaxed_pos(node, shift, relaxed) 1844| 3.21M| .visit(v, std::forward(args)...); 1845| 3.21M| } else { 1846| 1.99k| return make_regular_sub_pos(node, shift, size) 1847| 1.99k| .visit(v, std::forward(args)...); 1848| 1.99k| } 1849| 3.22M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1813| 3.21M| { 1814| 3.21M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.21M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 1036| 4.20k| { 1037| 4.20k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.20k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 958| 2.21k| { 959| 2.21k| auto offset = count() - 1; 960| 2.21k| auto child = node_->inner()[offset]; 961| 2.21k| auto is_leaf = shift_ == BL; 962| 2.21k| auto lsize = size_ - (size_t{offset} << shift_); 963| 2.21k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 2.21k] ------------------ 964| 2.21k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 2.21k| .visit(v, args...); 966| 2.21k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 913| 1.42M| { 914| 1.42M| each_left(v, count() - 1, args...); 915| 1.42M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 873| 1.42M| { 874| 1.42M| return each_left_regular(*this, v, last, args...); 875| 1.42M| } _ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvOT_T0_jDpOT1_: 575| 1.42M|{ 576| 1.42M| constexpr auto B = bits; 577| 1.42M| constexpr auto BL = bits_leaf; 578| 1.42M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.42M, False: 0] ------------------ 579| 1.42M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 774k, False: 647k] ------------------ 580| 774k| auto n = p.node()->inner(); 581| 774k| auto e = n + last; 582| 3.97M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.20M, False: 774k] ------------------ 583| 3.20M| IMMER_PREFETCH(n + 1); 584| 3.20M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.20M| } 586| 774k| } else { 587| 647k| auto n = p.node()->inner(); 588| 647k| auto e = n + last; 589| 647k| auto ss = p.shift() - B; 590| 1.08M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 432k, False: 647k] ------------------ 591| 432k| make_full_pos(*n, ss).visit(v, args...); 592| 647k| } 593| 1.42M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 913| 1.42M| { 914| 1.42M| each_left(v, count() - 1, args...); 915| 1.42M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 873| 1.42M| { 874| 1.42M| return each_left_regular(*this, v, last, args...); 875| 1.42M| } _ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISD_EEEEEvOT_T0_jDpOT1_: 575| 1.42M|{ 576| 1.42M| constexpr auto B = bits; 577| 1.42M| constexpr auto BL = bits_leaf; 578| 1.42M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.42M, False: 0] ------------------ 579| 1.42M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 774k, False: 647k] ------------------ 580| 774k| auto n = p.node()->inner(); 581| 774k| auto e = n + last; 582| 3.97M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.20M, False: 774k] ------------------ 583| 3.20M| IMMER_PREFETCH(n + 1); 584| 3.20M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.20M| } 586| 774k| } else { 587| 647k| auto n = p.node()->inner(); 588| 647k| auto e = n + last; 589| 647k| auto ss = p.shift() - B; 590| 1.08M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 432k, False: 647k] ------------------ 591| 432k| make_full_pos(*n, ss).visit(v, args...); 592| 647k| } 593| 1.42M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1762| 1.38M| { 1763| 1.38M| auto child = node_->inner()[0]; 1764| 1.38M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.38M| auto is_leaf = shift_ == BL; 1766| 1.38M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.38M, False: 0] ------------------ 1767| 1.38M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.38M] ------------------ 1768| 1.38M| : visit_maybe_relaxed_sub( 1769| 1.38M| child, shift_ - B, child_size, v, args...); 1770| 1.38M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 106| 1.04M| 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_policyELb1ELb1EEELj3ELj3EEENS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 1.38M|{ 1839| 1.38M| assert(node); ------------------ | Branch (1839:5): [True: 1.38M, False: 0] ------------------ 1840| 1.38M| auto relaxed = node->relaxed(); 1841| 1.38M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.05M, False: 328k] ------------------ 1842| 1.05M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.05M, False: 0] ------------------ 1843| 1.05M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.05M| .visit(v, std::forward(args)...); 1845| 1.05M| } else { 1846| 328k| return make_regular_sub_pos(node, shift, size) 1847| 328k| .visit(v, std::forward(args)...); 1848| 328k| } 1849| 1.38M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 1.05M| { 1814| 1.05M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.05M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 328k| { 1037| 328k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 328k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 958| 895| { 959| 895| auto offset = count() - 1; 960| 895| auto child = node_->inner()[offset]; 961| 895| auto is_leaf = shift_ == BL; 962| 895| auto lsize = size_ - (size_t{offset} << shift_); 963| 895| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 895] ------------------ 964| 895| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 895| .visit(v, args...); 966| 895| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1036| 1.33k| { 1037| 1.33k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.33k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 18.8k| { 971| 18.8k| auto is_leaf = shift_ == BL; 972| 18.8k| auto child = node_->inner()[0]; 973| 18.8k| auto is_full = size_ >= (size_t{1} << shift_); 974| 18.8k| return is_full ------------------ | Branch (974:16): [True: 18.8k, False: 0] ------------------ 975| 18.8k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 18.8k] ------------------ 976| 18.8k| ? make_full_leaf_pos(child).visit(v, args...) 977| 18.8k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 18.8k| : (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| 18.8k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1405| 26.2k| { 1406| 26.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 26.2k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 7.34k| { 1362| 7.34k| auto is_leaf = shift_ == BL; 1363| 7.34k| auto child = node_->inner()[0]; 1364| 7.34k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 7.34k] ------------------ 1365| 7.34k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 7.34k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 958| 26.0k| { 959| 26.0k| auto offset = count() - 1; 960| 26.0k| auto child = node_->inner()[offset]; 961| 26.0k| auto is_leaf = shift_ == BL; 962| 26.0k| auto lsize = size_ - (size_t{offset} << shift_); 963| 26.0k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 19.0k, False: 6.93k] ------------------ 964| 26.0k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 6.93k| .visit(v, args...); 966| 26.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 144| 20.3k| { 145| 20.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 20.3k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1370| 20.3k| { 1371| 20.3k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 20.3k, False: 0] ------------------ 1372| 20.3k| auto child = node_->inner()[0]; 1373| 20.3k| return make_full_leaf_pos(child).visit(v, args...); 1374| 20.3k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 207| 357k| { 208| 357k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 357k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1036| 7.14k| { 1037| 7.14k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.14k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 958| 338k| { 959| 338k| auto offset = count() - 1; 960| 338k| auto child = node_->inner()[offset]; 961| 338k| auto is_leaf = shift_ == BL; 962| 338k| auto lsize = size_ - (size_t{offset} << shift_); 963| 338k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 331k, False: 7.11k] ------------------ 964| 338k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 7.11k| .visit(v, args...); 966| 338k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 144| 337k| { 145| 337k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 337k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 986| 337k| { 987| 337k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 337k, False: 0] ------------------ 988| 337k| auto child = node_->inner()[0]; 989| 337k| auto is_full = size_ >= branches; 990| 337k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 337k, False: 0] ------------------ 991| 337k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 337k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 144| 688k| { 145| 688k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 688k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1036| 18.5k| { 1037| 18.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 18.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 958| 1.05M| { 959| 1.05M| auto offset = count() - 1; 960| 1.05M| auto child = node_->inner()[offset]; 961| 1.05M| auto is_leaf = shift_ == BL; 962| 1.05M| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.05M| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 423k, False: 630k] ------------------ 964| 1.05M| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 630k| .visit(v, args...); 966| 1.05M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 144| 688k| { 145| 688k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 688k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1774| 688k| { 1775| 688k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 688k, False: 0] ------------------ 1776| 688k| auto child = node_->inner()[0]; 1777| 688k| auto child_size = relaxed_->d.sizes[0]; 1778| 688k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 688k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 1036| 1.37M| { 1037| 1.37M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.37M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1617| 11.3M| { 1618| 11.3M| each_left(v, relaxed_->d.count - 1, args...); 1619| 11.3M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 1623| 11.3M| { 1624| 11.3M| auto p = node_->inner(); 1625| 11.3M| auto s = size_t{}; 1626| 11.3M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 271k, False: 11.1M] ------------------ 1627| 1.87M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 1.59M, False: 271k] ------------------ 1628| 1.59M| IMMER_PREFETCH(p + i + 1); 1629| 1.59M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 1.59M| .visit(v, args...); 1631| 1.59M| s = relaxed_->d.sizes[i]; 1632| 1.59M| assert(s); ------------------ | Branch (1632:17): [True: 1.59M, False: 0] ------------------ 1633| 1.59M| } 1634| 11.1M| } else { 1635| 11.1M| auto ss = shift_ - B; 1636| 49.6M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 38.5M, False: 11.1M] ------------------ 1637| 38.5M| visit_maybe_relaxed_sub( 1638| 38.5M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 38.5M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 38.5M, False: 0] ------------------ 1641| 38.5M| } 1642| 11.1M| } 1643| 11.3M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1617| 11.3M| { 1618| 11.3M| each_left(v, relaxed_->d.count - 1, args...); 1619| 11.3M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 1623| 11.3M| { 1624| 11.3M| auto p = node_->inner(); 1625| 11.3M| auto s = size_t{}; 1626| 11.3M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 271k, False: 11.1M] ------------------ 1627| 1.87M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 1.59M, False: 271k] ------------------ 1628| 1.59M| IMMER_PREFETCH(p + i + 1); 1629| 1.59M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 1.59M| .visit(v, args...); 1631| 1.59M| s = relaxed_->d.sizes[i]; 1632| 1.59M| assert(s); ------------------ | Branch (1632:17): [True: 1.59M, False: 0] ------------------ 1633| 1.59M| } 1634| 11.1M| } else { 1635| 11.1M| auto ss = shift_ - B; 1636| 49.6M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 38.5M, False: 11.1M] ------------------ 1637| 38.5M| visit_maybe_relaxed_sub( 1638| 38.5M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 38.5M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 38.5M, False: 0] ------------------ 1641| 38.5M| } 1642| 11.1M| } 1643| 11.3M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1762| 7.12M| { 1763| 7.12M| auto child = node_->inner()[0]; 1764| 7.12M| auto child_size = relaxed_->d.sizes[0]; 1765| 7.12M| auto is_leaf = shift_ == BL; 1766| 7.12M| assert(child_size); ------------------ | Branch (1766:9): [True: 7.12M, False: 0] ------------------ 1767| 7.12M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 7.12M] ------------------ 1768| 7.12M| : visit_maybe_relaxed_sub( 1769| 7.12M| child, shift_ - B, child_size, v, args...); 1770| 7.12M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 7.12M|{ 1839| 7.12M| assert(node); ------------------ | Branch (1839:5): [True: 7.12M, False: 0] ------------------ 1840| 7.12M| auto relaxed = node->relaxed(); 1841| 7.12M| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.12M, False: 703] ------------------ 1842| 7.12M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.12M, False: 0] ------------------ 1843| 7.12M| return make_relaxed_pos(node, shift, relaxed) 1844| 7.12M| .visit(v, std::forward(args)...); 1845| 7.12M| } else { 1846| 703| return make_regular_sub_pos(node, shift, size) 1847| 703| .visit(v, std::forward(args)...); 1848| 703| } 1849| 7.12M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 7.12M| { 1814| 7.12M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.12M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 703| { 1037| 703| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 703| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1750| 63.9k| { 1751| 63.9k| auto offset = relaxed_->d.count - 1; 1752| 63.9k| auto child = node_->inner()[offset]; 1753| 63.9k| auto child_size = size(offset); 1754| 63.9k| auto is_leaf = shift_ == BL; 1755| 63.9k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 63.9k] ------------------ 1756| 63.9k| : visit_maybe_relaxed_sub( 1757| 63.9k| child, shift_ - B, child_size, v, args...); 1758| 63.9k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 63.9k|{ 1839| 63.9k| assert(node); ------------------ | Branch (1839:5): [True: 63.9k, False: 0] ------------------ 1840| 63.9k| auto relaxed = node->relaxed(); 1841| 63.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 63.4k, False: 442] ------------------ 1842| 63.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 63.4k, False: 0] ------------------ 1843| 63.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 63.4k| .visit(v, std::forward(args)...); 1845| 63.4k| } else { 1846| 442| return make_regular_sub_pos(node, shift, size) 1847| 442| .visit(v, std::forward(args)...); 1848| 442| } 1849| 63.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1813| 63.4k| { 1814| 63.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 63.4k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 1.43k| { 971| 1.43k| auto is_leaf = shift_ == BL; 972| 1.43k| auto child = node_->inner()[0]; 973| 1.43k| auto is_full = size_ >= (size_t{1} << shift_); 974| 1.43k| return is_full ------------------ | Branch (974:16): [True: 1.43k, False: 0] ------------------ 975| 1.43k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 1.43k] ------------------ 976| 1.43k| ? make_full_leaf_pos(child).visit(v, args...) 977| 1.43k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 1.43k| : (is_leaf ------------------ | Branch (978:23): [True: 0, False: 0] ------------------ 979| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 980| 0| : make_regular_sub_pos(child, shift_ - B, size_) 981| 0| .visit(v, args...)); 982| 1.43k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1405| 1.86k| { 1406| 1.86k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.86k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 427| { 1362| 427| auto is_leaf = shift_ == BL; 1363| 427| auto child = node_->inner()[0]; 1364| 427| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 427] ------------------ 1365| 427| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 427| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1750| 1.66k| { 1751| 1.66k| auto offset = relaxed_->d.count - 1; 1752| 1.66k| auto child = node_->inner()[offset]; 1753| 1.66k| auto child_size = size(offset); 1754| 1.66k| auto is_leaf = shift_ == BL; 1755| 1.66k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 1.22k, False: 440] ------------------ 1756| 1.66k| : visit_maybe_relaxed_sub( 1757| 440| child, shift_ - B, child_size, v, args...); 1758| 1.66k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 440|{ 1839| 440| assert(node); ------------------ | Branch (1839:5): [True: 440, False: 0] ------------------ 1840| 440| auto relaxed = node->relaxed(); 1841| 440| if (relaxed) { ------------------ | Branch (1841:9): [True: 231, False: 209] ------------------ 1842| 231| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 231, False: 0] ------------------ 1843| 231| return make_relaxed_pos(node, shift, relaxed) 1844| 231| .visit(v, std::forward(args)...); 1845| 231| } else { 1846| 209| return make_regular_sub_pos(node, shift, size) 1847| 209| .visit(v, std::forward(args)...); 1848| 209| } 1849| 440|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1813| 231| { 1814| 231| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 231| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1750| 17.7k| { 1751| 17.7k| auto offset = relaxed_->d.count - 1; 1752| 17.7k| auto child = node_->inner()[offset]; 1753| 17.7k| auto child_size = size(offset); 1754| 17.7k| auto is_leaf = shift_ == BL; 1755| 17.7k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 5.51k, False: 12.2k] ------------------ 1756| 17.7k| : visit_maybe_relaxed_sub( 1757| 12.2k| child, shift_ - B, child_size, v, args...); 1758| 17.7k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 12.2k|{ 1839| 12.2k| assert(node); ------------------ | Branch (1839:5): [True: 12.2k, False: 0] ------------------ 1840| 12.2k| auto relaxed = node->relaxed(); 1841| 12.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 822, False: 11.4k] ------------------ 1842| 822| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 822, False: 0] ------------------ 1843| 822| return make_relaxed_pos(node, shift, relaxed) 1844| 822| .visit(v, std::forward(args)...); 1845| 11.4k| } else { 1846| 11.4k| return make_regular_sub_pos(node, shift, size) 1847| 11.4k| .visit(v, std::forward(args)...); 1848| 11.4k| } 1849| 12.2k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1813| 822| { 1814| 822| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 822| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1750| 8.09M| { 1751| 8.09M| auto offset = relaxed_->d.count - 1; 1752| 8.09M| auto child = node_->inner()[offset]; 1753| 8.09M| auto child_size = size(offset); 1754| 8.09M| auto is_leaf = shift_ == BL; 1755| 8.09M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 265k, False: 7.82M] ------------------ 1756| 8.09M| : visit_maybe_relaxed_sub( 1757| 7.82M| child, shift_ - B, child_size, v, args...); 1758| 8.09M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 7.82M|{ 1839| 7.82M| assert(node); ------------------ | Branch (1839:5): [True: 7.82M, False: 0] ------------------ 1840| 7.82M| auto relaxed = node->relaxed(); 1841| 7.82M| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.08M, False: 743k] ------------------ 1842| 7.08M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.08M, False: 0] ------------------ 1843| 7.08M| return make_relaxed_pos(node, shift, relaxed) 1844| 7.08M| .visit(v, std::forward(args)...); 1845| 7.08M| } else { 1846| 743k| return make_regular_sub_pos(node, shift, size) 1847| 743k| .visit(v, std::forward(args)...); 1848| 743k| } 1849| 7.82M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1813| 7.08M| { 1814| 7.08M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.08M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 18.1k| { 1037| 18.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 18.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 1036| 16.9k| { 1037| 16.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 16.9k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 16.9k|{ 1839| 16.9k| assert(node); ------------------ | Branch (1839:5): [True: 16.9k, False: 0] ------------------ 1840| 16.9k| auto relaxed = node->relaxed(); 1841| 16.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.80k, False: 10.1k] ------------------ 1842| 6.80k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.80k, False: 0] ------------------ 1843| 6.80k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.80k| .visit(v, std::forward(args)...); 1845| 10.1k| } else { 1846| 10.1k| return make_regular_sub_pos(node, shift, size) 1847| 10.1k| .visit(v, std::forward(args)...); 1848| 10.1k| } 1849| 16.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 6.80k| { 1814| 6.80k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.80k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 10.1k| { 1037| 10.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1813| 177k| { 1814| 177k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 177k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11last_oh_cshINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_jmDpOT0_: 1737| 171k| { 1738| 171k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 171k, False: 0] ------------------ 1739| 171k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 171k, False: 0] ------------------ 1740| 171k| auto child = node_->inner()[offset_hint]; 1741| 171k| auto is_leaf = shift_ == BL; 1742| 171k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 171k] ------------------ 1743| 171k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 171k| : visit_maybe_relaxed_sub( 1745| 171k| child, shift_ - B, child_size_hint, v, args...); 1746| 171k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcPT_jmT0_DpOT1_: 1838| 171k|{ 1839| 171k| assert(node); ------------------ | Branch (1839:5): [True: 171k, False: 0] ------------------ 1840| 171k| auto relaxed = node->relaxed(); 1841| 171k| if (relaxed) { ------------------ | Branch (1841:9): [True: 14.2k, False: 157k] ------------------ 1842| 14.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 14.2k, False: 0] ------------------ 1843| 14.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 14.2k| .visit(v, std::forward(args)...); 1845| 157k| } else { 1846| 157k| return make_regular_sub_pos(node, shift, size) 1847| 157k| .visit(v, std::forward(args)...); 1848| 157k| } 1849| 171k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1036| 157k| { 1037| 157k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 157k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 952| 324k| { 953| 324k| return last_oh_regular(*this, v, offset_hint, args...); 954| 324k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21push_tail_mut_visitorISD_Lb1EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 324k|{ 678| 324k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 324k, False: 0] ------------------ 679| 324k| constexpr auto B = bits; 680| 324k| constexpr auto BL = bits_leaf; 681| 324k| auto child = p.node()->inner()[offset_hint]; 682| 324k| auto is_leaf = p.shift() == BL; 683| 324k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 324k] ------------------ 684| 324k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 324k| .visit(v, args...); 686| 324k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 336| 1.03M| { 337| 1.03M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.03M| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 330| 711k| { 331| 711k| return last_oh_regular(*this, v, offset_hint, args...); 332| 711k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21push_tail_mut_visitorISD_Lb1EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 711k|{ 678| 711k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 711k, False: 0] ------------------ 679| 711k| constexpr auto B = bits; 680| 711k| constexpr auto BL = bits_leaf; 681| 711k| auto child = p.node()->inner()[offset_hint]; 682| 711k| auto is_leaf = p.shift() == BL; 683| 711k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 711k] ------------------ 684| 711k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 711k| .visit(v, args...); 686| 711k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 330| 2.92k| { 331| 2.92k| return last_oh_regular(*this, v, offset_hint, args...); 332| 2.92k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21push_tail_mut_visitorISD_Lb0EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 2.92k|{ 678| 2.92k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 2.92k, False: 0] ------------------ 679| 2.92k| constexpr auto B = bits; 680| 2.92k| constexpr auto BL = bits_leaf; 681| 2.92k| auto child = p.node()->inner()[offset_hint]; 682| 2.92k| auto is_leaf = p.shift() == BL; 683| 2.92k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 2.92k] ------------------ 684| 2.92k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 2.92k| .visit(v, args...); 686| 2.92k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 336| 4.56k| { 337| 4.56k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.56k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 952| 1.64k| { 953| 1.64k| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.64k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21push_tail_mut_visitorISD_Lb0EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 1.64k|{ 678| 1.64k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.64k, False: 0] ------------------ 679| 1.64k| constexpr auto B = bits; 680| 1.64k| constexpr auto BL = bits_leaf; 681| 1.64k| auto child = p.node()->inner()[offset_hint]; 682| 1.64k| auto is_leaf = p.shift() == BL; 683| 1.64k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.64k] ------------------ 684| 1.64k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.64k| .visit(v, args...); 686| 1.64k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11last_oh_cshINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_jmDpOT0_: 1737| 9.77k| { 1738| 9.77k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 9.77k, False: 0] ------------------ 1739| 9.77k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 9.77k, False: 0] ------------------ 1740| 9.77k| auto child = node_->inner()[offset_hint]; 1741| 9.77k| auto is_leaf = shift_ == BL; 1742| 9.77k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 9.77k] ------------------ 1743| 9.77k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 9.77k| : visit_maybe_relaxed_sub( 1745| 9.77k| child, shift_ - B, child_size_hint, v, args...); 1746| 9.77k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcPT_jmT0_DpOT1_: 1838| 9.77k|{ 1839| 9.77k| assert(node); ------------------ | Branch (1839:5): [True: 9.77k, False: 0] ------------------ 1840| 9.77k| auto relaxed = node->relaxed(); 1841| 9.77k| if (relaxed) { ------------------ | Branch (1841:9): [True: 8.71k, False: 1.06k] ------------------ 1842| 8.71k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 8.71k, False: 0] ------------------ 1843| 8.71k| return make_relaxed_pos(node, shift, relaxed) 1844| 8.71k| .visit(v, std::forward(args)...); 1845| 8.71k| } else { 1846| 1.06k| return make_regular_sub_pos(node, shift, size) 1847| 1.06k| .visit(v, std::forward(args)...); 1848| 1.06k| } 1849| 9.77k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1813| 8.71k| { 1814| 8.71k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 8.71k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1036| 1.06k| { 1037| 1.06k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.06k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 1036| 180k| { 1037| 180k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 180k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcPT_jmT0_DpOT1_: 1838| 25.0k|{ 1839| 25.0k| assert(node); ------------------ | Branch (1839:5): [True: 25.0k, False: 0] ------------------ 1840| 25.0k| auto relaxed = node->relaxed(); 1841| 25.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 22.3k, False: 2.64k] ------------------ 1842| 22.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 22.3k, False: 0] ------------------ 1843| 22.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 22.3k| .visit(v, std::forward(args)...); 1845| 22.3k| } else { 1846| 2.64k| return make_regular_sub_pos(node, shift, size) 1847| 2.64k| .visit(v, std::forward(args)...); 1848| 2.64k| } 1849| 25.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_: 1813| 22.3k| { 1814| 22.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 22.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjDpOT0_: 1686| 134k| { 1687| 134k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 134k, False: 0] ------------------ 1688| 134k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 29.1k, False: 105k] ------------------ 1689| 134k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 134k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjmDpOT0_: 1698| 134k| { 1699| 134k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 134k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_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: 29.1k, False: 105k] | 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: 20.2k, False: 114k] ------------------ 1726| 134k| ? make_leaf_sub_pos(child, next_size) 1727| 20.2k| .visit(v, next_idx, args...) 1728| 134k| : visit_maybe_relaxed_sub( 1729| 114k| 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_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 144| 20.2k| { 145| 20.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 20.2k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcPT_jmT0_DpOT1_: 1838| 114k|{ 1839| 114k| assert(node); ------------------ | Branch (1839:5): [True: 114k, False: 0] ------------------ 1840| 114k| auto relaxed = node->relaxed(); 1841| 114k| if (relaxed) { ------------------ | Branch (1841:9): [True: 112k, False: 2.11k] ------------------ 1842| 112k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 112k, False: 0] ------------------ 1843| 112k| return make_relaxed_pos(node, shift, relaxed) 1844| 112k| .visit(v, std::forward(args)...); 1845| 112k| } else { 1846| 2.11k| return make_regular_sub_pos(node, shift, size) 1847| 2.11k| .visit(v, std::forward(args)...); 1848| 2.11k| } 1849| 114k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1813| 112k| { 1814| 112k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 112k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1036| 2.11k| { 1037| 2.11k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.11k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 938| 4.76k| { 939| 4.76k| return towards_oh_ch_regular( 940| 4.76k| *this, v, idx, offset_hint, count(), args...); 941| 4.76k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_: 632| 4.76k|{ 633| 4.76k| constexpr auto B = bits; 634| 4.76k| constexpr auto BL = bits_leaf; 635| 4.76k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.76k, False: 0] ------------------ 636| 4.76k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.76k, False: 0] ------------------ 637| 4.76k| auto is_leaf = p.shift() == BL; 638| 4.76k| auto child = p.node()->inner()[offset_hint]; 639| 4.76k| auto is_full = offset_hint + 1 != count_hint; 640| 4.76k| return is_full ------------------ | Branch (640:12): [True: 2.25k, False: 2.50k] ------------------ 641| 4.76k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.12k, False: 1.13k] ------------------ 642| 2.25k| : make_full_pos(child, p.shift() - B) 643| 1.13k| .visit(v, idx, args...)) 644| 4.76k| : (is_leaf ------------------ | Branch (644:19): [True: 1.27k, False: 1.23k] ------------------ 645| 2.50k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.50k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.23k| .visit(v, idx, args...)); 648| 4.76k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 207| 2.90k| { 208| 2.90k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.90k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1405| 2.17k| { 1406| 2.17k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.17k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 1329| 2.17k| { 1330| 2.17k| return towards_oh(v, idx, offset_hint, args...); 1331| 2.17k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjDpOT0_: 1336| 2.17k| { 1337| 2.17k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.17k, False: 0] ------------------ 1338| 2.17k| auto is_leaf = shift_ == BL; 1339| 2.17k| auto child = node_->inner()[offset_hint]; 1340| 2.17k| return is_leaf ------------------ | Branch (1340:16): [True: 1.41k, False: 759] ------------------ 1341| 2.17k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.17k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.17k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 112| 1.86k| { 113| 1.86k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.86k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 336| 1.75k| { 337| 1.75k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.75k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 316| 1.75k| { 317| 1.75k| return towards_oh_ch_regular( 318| 1.75k| *this, v, idx, offset_hint, count(), args...); 319| 1.75k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_: 632| 1.75k|{ 633| 1.75k| constexpr auto B = bits; 634| 1.75k| constexpr auto BL = bits_leaf; 635| 1.75k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 1.75k, False: 0] ------------------ 636| 1.75k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 1.75k, False: 0] ------------------ 637| 1.75k| auto is_leaf = p.shift() == BL; 638| 1.75k| auto child = p.node()->inner()[offset_hint]; 639| 1.75k| auto is_full = offset_hint + 1 != count_hint; 640| 1.75k| return is_full ------------------ | Branch (640:12): [True: 645, False: 1.11k] ------------------ 641| 1.75k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 365, False: 280] ------------------ 642| 645| : make_full_pos(child, p.shift() - B) 643| 280| .visit(v, idx, args...)) 644| 1.75k| : (is_leaf ------------------ | Branch (644:19): [True: 591, False: 522] ------------------ 645| 1.11k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.11k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 522| .visit(v, idx, args...)); 648| 1.75k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_: 1036| 2.64k| { 1037| 2.64k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.64k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 43.5k|{ 1839| 43.5k| assert(node); ------------------ | Branch (1839:5): [True: 43.5k, False: 0] ------------------ 1840| 43.5k| auto relaxed = node->relaxed(); 1841| 43.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 31.0k, False: 12.5k] ------------------ 1842| 31.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 31.0k, False: 0] ------------------ 1843| 31.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 31.0k| .visit(v, std::forward(args)...); 1845| 31.0k| } else { 1846| 12.5k| return make_regular_sub_pos(node, shift, size) 1847| 12.5k| .visit(v, std::forward(args)...); 1848| 12.5k| } 1849| 43.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 31.0k| { 1814| 31.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 31.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 14.4k| { 1687| 14.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 14.4k, False: 0] ------------------ 1688| 14.4k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 14.4k] ------------------ 1689| 14.4k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 14.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 14.4k| { 1699| 14.4k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 14.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 14.4k| { 1718| 14.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 14.4k, False: 0] ------------------ 1719| 14.4k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 14.4k] | Branch (1719:9): [True: 14.4k, False: 0] ------------------ 1720| 14.4k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 14.4k| auto child = node_->inner()[offset_hint]; 1722| 14.4k| auto is_leaf = shift_ == BL; 1723| 14.4k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 14.4k| auto next_idx = idx - left_size_hint; 1725| 14.4k| return is_leaf ------------------ | Branch (1725:16): [True: 869, False: 13.5k] ------------------ 1726| 14.4k| ? make_leaf_sub_pos(child, next_size) 1727| 869| .visit(v, next_idx, args...) 1728| 14.4k| : visit_maybe_relaxed_sub( 1729| 13.5k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 14.4k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 869| { 145| 869| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 869| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 13.8k| { 1687| 13.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 13.8k, False: 0] ------------------ 1688| 13.8k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 13.8k] ------------------ 1689| 13.8k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 13.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 13.8k| { 1699| 13.8k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 13.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 13.8k| { 1718| 13.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 13.8k, False: 0] ------------------ 1719| 13.8k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 13.8k] | Branch (1719:9): [True: 13.8k, False: 0] ------------------ 1720| 13.8k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 13.8k| auto child = node_->inner()[offset_hint]; 1722| 13.8k| auto is_leaf = shift_ == BL; 1723| 13.8k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 13.8k| auto next_idx = idx - left_size_hint; 1725| 13.8k| return is_leaf ------------------ | Branch (1725:16): [True: 966, False: 12.8k] ------------------ 1726| 13.8k| ? make_leaf_sub_pos(child, next_size) 1727| 966| .visit(v, next_idx, args...) 1728| 13.8k| : visit_maybe_relaxed_sub( 1729| 12.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 13.8k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 966| { 145| 966| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 966| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 12.8k|{ 1839| 12.8k| assert(node); ------------------ | Branch (1839:5): [True: 12.8k, False: 0] ------------------ 1840| 12.8k| auto relaxed = node->relaxed(); 1841| 12.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.6k, False: 1.21k] ------------------ 1842| 11.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.6k, False: 0] ------------------ 1843| 11.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.6k| .visit(v, std::forward(args)...); 1845| 11.6k| } else { 1846| 1.21k| return make_regular_sub_pos(node, shift, size) 1847| 1.21k| .visit(v, std::forward(args)...); 1848| 1.21k| } 1849| 12.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 11.6k| { 1814| 11.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.6k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.21k| { 1037| 1.21k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.21k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 2.69k| { 928| 2.69k| return towards_oh_ch_regular( 929| 2.69k| *this, v, idx, offset_hint, count(), args...); 930| 2.69k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 2.69k|{ 633| 2.69k| constexpr auto B = bits; 634| 2.69k| constexpr auto BL = bits_leaf; 635| 2.69k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.69k, False: 0] ------------------ 636| 2.69k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.69k, False: 0] ------------------ 637| 2.69k| auto is_leaf = p.shift() == BL; 638| 2.69k| auto child = p.node()->inner()[offset_hint]; 639| 2.69k| auto is_full = offset_hint + 1 != count_hint; 640| 2.69k| return is_full ------------------ | Branch (640:12): [True: 2.28k, False: 412] ------------------ 641| 2.69k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 691, False: 1.59k] ------------------ 642| 2.28k| : make_full_pos(child, p.shift() - B) 643| 1.59k| .visit(v, idx, args...)) 644| 2.69k| : (is_leaf ------------------ | Branch (644:19): [True: 412, False: 0] ------------------ 645| 412| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 412| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.69k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 1.95k| { 208| 1.95k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.95k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_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_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 1.50k| { 1337| 1.50k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.50k, False: 0] ------------------ 1338| 1.50k| auto is_leaf = shift_ == BL; 1339| 1.50k| auto child = node_->inner()[offset_hint]; 1340| 1.50k| return is_leaf ------------------ | Branch (1340:16): [True: 1.25k, False: 245] ------------------ 1341| 1.50k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.50k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.50k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 2.37k| { 1337| 2.37k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.37k, False: 0] ------------------ 1338| 2.37k| auto is_leaf = shift_ == BL; 1339| 2.37k| auto child = node_->inner()[offset_hint]; 1340| 2.37k| return is_leaf ------------------ | Branch (1340:16): [True: 1.39k, False: 980] ------------------ 1341| 2.37k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.37k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.37k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 3.24k| { 208| 3.24k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.24k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.72k| { 1406| 3.72k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.72k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 3.36k| { 1406| 3.36k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.36k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 9.58k| { 1337| 9.58k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 9.58k, False: 0] ------------------ 1338| 9.58k| auto is_leaf = shift_ == BL; 1339| 9.58k| auto child = node_->inner()[offset_hint]; 1340| 9.58k| return is_leaf ------------------ | Branch (1340:16): [True: 7.38k, False: 2.19k] ------------------ 1341| 9.58k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 9.58k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 9.58k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 10.1k| { 208| 10.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.1k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 5.12k| { 1406| 5.12k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.12k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 3.41k| { 1311| 3.41k| each_i(v, start, branches, args...); 1312| 3.41k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 3.41k| { 1264| 3.41k| auto p = node_->inner() + i; 1265| 3.41k| auto e = node_->inner() + n; 1266| 3.41k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 1.99k, False: 1.42k] ------------------ 1267| 12.9k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 10.9k, False: 1.99k] ------------------ 1268| 10.9k| IMMER_PREFETCH(p + 1); 1269| 10.9k| make_full_leaf_pos(*p).visit(v, args...); 1270| 10.9k| } 1271| 1.99k| } else { 1272| 1.42k| auto ss = shift_ - B; 1273| 10.8k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 9.41k, False: 1.42k] ------------------ 1274| 9.41k| make_full_pos(*p, ss).visit(v, args...); 1275| 1.42k| } 1276| 3.41k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 412| { 113| 412| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 412| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 305| 2.75k| { 306| 2.75k| return towards_oh_ch_regular( 307| 2.75k| *this, v, idx, offset_hint, count(), args...); 308| 2.75k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 2.75k|{ 633| 2.75k| constexpr auto B = bits; 634| 2.75k| constexpr auto BL = bits_leaf; 635| 2.75k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.75k, False: 0] ------------------ 636| 2.75k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.75k, False: 0] ------------------ 637| 2.75k| auto is_leaf = p.shift() == BL; 638| 2.75k| auto child = p.node()->inner()[offset_hint]; 639| 2.75k| auto is_full = offset_hint + 1 != count_hint; 640| 2.75k| return is_full ------------------ | Branch (640:12): [True: 1.89k, False: 859] ------------------ 641| 2.75k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 836, False: 1.05k] ------------------ 642| 1.89k| : make_full_pos(child, p.shift() - B) 643| 1.05k| .visit(v, idx, args...)) 644| 2.75k| : (is_leaf ------------------ | Branch (644:19): [True: 511, False: 348] ------------------ 645| 859| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 859| : make_regular_pos(child, p.shift() - B, p.size()) 647| 348| .visit(v, idx, args...)); 648| 2.75k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 1.37k| { 113| 1.37k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.37k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 336| 3.68k| { 337| 3.68k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.68k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 1.15k| { 337| 1.15k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.15k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 305| 4.19k| { 306| 4.19k| return towards_oh_ch_regular( 307| 4.19k| *this, v, idx, offset_hint, count(), args...); 308| 4.19k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 4.19k|{ 633| 4.19k| constexpr auto B = bits; 634| 4.19k| constexpr auto BL = bits_leaf; 635| 4.19k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.19k, False: 0] ------------------ 636| 4.19k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.19k, False: 0] ------------------ 637| 4.19k| auto is_leaf = p.shift() == BL; 638| 4.19k| auto child = p.node()->inner()[offset_hint]; 639| 4.19k| auto is_full = offset_hint + 1 != count_hint; 640| 4.19k| return is_full ------------------ | Branch (640:12): [True: 1.99k, False: 2.20k] ------------------ 641| 4.19k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.08k, False: 903] ------------------ 642| 1.99k| : make_full_pos(child, p.shift() - B) 643| 903| .visit(v, idx, args...)) 644| 4.19k| : (is_leaf ------------------ | Branch (644:19): [True: 1.41k, False: 793] ------------------ 645| 2.20k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.20k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 793| .visit(v, idx, args...)); 648| 4.19k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 2.18k| { 113| 2.18k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.18k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 336| 3.26k| { 337| 3.26k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.26k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 2.75k| { 286| 2.75k| return each_right_regular(*this, v, start, args...); 287| 2.75k| } _ZN5immer6detail4rbts18each_right_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 597| 2.75k|{ 598| 2.75k| constexpr auto B = bits; 599| 2.75k| constexpr auto BL = bits_leaf; 600| | 601| 2.75k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 1.34k, False: 1.40k] ------------------ 602| 1.34k| auto n = p.node()->inner() + start; 603| 1.34k| auto last = p.count() - 1; 604| 1.34k| auto e = p.node()->inner() + last; 605| 1.34k| if (n <= e) { ------------------ | Branch (605:13): [True: 836, False: 511] ------------------ 606| 3.12k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 2.29k, False: 836] ------------------ 607| 2.29k| IMMER_PREFETCH(n + 1); 608| 2.29k| make_full_leaf_pos(*n).visit(v, args...); 609| 2.29k| } 610| 836| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 836| } 612| 1.40k| } else { 613| 1.40k| auto n = p.node()->inner() + start; 614| 1.40k| auto last = p.count() - 1; 615| 1.40k| auto e = p.node()->inner() + last; 616| 1.40k| auto ss = p.shift() - B; 617| 1.40k| if (n <= e) { ------------------ | Branch (617:13): [True: 1.05k, False: 348] ------------------ 618| 2.84k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.78k, False: 1.05k] ------------------ 619| 1.78k| make_full_pos(*n, ss).visit(v, args...); 620| 1.05k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 1.05k| } 622| 1.40k| } 623| 2.75k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 6.90k| { 928| 6.90k| return towards_oh_ch_regular( 929| 6.90k| *this, v, idx, offset_hint, count(), args...); 930| 6.90k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 6.90k|{ 633| 6.90k| constexpr auto B = bits; 634| 6.90k| constexpr auto BL = bits_leaf; 635| 6.90k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.90k, False: 0] ------------------ 636| 6.90k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.90k, False: 0] ------------------ 637| 6.90k| auto is_leaf = p.shift() == BL; 638| 6.90k| auto child = p.node()->inner()[offset_hint]; 639| 6.90k| auto is_full = offset_hint + 1 != count_hint; 640| 6.90k| return is_full ------------------ | Branch (640:12): [True: 2.70k, False: 4.20k] ------------------ 641| 6.90k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.01k, False: 1.69k] ------------------ 642| 2.70k| : make_full_pos(child, p.shift() - B) 643| 1.69k| .visit(v, idx, args...)) 644| 6.90k| : (is_leaf ------------------ | Branch (644:19): [True: 861, False: 3.34k] ------------------ 645| 4.20k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.20k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.34k| .visit(v, idx, args...)); 648| 6.90k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 6.93k| { 928| 6.93k| return towards_oh_ch_regular( 929| 6.93k| *this, v, idx, offset_hint, count(), args...); 930| 6.93k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 6.93k|{ 633| 6.93k| constexpr auto B = bits; 634| 6.93k| constexpr auto BL = bits_leaf; 635| 6.93k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.93k, False: 0] ------------------ 636| 6.93k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.93k, False: 0] ------------------ 637| 6.93k| auto is_leaf = p.shift() == BL; 638| 6.93k| auto child = p.node()->inner()[offset_hint]; 639| 6.93k| auto is_full = offset_hint + 1 != count_hint; 640| 6.93k| return is_full ------------------ | Branch (640:12): [True: 3.69k, False: 3.23k] ------------------ 641| 6.93k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.67k, False: 2.02k] ------------------ 642| 3.69k| : make_full_pos(child, p.shift() - B) 643| 2.02k| .visit(v, idx, args...)) 644| 6.93k| : (is_leaf ------------------ | Branch (644:19): [True: 769, False: 2.46k] ------------------ 645| 3.23k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.23k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.46k| .visit(v, idx, args...)); 648| 6.93k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 867| 12.0k| { 868| 12.0k| return each_right_regular(*this, v, start, args...); 869| 12.0k| } _ZN5immer6detail4rbts18each_right_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 597| 12.0k|{ 598| 12.0k| constexpr auto B = bits; 599| 12.0k| constexpr auto BL = bits_leaf; 600| | 601| 12.0k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 3.63k, False: 8.40k] ------------------ 602| 3.63k| auto n = p.node()->inner() + start; 603| 3.63k| auto last = p.count() - 1; 604| 3.63k| auto e = p.node()->inner() + last; 605| 3.63k| if (n <= e) { ------------------ | Branch (605:13): [True: 2.00k, False: 1.63k] ------------------ 606| 4.17k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 2.16k, False: 2.00k] ------------------ 607| 2.16k| IMMER_PREFETCH(n + 1); 608| 2.16k| make_full_leaf_pos(*n).visit(v, args...); 609| 2.16k| } 610| 2.00k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 2.00k| } 612| 8.40k| } else { 613| 8.40k| auto n = p.node()->inner() + start; 614| 8.40k| auto last = p.count() - 1; 615| 8.40k| auto e = p.node()->inner() + last; 616| 8.40k| auto ss = p.shift() - B; 617| 8.40k| if (n <= e) { ------------------ | Branch (617:13): [True: 5.06k, False: 3.34k] ------------------ 618| 6.06k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 998, False: 5.06k] ------------------ 619| 998| make_full_pos(*n, ss).visit(v, args...); 620| 5.06k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 5.06k| } 622| 8.40k| } 623| 12.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 20.8k| { 1814| 20.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 20.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 9.37k| { 1687| 9.37k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 9.37k, False: 0] ------------------ 1688| 9.37k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 8.96k, False: 406] ------------------ 1689| 9.37k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 9.37k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 9.37k| { 1699| 9.37k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 9.37k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 9.37k| { 1718| 9.37k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 9.37k, False: 0] ------------------ 1719| 9.37k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 8.96k, False: 406] | Branch (1719:9): [True: 9.37k, False: 0] ------------------ 1720| 9.37k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 9.37k| auto child = node_->inner()[offset_hint]; 1722| 9.37k| auto is_leaf = shift_ == BL; 1723| 9.37k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 9.37k| auto next_idx = idx - left_size_hint; 1725| 9.37k| return is_leaf ------------------ | Branch (1725:16): [True: 1.79k, False: 7.57k] ------------------ 1726| 9.37k| ? make_leaf_sub_pos(child, next_size) 1727| 1.79k| .visit(v, next_idx, args...) 1728| 9.37k| : visit_maybe_relaxed_sub( 1729| 7.57k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 9.37k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 1.79k| { 145| 1.79k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.79k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 7.57k|{ 1839| 7.57k| assert(node); ------------------ | Branch (1839:5): [True: 7.57k, False: 0] ------------------ 1840| 7.57k| auto relaxed = node->relaxed(); 1841| 7.57k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.76k, False: 4.80k] ------------------ 1842| 2.76k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.76k, False: 0] ------------------ 1843| 2.76k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.76k| .visit(v, std::forward(args)...); 1845| 4.80k| } else { 1846| 4.80k| return make_regular_sub_pos(node, shift, size) 1847| 4.80k| .visit(v, std::forward(args)...); 1848| 4.80k| } 1849| 7.57k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 2.76k| { 1814| 2.76k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.76k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 4.80k| { 1037| 4.80k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.80k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1036| 10.1k| { 1037| 10.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 11.6k| { 1687| 11.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 11.6k, False: 0] ------------------ 1688| 11.6k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.88k, False: 1.75k] ------------------ 1689| 11.6k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 11.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 11.6k| { 1699| 11.6k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 11.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 11.6k| { 1718| 11.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 11.6k, False: 0] ------------------ 1719| 11.6k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.88k, False: 1.75k] | Branch (1719:9): [True: 11.6k, False: 0] ------------------ 1720| 11.6k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 11.6k| auto child = node_->inner()[offset_hint]; 1722| 11.6k| auto is_leaf = shift_ == BL; 1723| 11.6k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 11.6k| auto next_idx = idx - left_size_hint; 1725| 11.6k| return is_leaf ------------------ | Branch (1725:16): [True: 4.69k, False: 6.95k] ------------------ 1726| 11.6k| ? make_leaf_sub_pos(child, next_size) 1727| 4.69k| .visit(v, next_idx, args...) 1728| 11.6k| : visit_maybe_relaxed_sub( 1729| 6.95k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 11.6k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 4.69k| { 145| 4.69k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.69k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 6.95k|{ 1839| 6.95k| assert(node); ------------------ | Branch (1839:5): [True: 6.95k, False: 0] ------------------ 1840| 6.95k| auto relaxed = node->relaxed(); 1841| 6.95k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.81k, False: 3.13k] ------------------ 1842| 3.81k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.81k, False: 0] ------------------ 1843| 3.81k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.81k| .visit(v, std::forward(args)...); 1845| 3.81k| } else { 1846| 3.13k| return make_regular_sub_pos(node, shift, size) 1847| 3.13k| .visit(v, std::forward(args)...); 1848| 3.13k| } 1849| 6.95k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 3.81k| { 1814| 3.81k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.81k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 3.13k| { 1037| 3.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.13k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_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: 2.66k, False: 21.1k] ------------------ 1659| 9.52k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 6.85k, False: 2.66k] ------------------ 1660| 6.85k| IMMER_PREFETCH(p + i + 1); 1661| 6.85k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 6.85k| .visit(v, args...); 1663| 6.85k| s = relaxed_->d.sizes[i]; 1664| 6.85k| assert(s); ------------------ | Branch (1664:17): [True: 6.85k, False: 0] ------------------ 1665| 6.85k| } 1666| 21.1k| } else { 1667| 21.1k| auto ss = shift_ - B; 1668| 111k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 89.9k, False: 21.1k] ------------------ 1669| 89.9k| visit_maybe_relaxed_sub( 1670| 89.9k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 89.9k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 89.9k, False: 0] ------------------ 1673| 89.9k| } 1674| 21.1k| } 1675| 23.8k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 12.5k| { 1037| 12.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 12.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 5.13k| { 928| 5.13k| return towards_oh_ch_regular( 929| 5.13k| *this, v, idx, offset_hint, count(), args...); 930| 5.13k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 5.13k|{ 633| 5.13k| constexpr auto B = bits; 634| 5.13k| constexpr auto BL = bits_leaf; 635| 5.13k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.13k, False: 0] ------------------ 636| 5.13k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.13k, False: 0] ------------------ 637| 5.13k| auto is_leaf = p.shift() == BL; 638| 5.13k| auto child = p.node()->inner()[offset_hint]; 639| 5.13k| auto is_full = offset_hint + 1 != count_hint; 640| 5.13k| return is_full ------------------ | Branch (640:12): [True: 4.36k, False: 773] ------------------ 641| 5.13k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 994, False: 3.37k] ------------------ 642| 4.36k| : make_full_pos(child, p.shift() - B) 643| 3.37k| .visit(v, idx, args...)) 644| 5.13k| : (is_leaf ------------------ | Branch (644:19): [True: 773, False: 0] ------------------ 645| 773| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 773| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.13k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 1.59k| { 208| 1.59k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.59k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.81k| { 1406| 3.81k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.81k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 1.03k| { 1337| 1.03k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.03k, False: 0] ------------------ 1338| 1.03k| auto is_leaf = shift_ == BL; 1339| 1.03k| auto child = node_->inner()[offset_hint]; 1340| 1.03k| return is_leaf ------------------ | Branch (1340:16): [True: 596, False: 441] ------------------ 1341| 1.03k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.03k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.03k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 773| { 113| 773| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 773| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 943| { 145| 943| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 943| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 61.9k|{ 1839| 61.9k| assert(node); ------------------ | Branch (1839:5): [True: 61.9k, False: 0] ------------------ 1840| 61.9k| auto relaxed = node->relaxed(); 1841| 61.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 59.3k, False: 2.60k] ------------------ 1842| 59.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 59.3k, False: 0] ------------------ 1843| 59.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 59.3k| .visit(v, std::forward(args)...); 1845| 59.3k| } else { 1846| 2.60k| return make_regular_sub_pos(node, shift, size) 1847| 2.60k| .visit(v, std::forward(args)...); 1848| 2.60k| } 1849| 61.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 59.3k| { 1814| 59.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 59.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 2.17k| { 1706| 2.17k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 2.17k, False: 0] ------------------ 1707| 2.17k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 1.74k, False: 433] ------------------ 1708| 2.17k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 2.17k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 2.17k| { 1718| 2.17k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 2.17k, False: 0] ------------------ 1719| 2.17k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 1.74k, False: 433] | Branch (1719:9): [True: 2.17k, False: 0] ------------------ 1720| 2.17k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 2.17k| auto child = node_->inner()[offset_hint]; 1722| 2.17k| auto is_leaf = shift_ == BL; 1723| 2.17k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 2.17k| auto next_idx = idx - left_size_hint; 1725| 2.17k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 2.17k] ------------------ 1726| 2.17k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 2.17k| : visit_maybe_relaxed_sub( 1729| 2.17k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 2.17k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 3.35k| { 1706| 3.35k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.35k, False: 0] ------------------ 1707| 3.35k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 2.85k, False: 505] ------------------ 1708| 3.35k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.35k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 3.35k| { 1718| 3.35k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.35k, False: 0] ------------------ 1719| 3.35k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 2.85k, False: 505] | Branch (1719:9): [True: 3.35k, False: 0] ------------------ 1720| 3.35k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.35k| auto child = node_->inner()[offset_hint]; 1722| 3.35k| auto is_leaf = shift_ == BL; 1723| 3.35k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.35k| auto next_idx = idx - left_size_hint; 1725| 3.35k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.35k] ------------------ 1726| 3.35k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.35k| : visit_maybe_relaxed_sub( 1729| 3.35k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.35k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 3.35k|{ 1839| 3.35k| assert(node); ------------------ | Branch (1839:5): [True: 3.35k, False: 0] ------------------ 1840| 3.35k| auto relaxed = node->relaxed(); 1841| 3.35k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.17k, False: 1.17k] ------------------ 1842| 2.17k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.17k, False: 0] ------------------ 1843| 2.17k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.17k| .visit(v, std::forward(args)...); 1845| 2.17k| } else { 1846| 1.17k| return make_regular_sub_pos(node, shift, size) 1847| 1.17k| .visit(v, std::forward(args)...); 1848| 1.17k| } 1849| 3.35k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 2.17k| { 1814| 2.17k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.17k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.17k| { 1037| 1.17k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.17k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 1.50k| { 947| 1.50k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 1.50k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_22slice_left_mut_visitorISD_Lb1ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 1.50k|{ 654| 1.50k| constexpr auto B = bits; 655| 1.50k| constexpr auto BL = bits_leaf; 656| 1.50k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 1.50k, False: 0] ------------------ 657| 1.50k| auto is_leaf = p.shift() == BL; 658| 1.50k| auto child = p.node()->inner()[offset_hint]; 659| 1.50k| auto lsize = offset_hint << p.shift(); 660| 1.50k| auto size = p.this_size(); 661| 1.50k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 1.50k| return is_full ------------------ | Branch (662:12): [True: 493, False: 1.01k] ------------------ 663| 1.50k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 493] ------------------ 664| 493| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 493| : make_full_pos(child, p.shift() - B) 666| 493| .visit(v, idx - lsize, args...)) 667| 1.50k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.01k] ------------------ 668| 1.01k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.01k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.01k| .visit(v, idx - lsize, args...)); 672| 1.50k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 493| { 1406| 493| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 493| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 2.75k| { 1349| 2.75k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 2.75k, False: 0] ------------------ 1350| 2.75k| auto is_leaf = shift_ == BL; 1351| 2.75k| auto child = node_->inner()[offset_hint]; 1352| 2.75k| auto lsize = size_t{offset_hint} << shift_; 1353| 2.75k| return is_leaf ------------------ | Branch (1353:16): [True: 2.08k, False: 666] ------------------ 1354| 2.75k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 2.75k| : make_full_pos(child, shift_ - B) 1356| 666| .visit(v, idx - lsize, args...); 1357| 2.75k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 8.05k| { 208| 8.05k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 8.05k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 2.25k| { 1406| 2.25k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.25k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.01k| { 1037| 1.01k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.01k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 7.56k| { 947| 7.56k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 7.56k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_22slice_left_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 7.56k|{ 654| 7.56k| constexpr auto B = bits; 655| 7.56k| constexpr auto BL = bits_leaf; 656| 7.56k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 7.56k, False: 0] ------------------ 657| 7.56k| auto is_leaf = p.shift() == BL; 658| 7.56k| auto child = p.node()->inner()[offset_hint]; 659| 7.56k| auto lsize = offset_hint << p.shift(); 660| 7.56k| auto size = p.this_size(); 661| 7.56k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 7.56k| return is_full ------------------ | Branch (662:12): [True: 7.56k, False: 0] ------------------ 663| 7.56k| ? (is_leaf ------------------ | Branch (663:19): [True: 5.97k, False: 1.59k] ------------------ 664| 7.56k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 7.56k| : make_full_pos(child, p.shift() - B) 666| 1.59k| .visit(v, idx - lsize, args...)) 667| 7.56k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 7.56k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 2.17k| { 1814| 2.17k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.17k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 209k| { 1706| 209k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 209k, False: 0] ------------------ 1707| 209k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 48.3k, False: 161k] ------------------ 1708| 209k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 209k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 209k| { 1718| 209k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 209k, False: 0] ------------------ 1719| 209k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 48.3k, False: 161k] | Branch (1719:9): [True: 209k, False: 0] ------------------ 1720| 209k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 209k| auto child = node_->inner()[offset_hint]; 1722| 209k| auto is_leaf = shift_ == BL; 1723| 209k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 209k| auto next_idx = idx - left_size_hint; 1725| 209k| return is_leaf ------------------ | Branch (1725:16): [True: 4.53k, False: 205k] ------------------ 1726| 209k| ? make_leaf_sub_pos(child, next_size) 1727| 4.53k| .visit(v, next_idx, args...) 1728| 209k| : visit_maybe_relaxed_sub( 1729| 205k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 209k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 4.53k| { 145| 4.53k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.53k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 205k|{ 1839| 205k| assert(node); ------------------ | Branch (1839:5): [True: 205k, False: 0] ------------------ 1840| 205k| auto relaxed = node->relaxed(); 1841| 205k| if (relaxed) { ------------------ | Branch (1841:9): [True: 203k, False: 2.20k] ------------------ 1842| 203k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 203k, False: 0] ------------------ 1843| 203k| return make_relaxed_pos(node, shift, relaxed) 1844| 203k| .visit(v, std::forward(args)...); 1845| 203k| } else { 1846| 2.20k| return make_regular_sub_pos(node, shift, size) 1847| 2.20k| .visit(v, std::forward(args)...); 1848| 2.20k| } 1849| 205k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 203k| { 1814| 203k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 203k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 2.20k| { 1037| 2.20k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.20k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 96.9k| { 1706| 96.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 96.9k, False: 0] ------------------ 1707| 96.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 62.6k, False: 34.3k] ------------------ 1708| 96.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 96.9k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 96.9k| { 1718| 96.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 96.9k, False: 0] ------------------ 1719| 96.9k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 62.6k, False: 34.3k] | Branch (1719:9): [True: 96.9k, False: 0] ------------------ 1720| 96.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 96.9k| auto child = node_->inner()[offset_hint]; 1722| 96.9k| auto is_leaf = shift_ == BL; 1723| 96.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 96.9k| auto next_idx = idx - left_size_hint; 1725| 96.9k| return is_leaf ------------------ | Branch (1725:16): [True: 47.1k, False: 49.8k] ------------------ 1726| 96.9k| ? make_leaf_sub_pos(child, next_size) 1727| 47.1k| .visit(v, next_idx, args...) 1728| 96.9k| : visit_maybe_relaxed_sub( 1729| 49.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 96.9k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 47.1k| { 145| 47.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 47.1k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 49.8k|{ 1839| 49.8k| assert(node); ------------------ | Branch (1839:5): [True: 49.8k, False: 0] ------------------ 1840| 49.8k| auto relaxed = node->relaxed(); 1841| 49.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 47.7k, False: 2.07k] ------------------ 1842| 47.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 47.7k, False: 0] ------------------ 1843| 47.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 47.7k| .visit(v, std::forward(args)...); 1845| 47.7k| } else { 1846| 2.07k| return make_regular_sub_pos(node, shift, size) 1847| 2.07k| .visit(v, std::forward(args)...); 1848| 2.07k| } 1849| 49.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 47.7k| { 1814| 47.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 47.7k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 2.07k| { 1037| 2.07k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.07k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 2.60k| { 1037| 2.60k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.60k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcPT_jmT0_DpOT1_: 1838| 21.3k|{ 1839| 21.3k| assert(node); ------------------ | Branch (1839:5): [True: 21.3k, False: 0] ------------------ 1840| 21.3k| auto relaxed = node->relaxed(); 1841| 21.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.5k, False: 8.79k] ------------------ 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| 8.79k| return make_regular_sub_pos(node, shift, size) 1847| 8.79k| .visit(v, std::forward(args)...); 1848| 8.79k| } 1849| 21.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcT_DpOT0_: 1813| 12.5k| { 1814| 12.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 12.5k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcPT_jmT0_DpOT1_: 1838| 12.5k|{ 1839| 12.5k| assert(node); ------------------ | Branch (1839:5): [True: 12.5k, False: 0] ------------------ 1840| 12.5k| auto relaxed = node->relaxed(); 1841| 12.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.64k, False: 2.93k] ------------------ 1842| 9.64k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.64k, False: 0] ------------------ 1843| 9.64k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.64k| .visit(v, std::forward(args)...); 1845| 9.64k| } else { 1846| 2.93k| return make_regular_sub_pos(node, shift, size) 1847| 2.93k| .visit(v, std::forward(args)...); 1848| 2.93k| } 1849| 12.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1813| 9.64k| { 1814| 9.64k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 9.64k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 54.6k| { 1794| 54.6k| auto child = node_->inner()[offset]; 1795| 54.6k| auto child_size = size(offset); 1796| 54.6k| auto is_leaf = shift_ == BL; 1797| 54.6k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 25.4k, False: 29.1k] ------------------ 1798| 54.6k| : visit_maybe_relaxed_sub( 1799| 29.1k| child, shift_ - B, child_size, v, args...); 1800| 54.6k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 26.0k| { 145| 26.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 26.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1804| 26.0k| { 1805| 26.0k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 26.0k, False: 0] ------------------ 1806| 26.0k| auto child = node_->inner()[offset]; 1807| 26.0k| auto child_size = size(offset); 1808| 26.0k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 26.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 26.6k| { 145| 26.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 26.6k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 29.1k|{ 1839| 29.1k| assert(node); ------------------ | Branch (1839:5): [True: 29.1k, False: 0] ------------------ 1840| 29.1k| auto relaxed = node->relaxed(); 1841| 29.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 24.3k, False: 4.86k] ------------------ 1842| 24.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 24.3k, False: 0] ------------------ 1843| 24.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 24.3k| .visit(v, std::forward(args)...); 1845| 24.3k| } else { 1846| 4.86k| return make_regular_sub_pos(node, shift, size) 1847| 4.86k| .visit(v, std::forward(args)...); 1848| 4.86k| } 1849| 29.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 24.3k| { 1814| 24.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 24.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 24.3k| { 1794| 24.3k| auto child = node_->inner()[offset]; 1795| 24.3k| auto child_size = size(offset); 1796| 24.3k| auto is_leaf = shift_ == BL; 1797| 24.3k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 24.3k] ------------------ 1798| 24.3k| : visit_maybe_relaxed_sub( 1799| 24.3k| child, shift_ - B, child_size, v, args...); 1800| 24.3k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_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: 23.4k, False: 873] ------------------ 1842| 23.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 23.4k, False: 0] ------------------ 1843| 23.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 23.4k| .visit(v, std::forward(args)...); 1845| 23.4k| } else { 1846| 873| return make_regular_sub_pos(node, shift, size) 1847| 873| .visit(v, std::forward(args)...); 1848| 873| } 1849| 24.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 23.4k| { 1814| 23.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 23.4k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 1.19k| { 1037| 1.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.19k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 7.97k| { 1794| 7.97k| auto child = node_->inner()[offset]; 1795| 7.97k| auto child_size = size(offset); 1796| 7.97k| auto is_leaf = shift_ == BL; 1797| 7.97k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 5.21k, False: 2.76k] ------------------ 1798| 7.97k| : visit_maybe_relaxed_sub( 1799| 2.76k| child, shift_ - B, child_size, v, args...); 1800| 7.97k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 5.21k| { 145| 5.21k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.21k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1025| 5.21k| { 1026| 5.21k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 5.21k, False: 0] ------------------ 1027| 5.21k| auto child = node_->inner()[idx]; 1028| 5.21k| auto lsize = size(idx); 1029| 5.21k| auto is_full = idx + 1 < count(); 1030| 5.21k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 4.56k, False: 649] ------------------ 1031| 5.21k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 5.21k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 207| 12.4k| { 208| 12.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 12.4k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.76k|{ 1839| 2.76k| assert(node); ------------------ | Branch (1839:5): [True: 2.76k, False: 0] ------------------ 1840| 2.76k| auto relaxed = node->relaxed(); 1841| 2.76k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.94k, False: 819] ------------------ 1842| 1.94k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.94k, False: 0] ------------------ 1843| 1.94k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.94k| .visit(v, std::forward(args)...); 1845| 1.94k| } else { 1846| 819| return make_regular_sub_pos(node, shift, size) 1847| 819| .visit(v, std::forward(args)...); 1848| 819| } 1849| 2.76k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 1.94k| { 1814| 1.94k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.94k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1007| 1.94k| { 1008| 1.94k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 1.94k, False: 0] ------------------ 1009| 1.94k| auto is_leaf = shift_ == BL; 1010| 1.94k| auto child = node_->inner()[idx]; 1011| 1.94k| auto lsize = size(idx); 1012| 1.94k| auto is_full = idx + 1 < count(); 1013| 1.94k| return is_full ------------------ | Branch (1013:16): [True: 1.62k, False: 324] ------------------ 1014| 1.94k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.62k] ------------------ 1015| 1.62k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.62k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 1.94k| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 324] ------------------ 1018| 324| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 324| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 324| .visit(v, args...)); 1021| 1.94k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1405| 2.23k| { 1406| 2.23k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.23k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 9.33k| { 1794| 9.33k| auto child = node_->inner()[offset]; 1795| 9.33k| auto child_size = size(offset); 1796| 9.33k| auto is_leaf = shift_ == BL; 1797| 9.33k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 7.85k, False: 1.47k] ------------------ 1798| 9.33k| : visit_maybe_relaxed_sub( 1799| 1.47k| child, shift_ - B, child_size, v, args...); 1800| 9.33k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 7.85k| { 145| 7.85k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.85k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1396| 7.85k| { 1397| 7.85k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 7.85k, False: 0] ------------------ 1398| 7.85k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 7.85k, False: 0] ------------------ 1399| 7.85k| auto child = node_->inner()[idx]; 1400| 7.85k| return make_full_leaf_pos(child).visit(v, args...); 1401| 7.85k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 1.47k|{ 1839| 1.47k| assert(node); ------------------ | Branch (1839:5): [True: 1.47k, False: 0] ------------------ 1840| 1.47k| auto relaxed = node->relaxed(); 1841| 1.47k| if (relaxed) { ------------------ | Branch (1841:9): [True: 606, False: 873] ------------------ 1842| 606| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 606, False: 0] ------------------ 1843| 606| return make_relaxed_pos(node, shift, relaxed) 1844| 606| .visit(v, std::forward(args)...); 1845| 873| } else { 1846| 873| return make_regular_sub_pos(node, shift, size) 1847| 873| .visit(v, std::forward(args)...); 1848| 873| } 1849| 1.47k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 606| { 1814| 606| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 606| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1386| 606| { 1387| 606| assert(idx < count()); ------------------ | Branch (1387:9): [True: 606, False: 0] ------------------ 1388| 606| auto is_leaf = shift_ == BL; 1389| 606| auto child = node_->inner()[idx]; 1390| 606| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 606] ------------------ 1391| 606| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 606| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 873| { 1037| 873| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 873| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1386| 873| { 1387| 873| assert(idx < count()); ------------------ | Branch (1387:9): [True: 873, False: 0] ------------------ 1388| 873| auto is_leaf = shift_ == BL; 1389| 873| auto child = node_->inner()[idx]; 1390| 873| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 873] ------------------ 1391| 873| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 873| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1405| 1.69k| { 1406| 1.69k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.69k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 1222| 4.67k| { 1223| 4.67k| auto p = node_->inner(); 1224| 4.67k| auto p2 = other->inner(); 1225| 4.67k| auto e = p + branches; 1226| 4.67k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 3.49k, False: 1.17k] ------------------ 1227| 23.7k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 21.6k, False: 2.03k] ------------------ 1228| 21.6k| IMMER_PREFETCH(p + 1); 1229| 21.6k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 1.46k, False: 20.2k] ------------------ 1230| 1.46k| return false; 1231| 21.6k| } 1232| 3.49k| } else { 1233| 1.17k| auto ss = shift_ - B; 1234| 7.79k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 7.07k, False: 716] ------------------ 1235| 7.07k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 460, False: 6.61k] ------------------ 1236| 460| return false; 1237| 1.17k| } 1238| 2.75k| return true; 1239| 4.67k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 29.6k| { 208| 29.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 29.6k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 12.5k| { 1406| 12.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 12.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 837| 5.51k| { 838| 5.51k| return each_pred_zip_regular(*this, v, other, args...); 839| 5.51k| } _ZN5immer6detail4rbts21each_pred_zip_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_14equals_visitorEJEEEbOT_T0_PNSt3__15decayISH_E4type6node_tEDpOT1_: 392| 5.51k|{ 393| 5.51k| constexpr auto B = bits; 394| 5.51k| constexpr auto BL = bits_leaf; 395| | 396| 5.51k| auto n = p.node()->inner(); 397| 5.51k| auto n2 = other->inner(); 398| 5.51k| auto last = p.count() - 1; 399| 5.51k| auto e = n + last; 400| 5.51k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.18k, False: 3.33k] ------------------ 401| 6.63k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 5.35k, False: 1.27k] ------------------ 402| 5.35k| IMMER_PREFETCH(n + 1); 403| 5.35k| IMMER_PREFETCH(n2 + 1); 404| 5.35k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 911, False: 4.44k] ------------------ 405| 911| return false; 406| 5.35k| } 407| 1.27k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 3.33k| } else { 409| 3.33k| auto ss = p.shift() - B; 410| 6.71k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 4.29k, False: 2.42k] ------------------ 411| 4.29k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 907, False: 3.38k] ------------------ 412| 907| return false; 413| 2.42k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 3.33k| } 415| 5.51k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 2.88k| { 113| 2.88k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.88k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 3.04k| { 337| 3.04k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.04k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 255| 2.75k| { 256| 2.75k| return each_pred_zip_regular(*this, v, other, args...); 257| 2.75k| } _ZN5immer6detail4rbts21each_pred_zip_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_14equals_visitorEJEEEbOT_T0_PNSt3__15decayISH_E4type6node_tEDpOT1_: 392| 2.75k|{ 393| 2.75k| constexpr auto B = bits; 394| 2.75k| constexpr auto BL = bits_leaf; 395| | 396| 2.75k| auto n = p.node()->inner(); 397| 2.75k| auto n2 = other->inner(); 398| 2.75k| auto last = p.count() - 1; 399| 2.75k| auto e = n + last; 400| 2.75k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.84k, False: 911] ------------------ 401| 4.20k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 2.59k, False: 1.61k] ------------------ 402| 2.59k| IMMER_PREFETCH(n + 1); 403| 2.59k| IMMER_PREFETCH(n2 + 1); 404| 2.59k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 228, False: 2.36k] ------------------ 405| 228| return false; 406| 2.59k| } 407| 1.61k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 1.84k| } else { 409| 911| auto ss = p.shift() - B; 410| 1.78k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 1.16k, False: 617] ------------------ 411| 1.16k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 294, False: 871] ------------------ 412| 294| return false; 413| 617| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 911| } 415| 2.75k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1386| 6.22k| { 1387| 6.22k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 6.22k, False: 0] ------------------ 1388| 6.22k| auto is_leaf = shift_ == BL; 1389| 6.22k| auto child = node_->inner()[idx]; 1390| 6.22k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 5.22k, False: 1.00k] ------------------ 1391| 6.22k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 6.22k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 207| 284k| { 208| 284k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 284k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_18region_for_visitorIiEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 4.72M|{ 1839| 4.72M| assert(node); ------------------ | Branch (1839:5): [True: 4.72M, False: 0] ------------------ 1840| 4.72M| auto relaxed = node->relaxed(); 1841| 4.72M| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.41M, False: 318k] ------------------ 1842| 4.41M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.41M, False: 0] ------------------ 1843| 4.41M| return make_relaxed_pos(node, shift, relaxed) 1844| 4.41M| .visit(v, std::forward(args)...); 1845| 4.41M| } else { 1846| 318k| return make_regular_sub_pos(node, shift, size) 1847| 318k| .visit(v, std::forward(args)...); 1848| 318k| } 1849| 4.72M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 4.41M| { 1814| 4.41M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.41M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 4.41M| { 1680| 4.41M| return towards_oh(v, idx, subindex(idx), args...); 1681| 4.41M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1686| 4.41M| { 1687| 4.41M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 4.41M, False: 0] ------------------ 1688| 4.41M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 3.06M, False: 1.34M] ------------------ 1689| 4.41M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 4.41M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_18region_for_visitorIiEEJEEEDcT_mjmDpOT0_: 1698| 4.41M| { 1699| 4.41M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 4.41M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_18region_for_visitorIiEEJEEEDcT_mjmDpOT0_: 1717| 4.41M| { 1718| 4.41M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.41M, False: 0] ------------------ 1719| 4.41M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.06M, False: 1.34M] | Branch (1719:9): [True: 4.41M, False: 0] ------------------ 1720| 4.41M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.41M| auto child = node_->inner()[offset_hint]; 1722| 4.41M| auto is_leaf = shift_ == BL; 1723| 4.41M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.41M| auto next_idx = idx - left_size_hint; 1725| 4.41M| return is_leaf ------------------ | Branch (1725:16): [True: 958k, False: 3.45M] ------------------ 1726| 4.41M| ? make_leaf_sub_pos(child, next_size) 1727| 958k| .visit(v, next_idx, args...) 1728| 4.41M| : visit_maybe_relaxed_sub( 1729| 3.45M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.41M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 144| 958k| { 145| 958k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 958k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 318k| { 1037| 318k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 318k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 318k| { 920| 318k| return towards_oh_ch_regular( 921| 318k| *this, v, idx, index(idx), count(), args...); 922| 318k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_18region_for_visitorIiEEJEEEDcOT_T0_mjjDpOT1_: 632| 318k|{ 633| 318k| constexpr auto B = bits; 634| 318k| constexpr auto BL = bits_leaf; 635| 318k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 318k, False: 0] ------------------ 636| 318k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 318k, False: 0] ------------------ 637| 318k| auto is_leaf = p.shift() == BL; 638| 318k| auto child = p.node()->inner()[offset_hint]; 639| 318k| auto is_full = offset_hint + 1 != count_hint; 640| 318k| return is_full ------------------ | Branch (640:12): [True: 271k, False: 46.9k] ------------------ 641| 318k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 70.6k, False: 200k] ------------------ 642| 271k| : make_full_pos(child, p.shift() - B) 643| 200k| .visit(v, idx, args...)) 644| 318k| : (is_leaf ------------------ | Branch (644:19): [True: 13.4k, False: 33.5k] ------------------ 645| 46.9k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 46.9k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 33.5k| .visit(v, idx, args...)); 648| 318k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 299k| { 208| 299k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 299k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 348k| { 1406| 348k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 348k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 348k| { 1323| 348k| return towards_oh(v, idx, index(idx), args...); 1324| 348k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 348k| { 1337| 348k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 348k, False: 0] ------------------ 1338| 348k| auto is_leaf = shift_ == BL; 1339| 348k| auto child = node_->inner()[offset_hint]; 1340| 348k| return is_leaf ------------------ | Branch (1340:16): [True: 214k, False: 133k] ------------------ 1341| 348k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 348k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 348k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 18.7k| { 113| 18.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 18.7k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 37.3k| { 337| 37.3k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 37.3k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 37.3k| { 298| 37.3k| return towards_oh_ch_regular( 299| 37.3k| *this, v, idx, index(idx), count(), args...); 300| 37.3k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_18region_for_visitorIiEEJEEEDcOT_T0_mjjDpOT1_: 632| 37.3k|{ 633| 37.3k| constexpr auto B = bits; 634| 37.3k| constexpr auto BL = bits_leaf; 635| 37.3k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 37.3k, False: 0] ------------------ 636| 37.3k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 37.3k, False: 0] ------------------ 637| 37.3k| auto is_leaf = p.shift() == BL; 638| 37.3k| auto child = p.node()->inner()[offset_hint]; 639| 37.3k| auto is_full = offset_hint + 1 != count_hint; 640| 37.3k| return is_full ------------------ | Branch (640:12): [True: 28.1k, False: 9.13k] ------------------ 641| 37.3k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 14.0k, False: 14.1k] ------------------ 642| 28.1k| : make_full_pos(child, p.shift() - B) 643| 14.1k| .visit(v, idx, args...)) 644| 37.3k| : (is_leaf ------------------ | Branch (644:19): [True: 5.36k, False: 3.76k] ------------------ 645| 9.13k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 9.13k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.76k| .visit(v, idx, args...)); 648| 37.3k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1405| 27.1k| { 1406| 27.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 27.1k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1202| 27.1k| { 1203| 27.1k| auto p = node_->inner(); 1204| 27.1k| auto e = p + branches; 1205| 27.1k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 25.7k, False: 1.39k] ------------------ 1206| 226k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 201k, False: 24.8k] ------------------ 1207| 201k| IMMER_PREFETCH(p + 1); 1208| 201k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 919, False: 200k] ------------------ 1209| 919| return false; 1210| 201k| } 1211| 25.7k| } else { 1212| 1.39k| auto ss = shift_ - B; 1213| 11.6k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 10.5k, False: 1.17k] ------------------ 1214| 10.5k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 222, False: 10.2k] ------------------ 1215| 222| return false; 1216| 1.39k| } 1217| 25.9k| return true; 1218| 27.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 819| { 1037| 819| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 819| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1007| 819| { 1008| 819| assert(idx < count()); ------------------ | Branch (1008:9): [True: 819, False: 0] ------------------ 1009| 819| auto is_leaf = shift_ == BL; 1010| 819| auto child = node_->inner()[idx]; 1011| 819| auto lsize = size(idx); 1012| 819| auto is_full = idx + 1 < count(); 1013| 819| return is_full ------------------ | Branch (1013:16): [True: 819, False: 0] ------------------ 1014| 819| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 819] ------------------ 1015| 819| ? make_full_leaf_pos(child).visit(v, args...) 1016| 819| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 819| : (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| 819| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 3.89k| { 1037| 3.89k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.89k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1007| 5.10k| { 1008| 5.10k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 5.10k, False: 0] ------------------ 1009| 5.10k| auto is_leaf = shift_ == BL; 1010| 5.10k| auto child = node_->inner()[idx]; 1011| 5.10k| auto lsize = size(idx); 1012| 5.10k| auto is_full = idx + 1 < count(); 1013| 5.10k| return is_full ------------------ | Branch (1013:16): [True: 3.12k, False: 1.97k] ------------------ 1014| 5.10k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.57k, False: 555] ------------------ 1015| 3.12k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 3.12k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 5.10k| : (is_leaf ------------------ | Branch (1017:23): [True: 1.14k, False: 835] ------------------ 1018| 1.97k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 1.97k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 835| .visit(v, args...)); 1021| 5.10k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 144| 908k| { 145| 908k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 908k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_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_policyELb1ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 831| 15.0k| { 832| 15.0k| return each_pred_regular(*this, v, args...); 833| 15.0k| } _ZN5immer6detail4rbts17each_pred_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSC_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEEbSM_SN_DpOT1_: 365| 15.0k|{ 366| 15.0k| constexpr auto B = bits; 367| 15.0k| constexpr auto BL = bits_leaf; 368| 15.0k| auto n = p.node()->inner(); 369| 15.0k| auto last = p.count() - 1; 370| 15.0k| auto e = n + last; 371| 15.0k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 10.8k, False: 4.23k] ------------------ 372| 71.6k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 62.3k, False: 9.30k] ------------------ 373| 62.3k| IMMER_PREFETCH(n + 1); 374| 62.3k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 1.54k, False: 60.7k] ------------------ 375| 1.54k| return false; 376| 62.3k| } 377| 9.30k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 10.8k| } else { 379| 4.23k| auto ss = p.shift() - B; 380| 17.3k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 13.6k, False: 3.78k] ------------------ 381| 13.6k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 451, False: 13.1k] ------------------ 382| 451| return false; 383| 3.78k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 4.23k| } 385| 15.0k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 112| 12.5k| { 113| 12.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 12.5k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 336| 4.76k| { 337| 4.76k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.76k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 249| 4.76k| { 250| 4.76k| return each_pred_regular(*this, v, args...); 251| 4.76k| } _ZN5immer6detail4rbts17each_pred_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSC_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEEbSM_SN_DpOT1_: 365| 4.76k|{ 366| 4.76k| constexpr auto B = bits; 367| 4.76k| constexpr auto BL = bits_leaf; 368| 4.76k| auto n = p.node()->inner(); 369| 4.76k| auto last = p.count() - 1; 370| 4.76k| auto e = n + last; 371| 4.76k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 3.53k, False: 1.22k] ------------------ 372| 16.3k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 13.0k, False: 3.28k] ------------------ 373| 13.0k| IMMER_PREFETCH(n + 1); 374| 13.0k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 250, False: 12.8k] ------------------ 375| 250| return false; 376| 13.0k| } 377| 3.28k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 3.53k| } else { 379| 1.22k| auto ss = p.shift() - B; 380| 2.42k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 1.44k, False: 977] ------------------ 381| 1.44k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 247, False: 1.19k] ------------------ 382| 247| return false; 383| 977| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 1.22k| } 385| 4.76k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 4.86k| { 1037| 4.86k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.86k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 4.86k| { 1794| 4.86k| auto child = node_->inner()[offset]; 1795| 4.86k| auto child_size = size(offset); 1796| 4.86k| auto is_leaf = shift_ == BL; 1797| 4.86k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 4.86k] ------------------ 1798| 4.86k| : visit_maybe_relaxed_sub( 1799| 4.86k| child, shift_ - B, child_size, v, args...); 1800| 4.86k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 4.86k|{ 1839| 4.86k| assert(node); ------------------ | Branch (1839:5): [True: 4.86k, False: 0] ------------------ 1840| 4.86k| auto relaxed = node->relaxed(); 1841| 4.86k| if (relaxed) { ------------------ | Branch (1841:9): [True: 967, False: 3.89k] ------------------ 1842| 967| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 967, False: 0] ------------------ 1843| 967| return make_relaxed_pos(node, shift, relaxed) 1844| 967| .visit(v, std::forward(args)...); 1845| 3.89k| } else { 1846| 3.89k| return make_regular_sub_pos(node, shift, size) 1847| 3.89k| .visit(v, std::forward(args)...); 1848| 3.89k| } 1849| 4.86k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 967| { 1814| 967| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 967| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1007| 7.84k| { 1008| 7.84k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 7.84k, False: 0] ------------------ 1009| 7.84k| auto is_leaf = shift_ == BL; 1010| 7.84k| auto child = node_->inner()[idx]; 1011| 7.84k| auto lsize = size(idx); 1012| 7.84k| auto is_full = idx + 1 < count(); 1013| 7.84k| return is_full ------------------ | Branch (1013:16): [True: 7.30k, False: 536] ------------------ 1014| 7.84k| ? (is_leaf ------------------ | Branch (1014:23): [True: 4.59k, False: 2.71k] ------------------ 1015| 7.30k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 7.30k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 7.84k| : (is_leaf ------------------ | Branch (1017:23): [True: 536, False: 0] ------------------ 1018| 536| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 536| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 7.84k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 207| 11.7k| { 208| 11.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 11.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1804| 11.7k| { 1805| 11.7k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 11.7k, False: 0] ------------------ 1806| 11.7k| auto child = node_->inner()[offset]; 1807| 11.7k| auto child_size = size(offset); 1808| 11.7k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 11.7k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 11.7k| { 145| 11.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 11.7k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1405| 4.72k| { 1406| 4.72k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.72k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 4.72k| { 1794| 4.72k| auto child = node_->inner()[offset]; 1795| 4.72k| auto child_size = size(offset); 1796| 4.72k| auto is_leaf = shift_ == BL; 1797| 4.72k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 4.72k] ------------------ 1798| 4.72k| : visit_maybe_relaxed_sub( 1799| 4.72k| child, shift_ - B, child_size, v, args...); 1800| 4.72k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 4.72k|{ 1839| 4.72k| assert(node); ------------------ | Branch (1839:5): [True: 4.72k, False: 0] ------------------ 1840| 4.72k| auto relaxed = node->relaxed(); 1841| 4.72k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.05k, False: 2.66k] ------------------ 1842| 2.05k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.05k, False: 0] ------------------ 1843| 2.05k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.05k| .visit(v, std::forward(args)...); 1845| 2.66k| } else { 1846| 2.66k| return make_regular_sub_pos(node, shift, size) 1847| 2.66k| .visit(v, std::forward(args)...); 1848| 2.66k| } 1849| 4.72k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 2.05k| { 1814| 2.05k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.05k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1386| 9.17k| { 1387| 9.17k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 9.17k, False: 0] ------------------ 1388| 9.17k| auto is_leaf = shift_ == BL; 1389| 9.17k| auto child = node_->inner()[idx]; 1390| 9.17k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 7.16k, False: 2.00k] ------------------ 1391| 9.17k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 9.17k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 2.66k| { 1037| 2.66k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.66k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1793| 67.1k| { 1794| 67.1k| auto child = node_->inner()[offset]; 1795| 67.1k| auto child_size = size(offset); 1796| 67.1k| auto is_leaf = shift_ == BL; 1797| 67.1k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 30.9k, False: 36.1k] ------------------ 1798| 67.1k| : visit_maybe_relaxed_sub( 1799| 36.1k| child, shift_ - B, child_size, v, args...); 1800| 67.1k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSI_T0_E_EEEDcPSI_jmSK_DpOT1_: 1838| 150k|{ 1839| 150k| assert(node); ------------------ | Branch (1839:5): [True: 150k, False: 0] ------------------ 1840| 150k| auto relaxed = node->relaxed(); 1841| 150k| if (relaxed) { ------------------ | Branch (1841:9): [True: 136k, False: 14.2k] ------------------ 1842| 136k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 136k, False: 0] ------------------ 1843| 136k| return make_relaxed_pos(node, shift, relaxed) 1844| 136k| .visit(v, std::forward(args)...); 1845| 136k| } else { 1846| 14.2k| return make_regular_sub_pos(node, shift, size) 1847| 14.2k| .visit(v, std::forward(args)...); 1848| 14.2k| } 1849| 150k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1813| 136k| { 1814| 136k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 136k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1482| 136k| { 1483| 136k| auto p = node_->inner(); 1484| 136k| auto s = size_t{}; 1485| 136k| auto n = count(); 1486| 136k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 119k, False: 16.7k] ------------------ 1487| 995k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 876k, False: 118k] ------------------ 1488| 876k| IMMER_PREFETCH(p + i + 1); 1489| 876k| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 968, False: 875k] ------------------ 1490| 876k| .visit(v, args...)) 1491| 968| return false; 1492| 875k| s = relaxed_->d.sizes[i]; 1493| 875k| } 1494| 119k| } else { 1495| 16.7k| auto ss = shift_ - B; 1496| 130k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 114k, False: 15.9k] ------------------ 1497| 114k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 790, False: 113k] ------------------ 1498| 114k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 790| return false; 1500| 113k| s = relaxed_->d.sizes[i]; 1501| 113k| } 1502| 16.7k| } 1503| 134k| return true; 1504| 136k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1036| 2.93k| { 1037| 2.93k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.93k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE15first_sub_innerINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERPSC_RjRmEEEDcT_DpOT0_: 1783| 1.12k| { 1784| 1.12k| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 1.12k, False: 0] ------------------ 1785| 1.12k| auto child = node_->inner()[0]; 1786| 1.12k| auto child_size = relaxed_->d.sizes[0]; 1787| 1.12k| return visit_maybe_relaxed_sub( 1788| 1.12k| child, shift_ - B, child_size, v, args...); 1789| 1.12k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERPSC_RjRmEEEDcPT_jmT0_DpOT1_: 1838| 1.12k|{ 1839| 1.12k| assert(node); ------------------ | Branch (1839:5): [True: 1.12k, False: 0] ------------------ 1840| 1.12k| auto relaxed = node->relaxed(); 1841| 1.12k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.12k, False: 0] ------------------ 1842| 1.12k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.12k, False: 0] ------------------ 1843| 1.12k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.12k| .visit(v, std::forward(args)...); 1845| 1.12k| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 1.12k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERPSC_RjRmEEEDcT_DpOT0_: 1813| 1.12k| { 1814| 1.12k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.12k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcPT_jmT0_DpOT1_: 1838| 8.79k|{ 1839| 8.79k| assert(node); ------------------ | Branch (1839:5): [True: 8.79k, False: 0] ------------------ 1840| 8.79k| auto relaxed = node->relaxed(); 1841| 8.79k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.76k, False: 6.02k] ------------------ 1842| 2.76k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.76k, False: 0] ------------------ 1843| 2.76k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.76k| .visit(v, std::forward(args)...); 1845| 6.02k| } else { 1846| 6.02k| return make_regular_sub_pos(node, shift, size) 1847| 6.02k| .visit(v, std::forward(args)...); 1848| 6.02k| } 1849| 8.79k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1813| 2.76k| { 1814| 2.76k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.76k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1036| 6.02k| { 1037| 6.02k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.02k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcT_DpOT0_: 1036| 8.79k| { 1037| 8.79k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.79k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRKPSC_EEEDcT_DpOT0_: 144| 6.54k| { 145| 6.54k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.54k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 114| 1.36M| : size{0} 115| 1.36M| , shift{BL} 116| 1.36M| , root{empty_root()} 117| 1.36M| , tail{empty_tail()} 118| 1.36M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 1.36M, False: 0] ------------------ 120| 1.36M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_rootEv: 61| 1.37M| { 62| 1.37M| static const auto empty_ = [] { 63| 1.37M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1.37M| static std::aligned_storage_t 65| 1.37M| storage; 66| 1.37M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1.37M| }(); 68| 1.37M| return empty_->inc(); 69| 1.37M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_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_policyELb1ELb1EEELj3ELj3EE10empty_tailEv: 72| 1.36M| { 73| 1.36M| static const auto empty_ = [] { 74| 1.36M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1.36M| static std::aligned_storage_t 76| 1.36M| storage; 77| 1.36M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1.36M| }(); 79| 1.36M| return empty_->inc(); 80| 1.36M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_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_policyELb1ELb1EEELj3ELj3EE10check_treeEv: 1372| 3.34M| { 1373| 3.34M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 3.34M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.34M] | | ------------------ | | 33| 3.34M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 3.34M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 3.34M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.34M] | | ------------------ | | 33| 3.34M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 3.34M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 3.34M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.34M] | | ------------------ | | 33| 3.34M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 3.34M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 3.34M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.34M] | | ------------------ | | 33| 3.34M| 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| 3.34M| return true; 1382| 3.34M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11tail_offsetEv: 197| 18.1M| { 198| 18.1M| auto r = root->relaxed(); 199| 18.1M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 7.58M, False: 10.5M] | Branch (199:9): [True: 10.5M, False: 0] | Branch (199:9): [True: 18.1M, False: 0] ------------------ 200| 18.1M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 10.5M, False: 7.58M] ------------------ 201| 18.1M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 3.47M, False: 4.11M] ------------------ 202| | /* otherwise */ 203| 7.58M| : 0; 204| 18.1M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9tail_sizeEv: 194| 3.72M| auto tail_size() const { return size - tail_offset(); } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EED2Ev: 184| 3.34M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3decEv: 192| 3.34M| void dec() const { traverse(dec_visitor()); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8traverseINS1_11dec_visitorEJEEEvT_DpOT0_: 208| 3.34M| { 209| 3.34M| auto tail_off = tail_offset(); 210| 3.34M| auto tail_size = size - tail_off; 211| | 212| 3.34M| if (tail_off) ------------------ | Branch (212:13): [True: 1.83M, False: 1.50M] ------------------ 213| 1.83M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 1.50M| else 215| 1.50M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 3.34M| if (tail_size) ------------------ | Branch (217:13): [True: 1.97M, False: 1.36M] ------------------ 218| 1.97M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 1.36M| else 220| 1.36M| make_empty_leaf_pos(tail).visit(v, args...); 221| 3.34M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 500| 341k| { 501| 341k| auto ts = tail_size(); 502| 341k| if (ts < branches) { ------------------ | Branch (502:13): [True: 289k, False: 52.0k] ------------------ 503| 289k| auto new_tail = 504| 289k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 289k| return {size + 1, shift, root->inc(), new_tail}; 506| 289k| } else { 507| 52.0k| using std::get; 508| 52.0k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 52.0k| auto tail_off = tail_offset(); 510| 52.0k| IMMER_TRY { ------------------ | | 49| 52.0k|#define IMMER_TRY try ------------------ 511| 52.0k| auto new_root = 512| 52.0k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 52.0k| tail->inc(); 514| 52.0k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 52.0k| } 516| 52.0k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 52.0k| } 521| 341k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2EmjPNS1_4nodeIiSA_Lj3ELj3EEESE_: 127| 1.97M| : size{sz} 128| 1.97M| , shift{sh} 129| 1.97M| , root{r} 130| 1.97M| , tail{t} 131| 1.97M| { 132| 1.97M|#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| 1.97M| try { 137| 1.97M| check_tree(); 138| 1.97M| } catch (...) { 139| | // This not fully constructed rrbtree owns the nodes already, have 140| | // to dec them. 141| 0| if (r && t) ------------------ | Branch (141:17): [True: 0, False: 0] | Branch (141:22): [True: 0, False: 0] ------------------ 142| 0| dec(); 143| 0| throw; 144| 0| } 145| |#else 146| | assert(check_tree()); 147| |#endif 148| 1.97M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_tailEPNS1_4nodeIiSA_Lj3ELj3EEEjmSE_j: 369| 385k| { 370| 385k| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 53.4k, False: 332k] ------------------ 371| 53.4k| auto new_root = 372| 53.4k| make_relaxed_pos(root, shift, r) 373| 53.4k| .visit(push_tail_visitor{}, tail, tail_size); 374| 53.4k| if (new_root) ------------------ | Branch (374:17): [True: 51.5k, False: 1.95k] ------------------ 375| 51.5k| return std::make_tuple(shift, new_root); 376| 1.95k| else { 377| 1.95k| auto new_root = node_t::make_inner_r_n(2); 378| 1.95k| IMMER_TRY { ------------------ | | 49| 1.95k|#define IMMER_TRY try ------------------ 379| 1.95k| auto new_path = node_t::make_path(shift, tail); 380| 1.95k| new_root->inner()[0] = root->inc(); 381| 1.95k| new_root->inner()[1] = new_path; 382| 1.95k| new_root->relaxed()->d.sizes[0] = size; 383| 1.95k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 1.95k| assert(size); ------------------ | Branch (384:21): [True: 1.95k, False: 0] ------------------ 385| 1.95k| assert(tail_size); ------------------ | Branch (385:21): [True: 1.95k, False: 0] ------------------ 386| 1.95k| new_root->relaxed()->d.count = 2u; 387| 1.95k| } 388| 1.95k| 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| 1.95k| return std::make_tuple(shift + B, new_root); 393| 1.95k| } 394| 332k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 3.79k, False: 328k] ------------------ 395| 3.79k| auto new_root = node_t::make_inner_n(2); 396| 3.79k| IMMER_TRY { ------------------ | | 49| 3.79k|#define IMMER_TRY try ------------------ 397| 3.79k| auto new_path = node_t::make_path(shift, tail); 398| 3.79k| new_root->inner()[0] = root->inc(); 399| 3.79k| new_root->inner()[1] = new_path; 400| 3.79k| } 401| 3.79k| IMMER_CATCH (...) { 402| 0| node_t::delete_inner(new_root, 2); 403| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 404| 0| } 405| 3.79k| return std::make_tuple(shift + B, new_root); 406| 328k| } else if (size) { ------------------ | Branch (406:20): [True: 315k, False: 13.2k] ------------------ 407| 315k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 315k| .visit(push_tail_visitor{}, tail); 409| 315k| return std::make_tuple(shift, new_root); 410| 315k| } else { 411| 13.2k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 13.2k| } 413| 385k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2EOSB_: 157| 1.27M| : rrbtree{} 158| 1.27M| { 159| 1.27M| swap(*this, other); 160| 1.27M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESC_: 176| 4.46M| { 177| 4.46M| using std::swap; 178| 4.46M| swap(x.size, y.size); 179| 4.46M| swap(x.shift, y.shift); 180| 4.46M| swap(x.root, y.root); 181| 4.46M| swap(x.tail, y.tail); 182| 4.46M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEaSEOSB_: 170| 3.18M| { 171| 3.18M| swap(*this, other); 172| 3.18M| return *this; 173| 3.18M| } flex-vector-bo.cpp:_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSG_E_EESB_mOSG_: 580| 167k| { 581| 167k| auto tail_off = tail_offset(); 582| 167k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 68.9k, False: 98.1k] ------------------ 583| 68.9k| auto tail_size = size - tail_off; 584| 68.9k| auto new_tail = 585| 68.9k| make_leaf_sub_pos(tail, tail_size) 586| 68.9k| .visit(update_visitor{}, idx - tail_off, fn); 587| 68.9k| return {size, shift, root->inc(), new_tail}; 588| 98.1k| } else { 589| 98.1k| auto new_root = visit_maybe_relaxed_sub( 590| 98.1k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 98.1k| return {size, shift, new_root, tail->inc()}; 592| 98.1k| } 593| 167k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 647| 23.6k| { 648| 23.6k| auto tail_off = tail_offset(); 649| 23.6k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 3.97k, False: 19.7k] ------------------ 650| 3.97k| return {}; 651| 19.7k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 1.16k, False: 18.5k] ------------------ 652| 1.16k| return *this; 653| 18.5k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 1.58k, False: 16.9k] ------------------ 654| 1.58k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 1.58k| return {new_size, shift, root->inc(), new_tail}; 656| 16.9k| } else { 657| 16.9k| using std::get; 658| 16.9k| auto l = new_size - 1; 659| 16.9k| auto v = slice_right_visitor(); 660| 16.9k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 16.9k| auto new_shift = get<0>(r); 662| 16.9k| auto new_root = get<1>(r); 663| 16.9k| auto new_tail = get<3>(r); 664| 16.9k| if (new_root) { ------------------ | Branch (664:17): [True: 12.9k, False: 4.05k] ------------------ 665| 12.9k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 12.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 12.9k, False: 0] ------------------ 666| 12.9k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 12.9k, False: 0] ------------------ 667| 12.9k| return {new_size, new_shift, new_root, new_tail}; 668| 12.9k| } else { 669| 4.05k| return {new_size, BL, empty_root(), new_tail}; 670| 4.05k| } 671| 16.9k| } 672| 23.6k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKSB_: 151| 8.99k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 8.99k| { 153| 8.99k| inc(); 154| 8.99k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 187| 8.99k| { 188| 8.99k| root->inc(); 189| 8.99k| tail->inc(); 190| 8.99k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 711| 39.1k| { 712| 39.1k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.56k, False: 36.5k] ------------------ 713| 2.56k| return *this; 714| 36.5k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 1.85k, False: 34.7k] ------------------ 715| 1.85k| return {}; 716| 34.7k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 1.84k, False: 32.8k] ------------------ 717| 1.84k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 32.8k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 1.72k, False: 31.1k] ------------------ 719| 1.72k| auto tail_off = tail_offset(); 720| 1.72k| auto new_tail = 721| 1.72k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 1.72k| return {size - elems, BL, empty_root(), new_tail}; 723| 31.1k| } else { 724| 31.1k| using std::get; 725| 31.1k| auto v = slice_left_visitor(); 726| 31.1k| auto r = 727| 31.1k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 31.1k| auto new_root = get<1>(r); 729| 31.1k| auto new_shift = get<0>(r); 730| 31.1k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 31.1k| } 732| 39.1k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8max_sizeEv: 54| 2.43M| { 55| 2.43M| auto S = sizeof(size_t) * 8; 56| 2.43M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 2.43M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 2.43M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6concatERKSB_: 735| 675k| { 736| 675k| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 675k, False: 0] ------------------ 737| 675k| using std::get; 738| 675k| if (size == 0) ------------------ | Branch (738:13): [True: 1.64k, False: 673k] ------------------ 739| 1.64k| return r; 740| 673k| else if (r.size == 0) ------------------ | Branch (740:18): [True: 1.08k, False: 672k] ------------------ 741| 1.08k| return *this; 742| 672k| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 351k, False: 321k] ------------------ 743| | // just concat the tail, similar to push_back 744| 351k| auto tail_offst = tail_offset(); 745| 351k| auto tail_size = size - tail_offst; 746| 351k| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 68.2k, False: 283k] ------------------ 747| 68.2k| auto new_root = 748| 68.2k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 68.2k| tail->inc(); 750| 68.2k| return {size + r.size, 751| 68.2k| get<0>(new_root), 752| 68.2k| get<1>(new_root), 753| 68.2k| r.tail->inc()}; 754| 283k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 18.5k, False: 264k] ------------------ 755| 18.5k| auto new_tail = 756| 18.5k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 18.5k| return {size + r.size, shift, root->inc(), new_tail}; 758| 264k| } else { 759| 264k| auto remaining = branches - tail_size; 760| 264k| auto add_tail = 761| 264k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 264k| IMMER_TRY { ------------------ | | 49| 264k|#define IMMER_TRY try ------------------ 763| 264k| auto new_tail = 764| 264k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 264k| IMMER_TRY { ------------------ | | 49| 264k|#define IMMER_TRY try ------------------ 766| 264k| auto new_root = push_tail( 767| 264k| root, shift, tail_offst, add_tail, branches); 768| 264k| return {size + r.size, 769| 264k| get<0>(new_root), 770| 264k| get<1>(new_root), 771| 264k| new_tail}; 772| 264k| } 773| 264k| 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| 264k| } 778| 264k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 264k| } 783| 351k| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 3.08k, False: 318k] ------------------ 784| 3.08k| auto tail_offst = tail_offset(); 785| 3.08k| auto tail_size = size - tail_offst; 786| 3.08k| auto concated = 787| 3.08k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 3.08k| auto new_shift = concated.shift(); 789| 3.08k| auto new_root = concated.node(); 790| 3.08k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 3.08k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 3.08k, False: 0] ------------------ 791| 3.08k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 3.08k, False: 0] ------------------ 792| 3.08k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 318k| } else { 794| 318k| auto tail_offst = tail_offset(); 795| 318k| auto tail_size = size - tail_offst; 796| 318k| auto concated = concat_trees(root, 797| 318k| shift, 798| 318k| tail_offst, 799| 318k| tail, 800| 318k| tail_size, 801| 318k| r.root, 802| 318k| r.shift, 803| 318k| r.tail_offset()); 804| 318k| auto new_shift = concated.shift(); 805| 318k| auto new_root = concated.node(); 806| 318k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 318k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 318k, False: 0] ------------------ 807| 318k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 318k, False: 0] ------------------ 808| 318k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 318k| } 810| 675k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 39.2k| { 479| 39.2k| auto ts = tail_size(); 480| 39.2k| if (ts < branches) { ------------------ | Branch (480:13): [True: 29.6k, False: 9.56k] ------------------ 481| 29.6k| ensure_mutable_tail(e, ts); 482| 29.6k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 29.6k| } else { 484| 9.56k| using std::get; 485| 9.56k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 9.56k| auto tail_off = tail_offset(); 487| 9.56k| IMMER_TRY { ------------------ | | 49| 9.56k|#define IMMER_TRY try ------------------ 488| 9.56k| push_tail_mut(e, tail_off, tail, ts); 489| 9.56k| tail = new_tail; 490| 9.56k| } 491| 9.56k| IMMER_CATCH (...) { 492| 0| node_t::delete_leaf(new_tail, 1u); 493| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 494| 0| } 495| 9.56k| } 496| 39.2k| ++size; 497| 39.2k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 335k| { 470| 335k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 9.34k, False: 325k] ------------------ 471| 9.34k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 9.34k| dec_leaf(tail, n); 473| 9.34k| tail = new_tail; 474| 9.34k| } 475| 335k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj3ELj3EEEj: 417| 346k| { 418| 346k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 162k, False: 183k] ------------------ 419| 162k| auto new_root = 420| 162k| make_relaxed_pos(root, shift, r) 421| 162k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 162k| if (new_root) { ------------------ | Branch (422:17): [True: 162k, False: 732] ------------------ 423| 162k| root = new_root; 424| 162k| } else { 425| 732| auto new_root = node_t::make_inner_r_e(e); 426| 732| IMMER_TRY { ------------------ | | 49| 732|#define IMMER_TRY try ------------------ 427| 732| auto new_path = node_t::make_path_e(e, shift, tail); 428| 732| new_root->inner()[0] = root; 429| 732| new_root->inner()[1] = new_path; 430| 732| new_root->relaxed()->d.sizes[0] = tail_off; 431| 732| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 732| assert(tail_off); ------------------ | Branch (432:21): [True: 732, False: 0] ------------------ 433| 732| assert(tail_size); ------------------ | Branch (433:21): [True: 732, False: 0] ------------------ 434| 732| new_root->relaxed()->d.count = 2u; 435| 732| root = new_root; 436| 732| shift += B; 437| 732| } 438| 732| 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| 732| } 443| 183k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 1.88k, False: 182k] ------------------ 444| 1.88k| auto new_root = node_t::make_inner_e(e); 445| 1.88k| IMMER_TRY { ------------------ | | 49| 1.88k|#define IMMER_TRY try ------------------ 446| 1.88k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 1.88k| new_root->inner()[0] = root; 448| 1.88k| new_root->inner()[1] = new_path; 449| 1.88k| root = new_root; 450| 1.88k| shift += B; 451| 1.88k| } 452| 1.88k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 182k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 180k, False: 1.96k] ------------------ 457| 180k| auto new_root = 458| 180k| make_regular_sub_pos(root, shift, tail_off) 459| 180k| .visit(push_tail_mut_visitor{}, e, tail); 460| 180k| root = new_root; 461| 180k| } else { 462| 1.96k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 1.96k| dec_empty_regular(root); 464| 1.96k| root = new_root; 465| 1.96k| } 466| 346k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10update_mutIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSG_E0_EEvNS9_5applyIS6_E4type4editEmOSG_: 573| 35.0k| { 574| 35.0k| auto& elem = get_mut(e, idx); 575| 35.0k| elem = std::forward(fn)(std::move(elem)); 576| 35.0k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 35.0k| { 540| 35.0k| auto tail_off = tail_offset(); 541| 35.0k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 9.99k, False: 25.0k] ------------------ 542| 9.99k| ensure_mutable_tail(e, size - tail_off); 543| 9.99k| return tail->leaf()[(idx - tail_off) & mask]; 544| 25.0k| } else { 545| 25.0k| return visit_maybe_relaxed_sub(root, 546| 25.0k| shift, 547| 25.0k| tail_off, 548| 25.0k| get_mut_visitor{}, 549| 25.0k| idx, 550| 25.0k| e, 551| 25.0k| &root); 552| 25.0k| } 553| 35.0k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 31.6k| { 607| 31.6k| auto tail_off = tail_offset(); 608| 31.6k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 745, False: 30.9k] ------------------ 609| 745| *this = {}; 610| 30.9k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 350, False: 30.6k] ------------------ 611| 350| return; 612| 30.6k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 605, False: 29.9k] ------------------ 613| 605| auto ts = size - tail_off; 614| 605| auto newts = new_size - tail_off; 615| 605| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 355, False: 250] ------------------ 616| 355| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 355| } else { 618| 250| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 250| dec_leaf(tail, ts); 620| 250| tail = new_tail; 621| 250| } 622| 605| size = new_size; 623| 605| return; 624| 29.9k| } else { 625| 29.9k| using std::get; 626| 29.9k| auto l = new_size - 1; 627| 29.9k| auto v = slice_right_mut_visitor(); 628| 29.9k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 29.9k| auto new_shift = get<0>(r); 630| 29.9k| auto new_root = get<1>(r); 631| 29.9k| auto new_tail = get<3>(r); 632| 29.9k| if (new_root) { ------------------ | Branch (632:17): [True: 23.4k, False: 6.56k] ------------------ 633| 23.4k| root = new_root; 634| 23.4k| shift = new_shift; 635| 23.4k| } else { 636| 6.56k| root = empty_root(); 637| 6.56k| shift = BL; 638| 6.56k| } 639| 29.9k| dec_leaf(tail, size - tail_off); 640| 29.9k| size = new_size; 641| 29.9k| tail = new_tail; 642| 29.9k| return; 643| 29.9k| } 644| 31.6k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 68.5k| { 676| 68.5k| using std::get; 677| 68.5k| auto tail_off = tail_offset(); 678| 68.5k| if (elems == 0) { ------------------ | Branch (678:13): [True: 7.42k, False: 61.1k] ------------------ 679| 7.42k| return; 680| 61.1k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 283, False: 60.8k] ------------------ 681| 283| *this = {}; 682| 60.8k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 203, False: 60.6k] ------------------ 683| 203| dec_inner(root, shift, tail_off); 684| 203| shift = BL; 685| 203| root = empty_root(); 686| 203| size -= elems; 687| 203| return; 688| 60.6k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 943, False: 59.7k] ------------------ 689| 943| auto v = slice_left_mut_visitor(); 690| 943| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 943| .visit(v, elems - tail_off, e)); 692| 943| if (tail_off) { ------------------ | Branch (692:17): [True: 224, False: 719] ------------------ 693| 224| dec_inner(root, shift, tail_off); 694| 224| shift = BL; 695| 224| root = empty_root(); 696| 224| } 697| 943| size -= elems; 698| 943| return; 699| 59.7k| } else { 700| 59.7k| auto v = slice_left_mut_visitor(); 701| 59.7k| auto r = 702| 59.7k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 59.7k| shift = get<0>(r); 704| 59.7k| root = get<1>(r); 705| 59.7k| size -= elems; 706| 59.7k| return; 707| 59.7k| } 708| 68.5k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editERKSB_: 816| 198k| { 817| 198k| assert(&l != &r); ------------------ | Branch (817:9): [True: 198k, False: 0] ------------------ 818| 198k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 198k, False: 0] ------------------ 819| 198k| using std::get; 820| 198k| if (l.size == 0) ------------------ | Branch (820:13): [True: 434, False: 198k] ------------------ 821| 434| l = r; 822| 198k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 518, False: 197k] ------------------ 823| 518| return; 824| 197k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 67.8k, False: 129k] ------------------ 825| | // just concat the tail, similar to push_back 826| 67.8k| auto tail_offst = l.tail_offset(); 827| 67.8k| auto tail_size = l.size - tail_offst; 828| 67.8k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 9.67k, False: 58.2k] ------------------ 829| 9.67k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 9.67k| l.tail = r.tail->inc(); 831| 9.67k| l.size += r.size; 832| 9.67k| return; 833| 58.2k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 854, False: 57.3k] ------------------ 834| 854| l.ensure_mutable_tail(el, tail_size); 835| 854| detail::uninitialized_copy(r.tail->leaf(), 836| 854| r.tail->leaf() + r.size, 837| 854| l.tail->leaf() + tail_size); 838| 854| l.size += r.size; 839| 854| return; 840| 57.3k| } else { 841| 57.3k| auto remaining = branches - tail_size; 842| 57.3k| l.ensure_mutable_tail(el, tail_size); 843| 57.3k| detail::uninitialized_copy(r.tail->leaf(), 844| 57.3k| r.tail->leaf() + remaining, 845| 57.3k| l.tail->leaf() + tail_size); 846| 57.3k| IMMER_TRY { ------------------ | | 49| 57.3k|#define IMMER_TRY try ------------------ 847| 57.3k| auto new_tail = 848| 57.3k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 57.3k| IMMER_TRY { ------------------ | | 49| 57.3k|#define IMMER_TRY try ------------------ 850| 57.3k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 57.3k| l.tail = new_tail; 852| 57.3k| l.size += r.size; 853| 57.3k| return; 854| 57.3k| } 855| 57.3k| 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| 57.3k| } 860| 57.3k| 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| 57.3k| } 865| 129k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 452, False: 129k] ------------------ 866| 452| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 452] ------------------ 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| 452| } else { 886| 452| auto tail_offst = l.tail_offset(); 887| 452| auto tail_size = l.size - tail_offst; 888| 452| auto concated = concat_trees( 889| 452| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 452| l = {l.size + r.size, 891| 452| concated.shift(), 892| 452| concated.node(), 893| 452| r.tail->inc()}; 894| 452| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 452, False: 0] ------------------ 895| 452| return; 896| 452| } 897| 129k| } else { 898| 129k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 129k] ------------------ 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| 129k| } else { 923| 129k| auto tail_offst = l.tail_offset(); 924| 129k| auto tail_size = l.size - tail_offst; 925| 129k| auto concated = concat_trees(l.root, 926| 129k| l.shift, 927| 129k| tail_offst, 928| 129k| l.tail, 929| 129k| tail_size, 930| 129k| r.root, 931| 129k| r.shift, 932| 129k| r.tail_offset()); 933| 129k| l = {l.size + r.size, 934| 129k| concated.shift(), 935| 129k| concated.node(), 936| 129k| r.tail->inc()}; 937| 129k| } 938| 129k| } 939| 198k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEaSERKSB_: 163| 2.54k| { 164| 2.54k| auto next{other}; 165| 2.54k| swap(*this, next); 166| 2.54k| return *this; 167| 2.54k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERSB_NS9_5applyIS6_E4type4editE: 942| 3.81k| { 943| 3.81k| assert(&l != &r); ------------------ | Branch (943:9): [True: 3.81k, False: 0] ------------------ 944| 3.81k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 3.81k, False: 0] ------------------ 945| 3.81k| using std::get; 946| 3.81k| if (r.size == 0) ------------------ | Branch (946:13): [True: 234, False: 3.58k] ------------------ 947| 234| r = std::move(l); 948| 3.58k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 196, False: 3.38k] ------------------ 949| 196| return; 950| 3.38k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 1.41k, False: 1.97k] ------------------ 951| | // just concat the tail, similar to push_back 952| 1.41k| auto tail_offst = l.tail_offset(); 953| 1.41k| auto tail_size = l.size - tail_offst; 954| 1.41k| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 450, False: 964] ------------------ 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| 450| auto res = 959| 450| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 450| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 450| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 450| return; 965| 964| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 464, False: 500] ------------------ 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| 464| auto new_tail = 974| 464| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 464| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 464| return; 977| 500| } else { 978| | // like the immutable version 979| 500| auto remaining = branches - tail_size; 980| 500| auto add_tail = node_t::copy_leaf_e( 981| 500| er, l.tail, tail_size, r.tail, remaining); 982| 500| IMMER_TRY { ------------------ | | 49| 500|#define IMMER_TRY try ------------------ 983| 500| auto new_tail = 984| 500| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 500| IMMER_TRY { ------------------ | | 49| 500|#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| 500| auto new_root = l.push_tail(l.root, 990| 500| l.shift, 991| 500| tail_offst, 992| 500| add_tail, 993| 500| branches); 994| 500| r = {l.size + r.size, 995| 500| get<0>(new_root), 996| 500| get<1>(new_root), 997| 500| new_tail}; 998| 500| return; 999| 500| } 1000| 500| 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| 500| } 1005| 500| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 500| } 1010| 1.97k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 608, False: 1.36k] ------------------ 1011| 608| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 608] ------------------ 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| 608| } else { 1030| 608| auto tail_offst = l.tail_offset(); 1031| 608| auto tail_size = l.size - tail_offst; 1032| 608| auto concated = concat_trees( 1033| 608| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 608| r = {l.size + r.size, 1035| 608| concated.shift(), 1036| 608| concated.node(), 1037| 608| r.tail->inc()}; 1038| 608| return; 1039| 608| } 1040| 1.36k| } else { 1041| 1.36k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.36k] ------------------ 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.36k| } else { 1064| 1.36k| auto tail_offst = l.tail_offset(); 1065| 1.36k| auto tail_size = l.size - tail_offst; 1066| 1.36k| auto concated = concat_trees(l.root, 1067| 1.36k| l.shift, 1068| 1.36k| tail_offst, 1069| 1.36k| l.tail, 1070| 1.36k| tail_size, 1071| 1.36k| r.root, 1072| 1.36k| r.shift, 1073| 1.36k| r.tail_offset()); 1074| 1.36k| r = {l.size + r.size, 1075| 1.36k| concated.shift(), 1076| 1.36k| concated.node(), 1077| 1.36k| r.tail->inc()}; 1078| 1.36k| return; 1079| 1.36k| } 1080| 1.36k| } 1081| 3.81k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 878k| { 1085| 878k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 878k, False: 0] ------------------ 1086| 878k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 878k, False: 0] ------------------ 1087| 878k| using std::get; 1088| 878k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 1.87k, False: 876k] ------------------ 1089| 1.87k| l = r; 1090| 876k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 2.31k, False: 874k] ------------------ 1091| 2.31k| return; 1092| 874k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 273k, False: 601k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 273k| auto tail_offst = l.tail_offset(); 1095| 273k| auto tail_size = l.size - tail_offst; 1096| 273k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 36.1k, False: 237k] ------------------ 1097| 36.1k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 36.1k| l.tail = r.tail->inc(); 1099| 36.1k| l.size += r.size; 1100| 36.1k| return; 1101| 237k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 3.13k, False: 234k] ------------------ 1102| 3.13k| l.ensure_mutable_tail(el, tail_size); 1103| 3.13k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 1.72k, False: 1.41k] ------------------ 1104| 1.72k| detail::uninitialized_move(r.tail->leaf(), 1105| 1.72k| r.tail->leaf() + r.size, 1106| 1.72k| l.tail->leaf() + tail_size); 1107| 1.41k| else 1108| 1.41k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.41k| r.tail->leaf() + r.size, 1110| 1.41k| l.tail->leaf() + tail_size); 1111| 3.13k| l.size += r.size; 1112| 3.13k| return; 1113| 234k| } else { 1114| 234k| auto remaining = branches - tail_size; 1115| 234k| l.ensure_mutable_tail(el, tail_size); 1116| 234k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 96.5k, False: 137k] ------------------ 1117| 96.5k| detail::uninitialized_move(r.tail->leaf(), 1118| 96.5k| r.tail->leaf() + remaining, 1119| 96.5k| l.tail->leaf() + tail_size); 1120| 137k| else 1121| 137k| detail::uninitialized_copy(r.tail->leaf(), 1122| 137k| r.tail->leaf() + remaining, 1123| 137k| l.tail->leaf() + tail_size); 1124| 234k| IMMER_TRY { ------------------ | | 49| 234k|#define IMMER_TRY try ------------------ 1125| 234k| auto new_tail = 1126| 234k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 234k| IMMER_TRY { ------------------ | | 49| 234k|#define IMMER_TRY try ------------------ 1128| 234k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 234k| l.tail = new_tail; 1130| 234k| l.size += r.size; 1131| 234k| return; 1132| 234k| } 1133| 234k| 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| 234k| } 1138| 234k| 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| 234k| } 1143| 601k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.58k, False: 597k] ------------------ 1144| 3.58k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.58k] ------------------ 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.58k| } else { 1165| 3.58k| auto tail_offst = l.tail_offset(); 1166| 3.58k| auto tail_size = l.size - tail_offst; 1167| 3.58k| auto concated = concat_trees( 1168| 3.58k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.58k| l = {l.size + r.size, 1170| 3.58k| concated.shift(), 1171| 3.58k| concated.node(), 1172| 3.58k| r.tail->inc()}; 1173| 3.58k| return; 1174| 3.58k| } 1175| 597k| } else { 1176| 597k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 597k] ------------------ 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| 597k| } else { 1200| 597k| auto tail_offst = l.tail_offset(); 1201| 597k| auto tail_size = l.size - tail_offst; 1202| 597k| auto concated = concat_trees(l.root, 1203| 597k| l.shift, 1204| 597k| tail_offst, 1205| 597k| l.tail, 1206| 597k| tail_size, 1207| 597k| r.root, 1208| 597k| r.shift, 1209| 597k| r.tail_offset()); 1210| 597k| l = {l.size + r.size, 1211| 597k| concated.shift(), 1212| 597k| concated.node(), 1213| 597k| r.tail->inc()}; 1214| 597k| return; 1215| 597k| } 1216| 597k| } 1217| 878k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6equalsERKSB_: 315| 76.1k| { 316| 76.1k| using iter_t = rrbtree_iterator; 317| 76.1k| if (size != other.size) ------------------ | Branch (317:13): [True: 53.3k, False: 22.7k] ------------------ 318| 53.3k| return false; 319| 22.7k| if (size == 0) ------------------ | Branch (319:13): [True: 253, False: 22.5k] ------------------ 320| 253| return true; 321| 22.5k| auto tail_off = tail_offset(); 322| 22.5k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 22.5k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 21.5k, False: 964] | Branch (324:29): [True: 21.3k, False: 198] ------------------ 325| | // other.shift != shift is a theoretical possibility for 326| | // relaxed trees that sadly we haven't managed to exercise 327| | // in tests yet... 328| 21.3k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 20.7k, False: 637] ------------------ 329| 20.7k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 11.1k, False: 9.63k] ------------------ 330| 20.7k| other.shift, 331| 20.7k| tail_off_other, 332| 20.7k| equals_visitor::rrb{}, 333| 20.7k| iter_t{other}, 334| 20.7k| root, 335| 20.7k| shift, 336| 20.7k| tail_off)) 337| 11.1k| return false; 338| 20.7k| } else { 339| 637| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 229, False: 408] ------------------ 340| 637| shift, 341| 637| tail_off, 342| 637| equals_visitor::rrb{}, 343| 637| iter_t{*this}, 344| 637| other.root, 345| 637| other.shift, 346| 637| tail_off_other)) 347| 229| return false; 348| 637| } 349| 21.3k| } 350| 11.2k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 6.54k, False: 4.65k] ------------------ 351| 11.2k| ? make_leaf_sub_pos(tail, tail_size()) 352| 6.54k| .visit(equals_visitor{}, other.tail) 353| 11.2k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 2.09k, False: 2.56k] ------------------ 354| 4.65k| ? std::equal(tail->leaf(), 355| 2.09k| tail->leaf() + (size - tail_off), 356| 2.09k| other.tail->leaf() + 357| 2.09k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 4.65k| : std::equal(tail->leaf(), 360| 2.56k| tail->leaf() + (size - tail_off), 361| 2.56k| iter_t{other} + tail_off); 362| 22.5k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10region_forEm: 524| 1.28M| { 525| 1.28M| using std::get; 526| 1.28M| auto tail_off = tail_offset(); 527| 1.28M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 4.34k, False: 1.27M] ------------------ 528| 4.34k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.27M| } else { 530| 1.27M| auto subs = visit_maybe_relaxed_sub( 531| 1.27M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.27M| auto first = idx - get<1>(subs); 533| 1.27M| auto end = first + get<2>(subs); 534| 1.27M| return std::make_tuple(get<0>(subs), first, end); 535| 1.27M| } 536| 1.28M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11dereferenceEv: 90| 9.72M| { 91| 9.72M| using std::get; 92| 9.72M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 85.9k, False: 9.63M] | Branch (92:35): [True: 1.19M, False: 8.43M] ------------------ 93| 1.28M| curr_ = v_->region_for(i_); 94| 9.72M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 9.72M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7advanceEl: 74| 183k| { 75| 183k| using std::get; 76| 183k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 329, False: 182k] | Branch (76:9): [True: 182k, False: 0] | Branch (76:9): [True: 183k, False: 0] ------------------ 77| 183k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 183k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 183k, False: 0] ------------------ 78| 183k| i_ += n; 79| 183k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9incrementEv: 60| 8.50M| { 61| 8.50M| using std::get; 62| 8.50M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 8.50M, False: 0] ------------------ 63| 8.50M| ++i_; 64| 8.50M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKNS1_7rrbtreeIiSA_Lj3ELj3EEE: 39| 23.9k| : v_{&v} 40| 23.9k| , i_{0} 41| 23.9k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 23.9k| { 43| 23.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 26.5k| { 32| 26.5k| return Deriv::visit_inner(std::forward(args)...); 33| 26.5k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 104k| { 32| 104k| return Deriv::visit_inner(std::forward(args)...); 33| 104k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EEEE13visit_regularIJRNS1_15regular_sub_posISD_EERmEEEDcDpOT_: 37| 1.79k| { 38| 1.79k| return Deriv::visit_inner(std::forward(args)...); 39| 1.79k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EEEE13visit_regularIJRNS1_8full_posISD_EEmEEEDcDpOT_: 37| 7.69k| { 38| 7.69k| return Deriv::visit_inner(std::forward(args)...); 39| 7.69k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EEEE13visit_regularIJRNS1_15regular_sub_posISD_EERmEEEDcDpOT_: 37| 8.21k| { 38| 8.21k| return Deriv::visit_inner(std::forward(args)...); 39| 8.21k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EEEE13visit_regularIJRNS1_8full_posISD_EEmEEEDcDpOT_: 37| 737| { 38| 737| return Deriv::visit_inner(std::forward(args)...); 39| 737| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EEEE13visit_regularIJRNS1_15regular_sub_posISD_EEmEEEDcDpOT_: 37| 1.50k| { 38| 1.50k| return Deriv::visit_inner(std::forward(args)...); 39| 1.50k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_25singleton_regular_sub_posISD_EENS1_14empty_leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 7.72k| { 38| 7.72k| return Deriv::visit_inner(std::forward(args)...); 39| 7.72k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_25singleton_regular_sub_posISD_EENS1_14empty_leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 7.72k| { 44| 7.72k| return Deriv::visit_node(std::forward(args)...); 45| 7.72k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 31| 5.56k| { 32| 5.56k| return Deriv::visit_inner(std::forward(args)...); 33| 5.56k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 43| 5.56k| { 44| 5.56k| return Deriv::visit_node(std::forward(args)...); 45| 5.56k| } _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_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 49| 7.80M| { 50| 7.80M| return Deriv::visit_node(std::forward(args)...); 51| 7.80M| } _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_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 31| 107M| { 32| 107M| return Deriv::visit_inner(std::forward(args)...); 33| 107M| } _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_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 43| 107M| { 44| 107M| return Deriv::visit_node(std::forward(args)...); 45| 107M| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 31| 107M| { 32| 107M| return Deriv::visit_inner(std::forward(args)...); 33| 107M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 31| 19.4k| { 32| 19.4k| return Deriv::visit_inner(std::forward(args)...); 33| 19.4k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 290| { 38| 290| return Deriv::visit_inner(std::forward(args)...); 39| 290| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 920| { 38| 920| return Deriv::visit_inner(std::forward(args)...); 39| 920| } _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_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 49| 5.30M| { 50| 5.30M| return Deriv::visit_node(std::forward(args)...); 51| 5.30M| } _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_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 37| 528k| { 38| 528k| return Deriv::visit_inner(std::forward(args)...); 39| 528k| } _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_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 43| 528k| { 44| 528k| return Deriv::visit_node(std::forward(args)...); 45| 528k| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 37| 528k| { 38| 528k| return Deriv::visit_inner(std::forward(args)...); 39| 528k| } _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_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 37| 3.77M| { 38| 3.77M| return Deriv::visit_inner(std::forward(args)...); 39| 3.77M| } _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_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 43| 3.77M| { 44| 3.77M| return Deriv::visit_node(std::forward(args)...); 45| 3.77M| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 37| 3.77M| { 38| 3.77M| return Deriv::visit_inner(std::forward(args)...); 39| 3.77M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 2.16k| { 38| 2.16k| return Deriv::visit_inner(std::forward(args)...); 39| 2.16k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 43| 2.16k| { 44| 2.16k| return Deriv::visit_node(std::forward(args)...); 45| 2.16k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 31| 1.02M| { 32| 1.02M| return Deriv::visit_inner(std::forward(args)...); 33| 1.02M| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 1.02M| { 44| 1.02M| return Deriv::visit_node(std::forward(args)...); 45| 1.02M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 1.01M| { 32| 1.01M| return Deriv::visit_inner(std::forward(args)...); 33| 1.01M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 1.01M| { 44| 1.01M| return Deriv::visit_node(std::forward(args)...); 45| 1.01M| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 31| 3.21M| { 32| 3.21M| return Deriv::visit_inner(std::forward(args)...); 33| 3.21M| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_: 37| 4.20k| { 38| 4.20k| return Deriv::visit_inner(std::forward(args)...); 39| 4.20k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 1.05M| { 32| 1.05M| return Deriv::visit_inner(std::forward(args)...); 33| 1.05M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 328k| { 38| 328k| return Deriv::visit_inner(std::forward(args)...); 39| 328k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 37| 1.33k| { 38| 1.33k| return Deriv::visit_inner(std::forward(args)...); 39| 1.33k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 26.2k| { 38| 26.2k| return Deriv::visit_inner(std::forward(args)...); 39| 26.2k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_: 37| 7.14k| { 38| 7.14k| return Deriv::visit_inner(std::forward(args)...); 39| 7.14k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 37| 18.5k| { 38| 18.5k| return Deriv::visit_inner(std::forward(args)...); 39| 18.5k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_: 37| 1.37M| { 38| 1.37M| return Deriv::visit_inner(std::forward(args)...); 39| 1.37M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 7.12M| { 32| 7.12M| return Deriv::visit_inner(std::forward(args)...); 33| 7.12M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 703| { 38| 703| return Deriv::visit_inner(std::forward(args)...); 39| 703| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_15regular_sub_posISD_EEEEEDcDpOT_: 31| 63.4k| { 32| 63.4k| return Deriv::visit_inner(std::forward(args)...); 33| 63.4k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 1.86k| { 38| 1.86k| return Deriv::visit_inner(std::forward(args)...); 39| 1.86k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_: 31| 231| { 32| 231| return Deriv::visit_inner(std::forward(args)...); 33| 231| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_15regular_sub_posISD_EEEEEDcDpOT_: 31| 822| { 32| 822| return Deriv::visit_inner(std::forward(args)...); 33| 822| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 31| 7.08M| { 32| 7.08M| return Deriv::visit_inner(std::forward(args)...); 33| 7.08M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 18.1k| { 38| 18.1k| return Deriv::visit_inner(std::forward(args)...); 39| 18.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 18.1k| { 44| 18.1k| return Deriv::visit_node(std::forward(args)...); 45| 18.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 16.9k| { 38| 16.9k| return Deriv::visit_inner(std::forward(args)...); 39| 16.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 16.9k| { 44| 16.9k| return Deriv::visit_node(std::forward(args)...); 45| 16.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 6.80k| { 32| 6.80k| return Deriv::visit_inner(std::forward(args)...); 33| 6.80k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 6.80k| { 44| 6.80k| return Deriv::visit_node(std::forward(args)...); 45| 6.80k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 10.1k| { 38| 10.1k| return Deriv::visit_inner(std::forward(args)...); 39| 10.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 10.1k| { 44| 10.1k| return Deriv::visit_node(std::forward(args)...); 45| 10.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 31| 12.5k| { 32| 12.5k| return Deriv::visit_inner(std::forward(args)...); 33| 12.5k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 43| 12.5k| { 44| 12.5k| return Deriv::visit_node(std::forward(args)...); 45| 12.5k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 24.3k| { 32| 24.3k| return Deriv::visit_inner(std::forward(args)...); 33| 24.3k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_15regular_sub_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 1.94k| { 32| 1.94k| return Deriv::visit_inner(std::forward(args)...); 33| 1.94k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_8full_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 606| { 32| 606| return Deriv::visit_inner(std::forward(args)...); 33| 606| } _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_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_8full_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 873| { 38| 873| return Deriv::visit_inner(std::forward(args)...); 39| 873| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERmEEEDcDpOT_: 31| 4.41M| { 32| 4.41M| return Deriv::visit_inner(std::forward(args)...); 33| 4.41M| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERmEEEDcDpOT_: 37| 318k| { 38| 318k| return Deriv::visit_inner(std::forward(args)...); 39| 318k| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERmEEEDcDpOT_: 37| 348k| { 38| 348k| return Deriv::visit_inner(std::forward(args)...); 39| 348k| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_regularIJRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERmEEEDcDpOT_: 37| 37.3k| { 38| 37.3k| return Deriv::visit_inner(std::forward(args)...); 39| 37.3k| } _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_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj3ELj3EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 27.1k| { 38| 27.1k| return Deriv::visit_inner(std::forward(args)...); 39| 27.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 819| { 38| 819| return Deriv::visit_inner(std::forward(args)...); 39| 819| } _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_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj3ELj3EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 15.0k| { 38| 15.0k| return Deriv::visit_inner(std::forward(args)...); 39| 15.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_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj3ELj3EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 4.76k| { 38| 4.76k| return Deriv::visit_inner(std::forward(args)...); 39| 4.76k| } _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_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 4.86k| { 38| 4.86k| return Deriv::visit_inner(std::forward(args)...); 39| 4.86k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 4.72k| { 38| 4.72k| return Deriv::visit_inner(std::forward(args)...); 39| 4.72k| } _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_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj3ELj3EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 31| 136k| { 32| 136k| return Deriv::visit_inner(std::forward(args)...); 33| 136k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERPSH_RjRmEEEDcDpOT_: 31| 1.12k| { 32| 1.12k| return Deriv::visit_inner(std::forward(args)...); 33| 1.12k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERPSH_RjRmEEEDcDpOT_: 43| 1.12k| { 44| 1.12k| return Deriv::visit_node(std::forward(args)...); 45| 1.12k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 37| 8.79k| { 38| 8.79k| return Deriv::visit_inner(std::forward(args)...); 39| 8.79k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 43| 8.79k| { 44| 8.79k| return Deriv::visit_node(std::forward(args)...); 45| 8.79k| } _ZN5immer6detail15auto_const_castINS_22unsafe_refcount_policyEEERT_RKS3_: 143| 456M|{ 144| 456M| return const_cast(x); 145| 456M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 284M| { 114| 284M| check_base(); 115| 284M| auto* base = static_cast(this); 116| 284M| return reinterpret_cast(base + 1); 117| 284M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 284M| { 135| 284M| static_assert(std::is_standard_layout::value && 136| 284M| !std::is_empty::value, 137| 284M| "Please add 'true' if the derived class is emtpy"); 138| 284M| } _ZN5immer6detail9static_ifILb0EZNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14delete_inner_rEPSC_jEUlT_E_EENSt3__19enable_ifIXntT_EvE4typeEOT0_: 334| 32.9M|{ 335| 32.9M|} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 1.62M|{ 189| 1.62M| return first + n; 190| 1.62M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6leaf_tEiLb1EE15get_storage_ptrEv: 75| 11.4M| { 76| 11.4M| check_base(); 77| 11.4M| return reinterpret_cast(this); 78| 11.4M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6leaf_tEiLb1EE10check_baseEv: 94| 11.4M| { 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| 11.4M| static_assert(std::is_standard_layout::value, 100| 11.4M| "Please remove 'true' if the derived class is non emtpy"); 101| 11.4M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 2.15M|{ 237| 2.15M| return std::copy(first, last, out); 238| 2.15M|} _ZN5immer6detail9static_ifILb1EPNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEZNSC_15make_inner_sr_nEjPNS0_3csl6memberINSC_14relaxed_data_tEvE4typeEEUlT_E_ZNSC_15make_inner_sr_nEjSJ_EUlSK_E0_EENSt3__19enable_ifIXT_ET0_E4typeEOT1_OT2_: 339| 210k|{ 340| 210k| return std::forward(f1)(empty_t{}); 341| 210k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 51.1M|{ 324| 51.1M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 2.43M, False: 48.7M] ------------------ 325| 51.1M|} _ZN5immer6detail9static_ifILb1EPNS0_3csl6memberINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14relaxed_data_tEvE4typeEZNSE_24ensure_mutable_relaxed_nENSC_5applyIS9_E4type4editEjEUlT_E_ZNSE_24ensure_mutable_relaxed_nESM_jEUlSN_E0_EENSt3__19enable_ifIXT_ET0_E4typeEOT1_OT2_: 339| 180k|{ 340| 180k| return std::forward(f1)(empty_t{}); 341| 180k|} _ZN5immer6detail9static_ifILb0EZNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_eENSA_5applyIS7_E4type4editEEUlT_E_EENSt3__19enable_ifIXntT_EvE4typeEOT0_: 334| 162k|{ 335| 162k|} _ZN5immer6detail9static_ifILb1EPNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEZNSC_15make_inner_sr_eENSA_5applyIS7_E4type4editEPNS0_3csl6memberINSC_14relaxed_data_tEvE4typeEEUlT_E_ZNSC_15make_inner_sr_eESH_SN_EUlSO_E0_EENSt3__19enable_ifIXT_ET0_E4typeEOT1_OT2_: 339| 34.8k|{ 340| 34.8k| return std::forward(f1)(empty_t{}); 341| 34.8k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 355|{ 189| 355| return first + n; 190| 355|} _ZN5immer6detail9static_ifILb1EPNS0_3csl6memberINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14relaxed_data_tEvE4typeEZNSE_22ensure_mutable_relaxedENSC_5applyIS9_E4type4editEEUlT_E_ZNSE_22ensure_mutable_relaxedESM_EUlSN_E0_EENSt3__19enable_ifIXT_ET0_E4typeEOT1_OT2_: 339| 209k|{ 340| 209k| return std::forward(f1)(empty_t{}); 341| 209k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 98.2k|{ 211| 98.2k| return std::copy(first, last, out); 212| 98.2k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.20M|{ 30| 1.20M| return x; 31| 1.20M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 15.4k|{ 261| 15.4k| auto ptr = Heap::allocate(sizeof(T)); 262| 15.4k| IMMER_TRY { ------------------ | | 49| 15.4k|#define IMMER_TRY try ------------------ 263| 15.4k| return new (ptr) T(std::forward(args)...); 264| 15.4k| } 265| 15.4k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 15.4k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 96| 82.7k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 246| 341k| { 247| 341k| return impl_.push_back(std::move(value)); 248| 341k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj3ELj3EEE: 536| 1.24M| : impl_(std::move(impl)) 537| 1.24M| { 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| 1.24M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4sizeEv: 181| 3.99M| IMMER_NODISCARD size_type size() const { return impl_.size; } flex-vector-bo.cpp:_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E_EES9_mOSE_: 323| 167k| { 324| 167k| return impl_.update(index, std::forward(fn)); 325| 167k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 350| 23.6k| { 351| 23.6k| return impl_.take(elems); 352| 23.6k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 376| 39.1k| { 377| 39.1k| return impl_.drop(elems); 378| 39.1k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8max_sizeEv: 90| 1.76M| 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_policyELb1ELb1EEELj3ELj3EEESB_: 403| 675k| { 404| 675k| return l.impl_.concat(r.impl_); 405| 675k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 251| 39.2k| { 252| 39.2k| return push_back_move(move_t{}, std::move(value)); 253| 39.2k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 39.2k| { 548| 39.2k| impl_.push_back_mut({}, std::move(value)); 549| 39.2k| return std::move(*this); 550| 39.2k| } flex-vector-bo.cpp:_ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEDcmOSE_: 329| 35.0k| { 330| 35.0k| return update_move(move_t{}, index, std::forward(fn)); 331| 35.0k| } flex-vector-bo.cpp:_ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11update_moveIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEOS9_NSt3__117integral_constantIbLb1EEEmOSE_: 568| 35.0k| { 569| 35.0k| impl_.update_mut({}, index, std::forward(fn)); 570| 35.0k| return std::move(*this); 571| 35.0k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 355| 31.6k| { 356| 31.6k| return take_move(move_t{}, elems); 357| 31.6k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 31.6k| { 580| 31.6k| impl_.take_mut({}, elems); 581| 31.6k| return std::move(*this); 582| 31.6k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 381| 68.5k| { 382| 68.5k| return drop_move(move_t{}, elems); 383| 68.5k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 68.5k| { 590| 68.5k| impl_.drop_mut({}, elems); 591| 68.5k| return std::move(*this); 592| 68.5k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERKS9_: 409| 198k| { 410| 198k| return concat_move(move_t{}, std::move(l), r); 411| 198k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 198k| { 601| 198k| concat_mut_l(l.impl_, {}, r.impl_); 602| 198k| return std::move(l); 603| 198k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEOS9_: 415| 3.81k| { 416| 3.81k| return concat_move(move_t{}, l, std::move(r)); 417| 3.81k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 3.81k| { 607| 3.81k| concat_mut_r(l.impl_, r.impl_, {}); 608| 3.81k| return std::move(r); 609| 3.81k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESA_: 421| 878k| { 422| 878k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 878k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 878k| { 613| 878k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 878k| return std::move(l); 615| 878k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEeqERKS9_: 222| 76.1k| { 223| 76.1k| return impl_.equals(other.impl_); 224| 76.1k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5eraseEm: 480| 6.36k| { 481| 6.36k| return take(pos) + drop(pos + 1); 482| 6.36k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6insertEmi: 442| 15.4k| { 443| 15.4k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 15.4k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 36.0M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 36.0M| { 28| 36.0M| return ::operator new(size); 29| 36.0M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 15.4k| { 50| 15.4k| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 15.4k| new (p) std::size_t{size}; 52| 15.4k| return ((char*) p) + extra_size; 53| 15.4k| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 15.4k| { 58| 15.4k| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 15.4k| assert(*p == size); ------------------ | Branch (59:9): [True: 15.4k, False: 0] ------------------ 60| 15.4k| Base::deallocate(size + extra_size, p, tags...); 61| 15.4k| } _ZN5immer15refcount_policyC2Ev: 28| 15.4k| : refcount{1} {}; _ZN5immer15refcount_policy3decEv: 36| 15.4k| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer22unsafe_refcount_policyC2Ev: 27| 36.0M| : refcount{1} {}; _ZN5immer22unsafe_refcount_policy3incEv: 33| 208M| void inc() { ++refcount; } _ZN5immer22unsafe_refcount_policy3decEv: 34| 244M| bool dec() { return --refcount == 0; } _ZN5immer22unsafe_refcount_policy6uniqueEv: 35| 2.63M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee5ownedEv: 36| 36.0M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee10can_mutateENS6_4editE: 35| 294k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeaSENS6_4editE: 34| 653k| ownee& operator=(edit) { return *this; };