LLVMFuzzerTestOneInput: 24| 11.0k|{ 25| 11.0k| constexpr auto var_count = 8; 26| 11.0k| constexpr auto bits = 3; 27| | 28| 11.0k| using vector_t = immer::flex_vector; 29| 11.0k| using size_t = std::uint8_t; 30| | 31| 11.0k| auto vars = std::array{}; 32| | 33| 11.0k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 34| 11.0k| auto is_valid_var_neq = [](auto other) { 35| 11.0k| return [=](auto idx) { 36| 11.0k| return idx >= 0 && idx < var_count && idx != other; 37| 11.0k| }; 38| 11.0k| }; 39| 11.0k| auto is_valid_index = [](auto& v) { 40| 11.0k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 11.0k| }; 42| 11.0k| auto is_valid_size = [](auto& v) { 43| 11.0k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 11.0k| }; 45| 11.0k| auto can_concat = [](auto&& v1, auto&& v2) { 46| 11.0k| return v1.size() + v2.size() < vector_t::max_size(); 47| 11.0k| }; 48| 11.0k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 11.0k| return v.size() < (1 << 15); 51| 11.0k| }; 52| 11.0k| return fuzzer_input{data, size}.run([&](auto& in) { 53| 11.0k| enum ops 54| 11.0k| { 55| 11.0k| op_push_back, 56| 11.0k| op_update, 57| 11.0k| op_take, 58| 11.0k| op_drop, 59| 11.0k| op_concat, 60| 11.0k| op_push_back_move, 61| 11.0k| op_update_move, 62| 11.0k| op_take_move, 63| 11.0k| op_drop_move, 64| 11.0k| op_concat_move_l, 65| 11.0k| op_concat_move_r, 66| 11.0k| op_concat_move_lr, 67| 11.0k| op_insert, 68| 11.0k| op_erase, 69| 11.0k| op_compare, 70| 11.0k| }; 71| 11.0k| auto src = read(in, is_valid_var); 72| 11.0k| auto dst = read(in, is_valid_var); 73| 11.0k| switch (read(in)) { 74| 11.0k| case op_push_back: { 75| 11.0k| vars[dst] = vars[src].push_back(42); 76| 11.0k| break; 77| 11.0k| } 78| 11.0k| case op_update: { 79| 11.0k| auto idx = read(in, is_valid_index(vars[src])); 80| 11.0k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 11.0k| break; 82| 11.0k| } 83| 11.0k| case op_take: { 84| 11.0k| auto idx = read(in, is_valid_size(vars[src])); 85| 11.0k| vars[dst] = vars[src].take(idx); 86| 11.0k| break; 87| 11.0k| } 88| 11.0k| case op_drop: { 89| 11.0k| auto idx = read(in, is_valid_size(vars[src])); 90| 11.0k| vars[dst] = vars[src].drop(idx); 91| 11.0k| break; 92| 11.0k| } 93| 11.0k| case op_concat: { 94| 11.0k| auto src2 = read(in, is_valid_var); 95| 11.0k| if (can_concat(vars[src], vars[src2])) 96| 11.0k| vars[dst] = vars[src] + vars[src2]; 97| 11.0k| break; 98| 11.0k| } 99| 11.0k| case op_push_back_move: { 100| 11.0k| vars[dst] = std::move(vars[src]).push_back(21); 101| 11.0k| break; 102| 11.0k| } 103| 11.0k| case op_update_move: { 104| 11.0k| auto idx = read(in, is_valid_index(vars[src])); 105| 11.0k| vars[dst] = 106| 11.0k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 11.0k| break; 108| 11.0k| } 109| 11.0k| case op_take_move: { 110| 11.0k| auto idx = read(in, is_valid_size(vars[src])); 111| 11.0k| vars[dst] = std::move(vars[src]).take(idx); 112| 11.0k| break; 113| 11.0k| } 114| 11.0k| case op_drop_move: { 115| 11.0k| auto idx = read(in, is_valid_size(vars[src])); 116| 11.0k| vars[dst] = std::move(vars[src]).drop(idx); 117| 11.0k| break; 118| 11.0k| } 119| 11.0k| case op_concat_move_l: { 120| 11.0k| auto src2 = read(in, is_valid_var_neq(src)); 121| 11.0k| if (can_concat(vars[src], vars[src2])) 122| 11.0k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 11.0k| break; 124| 11.0k| } 125| 11.0k| case op_concat_move_r: { 126| 11.0k| auto src2 = read(in, is_valid_var_neq(src)); 127| 11.0k| if (can_concat(vars[src], vars[src2])) 128| 11.0k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 11.0k| break; 130| 11.0k| } 131| 11.0k| case op_concat_move_lr: { 132| 11.0k| auto src2 = read(in, is_valid_var_neq(src)); 133| 11.0k| if (can_concat(vars[src], vars[src2])) 134| 11.0k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 11.0k| break; 136| 11.0k| } 137| 11.0k| case op_compare: { 138| 11.0k| using std::swap; 139| 11.0k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 140| 11.0k| swap(vars[src], vars[dst]); 141| 11.0k| break; 142| 11.0k| } 143| 11.0k| case op_erase: { 144| 11.0k| auto idx = read(in, is_valid_index(vars[src])); 145| 11.0k| vars[dst] = vars[src].erase(idx); 146| 11.0k| break; 147| 11.0k| } 148| 11.0k| case op_insert: { 149| 11.0k| auto idx = read(in, is_valid_size(vars[src])); 150| 11.0k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 11.0k| break; 152| 11.0k| } 153| 11.0k| default: 154| 11.0k| break; 155| 11.0k| }; 156| 11.0k| return true; 157| 11.0k| }); 158| 11.0k|} flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 52| 2.69M| return fuzzer_input{data, size}.run([&](auto& in) { 53| 2.69M| enum ops 54| 2.69M| { 55| 2.69M| op_push_back, 56| 2.69M| op_update, 57| 2.69M| op_take, 58| 2.69M| op_drop, 59| 2.69M| op_concat, 60| 2.69M| op_push_back_move, 61| 2.69M| op_update_move, 62| 2.69M| op_take_move, 63| 2.69M| op_drop_move, 64| 2.69M| op_concat_move_l, 65| 2.69M| op_concat_move_r, 66| 2.69M| op_concat_move_lr, 67| 2.69M| op_insert, 68| 2.69M| op_erase, 69| 2.69M| op_compare, 70| 2.69M| }; 71| 2.69M| auto src = read(in, is_valid_var); 72| 2.69M| auto dst = read(in, is_valid_var); 73| 2.69M| switch (read(in)) { 74| 349k| case op_push_back: { ------------------ | Branch (74:9): [True: 349k, False: 2.34M] ------------------ 75| 349k| vars[dst] = vars[src].push_back(42); 76| 349k| break; 77| 0| } 78| 168k| case op_update: { ------------------ | Branch (78:9): [True: 168k, False: 2.52M] ------------------ 79| 168k| auto idx = read(in, is_valid_index(vars[src])); 80| 168k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 168k| break; 82| 0| } 83| 2.01k| case op_take: { ------------------ | Branch (83:9): [True: 2.01k, False: 2.69M] ------------------ 84| 2.01k| auto idx = read(in, is_valid_size(vars[src])); 85| 2.01k| vars[dst] = vars[src].take(idx); 86| 2.01k| break; 87| 0| } 88| 14.7k| case op_drop: { ------------------ | Branch (88:9): [True: 14.7k, False: 2.68M] ------------------ 89| 14.7k| auto idx = read(in, is_valid_size(vars[src])); 90| 14.7k| vars[dst] = vars[src].drop(idx); 91| 14.7k| break; 92| 0| } 93| 692k| case op_concat: { ------------------ | Branch (93:9): [True: 692k, False: 2.00M] ------------------ 94| 692k| auto src2 = read(in, is_valid_var); 95| 692k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (95:17): [True: 677k, False: 14.6k] ------------------ 96| 677k| vars[dst] = vars[src] + vars[src2]; 97| 692k| break; 98| 0| } 99| 24.7k| case op_push_back_move: { ------------------ | Branch (99:9): [True: 24.7k, False: 2.67M] ------------------ 100| 24.7k| vars[dst] = std::move(vars[src]).push_back(21); 101| 24.7k| break; 102| 0| } 103| 33.3k| case op_update_move: { ------------------ | Branch (103:9): [True: 33.3k, False: 2.66M] ------------------ 104| 33.3k| auto idx = read(in, is_valid_index(vars[src])); 105| 33.3k| vars[dst] = 106| 33.3k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 33.3k| break; 108| 0| } 109| 31.8k| case op_take_move: { ------------------ | Branch (109:9): [True: 31.8k, False: 2.66M] ------------------ 110| 31.8k| auto idx = read(in, is_valid_size(vars[src])); 111| 31.8k| vars[dst] = std::move(vars[src]).take(idx); 112| 31.8k| break; 113| 0| } 114| 62.3k| case op_drop_move: { ------------------ | Branch (114:9): [True: 62.3k, False: 2.63M] ------------------ 115| 62.3k| auto idx = read(in, is_valid_size(vars[src])); 116| 62.3k| vars[dst] = std::move(vars[src]).drop(idx); 117| 62.3k| break; 118| 0| } 119| 222k| case op_concat_move_l: { ------------------ | Branch (119:9): [True: 222k, False: 2.47M] ------------------ 120| 222k| auto src2 = read(in, is_valid_var_neq(src)); 121| 222k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (121:17): [True: 216k, False: 5.26k] ------------------ 122| 216k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 222k| break; 124| 0| } 125| 4.02k| case op_concat_move_r: { ------------------ | Branch (125:9): [True: 4.02k, False: 2.69M] ------------------ 126| 4.02k| auto src2 = read(in, is_valid_var_neq(src)); 127| 4.02k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (127:17): [True: 3.63k, False: 386] ------------------ 128| 3.63k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 4.02k| break; 130| 0| } 131| 943k| case op_concat_move_lr: { ------------------ | Branch (131:9): [True: 943k, False: 1.75M] ------------------ 132| 943k| auto src2 = read(in, is_valid_var_neq(src)); 133| 943k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (133:17): [True: 929k, False: 13.7k] ------------------ 134| 929k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 943k| break; 136| 0| } 137| 92.1k| case op_compare: { ------------------ | Branch (137:9): [True: 92.1k, False: 2.60M] ------------------ 138| 92.1k| using std::swap; 139| 92.1k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (139:17): [True: 78.5k, False: 13.6k] | Branch (139:43): [True: 5.72k, False: 72.7k] ------------------ 140| 5.72k| swap(vars[src], vars[dst]); 141| 92.1k| break; 142| 0| } 143| 6.57k| case op_erase: { ------------------ | Branch (143:9): [True: 6.57k, False: 2.68M] ------------------ 144| 6.57k| auto idx = read(in, is_valid_index(vars[src])); 145| 6.57k| vars[dst] = vars[src].erase(idx); 146| 6.57k| break; 147| 0| } 148| 15.9k| case op_insert: { ------------------ | Branch (148:9): [True: 15.9k, False: 2.67M] ------------------ 149| 15.9k| auto idx = read(in, is_valid_size(vars[src])); 150| 15.9k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 15.9k| break; 152| 0| } 153| 21.6k| default: ------------------ | Branch (153:9): [True: 21.6k, False: 2.67M] ------------------ 154| 21.6k| break; 155| 2.69M| }; 156| 2.68M| return true; 157| 2.69M| }); flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 33| 6.45M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (33:48): [True: 6.26M, False: 187k] | Branch (33:60): [True: 6.06M, False: 198k] ------------------ 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| 234k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (40:39): [True: 234k, False: 0] | Branch (40:51): [True: 208k, False: 26.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| 168k| 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| 138k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (43:39): [True: 138k, False: 0] | Branch (43:51): [True: 126k, False: 11.4k] ------------------ flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_: 42| 126k| auto is_valid_size = [](auto& v) { 43| 126k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 126k| }; 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.86M| auto can_concat = [](auto&& v1, auto&& v2) { 46| 1.86M| return v1.size() + v2.size() < vector_t::max_size(); 47| 1.86M| }; flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 106| 33.3k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 35| 1.22M| return [=](auto idx) { 36| 1.22M| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (36:20): [True: 1.21M, False: 11.5k] | Branch (36:32): [True: 1.19M, False: 19.5k] | Branch (36:51): [True: 1.16M, False: 27.4k] ------------------ 37| 1.22M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 34| 1.16M| auto is_valid_var_neq = [](auto other) { 35| 1.16M| return [=](auto idx) { 36| 1.16M| return idx >= 0 && idx < var_count && idx != other; 37| 1.16M| }; 38| 1.16M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 48| 92.1k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 92.1k| return v.size() < (1 << 15); 51| 92.1k| }; flex-vector-bo.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 11.0k| { 51| 11.0k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 6, False: 11.0k] ------------------ 52| 6| return 0; 53| 11.0k| try { 54| 2.69M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.68M, False: 11.0k] ------------------ 55| 2.68M| continue; 56| 11.0k| } catch (const no_more_input&) { 57| 11.0k| }; 58| 11.0k| return 0; 59| 11.0k| } flex-vector-bo.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 6.07M|{ 71| 6.07M| auto x = read(fz); 72| 6.46M| while (!cond(x)) ------------------ | Branch (72:12): [True: 386k, False: 6.07M] ------------------ 73| 386k| x = read(fz); 74| 6.07M| return x; 75| 6.07M|} _Z4readIcERKT_R12fuzzer_input: 64| 10.3M|{ 65| 10.3M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 10.3M|} _ZN12fuzzer_input4nextEmm: 40| 10.7M| { 41| 10.7M| auto& p = const_cast(reinterpret_cast(data_)); 42| 10.7M| auto r = std::align(align, size, p, size_); 43| 10.7M| if (r == nullptr) ------------------ | Branch (43:13): [True: 11.0k, False: 10.7M] ------------------ 44| 11.0k| throw no_more_input{}; 45| 10.7M| return next(size); 46| 10.7M| } _ZN12fuzzer_input4nextEm: 30| 10.7M| { 31| 10.7M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 10.7M] ------------------ 32| 0| throw no_more_input{}; 33| 10.7M| auto r = data_; 34| 10.7M| data_ += size; 35| 10.7M| size_ -= size; 36| 10.7M| return r; 37| 10.7M| } 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| 234k| while (!cond(x)) ------------------ | Branch (72:12): [True: 26.6k, False: 208k] ------------------ 73| 26.6k| x = read(fz); 74| 208k| return x; 75| 208k|} _Z4readIhERKT_R12fuzzer_input: 64| 373k|{ 65| 373k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 373k|} 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| 126k|{ 71| 126k| auto x = read(fz); 72| 138k| while (!cond(x)) ------------------ | Branch (72:12): [True: 11.4k, False: 126k] ------------------ 73| 11.4k| x = read(fz); 74| 126k| return x; 75| 126k|} flex-vector-bo.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 1.16M|{ 71| 1.16M| auto x = read(fz); 72| 1.22M| while (!cond(x)) ------------------ | Branch (72:12): [True: 58.6k, False: 1.16M] ------------------ 73| 58.6k| x = read(fz); 74| 1.16M| return x; 75| 1.16M|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 15.9k| : impl_{detail::make(std::forward(arg))} 86| 15.9k| { 87| 15.9k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 15.9k| : value(std::forward(args)...) 48| 15.9k| { 49| 15.9k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 15.9k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 15.9k| 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.9k| { 132| 15.9k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 15.9k, False: 0] | Branch (132:22): [True: 15.9k, False: 0] ------------------ 133| 15.9k| impl_->~holder(); 134| 15.9k| heap::deallocate(sizeof(holder), impl_); 135| 15.9k| } 136| 15.9k| } _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| 504M| { 171| 504M| return x.get_(type_t{}); 172| 504M| } _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| 504M| { 185| 504M| return n.get_(t); 186| 504M| } _ZNK5immer6detail3csl6memberINS_22unsafe_refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 504M| 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| 40.1M| { 166| 40.1M| return x.get_(type_t{}); 167| 40.1M| } _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| 40.1M| { 180| 40.1M| return n.get_(t); 181| 40.1M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 40.1M| 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| 284k| { 171| 284k| return x.get_(type_t{}); 172| 284k| } _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| 284k| { 185| 284k| return n.get_(t); 186| 284k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 284k| 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| 10.9M| 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| 10.9M| { 23| 10.9M| return x.dereference(); 24| 10.9M| } _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| 11.0M| { 87| 11.0M| static_assert(std::is_base_of::value, 88| 11.0M| "must pass a derived thing"); 89| 11.0M| return *static_cast(this); 90| 11.0M| } _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| 175k| { 152| 175k| access_t::advance(derived(), n); 153| 175k| return derived(); 154| 175k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEElEEDcOT_T0_: 46| 175k| { 47| 175k| return x.advance(d); 48| 175k| } _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| 19.5M| { 93| 19.5M| static_assert(std::is_base_of::value, 94| 19.5M| "must pass a derived thing"); 95| 19.5M| return *static_cast(this); 96| 19.5M| } _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| 9.57M| { 120| 9.57M| access_t::increment(derived()); 121| 9.57M| return derived(); 122| 9.57M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDcOT_: 28| 9.57M| { 29| 9.57M| return x.increment(); 30| 9.57M| } _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| 97.7k| { 165| 97.7k| auto tmp = derived(); 166| 97.7k| return tmp += n; 167| 97.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17make_inner_n_intoEPvmj: 213| 1.30M| { 214| 1.30M| assert(n <= branches); ------------------ | Branch (214:9): [True: 1.30M, False: 0] ------------------ 215| 1.30M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 1.30M, False: 0] ------------------ 216| 1.30M| auto p = new (buffer) node_t; 217| 1.30M| p->impl.d.data.inner.relaxed = nullptr; 218| 1.30M|#if IMMER_TAGGED_NODE 219| 1.30M| p->impl.d.kind = node_t::kind_t::inner; 220| 1.30M|#endif 221| 1.30M| return p; 222| 1.30M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14sizeof_inner_nEj: 145| 41.7M| { 146| 41.7M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 41.7M, Folded] ------------------ 147| 41.7M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 956| 131M| { 957| 131M| refs(this).inc(); 958| 131M| return this; 959| 131M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4refsEPKSB_: 203| 504M| { 204| 504M| return auto_const_cast(get(x->impl)); 205| 504M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE16make_leaf_n_intoEPvmj: 330| 1.20M| { 331| 1.20M| assert(n <= branches); ------------------ | Branch (331:9): [True: 1.20M, False: 0] ------------------ 332| 1.20M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 1.20M, False: 0] ------------------ 333| 1.20M| auto p = new (buffer) node_t; 334| 1.20M|#if IMMER_TAGGED_NODE 335| 1.20M| p->impl.d.kind = node_t::kind_t::leaf; 336| 1.20M|#endif 337| 1.20M| return p; 338| 1.20M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13sizeof_leaf_nEj: 160| 5.22M| { 161| 5.22M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 5.22M, Folded] ------------------ 162| 5.22M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7relaxedEv: 172| 718M| { 173| 718M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 718M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 718M, False: 0] ------------------ 174| 718M| return impl.d.data.inner.relaxed; 175| 718M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4kindEv: 168| 1.09G| 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| 270M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5innerEv: 184| 312M| { 185| 312M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 312M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 312M, False: 0] ------------------ 186| 312M| return impl.d.data.inner.get_storage_ptr(); 187| 312M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14delete_inner_rEPSB_j: 832| 36.5M| { 833| 36.5M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 36.5M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 36.5M, False: 0] ------------------ 834| 36.5M| auto r = p->relaxed(); 835| 36.5M| assert(r); ------------------ | Branch (835:9): [True: 36.5M, False: 0] ------------------ 836| 36.5M| static_if([&](auto) { 837| 36.5M| if (node_t::refs(r).dec()) 838| 36.5M| heap::deallocate(node_t::ownee(r).owned() 839| 36.5M| ? node_t::max_sizeof_relaxed 840| 36.5M| : node_t::sizeof_relaxed_n(n), 841| 36.5M| r); 842| 36.5M| }); 843| 36.5M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 36.5M] ------------------ 844| 36.5M| : node_t::sizeof_inner_r_n(n), 845| 36.5M| p); 846| 36.5M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPSB_: 210| 40.1M| 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| 72.9M| { 151| 72.9M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 72.9M, Folded] ------------------ 152| 72.9M| } _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.6M| { 191| 11.6M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 11.6M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 11.6M, False: 0] ------------------ 192| 11.6M| return impl.d.data.leaf.get_storage_ptr(); 193| 11.6M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12delete_innerEPSB_j: 808| 1.39M| { 809| 1.39M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 1.39M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 1.39M, False: 0] ------------------ 810| 1.39M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 1.39M, False: 0] ------------------ 811| 1.39M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 1.39M] ------------------ 812| 1.39M| : node_t::sizeof_inner_n(n), 813| 1.39M| p); 814| 1.39M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 296k| { 795| 296k| auto dst = copy_leaf_n(n + 1, src, n); 796| 296k| IMMER_TRY { ------------------ | | 49| 296k|#define IMMER_TRY try ------------------ 797| 296k| new (dst->leaf() + n) T(std::forward(x)); 798| 296k| } 799| 296k| 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| 296k| return dst; 805| 296k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_nEjPSB_j: 696| 296k| { 697| 296k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 296k, False: 0] ------------------ 698| 296k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 296k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 296k, False: 0] ------------------ 699| 296k| auto dst = make_leaf_n(allocn); 700| 296k| IMMER_TRY { ------------------ | | 49| 296k|#define IMMER_TRY try ------------------ 701| 296k| detail::uninitialized_copy( 702| 296k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 296k| } 704| 296k| 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| 296k| return dst; 709| 296k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nEj: 341| 1.20M| { 342| 1.20M| assert(n <= branches); ------------------ | Branch (342:9): [True: 1.20M, False: 0] ------------------ 343| 1.20M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 1.20M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 1.20M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nIiEEPSB_jOT_: 470| 52.7k| { 471| 52.7k| assert(n >= 1); ------------------ | Branch (471:9): [True: 52.7k, False: 0] ------------------ 472| 52.7k| auto p = make_leaf_n(n); 473| 52.7k| IMMER_TRY { ------------------ | | 49| 52.7k|#define IMMER_TRY try ------------------ 474| 52.7k| new (p->leaf()) T(std::forward(x)); 475| 52.7k| } 476| 52.7k| IMMER_CATCH (...) { 477| 0| heap::deallocate(node_t::sizeof_leaf_n(n), p); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 52.7k| return p; 481| 52.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13do_copy_innerEPSB_SC_j: 558| 1.19M| { 559| 1.19M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 1.19M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 1.19M, False: 0] ------------------ 560| 1.19M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 1.19M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 1.19M, False: 0] ------------------ 561| 1.19M| auto p = src->inner(); 562| 1.19M| inc_nodes(p, n); 563| 1.19M| std::copy(p, p + n, dst->inner()); 564| 1.19M| return dst; 565| 1.19M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9inc_nodesEPPSB_j: 970| 27.6M| { 971| 127M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 100M, False: 27.6M] ------------------ 972| 100M| refs(*i).inc(); 973| 27.6M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14copy_inner_r_nEjPSB_j: 588| 210k| { 589| 210k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 210k, False: 0] ------------------ 590| 210k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 210k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 210k, False: 0] ------------------ 591| 210k| auto dst = make_inner_r_n(allocn); 592| 210k| return do_copy_inner_r(dst, src, n); 593| 210k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15do_copy_inner_rEPSB_SC_j: 610| 260k| { 611| 260k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 260k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 260k, False: 0] ------------------ 612| 260k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 260k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 260k, False: 0] ------------------ 613| 260k| auto src_r = src->relaxed(); 614| 260k| auto dst_r = dst->relaxed(); 615| 260k| inc_nodes(src->inner(), n); 616| 260k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 260k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 260k| dst_r->d.count = n; 619| 260k| return dst; 620| 260k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_nEj: 243| 36.3M| { 244| 36.3M| assert(n <= branches); ------------------ | Branch (244:9): [True: 36.3M, False: 0] ------------------ 245| 36.3M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 36.3M| auto mr = static_cast(nullptr); 247| 36.3M| if (embed_relaxed) { ------------------ | Branch (247:13): [True: 36.3M, Folded] ------------------ 248| 36.3M| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 36.3M| } 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| 36.3M| auto p = new (mp) node_t; 259| 36.3M| auto r = new (mr) relaxed_t; 260| 36.3M| r->d.count = 0; 261| 36.3M| p->impl.d.data.inner.relaxed = r; 262| 36.3M|#if IMMER_TAGGED_NODE 263| 36.3M| p->impl.d.kind = node_t::kind_t::inner; 264| 36.3M|#endif 265| 36.3M| return p; 266| 36.3M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9make_pathEjPSB_: 498| 445k| { 499| 445k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 445k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 445k, False: 0] ------------------ 500| 445k| if (shift == endshift) ------------------ | Branch (500:13): [True: 369k, False: 75.9k] ------------------ 501| 369k| return node; 502| 75.9k| else { 503| 75.9k| auto n = node_t::make_inner_n(1); 504| 75.9k| IMMER_TRY { ------------------ | | 49| 75.9k|#define IMMER_TRY try ------------------ 505| 75.9k| n->inner()[0] = make_path(shift - B, node); 506| 75.9k| } 507| 75.9k| 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| 75.9k| return n; 512| 75.9k| } 513| 445k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_nEj: 224| 1.30M| { 225| 1.30M| assert(n <= branches); ------------------ | Branch (225:9): [True: 1.30M, False: 0] ------------------ 226| 1.30M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 1.30M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 1.30M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_j: 666| 181k| { 667| 181k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 181k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 181k, False: 0] ------------------ 668| 181k| auto dst = make_leaf_n(n); 669| 181k| IMMER_TRY { ------------------ | | 49| 181k|#define IMMER_TRY try ------------------ 670| 181k| detail::uninitialized_copy( 671| 181k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 181k| } 673| 181k| 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| 181k| return dst; 678| 181k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_nEjPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeE: 269| 194k| { 270| 194k| return static_if( 271| 194k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 194k| [&](auto) { 273| 194k| auto p = 274| 194k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 194k| assert(r->d.count >= n); 276| 194k| node_t::refs(r).inc(); 277| 194k| p->impl.d.data.inner.relaxed = r; 278| 194k|#if IMMER_TAGGED_NODE 279| 194k| p->impl.d.kind = node_t::kind_t::inner; 280| 194k|#endif 281| 194k| return p; 282| 194k| }); 283| 194k| } _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| 194k| [&](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| 194k| { 653| 194k| if (embed_relaxed) ------------------ | Branch (653:13): [True: 194k, Folded] ------------------ 654| 194k| 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| 194k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE23do_copy_inner_replace_rEPSB_SC_jjSC_: 624| 194k| { 625| 194k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 194k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (625:9): [True: 194k, False: 0] ------------------ 626| 194k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 194k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (626:9): [True: 194k, False: 0] ------------------ 627| 194k| auto src_r = src->relaxed(); 628| 194k| auto dst_r = dst->relaxed(); 629| 194k| auto p = src->inner(); 630| 194k| inc_nodes(p, offset); 631| 194k| inc_nodes(p + offset + 1, n - offset - 1); 632| 194k| std::copy(src->inner(), src->inner() + n, dst->inner()); 633| 194k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 634| 194k| dst_r->d.count = n; 635| 194k| dst->inner()[offset] = child; 636| 194k| return dst; 637| 194k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 63.7k| { 570| 63.7k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 63.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 63.7k, False: 0] ------------------ 571| 63.7k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 63.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 63.7k, False: 0] ------------------ 572| 63.7k| auto p = src->inner(); 573| 63.7k| inc_nodes(p, offset); 574| 63.7k| inc_nodes(p + offset + 1, n - offset - 1); 575| 63.7k| std::copy(p, p + n, dst->inner()); 576| 63.7k| dst->inner()[offset] = child; 577| 63.7k| return dst; 578| 63.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_nEjPSB_j: 543| 11.3k| { 544| 11.3k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 11.3k, False: 0] ------------------ 545| 11.3k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 11.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 11.3k, False: 0] ------------------ 546| 11.3k| auto dst = make_inner_n(allocn); 547| 11.3k| return do_copy_inner(dst, src, n); 548| 11.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_rEPSB_j: 581| 3.88k| { 582| 3.88k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 3.88k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 3.88k, False: 0] ------------------ 583| 3.88k| auto dst = make_inner_r_n(n); 584| 3.88k| return do_copy_inner_r(dst, src, n); 585| 3.88k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13compute_shiftEv: 977| 4.07M| { 978| 4.07M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 353k, False: 3.72M] ------------------ 979| 353k| return endshift; 980| 3.72M| else 981| 3.72M| return B + inner()[0]->compute_shift(); 982| 4.07M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5checkEjm: 986| 353k| { 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| 353k| return true; 1023| 353k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jj: 778| 277k| { 779| 277k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 277k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 277k, False: 0] ------------------ 780| 277k| auto dst = make_leaf_n(last - idx); 781| 277k| IMMER_TRY { ------------------ | | 49| 277k|#define IMMER_TRY try ------------------ 782| 277k| detail::uninitialized_copy( 783| 277k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 277k| } 785| 277k| 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| 277k| return dst; 790| 277k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jSC_j: 712| 266k| { 713| 266k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 266k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 266k, False: 0] ------------------ 714| 266k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 266k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 266k, False: 0] ------------------ 715| 266k| auto dst = make_leaf_n(n1 + n2); 716| 266k| IMMER_TRY { ------------------ | | 49| 266k|#define IMMER_TRY try ------------------ 717| 266k| detail::uninitialized_copy( 718| 266k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 266k| } 720| 266k| 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| 266k| IMMER_TRY { ------------------ | | 49| 266k|#define IMMER_TRY try ------------------ 725| 266k| detail::uninitialized_copy( 726| 266k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 266k| } 728| 266k| 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| 266k| return dst; 734| 266k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 2.70M| { 871| 2.70M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 2.42M, False: 284k] | Branch (871:39): [True: 0, False: 284k] ------------------ 872| 2.70M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPKSB_: 207| 284k| { 208| 284k| return get(x->impl); 209| 284k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 43.7k| { 682| 43.7k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 43.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 43.7k, False: 0] ------------------ 683| 43.7k| auto dst = make_leaf_e(e); 684| 43.7k| IMMER_TRY { ------------------ | | 49| 43.7k|#define IMMER_TRY try ------------------ 685| 43.7k| detail::uninitialized_copy( 686| 43.7k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 43.7k| } 688| 43.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| 43.7k| return dst; 693| 43.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 408k| { 349| 408k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 408k| ownee(p) = e; 351| 408k|#if IMMER_TAGGED_NODE 352| 408k| p->impl.d.kind = node_t::kind_t::leaf; 353| 408k|#endif 354| 408k| return p; 355| 408k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 9.91k| { 486| 9.91k| auto p = make_leaf_e(e); 487| 9.91k| IMMER_TRY { ------------------ | | 49| 9.91k|#define IMMER_TRY try ------------------ 488| 9.91k| new (p->leaf()) T(std::forward(x)); 489| 9.91k| } 490| 9.91k| 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.91k| return p; 495| 9.91k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 219k| { 931| 219k| auto src_r = relaxed(); 932| 219k| return static_if( 933| 219k| [&](auto) { return src_r; }, 934| 219k| [&](auto) { 935| 219k| if (node_t::refs(src_r).unique() || 936| 219k| node_t::ownee(src_r).can_mutate(e)) 937| 219k| return src_r; 938| 219k| else { 939| 219k| auto dst_r = 940| 219k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 219k| if (src_r) { 942| 219k| std::copy( 943| 219k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 219k| if (node_t::refs(src_r).dec()) 945| 219k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 219k| src_r); 947| 219k| } 948| 219k| dst_r->d.count = n; 949| 219k| node_t::ownee(dst_r) = e; 950| 219k| return impl.d.data.inner.relaxed = dst_r; 951| 219k| } 952| 219k| }); 953| 219k| } _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| 219k| [&](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| 16.9k| { 597| 16.9k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 16.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (597:9): [True: 16.9k, False: 0] ------------------ 598| 16.9k| auto dst = make_inner_r_e(e); 599| 16.9k| return do_copy_inner_r(dst, src, n); 600| 16.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 286| 147k| { 287| 147k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 147k| auto mr = static_cast(nullptr); 289| 147k| if (embed_relaxed) { ------------------ | Branch (289:13): [True: 147k, Folded] ------------------ 290| 147k| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 147k| } 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| 147k| auto p = new (mp) node_t; 301| 147k| auto r = new (mr) relaxed_t; 302| 147k| ownee(p) = e; 303| 147k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 147k| r->d.count = 0; 305| 147k| p->impl.d.data.inner.relaxed = r; 306| 147k|#if IMMER_TAGGED_NODE 307| 147k| p->impl.d.kind = node_t::kind_t::inner; 308| 147k|#endif 309| 147k| return p; 310| 147k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_path_eENS9_5applyIS6_E4type4editEjPSB_: 516| 417k| { 517| 417k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 417k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 417k, False: 0] ------------------ 518| 417k| if (shift == endshift) ------------------ | Branch (518:13): [True: 362k, False: 55.5k] ------------------ 519| 362k| return node; 520| 55.5k| else { 521| 55.5k| auto n = node_t::make_inner_e(e); 522| 55.5k| IMMER_TRY { ------------------ | | 49| 55.5k|#define IMMER_TRY try ------------------ 523| 55.5k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 55.5k| } 525| 55.5k| 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| 55.5k| return n; 530| 55.5k| } 531| 417k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 85.7k| { 232| 85.7k| auto m = heap::allocate(max_sizeof_inner); 233| 85.7k| auto p = new (m) node_t; 234| 85.7k| ownee(p) = e; 235| 85.7k| p->impl.d.data.inner.relaxed = nullptr; 236| 85.7k|#if IMMER_TAGGED_NODE 237| 85.7k| p->impl.d.kind = node_t::kind_t::inner; 238| 85.7k|#endif 239| 85.7k| return p; 240| 85.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 19.2k| { 552| 19.2k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 19.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 19.2k, False: 0] ------------------ 553| 19.2k| auto dst = make_inner_e(e); 554| 19.2k| return do_copy_inner(dst, src, n); 555| 19.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 28.8k| { 604| 28.8k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 28.8k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 28.8k, False: 0] ------------------ 605| 28.8k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 28.8k| return do_copy_inner_sr(dst, src, n); 607| 28.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| 28.8k| { 314| 28.8k| return static_if( 315| 28.8k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 28.8k| [&](auto) { 317| 28.8k| auto p = 318| 28.8k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 28.8k| node_t::refs(r).inc(); 320| 28.8k| p->impl.d.data.inner.relaxed = r; 321| 28.8k| node_t::ownee(p) = e; 322| 28.8k|#if IMMER_TAGGED_NODE 323| 28.8k| p->impl.d.kind = node_t::kind_t::inner; 324| 28.8k|#endif 325| 28.8k| return p; 326| 28.8k| }); 327| 28.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| 28.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| 28.8k| { 641| 28.8k| if (embed_relaxed) ------------------ | Branch (641:13): [True: 28.8k, Folded] ------------------ 642| 28.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| 28.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 354k| { 764| 354k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 354k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 354k, False: 0] ------------------ 765| 354k| auto dst = make_leaf_e(e); 766| 354k| IMMER_TRY { ------------------ | | 49| 354k|#define IMMER_TRY try ------------------ 767| 354k| detail::uninitialized_copy( 768| 354k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 354k| } 770| 354k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 354k| return dst; 775| 354k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 182k| { 878| 182k| auto src_r = relaxed(); 879| 182k| return static_if( 880| 182k| [&](auto) { return src_r; }, 881| 182k| [&](auto) { 882| 182k| if (node_t::refs(src_r).unique() || 883| 182k| node_t::ownee(src_r).can_mutate(e)) 884| 182k| return src_r; 885| 182k| else { 886| 182k| auto dst_r = impl.d.data.inner.relaxed = 887| 182k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 182k| if (src_r) { 889| 182k| auto n = dst_r->d.count = src_r->d.count; 890| 182k| std::copy( 891| 182k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 182k| if (node_t::refs(src_r).dec()) 893| 182k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 182k| src_r); 895| 182k| } 896| 182k| node_t::ownee(dst_r) = e; 897| 182k| return dst_r; 898| 182k| } 899| 182k| }); 900| 182k| } _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| 182k| [&](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| 481| { 739| 481| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 481|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 481, False: 0] ------------------ 740| 481| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 481|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 481, False: 0] ------------------ 741| 481| auto dst = make_leaf_e(e); 742| 481| IMMER_TRY { ------------------ | | 49| 481|#define IMMER_TRY try ------------------ 743| 481| detail::uninitialized_copy( 744| 481| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 481| } 746| 481| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 481| IMMER_TRY { ------------------ | | 49| 481|#define IMMER_TRY try ------------------ 751| 481| detail::uninitialized_copy( 752| 481| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 481| } 754| 481| 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| 481| return dst; 760| 481| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 523| 181M| { 524| 181M| using node_t = node_type; 525| 181M| auto node = p.node(); 526| 181M| if (node->dec()) { ------------------ | Branch (526:13): [True: 36.5M, False: 145M] ------------------ 527| 36.5M| p.each(this_t{}); 528| 36.5M| node_t::delete_inner_r(node, p.count()); 529| 36.5M| } 530| 181M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 14.8M| { 535| 14.8M| using node_t = node_type; 536| 14.8M| auto node = p.node(); 537| 14.8M| if (node->dec()) { ------------------ | Branch (537:13): [True: 428k, False: 14.3M] ------------------ 538| 428k| p.each(this_t{}); 539| 428k| node_t::delete_inner(node, p.count()); 540| 428k| } 541| 14.8M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.70M| { 546| 1.70M| using node_t = node_type; 547| 1.70M| auto node = p.node(); 548| 1.70M| if (node->dec()) { ------------------ | Branch (548:13): [True: 566k, False: 1.13M] ------------------ 549| 566k| node_t::delete_leaf(node, p.count()); 550| 566k| } 551| 1.70M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 392k| { 546| 392k| using node_t = node_type; 547| 392k| auto node = p.node(); 548| 392k| if (node->dec()) { ------------------ | Branch (548:13): [True: 47.0k, False: 345k] ------------------ 549| 47.0k| node_t::delete_leaf(node, p.count()); 550| 47.0k| } 551| 392k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 2.82M| { 535| 2.82M| using node_t = node_type; 536| 2.82M| auto node = p.node(); 537| 2.82M| if (node->dec()) { ------------------ | Branch (537:13): [True: 97.4k, False: 2.72M] ------------------ 538| 97.4k| p.each(this_t{}); 539| 97.4k| node_t::delete_inner(node, p.count()); 540| 97.4k| } 541| 2.82M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 908k| { 535| 908k| using node_t = node_type; 536| 908k| auto node = p.node(); 537| 908k| if (node->dec()) { ------------------ | Branch (537:13): [True: 857k, False: 50.5k] ------------------ 538| 857k| p.each(this_t{}); 539| 857k| node_t::delete_inner(node, p.count()); 540| 857k| } 541| 908k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 1.53M| { 535| 1.53M| using node_t = node_type; 536| 1.53M| auto node = p.node(); 537| 1.53M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 1.53M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 1.53M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 65.6M| { 546| 65.6M| using node_t = node_type; 547| 65.6M| auto node = p.node(); 548| 65.6M| if (node->dec()) { ------------------ | Branch (548:13): [True: 999k, False: 64.6M] ------------------ 549| 999k| node_t::delete_leaf(node, p.count()); 550| 999k| } 551| 65.6M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.38M| { 546| 1.38M| using node_t = node_type; 547| 1.38M| auto node = p.node(); 548| 1.38M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 1.38M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 1.38M| } _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| 212k| { 792| 212k| auto level = pos.shift(); 793| 212k| auto idx = pos.count() - 1; 794| 212k| auto children = pos.size(idx); 795| 212k| auto new_idx = 796| 212k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 14.2k, False: 198k] | Branch (796:47): [True: 669, False: 197k] ------------------ 797| 212k| auto new_child = static_cast(nullptr); 798| 212k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 4.32k, False: 208k] ------------------ 799| 4.32k| return nullptr; 800| 208k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 197k, False: 10.5k] ------------------ 801| 197k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 197k| if (!new_child) { ------------------ | Branch (802:17): [True: 4.98k, False: 192k] ------------------ 803| 4.98k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 2.30k, False: 2.67k] ------------------ 804| 2.30k| new_child = node_t::make_path(level - B, tail); 805| 2.67k| else 806| 2.67k| return nullptr; 807| 4.98k| } 808| 197k| } else 809| 10.5k| new_child = node_t::make_path(level - B, tail); 810| 205k| IMMER_TRY { ------------------ | | 49| 205k|#define IMMER_TRY try ------------------ 811| 205k| auto count = new_idx + 1; 812| 205k| auto new_parent = 813| 205k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 205k| auto new_relaxed = new_parent->relaxed(); 815| 205k| new_parent->inner()[new_idx] = new_child; 816| 205k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 205k| new_relaxed->d.count = count; 818| 205k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 205k, False: 0] ------------------ 819| 205k| return new_parent; 820| 205k| } 821| 205k| 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| 205k| } _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| 41.7k| { 835| 41.7k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 41.7k, False: 0] ------------------ 836| 41.7k| auto idx = pos.index(pos.size() - 1); 837| 41.7k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 41.7k| auto count = new_idx + 1; 839| 41.7k| auto new_parent = node_t::make_inner_n(count); 840| 41.7k| IMMER_TRY { ------------------ | | 49| 41.7k|#define IMMER_TRY try ------------------ 841| 41.7k| new_parent->inner()[new_idx] = 842| 41.7k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 31.3k, False: 10.4k] ------------------ 843| | /* otherwise */ 844| 41.7k| : node_t::make_path(pos.shift() - B, tail); 845| 41.7k| } 846| 41.7k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 41.7k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 41.7k| } _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| 817k| { 835| 817k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 817k, False: 0] ------------------ 836| 817k| auto idx = pos.index(pos.size() - 1); 837| 817k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 817k| auto count = new_idx + 1; 839| 817k| auto new_parent = node_t::make_inner_n(count); 840| 817k| IMMER_TRY { ------------------ | | 49| 817k|#define IMMER_TRY try ------------------ 841| 817k| new_parent->inner()[new_idx] = 842| 817k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 512k, False: 304k] ------------------ 843| | /* otherwise */ 844| 817k| : node_t::make_path(pos.shift() - B, tail); 845| 817k| } 846| 817k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 817k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 817k| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_jm: 562| 441|{ 563| 441| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 441|} _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| 295k| { 835| 295k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 295k, False: 0] ------------------ 836| 295k| auto idx = pos.index(pos.size() - 1); 837| 295k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 295k| auto count = new_idx + 1; 839| 295k| auto new_parent = node_t::make_inner_n(count); 840| 295k| IMMER_TRY { ------------------ | | 49| 295k|#define IMMER_TRY try ------------------ 841| 295k| new_parent->inner()[new_idx] = 842| 295k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 273k, False: 21.7k] ------------------ 843| | /* otherwise */ 844| 295k| : node_t::make_path(pos.shift() - B, tail); 845| 295k| } 846| 295k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 295k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 295k| } 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| 122k| { 503| 122k| auto offset = pos.index(idx); 504| 122k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 122k| IMMER_TRY { ------------------ | | 49| 122k|#define IMMER_TRY try ------------------ 506| 122k| node->leaf()[offset] = 507| 122k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 122k| return node; 509| 122k| } 510| 122k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 122k| } 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| 194k| { 467| 194k| auto offset = pos.index(idx); 468| 194k| auto count = pos.count(); 469| 194k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 194k| IMMER_TRY { ------------------ | | 49| 194k|#define IMMER_TRY try ------------------ 471| 194k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 194k| node_t::do_copy_inner_replace_sr( 473| 194k| node, pos.node(), count, offset, child); 474| 194k| return node; 475| 194k| } 476| 194k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 194k| } 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| 45.8k| { 485| 45.8k| auto offset = pos.index(idx); 486| 45.8k| auto count = pos.count(); 487| 45.8k| auto node = node_t::make_inner_n(count); 488| 45.8k| IMMER_TRY { ------------------ | | 49| 45.8k|#define IMMER_TRY try ------------------ 489| 45.8k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 45.8k| node_t::do_copy_inner_replace( 491| 45.8k| node, pos.node(), count, offset, child); 492| 45.8k| return node; 493| 45.8k| } 494| 45.8k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 45.8k| } 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| 13.4k| { 503| 13.4k| auto offset = pos.index(idx); 504| 13.4k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 13.4k| IMMER_TRY { ------------------ | | 49| 13.4k|#define IMMER_TRY try ------------------ 506| 13.4k| node->leaf()[offset] = 507| 13.4k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 13.4k| return node; 509| 13.4k| } 510| 13.4k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 13.4k| } 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.8k| { 485| 13.8k| auto offset = pos.index(idx); 486| 13.8k| auto count = pos.count(); 487| 13.8k| auto node = node_t::make_inner_n(count); 488| 13.8k| IMMER_TRY { ------------------ | | 49| 13.8k|#define IMMER_TRY try ------------------ 489| 13.8k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 13.8k| node_t::do_copy_inner_replace( 491| 13.8k| node, pos.node(), count, offset, child); 492| 13.8k| return node; 493| 13.8k| } 494| 13.8k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 13.8k| } 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| 32.4k| { 503| 32.4k| auto offset = pos.index(idx); 504| 32.4k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 32.4k| IMMER_TRY { ------------------ | | 49| 32.4k|#define IMMER_TRY try ------------------ 506| 32.4k| node->leaf()[offset] = 507| 32.4k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 32.4k| return node; 509| 32.4k| } 510| 32.4k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 32.4k| } 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| 4.05k| { 485| 4.05k| auto offset = pos.index(idx); 486| 4.05k| auto count = pos.count(); 487| 4.05k| auto node = node_t::make_inner_n(count); 488| 4.05k| IMMER_TRY { ------------------ | | 49| 4.05k|#define IMMER_TRY try ------------------ 489| 4.05k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 4.05k| node_t::do_copy_inner_replace( 491| 4.05k| node, pos.node(), count, offset, child); 492| 4.05k| return node; 493| 4.05k| } 494| 4.05k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 4.05k| } _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| 31.7k| { 1097| 31.7k| auto idx = pos.index(last); 1098| 31.7k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 31.7k, Folded] | Branch (1098:25): [True: 24.3k, False: 7.40k] ------------------ 1099| 24.3k| return pos.towards_oh(this_t{}, last, idx); 1100| 24.3k| } else { 1101| 7.40k| using std::get; 1102| 7.40k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 7.40k| auto next = get<1>(subs); 1104| 7.40k| auto ts = get<2>(subs); 1105| 7.40k| auto tail = get<3>(subs); 1106| 7.40k| IMMER_TRY { ------------------ | | 49| 7.40k|#define IMMER_TRY try ------------------ 1107| 7.40k| if (next) { ------------------ | Branch (1107:21): [True: 4.04k, False: 3.35k] ------------------ 1108| 4.04k| auto count = idx + 1; 1109| 4.04k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 4.04k| auto newr = newn->relaxed(); 1111| 4.04k| newn->inner()[idx] = next; 1112| 4.04k| newr->d.sizes[idx] = last + 1 - ts; 1113| 4.04k| newr->d.count = count; 1114| 4.04k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 4.04k, False: 0] ------------------ 1115| 4.04k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 4.04k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 3.35k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 3.35k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 3.35k, Folded] | Branch (1118:40): [True: 1.78k, False: 1.57k] | Branch (1118:52): [True: 1.05k, False: 729] ------------------ 1119| 1.05k| auto newn = pos.node()->inner()[0]; 1120| 1.05k| return std::make_tuple( 1121| 1.05k| pos.shift() - B, newn->inc(), ts, tail); 1122| 2.30k| } else { 1123| 2.30k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 2.30k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 2.30k| } 1126| 7.40k| } 1127| 7.40k| IMMER_CATCH (...) { 1128| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] ------------------ 1129| 0| if (next) ------------------ | Branch (1129:21): [True: 0, False: 0] ------------------ 1130| 0| dec_inner(next, 1131| 0| pos.shift() - B, 1132| 0| last + 1 - ts - pos.size_before(idx)); 1133| 0| if (tail) ------------------ | Branch (1133:21): [True: 0, False: 0] ------------------ 1134| 0| dec_leaf(tail, ts); 1135| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1136| 0| } 1137| 7.40k| } 1138| 31.7k| } _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.92k| { 1182| 1.92k| auto old_tail_size = pos.count(); 1183| 1.92k| auto new_tail_size = pos.index(last) + 1; 1184| 1.92k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 578, False: 1.34k] ------------------ 1185| 1.92k| ? pos.node()->inc() 1186| 1.92k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.92k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.92k| } _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.21k| { 1182| 4.21k| auto old_tail_size = pos.count(); 1183| 4.21k| auto new_tail_size = pos.index(last) + 1; 1184| 4.21k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.37k, False: 2.84k] ------------------ 1185| 4.21k| ? pos.node()->inc() 1186| 4.21k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 4.21k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 4.21k| } _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.52k| { 1097| 3.52k| auto idx = pos.index(last); 1098| 3.52k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 3.52k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 3.52k| } else { 1101| 3.52k| using std::get; 1102| 3.52k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 3.52k| auto next = get<1>(subs); 1104| 3.52k| auto ts = get<2>(subs); 1105| 3.52k| auto tail = get<3>(subs); 1106| 3.52k| IMMER_TRY { ------------------ | | 49| 3.52k|#define IMMER_TRY try ------------------ 1107| 3.52k| if (next) { ------------------ | Branch (1107:21): [True: 787, False: 2.74k] ------------------ 1108| 787| auto count = idx + 1; 1109| 787| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 787| auto newr = newn->relaxed(); 1111| 787| newn->inner()[idx] = next; 1112| 787| newr->d.sizes[idx] = last + 1 - ts; 1113| 787| newr->d.count = count; 1114| 787| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 787, False: 0] ------------------ 1115| 787| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 2.74k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 1.15k, False: 1.58k] ------------------ 1117| 1.15k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 1.58k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 1.58k] | 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.58k| } else { 1123| 1.58k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.58k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.58k| } 1126| 3.52k| } 1127| 3.52k| 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.52k| } 1138| 3.52k| } _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| 3.18k| { 1143| 3.18k| auto idx = pos.index(last); 1144| 3.18k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.18k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 3.18k| } else { 1147| 3.18k| using std::get; 1148| 3.18k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.18k| auto next = get<1>(subs); 1150| 3.18k| auto ts = get<2>(subs); 1151| 3.18k| auto tail = get<3>(subs); 1152| 3.18k| IMMER_TRY { ------------------ | | 49| 3.18k|#define IMMER_TRY try ------------------ 1153| 3.18k| if (next) { ------------------ | Branch (1153:21): [True: 1.84k, False: 1.34k] ------------------ 1154| 1.84k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.84k| newn->inner()[idx] = next; 1156| 1.84k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.84k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 721, False: 625] ------------------ 1158| 721| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 721| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 625] | 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| 625| } else { 1164| 625| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 625| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 625| } 1167| 3.18k| } 1168| 3.18k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 3.18k| } 1177| 3.18k| } _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.01k| { 1182| 6.01k| auto old_tail_size = pos.count(); 1183| 6.01k| auto new_tail_size = pos.index(last) + 1; 1184| 6.01k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.59k, False: 4.42k] ------------------ 1185| 6.01k| ? pos.node()->inc() 1186| 6.01k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 6.01k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 6.01k| } _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.37k| { 1143| 2.37k| auto idx = pos.index(last); 1144| 2.37k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.37k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.37k| } else { 1147| 2.37k| using std::get; 1148| 2.37k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.37k| auto next = get<1>(subs); 1150| 2.37k| auto ts = get<2>(subs); 1151| 2.37k| auto tail = get<3>(subs); 1152| 2.37k| IMMER_TRY { ------------------ | | 49| 2.37k|#define IMMER_TRY try ------------------ 1153| 2.37k| if (next) { ------------------ | Branch (1153:21): [True: 250, False: 2.12k] ------------------ 1154| 250| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 250| newn->inner()[idx] = next; 1156| 250| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.12k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 487, False: 1.63k] ------------------ 1158| 487| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.63k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.63k] | 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.63k| } else { 1164| 1.63k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.63k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.63k| } 1167| 2.37k| } 1168| 2.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| 2.37k| } 1177| 2.37k| } _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.96k| { 1182| 2.96k| auto old_tail_size = pos.count(); 1183| 2.96k| auto new_tail_size = pos.index(last) + 1; 1184| 2.96k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.35k, False: 1.61k] ------------------ 1185| 2.96k| ? pos.node()->inc() 1186| 2.96k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.96k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.96k| } _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| 3.37k| { 1143| 3.37k| auto idx = pos.index(last); 1144| 3.37k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.37k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| 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: 829, False: 2.54k] ------------------ 1154| 829| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 829| newn->inner()[idx] = next; 1156| 829| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.54k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.21k, False: 1.32k] ------------------ 1158| 1.21k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.32k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.32k] | 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.32k| } else { 1164| 1.32k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.32k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.32k| } 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| 3.37k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_j: 556| 39.4k|{ 557| 39.4k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 39.4k|} _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.36k| { 1143| 8.36k| auto idx = pos.index(last); 1144| 8.36k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 8.36k, Folded] | Branch (1144:25): [True: 5.56k, False: 2.79k] ------------------ 1145| 5.56k| return pos.towards_oh(this_t{}, last, idx); 1146| 5.56k| } else { 1147| 2.79k| using std::get; 1148| 2.79k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.79k| auto next = get<1>(subs); 1150| 2.79k| auto ts = get<2>(subs); 1151| 2.79k| auto tail = get<3>(subs); 1152| 2.79k| IMMER_TRY { ------------------ | | 49| 2.79k|#define IMMER_TRY try ------------------ 1153| 2.79k| if (next) { ------------------ | Branch (1153:21): [True: 718, False: 2.08k] ------------------ 1154| 718| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 718| newn->inner()[idx] = next; 1156| 718| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.08k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.08k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.08k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.08k, Folded] | Branch (1159:40): [True: 1.29k, False: 786] | Branch (1159:52): [True: 689, False: 606] ------------------ 1160| 689| auto newn = pos.node()->inner()[0]; 1161| 689| return std::make_tuple( 1162| 689| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.39k| } else { 1164| 1.39k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.39k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.39k| } 1167| 2.79k| } 1168| 2.79k| 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.79k| } 1177| 8.36k| } _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.80k| { 1182| 1.80k| auto old_tail_size = pos.count(); 1183| 1.80k| auto new_tail_size = pos.index(last) + 1; 1184| 1.80k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 683, False: 1.12k] ------------------ 1185| 1.80k| ? pos.node()->inc() 1186| 1.80k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.80k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.80k| } _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.31k| { 1143| 5.31k| auto idx = pos.index(last); 1144| 5.31k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 5.31k, Folded] | Branch (1144:25): [True: 2.31k, False: 2.99k] ------------------ 1145| 2.31k| return pos.towards_oh(this_t{}, last, idx); 1146| 2.99k| } else { 1147| 2.99k| using std::get; 1148| 2.99k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.99k| auto next = get<1>(subs); 1150| 2.99k| auto ts = get<2>(subs); 1151| 2.99k| auto tail = get<3>(subs); 1152| 2.99k| IMMER_TRY { ------------------ | | 49| 2.99k|#define IMMER_TRY try ------------------ 1153| 2.99k| if (next) { ------------------ | Branch (1153:21): [True: 403, False: 2.59k] ------------------ 1154| 403| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 403| newn->inner()[idx] = next; 1156| 403| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.59k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.59k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.59k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.59k, Folded] | Branch (1159:40): [True: 707, False: 1.88k] | Branch (1159:52): [True: 260, False: 447] ------------------ 1160| 260| auto newn = pos.node()->inner()[0]; 1161| 260| return std::make_tuple( 1162| 260| pos.shift() - B, newn->inc(), ts, tail); 1163| 2.33k| } else { 1164| 2.33k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 2.33k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 2.33k| } 1167| 2.99k| } 1168| 2.99k| 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.99k| } 1177| 5.31k| } _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| 764| { 1182| 764| auto old_tail_size = pos.count(); 1183| 764| auto new_tail_size = pos.index(last) + 1; 1184| 764| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 345, False: 419] ------------------ 1185| 764| ? pos.node()->inc() 1186| 764| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 764| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 764| } _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| 24.4k| { 1415| 24.4k| auto idx = pos.subindex(first); 1416| 24.4k| auto count = pos.count(); 1417| 24.4k| auto left_size = pos.size_before(idx); 1418| 24.4k| auto child_size = pos.size_sbh(idx, left_size); 1419| 24.4k| auto dropped_size = first; 1420| 24.4k| auto child_dropped_size = dropped_size - left_size; 1421| 24.4k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 24.4k, Folded] | Branch (1421:25): [True: 22.2k, False: 2.20k] | Branch (1421:45): [True: 4.03k, False: 18.1k] ------------------ 1422| 4.03k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 20.3k| } else { 1424| 20.3k| using std::get; 1425| 20.3k| auto n = pos.node(); 1426| 20.3k| auto newc = count - idx; 1427| 20.3k| auto newn = node_t::make_inner_r_n(newc); 1428| 20.3k| IMMER_TRY { ------------------ | | 49| 20.3k|#define IMMER_TRY try ------------------ 1429| 20.3k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 20.3k| auto newr = newn->relaxed(); 1431| 20.3k| newr->d.count = count - idx; 1432| 20.3k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 20.3k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 20.3k, False: 0] ------------------ 1434| 20.3k| pos.copy_sizes(idx + 1, 1435| 20.3k| newr->d.count - 1, 1436| 20.3k| newr->d.sizes[0], 1437| 20.3k| newr->d.sizes + 1); 1438| 20.3k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 20.3k, False: 0] ------------------ 1439| 20.3k| pos.size() - dropped_size); 1440| 20.3k| newn->inner()[0] = get<1>(subs); 1441| 20.3k| std::copy(n->inner() + idx + 1, 1442| 20.3k| n->inner() + count, 1443| 20.3k| newn->inner() + 1); 1444| 20.3k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 20.3k| return std::make_tuple(pos.shift(), newn); 1446| 20.3k| } 1447| 20.3k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 20.3k| } 1452| 24.4k| } _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| 18.9k| { 1457| 18.9k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 18.9k| return std::make_tuple(0, n); 1459| 18.9k| } _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| 91.5k| { 1415| 91.5k| auto idx = pos.subindex(first); 1416| 91.5k| auto count = pos.count(); 1417| 91.5k| auto left_size = pos.size_before(idx); 1418| 91.5k| auto child_size = pos.size_sbh(idx, left_size); 1419| 91.5k| auto dropped_size = first; 1420| 91.5k| auto child_dropped_size = dropped_size - left_size; 1421| 91.5k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 91.5k] | 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| 91.5k| } else { 1424| 91.5k| using std::get; 1425| 91.5k| auto n = pos.node(); 1426| 91.5k| auto newc = count - idx; 1427| 91.5k| auto newn = node_t::make_inner_r_n(newc); 1428| 91.5k| IMMER_TRY { ------------------ | | 49| 91.5k|#define IMMER_TRY try ------------------ 1429| 91.5k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 91.5k| auto newr = newn->relaxed(); 1431| 91.5k| newr->d.count = count - idx; 1432| 91.5k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 91.5k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 91.5k, False: 0] ------------------ 1434| 91.5k| pos.copy_sizes(idx + 1, 1435| 91.5k| newr->d.count - 1, 1436| 91.5k| newr->d.sizes[0], 1437| 91.5k| newr->d.sizes + 1); 1438| 91.5k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 91.5k, False: 0] ------------------ 1439| 91.5k| pos.size() - dropped_size); 1440| 91.5k| newn->inner()[0] = get<1>(subs); 1441| 91.5k| std::copy(n->inner() + idx + 1, 1442| 91.5k| n->inner() + count, 1443| 91.5k| newn->inner() + 1); 1444| 91.5k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 91.5k| return std::make_tuple(pos.shift(), newn); 1446| 91.5k| } 1447| 91.5k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 91.5k| } 1452| 91.5k| } _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.42k| { 1415| 1.42k| auto idx = pos.subindex(first); 1416| 1.42k| auto count = pos.count(); 1417| 1.42k| auto left_size = pos.size_before(idx); 1418| 1.42k| auto child_size = pos.size_sbh(idx, left_size); 1419| 1.42k| auto dropped_size = first; 1420| 1.42k| auto child_dropped_size = dropped_size - left_size; 1421| 1.42k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 1.42k] | 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.42k| } else { 1424| 1.42k| using std::get; 1425| 1.42k| auto n = pos.node(); 1426| 1.42k| auto newc = count - idx; 1427| 1.42k| auto newn = node_t::make_inner_r_n(newc); 1428| 1.42k| IMMER_TRY { ------------------ | | 49| 1.42k|#define IMMER_TRY try ------------------ 1429| 1.42k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 1.42k| auto newr = newn->relaxed(); 1431| 1.42k| newr->d.count = count - idx; 1432| 1.42k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 1.42k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 1.42k, False: 0] ------------------ 1434| 1.42k| pos.copy_sizes(idx + 1, 1435| 1.42k| newr->d.count - 1, 1436| 1.42k| newr->d.sizes[0], 1437| 1.42k| newr->d.sizes + 1); 1438| 1.42k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 1.42k, False: 0] ------------------ 1439| 1.42k| pos.size() - dropped_size); 1440| 1.42k| newn->inner()[0] = get<1>(subs); 1441| 1.42k| std::copy(n->inner() + idx + 1, 1442| 1.42k| n->inner() + count, 1443| 1.42k| newn->inner() + 1); 1444| 1.42k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 1.42k| return std::make_tuple(pos.shift(), newn); 1446| 1.42k| } 1447| 1.42k| 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.42k| } 1452| 1.42k| } _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| 9.97k| { 1457| 9.97k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 9.97k| return std::make_tuple(0, n); 1459| 9.97k| } _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.22k| { 1415| 7.22k| auto idx = pos.subindex(first); 1416| 7.22k| auto count = pos.count(); 1417| 7.22k| auto left_size = pos.size_before(idx); 1418| 7.22k| auto child_size = pos.size_sbh(idx, left_size); 1419| 7.22k| auto dropped_size = first; 1420| 7.22k| auto child_dropped_size = dropped_size - left_size; 1421| 7.22k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 7.22k] | 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.22k| } else { 1424| 7.22k| using std::get; 1425| 7.22k| auto n = pos.node(); 1426| 7.22k| auto newc = count - idx; 1427| 7.22k| auto newn = node_t::make_inner_r_n(newc); 1428| 7.22k| IMMER_TRY { ------------------ | | 49| 7.22k|#define IMMER_TRY try ------------------ 1429| 7.22k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 7.22k| auto newr = newn->relaxed(); 1431| 7.22k| newr->d.count = count - idx; 1432| 7.22k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 7.22k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 7.22k, False: 0] ------------------ 1434| 7.22k| pos.copy_sizes(idx + 1, 1435| 7.22k| newr->d.count - 1, 1436| 7.22k| newr->d.sizes[0], 1437| 7.22k| newr->d.sizes + 1); 1438| 7.22k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 7.22k, False: 0] ------------------ 1439| 7.22k| pos.size() - dropped_size); 1440| 7.22k| newn->inner()[0] = get<1>(subs); 1441| 7.22k| std::copy(n->inner() + idx + 1, 1442| 7.22k| n->inner() + count, 1443| 7.22k| newn->inner() + 1); 1444| 7.22k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 7.22k| return std::make_tuple(pos.shift(), newn); 1446| 7.22k| } 1447| 7.22k| 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.22k| } 1452| 7.22k| } _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| 10.6k| { 1415| 10.6k| auto idx = pos.subindex(first); 1416| 10.6k| auto count = pos.count(); 1417| 10.6k| auto left_size = pos.size_before(idx); 1418| 10.6k| auto child_size = pos.size_sbh(idx, left_size); 1419| 10.6k| auto dropped_size = first; 1420| 10.6k| auto child_dropped_size = dropped_size - left_size; 1421| 10.6k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 10.6k, Folded] | Branch (1421:25): [True: 7.28k, False: 3.35k] | Branch (1421:45): [True: 2.85k, False: 4.43k] ------------------ 1422| 2.85k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 7.78k| } else { 1424| 7.78k| using std::get; 1425| 7.78k| auto n = pos.node(); 1426| 7.78k| auto newc = count - idx; 1427| 7.78k| auto newn = node_t::make_inner_r_n(newc); 1428| 7.78k| IMMER_TRY { ------------------ | | 49| 7.78k|#define IMMER_TRY try ------------------ 1429| 7.78k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 7.78k| auto newr = newn->relaxed(); 1431| 7.78k| newr->d.count = count - idx; 1432| 7.78k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 7.78k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 7.78k, False: 0] ------------------ 1434| 7.78k| pos.copy_sizes(idx + 1, 1435| 7.78k| newr->d.count - 1, 1436| 7.78k| newr->d.sizes[0], 1437| 7.78k| newr->d.sizes + 1); 1438| 7.78k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 7.78k, False: 0] ------------------ 1439| 7.78k| pos.size() - dropped_size); 1440| 7.78k| newn->inner()[0] = get<1>(subs); 1441| 7.78k| std::copy(n->inner() + idx + 1, 1442| 7.78k| n->inner() + count, 1443| 7.78k| newn->inner() + 1); 1444| 7.78k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 7.78k| return std::make_tuple(pos.shift(), newn); 1446| 7.78k| } 1447| 7.78k| 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.78k| } 1452| 10.6k| } _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| 760| { 1415| 760| auto idx = pos.subindex(first); 1416| 760| auto count = pos.count(); 1417| 760| auto left_size = pos.size_before(idx); 1418| 760| auto child_size = pos.size_sbh(idx, left_size); 1419| 760| auto dropped_size = first; 1420| 760| auto child_dropped_size = dropped_size - left_size; 1421| 760| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 760, Folded] | Branch (1421:25): [True: 284, False: 476] | Branch (1421:45): [True: 0, False: 284] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 760| } else { 1424| 760| using std::get; 1425| 760| auto n = pos.node(); 1426| 760| auto newc = count - idx; 1427| 760| auto newn = node_t::make_inner_r_n(newc); 1428| 760| IMMER_TRY { ------------------ | | 49| 760|#define IMMER_TRY try ------------------ 1429| 760| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 760| auto newr = newn->relaxed(); 1431| 760| newr->d.count = count - idx; 1432| 760| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 760| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 760, False: 0] ------------------ 1434| 760| pos.copy_sizes(idx + 1, 1435| 760| newr->d.count - 1, 1436| 760| newr->d.sizes[0], 1437| 760| newr->d.sizes + 1); 1438| 760| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 760, False: 0] ------------------ 1439| 760| pos.size() - dropped_size); 1440| 760| newn->inner()[0] = get<1>(subs); 1441| 760| std::copy(n->inner() + idx + 1, 1442| 760| n->inner() + count, 1443| 760| newn->inner() + 1); 1444| 760| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 760| return std::make_tuple(pos.shift(), newn); 1446| 760| } 1447| 760| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 760| } 1452| 760| } _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.32k|{ 2002| 7.32k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 7.32k| .visit(concat_trees_left_visitor{}, 2004| 7.32k| empty_leaf_pos{}, 2005| 7.32k| rroot, 2006| 7.32k| rshift, 2007| 7.32k| rsize) 2008| 7.32k| .realize(); 2009| 7.32k|} _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.32k| { 1972| 7.32k| return visit_maybe_relaxed_sub( 1973| 7.32k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 7.32k| } _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| 4.99k| { 1959| 4.99k| return concat_inners(lpos, tpos, rpos); 1960| 4.99k| } _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| 21.7k|{ 1873| 21.7k| auto lshift = lpos.shift(); 1874| 21.7k| auto rshift = rpos.shift(); 1875| 21.7k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 21.7k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 21.7k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 17.0k, False: 4.69k] ------------------ 1879| 17.0k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 17.0k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 17.0k| } else { 1882| 4.69k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 4.69k, False: 0] ------------------ 1883| 4.69k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 4.69k] | Branch (1883:9): [True: 4.69k, False: 0] | Branch (1883:9): [True: 4.69k, False: 0] ------------------ 1884| 4.69k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 4.69k| return concat_rebalance(lpos, cpos, rpos); 1886| 4.69k| } 1887| 21.7k|} _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| 14.1M| { 1513| 14.1M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.14M, False: 13.0M] ------------------ 1514| 1.14M| auto s = size_t{}; 1515| 4.58M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.44M, False: 1.14M] ------------------ 1516| 3.44M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.44M| s = sizes_[i]; 1518| 3.44M| } 1519| 13.0M| } else { 1520| 35.1M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 22.1M, False: 13.0M] ------------------ 1521| 22.1M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 22.1M| .visit(v, args...); 1523| 13.0M| } 1524| 14.1M| } _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| 8.51M| { 1734| 8.51M| auto count = p.count(); 1735| 8.51M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 8.51M, False: 0] ------------------ 1736| 8.51M| plan.counts[plan.n++] = count; 1737| 8.51M| plan.total += count; 1738| 8.51M| } _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| 119M| { 1734| 119M| auto count = p.count(); 1735| 119M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 119M, False: 0] ------------------ 1736| 119M| plan.counts[plan.n++] = count; 1737| 119M| plan.total += count; 1738| 119M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE7shuffleEj: 1762| 14.1M| { 1763| | // gcc seems to not really understand this code... :( 1764| 14.1M|#if !defined(_MSC_VER) 1765| 14.1M|#pragma GCC diagnostic push 1766| 14.1M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 14.1M|#endif 1768| 14.1M| constexpr count_t rrb_extras = 2; 1769| 14.1M| constexpr count_t rrb_invariant = 1; 1770| 14.1M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 1.14M, False: 13.0M] ------------------ 1771| 14.1M| const auto branches = count_t{1} << bits; 1772| 14.1M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 14.1M| count_t i = 0; 1774| 17.5M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 3.36M, False: 14.1M] ------------------ 1775| | // skip ok nodes 1776| 7.49M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 4.13M, False: 3.36M] ------------------ 1777| 4.13M| i++; 1778| 3.36M| assert(i < n); ------------------ | Branch (1778:13): [True: 3.36M, False: 0] ------------------ 1779| | // short node, redistribute 1780| 3.36M| auto remaining = counts[i]; 1781| 13.1M| do { 1782| 13.1M| auto next = counts[i + 1]; 1783| 13.1M| auto count = std::min(remaining + next, branches); 1784| 13.1M| counts[i] = count; 1785| 13.1M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 13.1M, False: 0] ------------------ 1786| 13.1M| remaining += next - count; 1787| 13.1M| ++i; 1788| 13.1M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 9.77M, False: 3.36M] ------------------ 1789| | // remove node 1790| 3.36M| std::move(counts + i + 1, counts + n, counts + i); 1791| 3.36M| --n; 1792| 3.36M| --i; 1793| 3.36M| } 1794| 14.1M|#if !defined(_MSC_VER) 1795| 14.1M|#pragma GCC diagnostic pop 1796| 14.1M|#endif 1797| 14.1M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1478| 28.3M| auto shift() const { return shift_; } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPjj: 1577| 14.1M| : curr_{counts} 1578| 14.1M| , n_{n} 1579| 14.1M| , result_{ 1580| 14.1M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 14.1M| { 1582| 14.1M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_m: 1481| 14.1M| : shift_{s} 1482| 14.1M| , count_{1} 1483| 14.1M| , nodes_{n0} 1484| 14.1M| , sizes_{s0} 1485| 14.1M| { 1486| 14.1M| } _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| 14.1M| { 1513| 14.1M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.14M, False: 13.0M] ------------------ 1514| 1.14M| auto s = size_t{}; 1515| 4.58M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.44M, False: 1.14M] ------------------ 1516| 3.44M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.44M| s = sizes_[i]; 1518| 3.44M| } 1519| 13.0M| } else { 1520| 35.1M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 22.1M, False: 13.0M] ------------------ 1521| 22.1M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 22.1M| .visit(v, args...); 1523| 13.0M| } 1524| 14.1M| } _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| 8.51M| { 1722| 8.51M| merger.merge_leaf(p); 1723| 8.51M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_: 1614| 8.51M| { 1615| 8.51M| auto from = p.node(); 1616| 8.51M| auto from_size = p.size(); 1617| 8.51M| auto from_count = p.count(); 1618| 8.51M| assert(from_size); ------------------ | Branch (1618:9): [True: 8.51M, False: 0] ------------------ 1619| 8.51M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 8.38M, False: 132k] | Branch (1619:21): [True: 8.31M, False: 63.6k] ------------------ 1620| 8.31M| add_child(from, from_size); 1621| 8.31M| from->inc(); 1622| 8.31M| } else { 1623| 196k| auto from_offset = count_t{}; 1624| 196k| auto from_data = from->leaf(); 1625| 262k| do { 1626| 262k| if (!to_) { ------------------ | Branch (1626:21): [True: 129k, False: 132k] ------------------ 1627| 129k| to_ = node_t::make_leaf_n(*curr_); 1628| 129k| to_offset_ = 0; 1629| 129k| } 1630| 262k| auto data = to_->leaf(); 1631| 262k| auto to_copy = 1632| 262k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 262k| detail::uninitialized_copy(from_data + from_offset, 1634| 262k| from_data + from_offset + to_copy, 1635| 262k| data + to_offset_); 1636| 262k| to_offset_ += to_copy; 1637| 262k| from_offset += to_copy; 1638| 262k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 129k, False: 132k] ------------------ 1639| 129k| add_child(to_, to_offset_); 1640| 129k| to_ = nullptr; 1641| 129k| } 1642| 262k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 66.0k, False: 196k] ------------------ 1643| 196k| } 1644| 8.51M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9add_childEPSC_m: 1589| 135M| { 1590| 135M| assert(size); ------------------ | Branch (1590:9): [True: 135M, False: 0] ------------------ 1591| 135M| ++curr_; 1592| 135M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 135M| auto relaxed = parent->relaxed(); 1594| 135M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 9.20M, False: 126M] ------------------ 1595| 9.20M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 9.20M, False: 0] ------------------ 1596| 9.20M| n_ -= branches; 1597| 9.20M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 9.20M| relaxed = parent->relaxed(); 1599| 9.20M| result_.nodes_[result_.count_] = parent; 1600| 9.20M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 9.20M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 9.20M, False: 0] ------------------ 1602| 9.20M| ++result_.count_; 1603| 9.20M| } 1604| 135M| auto idx = relaxed->d.count++; 1605| 135M| result_.sizes_[result_.count_ - 1] += size; 1606| 135M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 135M, False: 0] ------------------ 1607| 135M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 112M, False: 23.3M] ------------------ 1608| 135M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 135M, False: 0] ------------------ 1609| 135M| parent->inner()[idx] = p; 1610| 135M| }; _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| 119M| { 1716| 119M| merger.merge_inner(p); 1717| 119M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 119M| { 1649| 119M| auto from = p.node(); 1650| 119M| auto from_size = p.size(); 1651| 119M| auto from_count = p.count(); 1652| 119M| assert(from_size); ------------------ | Branch (1652:9): [True: 119M, False: 0] ------------------ 1653| 119M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 108M, False: 11.1M] | Branch (1653:21): [True: 105M, False: 2.73M] ------------------ 1654| 105M| add_child(from, from_size); 1655| 105M| from->inc(); 1656| 105M| } else { 1657| 13.8M| auto from_offset = count_t{}; 1658| 13.8M| auto from_data = from->inner(); 1659| 21.6M| do { 1660| 21.6M| if (!to_) { ------------------ | Branch (1660:21): [True: 10.5M, False: 11.1M] ------------------ 1661| 10.5M| to_ = node_t::make_inner_r_n(*curr_); 1662| 10.5M| to_offset_ = 0; 1663| 10.5M| to_size_ = 0; 1664| 10.5M| } 1665| 21.6M| auto data = to_->inner(); 1666| 21.6M| auto to_copy = 1667| 21.6M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 21.6M| std::copy(from_data + from_offset, 1669| 21.6M| from_data + from_offset + to_copy, 1670| 21.6M| data + to_offset_); 1671| 21.6M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 21.6M| auto sizes = to_->relaxed()->d.sizes; 1673| 21.6M| p.copy_sizes( 1674| 21.6M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 21.6M| to_offset_ += to_copy; 1676| 21.6M| from_offset += to_copy; 1677| 21.6M| to_size_ = sizes[to_offset_ - 1]; 1678| 21.6M| assert(to_size_); ------------------ | Branch (1678:17): [True: 21.6M, False: 0] ------------------ 1679| 21.6M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 10.5M, False: 11.1M] ------------------ 1680| 10.5M| to_->relaxed()->d.count = to_offset_; 1681| 10.5M| add_child(to_, to_size_); 1682| 10.5M| to_ = nullptr; 1683| 10.5M| } 1684| 21.6M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 7.81M, False: 13.8M] ------------------ 1685| 13.8M| } 1686| 119M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6finishEv: 1689| 14.1M| { 1690| 14.1M| assert(!to_); ------------------ | Branch (1690:9): [True: 14.1M, False: 0] ------------------ 1691| 14.1M| return result_; 1692| 14.1M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8each_subINS1_11dec_visitorEJEEEvT_DpOT0_: 1512| 14.1M| { 1513| 14.1M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.14M, False: 13.0M] ------------------ 1514| 1.14M| auto s = size_t{}; 1515| 4.58M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.44M, False: 1.14M] ------------------ 1516| 3.44M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.44M| s = sizes_[i]; 1518| 3.44M| } 1519| 13.0M| } else { 1520| 35.1M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 22.1M, False: 13.0M] ------------------ 1521| 22.1M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 22.1M| .visit(v, args...); 1523| 13.0M| } 1524| 14.1M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_mSE_m: 1503| 1.14M| : shift_{s} 1504| 1.14M| , count_{3} 1505| 1.14M| , nodes_{n0, n1, n2} 1506| 1.14M| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 1.14M| { 1508| 1.14M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_m: 1489| 7.32k| : shift_{s} 1490| 7.32k| , count_{2} 1491| 7.32k| , nodes_{n0, n1} 1492| 7.32k| , sizes_{s0, s0 + s1} 1493| 7.32k| { 1494| 7.32k| } _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| 16.7k| { 1918| 16.7k| return concat_inners(lpos, tpos, rpos); 1919| 16.7k| } _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| 297| { 1918| 297| return concat_inners(lpos, tpos, rpos); 1919| 297| } _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.62k|{ 1873| 2.62k| auto lshift = lpos.shift(); 1874| 2.62k| auto rshift = rpos.shift(); 1875| 2.62k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.62k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.62k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 722, False: 1.90k] ------------------ 1879| 722| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 722| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.90k| } else { 1882| 1.90k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.90k, False: 0] ------------------ 1883| 1.90k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.90k] | Branch (1883:9): [True: 1.90k, False: 0] | Branch (1883:9): [True: 1.90k, False: 0] ------------------ 1884| 1.90k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.90k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.90k| } 1887| 2.62k|} _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| 1.03k| { 1918| 1.03k| return concat_inners(lpos, tpos, rpos); 1919| 1.03k| } _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| 1.03k|{ 1873| 1.03k| auto lshift = lpos.shift(); 1874| 1.03k| auto rshift = rpos.shift(); 1875| 1.03k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 1.03k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.03k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 313, False: 722] ------------------ 1879| 313| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 313| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 722| } else { 1882| 722| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 722, False: 0] ------------------ 1883| 722| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 722] | Branch (1883:9): [True: 722, False: 0] | Branch (1883:9): [True: 722, False: 0] ------------------ 1884| 722| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 722| return concat_rebalance(lpos, cpos, rpos); 1886| 722| } 1887| 1.03k|} _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| 711|{ 1824| 711| auto plan = concat_rebalance_plan{}; 1825| 711| plan.fill(lpos, cpos, rpos); 1826| 711| plan.shuffle(cpos.shift()); 1827| 711| IMMER_TRY { ------------------ | | 49| 711|#define IMMER_TRY try ------------------ 1828| 711| return plan.merge(lpos, cpos, rpos); 1829| 711| } 1830| 711| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 711|} _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| 711| { 1753| 711| assert(n == 0u); ------------------ | Branch (1753:9): [True: 711, False: 0] ------------------ 1754| 711| assert(total == 0u); ------------------ | Branch (1754:9): [True: 711, False: 0] ------------------ 1755| 711| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 711| lpos.each_left_sub(visitor_t{}, *this); 1757| 711| cpos.each_sub(visitor_t{}, *this); 1758| 711| rpos.each_right_sub(visitor_t{}, *this); 1759| 711| } _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| 6.01M| { 1734| 6.01M| auto count = p.count(); 1735| 6.01M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 6.01M, False: 0] ------------------ 1736| 6.01M| plan.counts[plan.n++] = count; 1737| 6.01M| plan.total += count; 1738| 6.01M| } _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| 503k| { 1734| 503k| auto count = p.count(); 1735| 503k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 503k, False: 0] ------------------ 1736| 503k| plan.counts[plan.n++] = count; 1737| 503k| plan.total += count; 1738| 503k| } _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| 711| { 1803| 711| using node_t = node_type; 1804| 711| using merger_t = concat_merger; 1805| 711| using visitor_t = concat_merger_visitor; 1806| 711| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 711| IMMER_TRY { ------------------ | | 49| 711|#define IMMER_TRY try ------------------ 1808| 711| lpos.each_left_sub(visitor_t{}, merger); 1809| 711| cpos.each_sub(visitor_t{}, merger); 1810| 711| rpos.each_right_sub(visitor_t{}, merger); 1811| 711| cpos.each_sub(dec_visitor{}); 1812| 711| return merger.finish(); 1813| 711| } 1814| 711| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 711| } _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| 6.01M| { 1722| 6.01M| merger.merge_leaf(p); 1723| 6.01M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10merge_leafIRNS1_13full_leaf_posISC_EEEEvOT_: 1614| 6.01M| { 1615| 6.01M| auto from = p.node(); 1616| 6.01M| auto from_size = p.size(); 1617| 6.01M| auto from_count = p.count(); 1618| 6.01M| assert(from_size); ------------------ | Branch (1618:9): [True: 6.01M, False: 0] ------------------ 1619| 6.01M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 6.01M, False: 0] | Branch (1619:21): [True: 6.01M, False: 0] ------------------ 1620| 6.01M| add_child(from, from_size); 1621| 6.01M| from->inc(); 1622| 6.01M| } 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| 6.01M| } _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| 503k| { 1716| 503k| merger.merge_inner(p); 1717| 503k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 503k| { 1649| 503k| auto from = p.node(); 1650| 503k| auto from_size = p.size(); 1651| 503k| auto from_count = p.count(); 1652| 503k| assert(from_size); ------------------ | Branch (1652:9): [True: 503k, False: 0] ------------------ 1653| 503k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 503k, False: 0] | Branch (1653:21): [True: 503k, False: 0] ------------------ 1654| 503k| add_child(from, from_size); 1655| 503k| from->inc(); 1656| 503k| } 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| 503k| } _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| 722| { 1945| 722| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 722| } _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.62k| { 1925| 2.62k| return concat_leafs(lpos, tpos, rpos); 1926| 2.62k| } _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.62k|{ 1839| 2.62k| static_assert(Node::bits >= 2, ""); 1840| 2.62k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 2.62k, False: 0] ------------------ 1841| 2.62k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 2.62k, False: 0] ------------------ 1842| 2.62k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 2.62k, False: 0] ------------------ 1843| 2.62k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 2.62k] ------------------ 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.62k| else 1854| 2.62k| return { 1855| 2.62k| Node::bits_leaf, 1856| 2.62k| lpos.node()->inc(), 1857| 2.62k| lpos.count(), 1858| 2.62k| rpos.node()->inc(), 1859| 2.62k| rpos.count(), 1860| 2.62k| }; 1861| 2.62k|} _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| 722|{ 1824| 722| auto plan = concat_rebalance_plan{}; 1825| 722| plan.fill(lpos, cpos, rpos); 1826| 722| plan.shuffle(cpos.shift()); 1827| 722| IMMER_TRY { ------------------ | | 49| 722|#define IMMER_TRY try ------------------ 1828| 722| return plan.merge(lpos, cpos, rpos); 1829| 722| } 1830| 722| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 722|} _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| 722| { 1753| 722| assert(n == 0u); ------------------ | Branch (1753:9): [True: 722, False: 0] ------------------ 1754| 722| assert(total == 0u); ------------------ | Branch (1754:9): [True: 722, False: 0] ------------------ 1755| 722| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 722| lpos.each_left_sub(visitor_t{}, *this); 1757| 722| cpos.each_sub(visitor_t{}, *this); 1758| 722| rpos.each_right_sub(visitor_t{}, *this); 1759| 722| } _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| 722| { 1803| 722| using node_t = node_type; 1804| 722| using merger_t = concat_merger; 1805| 722| using visitor_t = concat_merger_visitor; 1806| 722| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 722| IMMER_TRY { ------------------ | | 49| 722|#define IMMER_TRY try ------------------ 1808| 722| lpos.each_left_sub(visitor_t{}, merger); 1809| 722| cpos.each_sub(visitor_t{}, merger); 1810| 722| rpos.each_right_sub(visitor_t{}, merger); 1811| 722| cpos.each_sub(dec_visitor{}); 1812| 722| return merger.finish(); 1813| 722| } 1814| 722| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 722| } _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.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_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.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| } _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| 4.25M| { 1734| 4.25M| auto count = p.count(); 1735| 4.25M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 4.25M, False: 0] ------------------ 1736| 4.25M| plan.counts[plan.n++] = count; 1737| 4.25M| plan.total += count; 1738| 4.25M| } _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.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| } _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| 4.25M| { 1716| 4.25M| merger.merge_inner(p); 1717| 4.25M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_: 1648| 4.25M| { 1649| 4.25M| auto from = p.node(); 1650| 4.25M| auto from_size = p.size(); 1651| 4.25M| auto from_count = p.count(); 1652| 4.25M| assert(from_size); ------------------ | Branch (1652:9): [True: 4.25M, False: 0] ------------------ 1653| 4.25M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 2.35M, False: 1.89M] | Branch (1653:21): [True: 2.35M, False: 0] ------------------ 1654| 2.35M| add_child(from, from_size); 1655| 2.35M| from->inc(); 1656| 2.35M| } else { 1657| 1.89M| auto from_offset = count_t{}; 1658| 1.89M| auto from_data = from->inner(); 1659| 3.78M| do { 1660| 3.78M| if (!to_) { ------------------ | Branch (1660:21): [True: 1.89M, False: 1.89M] ------------------ 1661| 1.89M| to_ = node_t::make_inner_r_n(*curr_); 1662| 1.89M| to_offset_ = 0; 1663| 1.89M| to_size_ = 0; 1664| 1.89M| } 1665| 3.78M| auto data = to_->inner(); 1666| 3.78M| auto to_copy = 1667| 3.78M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 3.78M| std::copy(from_data + from_offset, 1669| 3.78M| from_data + from_offset + to_copy, 1670| 3.78M| data + to_offset_); 1671| 3.78M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 3.78M| auto sizes = to_->relaxed()->d.sizes; 1673| 3.78M| p.copy_sizes( 1674| 3.78M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 3.78M| to_offset_ += to_copy; 1676| 3.78M| from_offset += to_copy; 1677| 3.78M| to_size_ = sizes[to_offset_ - 1]; 1678| 3.78M| assert(to_size_); ------------------ | Branch (1678:17): [True: 3.78M, False: 0] ------------------ 1679| 3.78M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 1.89M, False: 1.89M] ------------------ 1680| 1.89M| to_->relaxed()->d.count = to_offset_; 1681| 1.89M| add_child(to_, to_size_); 1682| 1.89M| to_ = nullptr; 1683| 1.89M| } 1684| 3.78M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.89M, False: 1.89M] ------------------ 1685| 1.89M| } 1686| 4.25M| } _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.90k| { 1945| 1.90k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 1.90k| } _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| 4.69k| { 1925| 4.69k| return concat_leafs(lpos, tpos, rpos); 1926| 4.69k| } _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| 4.69k|{ 1839| 4.69k| static_assert(Node::bits >= 2, ""); 1840| 4.69k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 4.69k, False: 0] ------------------ 1841| 4.69k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 4.69k, False: 0] ------------------ 1842| 4.69k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 4.69k, False: 0] ------------------ 1843| 4.69k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 4.69k] ------------------ 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| 4.69k| else 1854| 4.69k| return { 1855| 4.69k| Node::bits_leaf, 1856| 4.69k| lpos.node()->inc(), 1857| 4.69k| lpos.count(), 1858| 4.69k| rpos.node()->inc(), 1859| 4.69k| rpos.count(), 1860| 4.69k| }; 1861| 4.69k|} _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.90k|{ 1824| 1.90k| auto plan = concat_rebalance_plan{}; 1825| 1.90k| plan.fill(lpos, cpos, rpos); 1826| 1.90k| plan.shuffle(cpos.shift()); 1827| 1.90k| IMMER_TRY { ------------------ | | 49| 1.90k|#define IMMER_TRY try ------------------ 1828| 1.90k| return plan.merge(lpos, cpos, rpos); 1829| 1.90k| } 1830| 1.90k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.90k|} _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.90k| { 1753| 1.90k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.90k, False: 0] ------------------ 1754| 1.90k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.90k, False: 0] ------------------ 1755| 1.90k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.90k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.90k| cpos.each_sub(visitor_t{}, *this); 1758| 1.90k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.90k| } _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.90k| { 1803| 1.90k| using node_t = node_type; 1804| 1.90k| using merger_t = concat_merger; 1805| 1.90k| using visitor_t = concat_merger_visitor; 1806| 1.90k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.90k| IMMER_TRY { ------------------ | | 49| 1.90k|#define IMMER_TRY try ------------------ 1808| 1.90k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.90k| cpos.each_sub(visitor_t{}, merger); 1810| 1.90k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.90k| cpos.each_sub(dec_visitor{}); 1812| 1.90k| return merger.finish(); 1813| 1.90k| } 1814| 1.90k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.90k| } _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| 59.4k|{ 1824| 59.4k| auto plan = concat_rebalance_plan{}; 1825| 59.4k| plan.fill(lpos, cpos, rpos); 1826| 59.4k| plan.shuffle(cpos.shift()); 1827| 59.4k| IMMER_TRY { ------------------ | | 49| 59.4k|#define IMMER_TRY try ------------------ 1828| 59.4k| return plan.merge(lpos, cpos, rpos); 1829| 59.4k| } 1830| 59.4k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 59.4k|} _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| 59.4k| { 1753| 59.4k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 59.4k, False: 0] ------------------ 1754| 59.4k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 59.4k, False: 0] ------------------ 1755| 59.4k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 59.4k| lpos.each_left_sub(visitor_t{}, *this); 1757| 59.4k| cpos.each_sub(visitor_t{}, *this); 1758| 59.4k| rpos.each_right_sub(visitor_t{}, *this); 1759| 59.4k| } _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| 59.4k| { 1803| 59.4k| using node_t = node_type; 1804| 59.4k| using merger_t = concat_merger; 1805| 59.4k| using visitor_t = concat_merger_visitor; 1806| 59.4k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 59.4k| IMMER_TRY { ------------------ | | 49| 59.4k|#define IMMER_TRY try ------------------ 1808| 59.4k| lpos.each_left_sub(visitor_t{}, merger); 1809| 59.4k| cpos.each_sub(visitor_t{}, merger); 1810| 59.4k| rpos.each_right_sub(visitor_t{}, merger); 1811| 59.4k| cpos.each_sub(dec_visitor{}); 1812| 59.4k| return merger.finish(); 1813| 59.4k| } 1814| 59.4k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 59.4k| } _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| 4.69k| { 1945| 4.69k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 4.69k| } _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| 4.69k|{ 1824| 4.69k| auto plan = concat_rebalance_plan{}; 1825| 4.69k| plan.fill(lpos, cpos, rpos); 1826| 4.69k| plan.shuffle(cpos.shift()); 1827| 4.69k| IMMER_TRY { ------------------ | | 49| 4.69k|#define IMMER_TRY try ------------------ 1828| 4.69k| return plan.merge(lpos, cpos, rpos); 1829| 4.69k| } 1830| 4.69k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.69k|} _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| 4.69k| { 1753| 4.69k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.69k, False: 0] ------------------ 1754| 4.69k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.69k, False: 0] ------------------ 1755| 4.69k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.69k| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.69k| cpos.each_sub(visitor_t{}, *this); 1758| 4.69k| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.69k| } _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| 4.69k| { 1803| 4.69k| using node_t = node_type; 1804| 4.69k| using merger_t = concat_merger; 1805| 4.69k| using visitor_t = concat_merger_visitor; 1806| 4.69k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.69k| IMMER_TRY { ------------------ | | 49| 4.69k|#define IMMER_TRY try ------------------ 1808| 4.69k| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.69k| cpos.each_sub(visitor_t{}, merger); 1810| 4.69k| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.69k| cpos.each_sub(dec_visitor{}); 1812| 4.69k| return merger.finish(); 1813| 4.69k| } 1814| 4.69k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.69k| } _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.32k| { 1959| 2.32k| return concat_inners(lpos, tpos, rpos); 1960| 2.32k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7realizeEv: 1527| 1.14M| { 1528| 1.14M| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 49.4k, False: 1.09M] ------------------ 1529| 49.4k| IMMER_TRY { ------------------ | | 49| 49.4k|#define IMMER_TRY try ------------------ 1530| 49.4k| auto result = node_t::make_inner_r_n(count_); 1531| 49.4k| auto r = result->relaxed(); 1532| 49.4k| r->d.count = count_; 1533| 49.4k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 49.4k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 49.4k| return {result, shift_, r}; 1536| 49.4k| } 1537| 49.4k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 1.09M| } else { 1542| 1.09M| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 1.09M, False: 0] ------------------ 1543| 1.09M| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 1.09M| } 1545| 1.14M| } _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.14M|{ 1987| 1.14M| return visit_maybe_relaxed_sub(lroot, 1988| 1.14M| lshift, 1989| 1.14M| lsize, 1990| 1.14M| concat_trees_left_visitor{}, 1991| 1.14M| make_leaf_pos(ltail, ltcount), 1992| 1.14M| rroot, 1993| 1.14M| rshift, 1994| 1.14M| rsize) 1995| 1.14M| .realize(); 1996| 1.14M|} _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.12M| { 1972| 1.12M| return visit_maybe_relaxed_sub( 1973| 1.12M| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 1.12M| } _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.11M| { 1959| 1.11M| return concat_inners(lpos, tpos, rpos); 1960| 1.11M| } _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| 12.5M|{ 1873| 12.5M| auto lshift = lpos.shift(); 1874| 12.5M| auto rshift = rpos.shift(); 1875| 12.5M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 3.56M, False: 8.98M] ------------------ 1876| 3.56M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 3.56M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 8.98M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 35.0k, False: 8.95M] ------------------ 1879| 35.0k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 35.0k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 8.95M| } else { 1882| 8.95M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 8.95M, False: 0] ------------------ 1883| 8.95M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 8.95M] | Branch (1883:9): [True: 8.95M, False: 0] | Branch (1883:9): [True: 8.95M, False: 0] ------------------ 1884| 8.95M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 8.95M| return concat_rebalance(lpos, cpos, rpos); 1886| 8.95M| } 1887| 12.5M|} _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.56M| { 1898| 3.56M| return concat_inners(lpos, tpos, rpos); 1899| 3.56M| } _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.76k| { 1898| 4.76k| return concat_inners(lpos, tpos, rpos); 1899| 4.76k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 1.13M|{ 1873| 1.13M| auto lshift = lpos.shift(); 1874| 1.13M| auto rshift = rpos.shift(); 1875| 1.13M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.52k, False: 1.13M] ------------------ 1876| 2.52k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.52k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.13M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 7.35k, False: 1.12M] ------------------ 1879| 7.35k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 7.35k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.12M| } else { 1882| 1.12M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.12M, False: 0] ------------------ 1883| 1.12M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.12M] | Branch (1883:9): [True: 1.12M, False: 0] | Branch (1883:9): [True: 1.12M, False: 0] ------------------ 1884| 1.12M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.12M| return concat_rebalance(lpos, cpos, rpos); 1886| 1.12M| } 1887| 1.13M|} _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.41k|{ 1824| 3.41k| auto plan = concat_rebalance_plan{}; 1825| 3.41k| plan.fill(lpos, cpos, rpos); 1826| 3.41k| plan.shuffle(cpos.shift()); 1827| 3.41k| IMMER_TRY { ------------------ | | 49| 3.41k|#define IMMER_TRY try ------------------ 1828| 3.41k| return plan.merge(lpos, cpos, rpos); 1829| 3.41k| } 1830| 3.41k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.41k|} _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.41k| { 1753| 3.41k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.41k, False: 0] ------------------ 1754| 3.41k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.41k, False: 0] ------------------ 1755| 3.41k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.41k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.41k| cpos.each_sub(visitor_t{}, *this); 1758| 3.41k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.41k| } _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.41k| { 1803| 3.41k| using node_t = node_type; 1804| 3.41k| using merger_t = concat_merger; 1805| 3.41k| using visitor_t = concat_merger_visitor; 1806| 3.41k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.41k| IMMER_TRY { ------------------ | | 49| 3.41k|#define IMMER_TRY try ------------------ 1808| 3.41k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.41k| cpos.each_sub(visitor_t{}, merger); 1810| 3.41k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.41k| cpos.each_sub(dec_visitor{}); 1812| 3.41k| return merger.finish(); 1813| 3.41k| } 1814| 3.41k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.41k| } _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.12M| { 1918| 1.12M| return concat_inners(lpos, tpos, rpos); 1919| 1.12M| } _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| 393k| { 1918| 393k| return concat_inners(lpos, tpos, rpos); 1919| 393k| } _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| 405k|{ 1873| 405k| auto lshift = lpos.shift(); 1874| 405k| auto rshift = rpos.shift(); 1875| 405k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 887, False: 404k] ------------------ 1876| 887| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 887| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 404k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 464, False: 403k] ------------------ 1879| 464| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 464| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 403k| } else { 1882| 403k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 403k, False: 0] ------------------ 1883| 403k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 403k] | Branch (1883:9): [True: 403k, False: 0] | Branch (1883:9): [True: 403k, False: 0] ------------------ 1884| 403k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 403k| return concat_rebalance(lpos, cpos, rpos); 1886| 403k| } 1887| 405k|} _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| 9.89k| { 1918| 9.89k| return concat_inners(lpos, tpos, rpos); 1919| 9.89k| } _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| 9.89k|{ 1873| 9.89k| auto lshift = lpos.shift(); 1874| 9.89k| auto rshift = rpos.shift(); 1875| 9.89k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 9.89k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 9.89k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 202, False: 9.68k] ------------------ 1879| 202| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 202| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 9.68k| } else { 1882| 9.68k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 9.68k, False: 0] ------------------ 1883| 9.68k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 9.68k] | Branch (1883:9): [True: 9.68k, False: 0] | Branch (1883:9): [True: 9.68k, False: 0] ------------------ 1884| 9.68k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 9.68k| return concat_rebalance(lpos, cpos, rpos); 1886| 9.68k| } 1887| 9.89k|} _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| 7.55k| { 1945| 7.55k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 7.55k| } _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| 411k| { 1925| 411k| return concat_leafs(lpos, tpos, rpos); 1926| 411k| } _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| 411k|{ 1839| 411k| static_assert(Node::bits >= 2, ""); 1840| 411k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 411k, False: 0] ------------------ 1841| 411k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 411k, False: 0] ------------------ 1842| 411k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 411k, False: 0] ------------------ 1843| 411k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 411k, False: 0] ------------------ 1844| 411k| return { 1845| 411k| Node::bits_leaf, 1846| 411k| lpos.node()->inc(), 1847| 411k| lpos.count(), 1848| 411k| tpos.node()->inc(), 1849| 411k| tpos.count(), 1850| 411k| rpos.node()->inc(), 1851| 411k| rpos.count(), 1852| 411k| }; 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| 411k|} _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| 3.25k| { 1938| 3.25k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 3.25k| } _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| 9.68k|{ 1824| 9.68k| auto plan = concat_rebalance_plan{}; 1825| 9.68k| plan.fill(lpos, cpos, rpos); 1826| 9.68k| plan.shuffle(cpos.shift()); 1827| 9.68k| IMMER_TRY { ------------------ | | 49| 9.68k|#define IMMER_TRY try ------------------ 1828| 9.68k| return plan.merge(lpos, cpos, rpos); 1829| 9.68k| } 1830| 9.68k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 9.68k|} _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| 9.68k| { 1753| 9.68k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 9.68k, False: 0] ------------------ 1754| 9.68k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 9.68k, False: 0] ------------------ 1755| 9.68k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 9.68k| lpos.each_left_sub(visitor_t{}, *this); 1757| 9.68k| cpos.each_sub(visitor_t{}, *this); 1758| 9.68k| rpos.each_right_sub(visitor_t{}, *this); 1759| 9.68k| } _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| 9.68k| { 1803| 9.68k| using node_t = node_type; 1804| 9.68k| using merger_t = concat_merger; 1805| 9.68k| using visitor_t = concat_merger_visitor; 1806| 9.68k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 9.68k| IMMER_TRY { ------------------ | | 49| 9.68k|#define IMMER_TRY try ------------------ 1808| 9.68k| lpos.each_left_sub(visitor_t{}, merger); 1809| 9.68k| cpos.each_sub(visitor_t{}, merger); 1810| 9.68k| rpos.each_right_sub(visitor_t{}, merger); 1811| 9.68k| cpos.each_sub(dec_visitor{}); 1812| 9.68k| return merger.finish(); 1813| 9.68k| } 1814| 9.68k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 9.68k| } _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| 403k| { 1945| 403k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 403k| } _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| 730k| { 1925| 730k| return concat_leafs(lpos, tpos, rpos); 1926| 730k| } _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| 730k|{ 1839| 730k| static_assert(Node::bits >= 2, ""); 1840| 730k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 730k, False: 0] ------------------ 1841| 730k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 730k, False: 0] ------------------ 1842| 730k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 730k, False: 0] ------------------ 1843| 730k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 730k, False: 0] ------------------ 1844| 730k| return { 1845| 730k| Node::bits_leaf, 1846| 730k| lpos.node()->inc(), 1847| 730k| lpos.count(), 1848| 730k| tpos.node()->inc(), 1849| 730k| tpos.count(), 1850| 730k| rpos.node()->inc(), 1851| 730k| rpos.count(), 1852| 730k| }; 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| 730k|} _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| 5.97k| { 1938| 5.97k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 5.97k| } _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| 403k|{ 1824| 403k| auto plan = concat_rebalance_plan{}; 1825| 403k| plan.fill(lpos, cpos, rpos); 1826| 403k| plan.shuffle(cpos.shift()); 1827| 403k| IMMER_TRY { ------------------ | | 49| 403k|#define IMMER_TRY try ------------------ 1828| 403k| return plan.merge(lpos, cpos, rpos); 1829| 403k| } 1830| 403k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 403k|} _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| 403k| { 1753| 403k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 403k, False: 0] ------------------ 1754| 403k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 403k, False: 0] ------------------ 1755| 403k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 403k| lpos.each_left_sub(visitor_t{}, *this); 1757| 403k| cpos.each_sub(visitor_t{}, *this); 1758| 403k| rpos.each_right_sub(visitor_t{}, *this); 1759| 403k| } _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| 403k| { 1803| 403k| using node_t = node_type; 1804| 403k| using merger_t = concat_merger; 1805| 403k| using visitor_t = concat_merger_visitor; 1806| 403k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 403k| IMMER_TRY { ------------------ | | 49| 403k|#define IMMER_TRY try ------------------ 1808| 403k| lpos.each_left_sub(visitor_t{}, merger); 1809| 403k| cpos.each_sub(visitor_t{}, merger); 1810| 403k| rpos.each_right_sub(visitor_t{}, merger); 1811| 403k| cpos.each_sub(dec_visitor{}); 1812| 403k| return merger.finish(); 1813| 403k| } 1814| 403k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 403k| } _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| 730k| { 1945| 730k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 730k| } _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.51M| { 1938| 1.51M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.51M| } _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.12M|{ 1824| 1.12M| auto plan = concat_rebalance_plan{}; 1825| 1.12M| plan.fill(lpos, cpos, rpos); 1826| 1.12M| plan.shuffle(cpos.shift()); 1827| 1.12M| IMMER_TRY { ------------------ | | 49| 1.12M|#define IMMER_TRY try ------------------ 1828| 1.12M| return plan.merge(lpos, cpos, rpos); 1829| 1.12M| } 1830| 1.12M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.12M|} _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.12M| { 1753| 1.12M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.12M, False: 0] ------------------ 1754| 1.12M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.12M, False: 0] ------------------ 1755| 1.12M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.12M| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.12M| cpos.each_sub(visitor_t{}, *this); 1758| 1.12M| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.12M| } _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.12M| { 1803| 1.12M| using node_t = node_type; 1804| 1.12M| using merger_t = concat_merger; 1805| 1.12M| using visitor_t = concat_merger_visitor; 1806| 1.12M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.12M| IMMER_TRY { ------------------ | | 49| 1.12M|#define IMMER_TRY try ------------------ 1808| 1.12M| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.12M| cpos.each_sub(visitor_t{}, merger); 1810| 1.12M| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.12M| cpos.each_sub(dec_visitor{}); 1812| 1.12M| return merger.finish(); 1813| 1.12M| } 1814| 1.12M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.12M| } _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.57M|{ 1824| 3.57M| auto plan = concat_rebalance_plan{}; 1825| 3.57M| plan.fill(lpos, cpos, rpos); 1826| 3.57M| plan.shuffle(cpos.shift()); 1827| 3.57M| IMMER_TRY { ------------------ | | 49| 3.57M|#define IMMER_TRY try ------------------ 1828| 3.57M| return plan.merge(lpos, cpos, rpos); 1829| 3.57M| } 1830| 3.57M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.57M|} _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.57M| { 1753| 3.57M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.57M, False: 0] ------------------ 1754| 3.57M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.57M, False: 0] ------------------ 1755| 3.57M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.57M| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.57M| cpos.each_sub(visitor_t{}, *this); 1758| 3.57M| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.57M| } _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.57M| { 1803| 3.57M| using node_t = node_type; 1804| 3.57M| using merger_t = concat_merger; 1805| 3.57M| using visitor_t = concat_merger_visitor; 1806| 3.57M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.57M| IMMER_TRY { ------------------ | | 49| 3.57M|#define IMMER_TRY try ------------------ 1808| 3.57M| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.57M| cpos.each_sub(visitor_t{}, merger); 1810| 3.57M| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.57M| cpos.each_sub(dec_visitor{}); 1812| 3.57M| return merger.finish(); 1813| 3.57M| } 1814| 3.57M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.57M| } _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.87M| { 1918| 7.87M| return concat_inners(lpos, tpos, rpos); 1919| 7.87M| } _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| 572| { 1918| 572| return concat_inners(lpos, tpos, rpos); 1919| 572| } _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| 17.1k|{ 1873| 17.1k| auto lshift = lpos.shift(); 1874| 17.1k| auto rshift = rpos.shift(); 1875| 17.1k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 10.1k, False: 6.95k] ------------------ 1876| 10.1k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 10.1k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 10.1k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 670, False: 6.28k] ------------------ 1879| 670| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 670| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 6.28k| } else { 1882| 6.28k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 6.28k, False: 0] ------------------ 1883| 6.28k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 6.28k] | Branch (1883:9): [True: 6.28k, False: 0] | Branch (1883:9): [True: 6.28k, False: 0] ------------------ 1884| 6.28k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 6.28k| return concat_rebalance(lpos, cpos, rpos); 1886| 6.28k| } 1887| 17.1k|} _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| 9.72k| { 1898| 9.72k| return concat_inners(lpos, tpos, rpos); 1899| 9.72k| } _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.61k| { 1918| 1.61k| return concat_inners(lpos, tpos, rpos); 1919| 1.61k| } _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.61k|{ 1873| 1.61k| auto lshift = lpos.shift(); 1874| 1.61k| auto rshift = rpos.shift(); 1875| 1.61k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 1.61k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.61k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 196, False: 1.41k] ------------------ 1879| 196| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 196| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.41k| } else { 1882| 1.41k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.41k, False: 0] ------------------ 1883| 1.41k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.41k] | Branch (1883:9): [True: 1.41k, False: 0] | Branch (1883:9): [True: 1.41k, False: 0] ------------------ 1884| 1.41k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.41k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.41k| } 1887| 1.61k|} _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| 298| { 1938| 298| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 298| } _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.41k|{ 1824| 1.41k| auto plan = concat_rebalance_plan{}; 1825| 1.41k| plan.fill(lpos, cpos, rpos); 1826| 1.41k| plan.shuffle(cpos.shift()); 1827| 1.41k| IMMER_TRY { ------------------ | | 49| 1.41k|#define IMMER_TRY try ------------------ 1828| 1.41k| return plan.merge(lpos, cpos, rpos); 1829| 1.41k| } 1830| 1.41k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.41k|} _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.41k| { 1753| 1.41k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.41k, False: 0] ------------------ 1754| 1.41k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.41k, False: 0] ------------------ 1755| 1.41k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.41k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.41k| cpos.each_sub(visitor_t{}, *this); 1758| 1.41k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.41k| } _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.41k| { 1803| 1.41k| using node_t = node_type; 1804| 1.41k| using merger_t = concat_merger; 1805| 1.41k| using visitor_t = concat_merger_visitor; 1806| 1.41k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.41k| IMMER_TRY { ------------------ | | 49| 1.41k|#define IMMER_TRY try ------------------ 1808| 1.41k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.41k| cpos.each_sub(visitor_t{}, merger); 1810| 1.41k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.41k| cpos.each_sub(dec_visitor{}); 1812| 1.41k| return merger.finish(); 1813| 1.41k| } 1814| 1.41k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.41k| } _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| 448| { 1938| 448| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 448| } _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| 6.28k|{ 1824| 6.28k| auto plan = concat_rebalance_plan{}; 1825| 6.28k| plan.fill(lpos, cpos, rpos); 1826| 6.28k| plan.shuffle(cpos.shift()); 1827| 6.28k| IMMER_TRY { ------------------ | | 49| 6.28k|#define IMMER_TRY try ------------------ 1828| 6.28k| return plan.merge(lpos, cpos, rpos); 1829| 6.28k| } 1830| 6.28k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 6.28k|} _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| 6.28k| { 1753| 6.28k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 6.28k, False: 0] ------------------ 1754| 6.28k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 6.28k, False: 0] ------------------ 1755| 6.28k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 6.28k| lpos.each_left_sub(visitor_t{}, *this); 1757| 6.28k| cpos.each_sub(visitor_t{}, *this); 1758| 6.28k| rpos.each_right_sub(visitor_t{}, *this); 1759| 6.28k| } _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| 6.28k| { 1803| 6.28k| using node_t = node_type; 1804| 6.28k| using merger_t = concat_merger; 1805| 6.28k| using visitor_t = concat_merger_visitor; 1806| 6.28k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 6.28k| IMMER_TRY { ------------------ | | 49| 6.28k|#define IMMER_TRY try ------------------ 1808| 6.28k| lpos.each_left_sub(visitor_t{}, merger); 1809| 6.28k| cpos.each_sub(visitor_t{}, merger); 1810| 6.28k| rpos.each_right_sub(visitor_t{}, merger); 1811| 6.28k| cpos.each_sub(dec_visitor{}); 1812| 6.28k| return merger.finish(); 1813| 6.28k| } 1814| 6.28k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 6.28k| } _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.83M| { 1938| 7.83M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 7.83M| } _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.95M|{ 1824| 8.95M| auto plan = concat_rebalance_plan{}; 1825| 8.95M| plan.fill(lpos, cpos, rpos); 1826| 8.95M| plan.shuffle(cpos.shift()); 1827| 8.95M| IMMER_TRY { ------------------ | | 49| 8.95M|#define IMMER_TRY try ------------------ 1828| 8.95M| return plan.merge(lpos, cpos, rpos); 1829| 8.95M| } 1830| 8.95M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 8.95M|} _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.95M| { 1753| 8.95M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 8.95M, False: 0] ------------------ 1754| 8.95M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 8.95M, False: 0] ------------------ 1755| 8.95M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 8.95M| lpos.each_left_sub(visitor_t{}, *this); 1757| 8.95M| cpos.each_sub(visitor_t{}, *this); 1758| 8.95M| rpos.each_right_sub(visitor_t{}, *this); 1759| 8.95M| } _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.95M| { 1803| 8.95M| using node_t = node_type; 1804| 8.95M| using merger_t = concat_merger; 1805| 8.95M| using visitor_t = concat_merger_visitor; 1806| 8.95M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 8.95M| IMMER_TRY { ------------------ | | 49| 8.95M|#define IMMER_TRY try ------------------ 1808| 8.95M| lpos.each_left_sub(visitor_t{}, merger); 1809| 8.95M| cpos.each_sub(visitor_t{}, merger); 1810| 8.95M| rpos.each_right_sub(visitor_t{}, merger); 1811| 8.95M| cpos.each_sub(dec_visitor{}); 1812| 8.95M| return merger.finish(); 1813| 8.95M| } 1814| 8.95M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 8.95M| } _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| 6.83k| { 1959| 6.83k| return concat_inners(lpos, tpos, rpos); 1960| 6.83k| } _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.7k| { 1972| 16.7k| return visit_maybe_relaxed_sub( 1973| 16.7k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 16.7k| } _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.89k| { 1959| 6.89k| return concat_inners(lpos, tpos, rpos); 1960| 6.89k| } _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| 9.84k| { 1959| 9.84k| return concat_inners(lpos, tpos, rpos); 1960| 9.84k| } _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| 215k| { 681| 215k| auto node = pos.node(); 682| 215k| auto level = pos.shift(); 683| 215k| auto idx = pos.count() - 1; 684| 215k| auto children = pos.size(idx); 685| 215k| auto new_idx = 686| 215k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 2.90k, False: 212k] | Branch (686:47): [True: 325, False: 212k] ------------------ 687| 215k| auto new_child = static_cast(nullptr); 688| 215k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 215k, Folded] | Branch (688:38): [True: 212k, False: 2.98k] ------------------ 689| | 690| 215k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 760, False: 214k] ------------------ 691| 760| return nullptr; 692| 214k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 212k, False: 2.47k] ------------------ 693| 212k| new_child = 694| 212k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 209k, False: 2.53k] ------------------ 695| 212k| : pos.last_oh_csh( 696| 2.53k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 212k| if (!new_child) { ------------------ | Branch (697:17): [True: 1.04k, False: 211k] ------------------ 698| 1.04k| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 321, False: 719] ------------------ 699| 321| new_child = node_t::make_path_e(e, level - B, tail); 700| 719| else 701| 719| return nullptr; 702| 1.04k| } 703| 212k| } else 704| 2.47k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 214k| if (mutate) { ------------------ | Branch (706:13): [True: 211k, False: 2.66k] ------------------ 707| 211k| auto count = new_idx + 1; 708| 211k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 211k| node->inner()[new_idx] = new_child; 710| 211k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 211k| relaxed->d.count = count; 712| 211k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 211k, False: 0] ------------------ 713| 211k| return node; 714| 211k| } else { 715| 2.66k| IMMER_TRY { ------------------ | | 49| 2.66k|#define IMMER_TRY try ------------------ 716| 2.66k| auto count = new_idx + 1; 717| 2.66k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 2.66k| auto relaxed = new_node->relaxed(); 719| 2.66k| new_node->inner()[new_idx] = new_child; 720| 2.66k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 2.66k| relaxed->d.count = count; 722| 2.66k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 2.66k, False: 0] ------------------ 723| 2.66k| if (Mutating) ------------------ | Branch (723:21): [True: 2.66k, Folded] ------------------ 724| 2.66k| pos.visit(dec_visitor{}); 725| 2.66k| return new_node; 726| 2.66k| } 727| 2.66k| 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.66k| } 737| 214k| } _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| 170k| { 742| 170k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 170k, False: 0] ------------------ 743| 170k| auto node = pos.node(); 744| 170k| auto idx = pos.index(pos.size() - 1); 745| 170k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 170k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 170k, Folded] | Branch (746:36): [True: 169k, False: 1.07k] ------------------ 747| 170k| if (mutate) { ------------------ | Branch (747:13): [True: 169k, False: 1.07k] ------------------ 748| 169k| node->inner()[new_idx] = 749| 169k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 166k, False: 2.83k] ------------------ 750| | /* otherwise */ 751| 169k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 169k| return node; 753| 169k| } 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: 774, False: 302] ------------------ 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| 170k| } _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.08M| { 742| 1.08M| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.08M, False: 0] ------------------ 743| 1.08M| auto node = pos.node(); 744| 1.08M| auto idx = pos.index(pos.size() - 1); 745| 1.08M| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.08M| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 1.08M, Folded] | Branch (746:36): [True: 1.08M, False: 1.85k] ------------------ 747| 1.08M| if (mutate) { ------------------ | Branch (747:13): [True: 1.08M, False: 1.85k] ------------------ 748| 1.08M| node->inner()[new_idx] = 749| 1.08M| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 748k, False: 337k] ------------------ 750| | /* otherwise */ 751| 1.08M| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 1.08M| return node; 753| 1.08M| } else { 754| 1.85k| auto new_parent = node_t::make_inner_e(e); 755| 1.85k| IMMER_TRY { ------------------ | | 49| 1.85k|#define IMMER_TRY try ------------------ 756| 1.85k| new_parent->inner()[new_idx] = 757| 1.85k| idx == new_idx ------------------ | Branch (757:21): [True: 1.16k, False: 692] ------------------ 758| 1.85k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.85k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.85k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.85k| if (Mutating) ------------------ | Branch (762:21): [True: 1.85k, Folded] ------------------ 763| 1.85k| pos.visit(dec_visitor{}); 764| 1.85k| return new_parent; 765| 1.85k| } 766| 1.85k| 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.85k| } 771| 1.08M| } _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.33k| { 742| 4.33k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 4.33k, False: 0] ------------------ 743| 4.33k| auto node = pos.node(); 744| 4.33k| auto idx = pos.index(pos.size() - 1); 745| 4.33k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 4.33k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 4.33k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 4.33k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 4.33k] ------------------ 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.33k| } else { 754| 4.33k| auto new_parent = node_t::make_inner_e(e); 755| 4.33k| IMMER_TRY { ------------------ | | 49| 4.33k|#define IMMER_TRY try ------------------ 756| 4.33k| new_parent->inner()[new_idx] = 757| 4.33k| idx == new_idx ------------------ | Branch (757:21): [True: 1.53k, False: 2.80k] ------------------ 758| 4.33k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 4.33k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 4.33k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 4.33k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 4.33k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 4.33k| return new_parent; 765| 4.33k| } 766| 4.33k| 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.33k| } 771| 4.33k| } _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| 7.01k| { 681| 7.01k| auto node = pos.node(); 682| 7.01k| auto level = pos.shift(); 683| 7.01k| auto idx = pos.count() - 1; 684| 7.01k| auto children = pos.size(idx); 685| 7.01k| auto new_idx = 686| 7.01k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 847, False: 6.16k] | Branch (686:47): [True: 609, False: 5.55k] ------------------ 687| 7.01k| auto new_child = static_cast(nullptr); 688| 7.01k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 7.01k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 7.01k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 646, False: 6.36k] ------------------ 691| 646| return nullptr; 692| 6.36k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 5.55k, False: 810] ------------------ 693| 5.55k| new_child = 694| 5.55k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 5.55k] ------------------ 695| 5.55k| : pos.last_oh_csh( 696| 5.55k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 5.55k| if (!new_child) { ------------------ | Branch (697:17): [True: 785, False: 4.76k] ------------------ 698| 785| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 342, False: 443] ------------------ 699| 342| new_child = node_t::make_path_e(e, level - B, tail); 700| 443| else 701| 443| return nullptr; 702| 785| } 703| 5.55k| } else 704| 810| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 5.92k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 5.92k] ------------------ 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| 5.92k| } else { 715| 5.92k| IMMER_TRY { ------------------ | | 49| 5.92k|#define IMMER_TRY try ------------------ 716| 5.92k| auto count = new_idx + 1; 717| 5.92k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 5.92k| auto relaxed = new_node->relaxed(); 719| 5.92k| new_node->inner()[new_idx] = new_child; 720| 5.92k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 5.92k| relaxed->d.count = count; 722| 5.92k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 5.92k, False: 0] ------------------ 723| 5.92k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 5.92k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 5.92k| return new_node; 726| 5.92k| } 727| 5.92k| 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| 5.92k| } 737| 5.92k| } _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.08k| { 742| 1.08k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.08k, False: 0] ------------------ 743| 1.08k| auto node = pos.node(); 744| 1.08k| auto idx = pos.index(pos.size() - 1); 745| 1.08k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.08k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 1.08k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 1.08k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 1.08k] ------------------ 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.08k| } else { 754| 1.08k| auto new_parent = node_t::make_inner_e(e); 755| 1.08k| IMMER_TRY { ------------------ | | 49| 1.08k|#define IMMER_TRY try ------------------ 756| 1.08k| new_parent->inner()[new_idx] = 757| 1.08k| idx == new_idx ------------------ | Branch (757:21): [True: 553, False: 527] ------------------ 758| 1.08k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.08k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.08k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.08k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 1.08k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 1.08k| return new_parent; 765| 1.08k| } 766| 1.08k| 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.08k| } 771| 1.08k| } _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| 181k| { 742| 181k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 181k, False: 0] ------------------ 743| 181k| auto node = pos.node(); 744| 181k| auto idx = pos.index(pos.size() - 1); 745| 181k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 181k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 181k, Folded] | Branch (746:36): [True: 180k, False: 646] ------------------ 747| 181k| if (mutate) { ------------------ | Branch (747:13): [True: 180k, False: 646] ------------------ 748| 180k| node->inner()[new_idx] = 749| 180k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 172k, False: 8.63k] ------------------ 750| | /* otherwise */ 751| 180k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 180k| return node; 753| 180k| } else { 754| 646| auto new_parent = node_t::make_inner_e(e); 755| 646| IMMER_TRY { ------------------ | | 49| 646|#define IMMER_TRY try ------------------ 756| 646| new_parent->inner()[new_idx] = 757| 646| idx == new_idx ------------------ | Branch (757:21): [True: 314, False: 332] ------------------ 758| 646| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 646| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 646| node_t::do_copy_inner(new_parent, node, new_idx); 762| 646| if (Mutating) ------------------ | Branch (762:21): [True: 646, Folded] ------------------ 763| 646| pos.visit(dec_visitor{}); 764| 646| return new_parent; 765| 646| } 766| 646| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 646| } 771| 181k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_: 580| 2.26k|{ 581| 2.26k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 2.26k|} _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| 113k| { 596| 113k| auto offset = pos.index(idx); 597| 113k| auto count = pos.count(); 598| 113k| auto node = pos.node(); 599| 113k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 84.8k, False: 28.8k] ------------------ 600| 84.8k| return pos.towards_oh( 601| 84.8k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 84.8k| } else { 603| 28.8k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 28.8k| IMMER_TRY { ------------------ | | 49| 28.8k|#define IMMER_TRY try ------------------ 605| 28.8k| auto& res = pos.towards_oh( 606| 28.8k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 28.8k| pos.visit(dec_visitor{}); 608| 28.8k| *location = new_node; 609| 28.8k| return res; 610| 28.8k| } 611| 28.8k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 28.8k| } 616| 113k| } _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| 16.8k| { 653| 16.8k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 16.8k, False: 0] ------------------ 654| 16.8k| auto node = pos.node(); 655| 16.8k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 2.07k, False: 14.7k] ------------------ 656| 2.07k| return node->leaf()[pos.index(idx)]; 657| 14.7k| } else { 658| 14.7k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 14.7k| pos.visit(dec_visitor{}); 660| 14.7k| *location = new_node; 661| 14.7k| return new_node->leaf()[pos.index(idx)]; 662| 14.7k| } 663| 16.8k| } _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.81k| { 622| 4.81k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 4.81k, False: 0] ------------------ 623| 4.81k| auto offset = pos.index(idx); 624| 4.81k| auto count = pos.count(); 625| 4.81k| auto node = pos.node(); 626| 4.81k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 3.13k, False: 1.68k] ------------------ 627| 3.13k| return pos.towards_oh_ch( 628| 3.13k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 3.13k| } else { 630| 1.68k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.68k| IMMER_TRY { ------------------ | | 49| 1.68k|#define IMMER_TRY try ------------------ 632| 1.68k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.68k| idx, 634| 1.68k| offset, 635| 1.68k| count, 636| 1.68k| e, 637| 1.68k| &new_node->inner()[offset]); 638| 1.68k| pos.visit(dec_visitor{}); 639| 1.68k| *location = new_node; 640| 1.68k| return res; 641| 1.68k| } 642| 1.68k| 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.68k| } 647| 4.81k| } _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.84k| { 653| 2.84k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 2.84k, False: 0] ------------------ 654| 2.84k| auto node = pos.node(); 655| 2.84k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.26k, False: 1.57k] ------------------ 656| 1.26k| return node->leaf()[pos.index(idx)]; 657| 1.57k| } else { 658| 1.57k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 1.57k| pos.visit(dec_visitor{}); 660| 1.57k| *location = new_node; 661| 1.57k| return new_node->leaf()[pos.index(idx)]; 662| 1.57k| } 663| 2.84k| } _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.10k| { 622| 2.10k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.10k, False: 0] ------------------ 623| 2.10k| auto offset = pos.index(idx); 624| 2.10k| auto count = pos.count(); 625| 2.10k| auto node = pos.node(); 626| 2.10k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.11k, False: 994] ------------------ 627| 1.11k| return pos.towards_oh_ch( 628| 1.11k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.11k| } else { 630| 994| auto new_node = node_t::copy_inner_e(e, node, count); 631| 994| IMMER_TRY { ------------------ | | 49| 994|#define IMMER_TRY try ------------------ 632| 994| auto& res = pos.towards_oh_ch(this_t{}, 633| 994| idx, 634| 994| offset, 635| 994| count, 636| 994| e, 637| 994| &new_node->inner()[offset]); 638| 994| pos.visit(dec_visitor{}); 639| 994| *location = new_node; 640| 994| return res; 641| 994| } 642| 994| 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| 994| } 647| 2.10k| } _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.97k| { 653| 1.97k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 1.97k, False: 0] ------------------ 654| 1.97k| auto node = pos.node(); 655| 1.97k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.40k, False: 567] ------------------ 656| 1.40k| return node->leaf()[pos.index(idx)]; 657| 1.40k| } else { 658| 567| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 567| pos.visit(dec_visitor{}); 660| 567| *location = new_node; 661| 567| return new_node->leaf()[pos.index(idx)]; 662| 567| } 663| 1.97k| } _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.77k| { 622| 1.77k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 1.77k, False: 0] ------------------ 623| 1.77k| auto offset = pos.index(idx); 624| 1.77k| auto count = pos.count(); 625| 1.77k| auto node = pos.node(); 626| 1.77k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.34k, False: 437] ------------------ 627| 1.34k| return pos.towards_oh_ch( 628| 1.34k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.34k| } else { 630| 437| auto new_node = node_t::copy_inner_e(e, node, count); 631| 437| IMMER_TRY { ------------------ | | 49| 437|#define IMMER_TRY try ------------------ 632| 437| auto& res = pos.towards_oh_ch(this_t{}, 633| 437| idx, 634| 437| offset, 635| 437| count, 636| 437| e, 637| 437| &new_node->inner()[offset]); 638| 437| pos.visit(dec_visitor{}); 639| 437| *location = new_node; 640| 437| return res; 641| 437| } 642| 437| 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| 437| } 647| 1.77k| } _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| 33.7k| { 914| 33.7k| auto idx = pos.index(last); 915| 33.7k| auto node = pos.node(); 916| 33.7k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 33.7k, Folded] | Branch (916:35): [True: 25.6k, False: 8.10k] ------------------ 917| 33.7k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 33.7k, Folded] | Branch (917:25): [True: 21.3k, False: 12.4k] ------------------ 918| 21.3k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 17.8k, False: 3.53k] ------------------ 919| 21.3k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 21.3k| if (Mutating) ------------------ | Branch (920:17): [True: 21.3k, Folded] ------------------ 921| 21.3k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 21.3k| return res; 923| 21.3k| } 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.57k] ------------------ 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.02k, False: 3.41k] ------------------ 933| 9.02k| if (mutate) { ------------------ | Branch (933:25): [True: 5.87k, False: 3.15k] ------------------ 934| 5.87k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 5.87k| pos.each_right(dec_visitor{}, idx + 1); 936| 5.87k| node->inner()[idx] = next; 937| 5.87k| nodr->d.sizes[idx] = last + 1 - ts; 938| 5.87k| nodr->d.count = idx + 1; 939| 5.87k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 5.87k, False: 0] ------------------ 940| 5.87k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 5.87k| } else { 942| 3.15k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 3.15k| auto newr = newn->relaxed(); 944| 3.15k| newn->inner()[idx] = next; 945| 3.15k| newr->d.sizes[idx] = last + 1 - ts; 946| 3.15k| newr->d.count = idx + 1; 947| 3.15k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 3.15k, False: 0] ------------------ 948| 3.15k| if (Mutating) ------------------ | Branch (948:29): [True: 3.15k, Folded] ------------------ 949| 3.15k| pos.visit(dec_visitor{}); 950| 3.15k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 3.15k| } 952| 9.02k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 3.41k] ------------------ 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.41k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 3.41k, Folded] | Branch (956:40): [True: 2.60k, False: 814] | Branch (956:52): [True: 1.95k, False: 646] ------------------ 957| 1.95k| auto newn = pos.node()->inner()[0]; 958| 1.95k| if (!mutate) ------------------ | Branch (958:25): [True: 965, False: 991] ------------------ 959| 965| newn->inc(); 960| 1.95k| if (Mutating) ------------------ | Branch (960:25): [True: 1.95k, Folded] ------------------ 961| 1.95k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 1.95k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.95k| } else { 964| 1.46k| if (mutate) { ------------------ | Branch (964:25): [True: 1.00k, False: 456] ------------------ 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| 456| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 456| if (Mutating) ------------------ | Branch (970:29): [True: 456, Folded] ------------------ 971| 456| pos.visit(dec_visitor{}); 972| 456| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 456| } 974| 1.46k| } 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| 33.7k| } _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| 850| { 1060| 850| auto old_tail_size = pos.count(); 1061| 850| auto new_tail_size = pos.index(last) + 1; 1062| 850| auto node = pos.node(); 1063| 850| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 850, Folded] | Branch (1063:42): [True: 252, False: 598] ------------------ 1064| 850| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 207, False: 643] ------------------ 1065| 207| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 207] ------------------ 1066| 0| node->inc(); 1067| 207| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 643| } else if (mutate) { ------------------ | Branch (1068:20): [True: 244, False: 399] ------------------ 1069| 244| detail::destroy_n(node->leaf() + new_tail_size, 1070| 244| old_tail_size - new_tail_size); 1071| 244| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 399| } else { 1073| 399| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 399| if (Mutating) ------------------ | Branch (1074:17): [True: 399, Folded] ------------------ 1075| 399| pos.visit(dec_visitor{}); 1076| 399| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 399| } 1078| 850| } _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| 807| { 1060| 807| auto old_tail_size = pos.count(); 1061| 807| auto new_tail_size = pos.index(last) + 1; 1062| 807| auto node = pos.node(); 1063| 807| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 807] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 807| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 363, False: 444] ------------------ 1065| 363| if (!Mutating) ------------------ | Branch (1065:17): [True: 363, Folded] ------------------ 1066| 363| node->inc(); 1067| 363| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 444| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 444] ------------------ 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| 444| } else { 1073| 444| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 444| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 444] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 444| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 444| } 1078| 807| } _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| 10.2k| { 914| 10.2k| auto idx = pos.index(last); 915| 10.2k| auto node = pos.node(); 916| 10.2k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 10.2k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 10.2k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 10.2k, Folded] | Branch (917:25): [True: 8.73k, False: 1.52k] ------------------ 918| 8.73k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 8.73k] ------------------ 919| 8.73k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 8.73k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 8.73k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 8.73k| return res; 923| 8.73k| } else { 924| 1.52k| using std::get; 925| 1.52k| auto subs = 926| 1.52k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 1.52k] ------------------ 927| 1.52k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 1.52k| auto next = get<1>(subs); 929| 1.52k| auto ts = get<2>(subs); 930| 1.52k| auto tail = get<3>(subs); 931| 1.52k| IMMER_TRY { ------------------ | | 49| 1.52k|#define IMMER_TRY try ------------------ 932| 1.52k| if (next) { ------------------ | Branch (932:21): [True: 629, False: 897] ------------------ 933| 629| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 629] ------------------ 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| 629| } else { 942| 629| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 629| auto newr = newn->relaxed(); 944| 629| newn->inner()[idx] = next; 945| 629| newr->d.sizes[idx] = last + 1 - ts; 946| 629| newr->d.count = idx + 1; 947| 629| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 629, False: 0] ------------------ 948| 629| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 629] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 629| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 629| } 952| 897| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 897] ------------------ 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| 897| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 897, Folded] | Branch (956:40): [True: 566, False: 331] | Branch (956:52): [True: 273, False: 293] ------------------ 957| 273| auto newn = pos.node()->inner()[0]; 958| 273| if (!mutate) ------------------ | Branch (958:25): [True: 273, False: 0] ------------------ 959| 273| newn->inc(); 960| 273| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 273] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 273| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 624| } else { 964| 624| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 624] ------------------ 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| 624| } else { 969| 624| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 624| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 624] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 624| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 624| } 974| 624| } 975| 1.52k| } 976| 1.52k| 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.52k| } 987| 10.2k| } _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.20k| { 992| 1.20k| auto idx = pos.index(last); 993| 1.20k| auto node = pos.node(); 994| 1.20k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.20k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.20k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.20k, Folded] | Branch (995:25): [True: 290, False: 914] ------------------ 996| 290| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 290] ------------------ 997| 290| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 290| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 290] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 290| return res; 1001| 914| } else { 1002| 914| using std::get; 1003| 914| auto subs = 1004| 914| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 914] ------------------ 1005| 914| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 914| auto next = get<1>(subs); 1007| 914| auto ts = get<2>(subs); 1008| 914| auto tail = get<3>(subs); 1009| 914| IMMER_TRY { ------------------ | | 49| 914|#define IMMER_TRY try ------------------ 1010| 914| if (next) { ------------------ | Branch (1010:21): [True: 263, False: 651] ------------------ 1011| 263| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 263] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 263| } else { 1016| 263| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 263| newn->inner()[idx] = next; 1018| 263| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 263] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 263| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 263| } 1022| 651| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 651] ------------------ 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| 651| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 651, Folded] | Branch (1026:40): [True: 399, False: 252] | Branch (1026:52): [True: 196, False: 203] ------------------ 1027| 196| auto newn = pos.node()->inner()[0]; 1028| 196| if (!mutate) ------------------ | Branch (1028:25): [True: 196, False: 0] ------------------ 1029| 196| newn->inc(); 1030| 196| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 196] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 196| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 455| } else { 1034| 455| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 455] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 455| } else { 1038| 455| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 455| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 455] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 455| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 455| } 1043| 455| } 1044| 914| } 1045| 914| 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| 914| } 1055| 1.20k| } _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.87k| { 1060| 1.87k| auto old_tail_size = pos.count(); 1061| 1.87k| auto new_tail_size = pos.index(last) + 1; 1062| 1.87k| auto node = pos.node(); 1063| 1.87k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.87k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.87k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.19k, False: 682] ------------------ 1065| 1.19k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.19k, Folded] ------------------ 1066| 1.19k| node->inc(); 1067| 1.19k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.19k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 682] ------------------ 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| 682| } else { 1073| 682| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 682| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 682] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 682| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 682| } 1078| 1.87k| } _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.80k| { 992| 1.80k| auto idx = pos.index(last); 993| 1.80k| auto node = pos.node(); 994| 1.80k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.80k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.80k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.80k, Folded] | Branch (995:25): [True: 600, False: 1.20k] ------------------ 996| 600| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 600] ------------------ 997| 600| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 600| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 600] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 600| return res; 1001| 1.20k| } else { 1002| 1.20k| using std::get; 1003| 1.20k| auto subs = 1004| 1.20k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.20k] ------------------ 1005| 1.20k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.20k| auto next = get<1>(subs); 1007| 1.20k| auto ts = get<2>(subs); 1008| 1.20k| auto tail = get<3>(subs); 1009| 1.20k| IMMER_TRY { ------------------ | | 49| 1.20k|#define IMMER_TRY try ------------------ 1010| 1.20k| if (next) { ------------------ | Branch (1010:21): [True: 268, False: 935] ------------------ 1011| 268| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 268] ------------------ 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| 268| } else { 1016| 268| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 268| newn->inner()[idx] = next; 1018| 268| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 268] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 268| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 268| } 1022| 935| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 935] ------------------ 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| 935| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 935, Folded] | Branch (1026:40): [True: 429, False: 506] | Branch (1026:52): [True: 228, False: 201] ------------------ 1027| 228| auto newn = pos.node()->inner()[0]; 1028| 228| if (!mutate) ------------------ | Branch (1028:25): [True: 228, False: 0] ------------------ 1029| 228| newn->inc(); 1030| 228| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 228] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 228| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 707| } else { 1034| 707| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 707] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 707| } else { 1038| 707| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 707| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 707] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 707| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 707| } 1043| 707| } 1044| 1.20k| } 1045| 1.20k| 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.20k| } 1055| 1.80k| } _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.39k| { 1060| 3.39k| auto old_tail_size = pos.count(); 1061| 3.39k| auto new_tail_size = pos.index(last) + 1; 1062| 3.39k| auto node = pos.node(); 1063| 3.39k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 3.39k, Folded] | Branch (1063:42): [True: 319, False: 3.07k] ------------------ 1064| 3.39k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.66k, False: 1.72k] ------------------ 1065| 1.66k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.66k] ------------------ 1066| 0| node->inc(); 1067| 1.66k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.72k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 315, False: 1.41k] ------------------ 1069| 315| detail::destroy_n(node->leaf() + new_tail_size, 1070| 315| old_tail_size - new_tail_size); 1071| 315| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.41k| } else { 1073| 1.41k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.41k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.41k, Folded] ------------------ 1075| 1.41k| pos.visit(dec_visitor{}); 1076| 1.41k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.41k| } 1078| 3.39k| } _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.80k| { 992| 3.80k| auto idx = pos.index(last); 993| 3.80k| auto node = pos.node(); 994| 3.80k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.80k, Folded] | Branch (994:35): [True: 1.61k, False: 2.19k] ------------------ 995| 3.80k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.80k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.80k| } else { 1002| 3.80k| using std::get; 1003| 3.80k| auto subs = 1004| 3.80k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 1.61k, False: 2.19k] ------------------ 1005| 3.80k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.80k| auto next = get<1>(subs); 1007| 3.80k| auto ts = get<2>(subs); 1008| 3.80k| auto tail = get<3>(subs); 1009| 3.80k| IMMER_TRY { ------------------ | | 49| 3.80k|#define IMMER_TRY try ------------------ 1010| 3.80k| if (next) { ------------------ | Branch (1010:21): [True: 1.02k, False: 2.78k] ------------------ 1011| 1.02k| if (mutate) { ------------------ | Branch (1011:25): [True: 489, False: 533] ------------------ 1012| 489| node->inner()[idx] = next; 1013| 489| pos.each_right(dec_visitor{}, idx + 1); 1014| 489| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 533| } else { 1016| 533| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 533| newn->inner()[idx] = next; 1018| 533| if (Mutating) ------------------ | Branch (1018:29): [True: 533, Folded] ------------------ 1019| 533| pos.visit(dec_visitor{}); 1020| 533| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 533| } 1022| 2.78k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 970, False: 1.81k] ------------------ 1023| 970| if (Mutating) ------------------ | Branch (1023:25): [True: 970, Folded] ------------------ 1024| 970| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 970| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.81k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.81k] | 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.81k| } else { 1034| 1.81k| if (mutate) { ------------------ | Branch (1034:25): [True: 401, False: 1.41k] ------------------ 1035| 401| pos.each_right(dec_visitor{}, idx + 1); 1036| 401| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.41k| } else { 1038| 1.41k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.41k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.41k, Folded] ------------------ 1040| 1.41k| pos.visit(dec_visitor{}); 1041| 1.41k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.41k| } 1043| 1.81k| } 1044| 3.80k| } 1045| 3.80k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.80k| } 1055| 3.80k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 3.61k| { 879| 3.61k| using node_t = node_type; 880| 3.61k| auto node = p.node(); 881| 3.61k| if (node->dec()) { ------------------ | Branch (881:13): [True: 2.22k, False: 1.39k] ------------------ 882| 2.22k| p.each_right(dec_t{}, idx); 883| 2.22k| node_t::delete_inner(node, p.count()); 884| 2.22k| } 885| 3.61k| } _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.0k| { 1060| 10.0k| auto old_tail_size = pos.count(); 1061| 10.0k| auto new_tail_size = pos.index(last) + 1; 1062| 10.0k| auto node = pos.node(); 1063| 10.0k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 10.0k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 10.0k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 4.34k, False: 5.74k] ------------------ 1065| 4.34k| if (!Mutating) ------------------ | Branch (1065:17): [True: 4.34k, Folded] ------------------ 1066| 4.34k| node->inc(); 1067| 4.34k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 5.74k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 5.74k] ------------------ 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.74k| } else { 1073| 5.74k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 5.74k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 5.74k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 5.74k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 5.74k| } 1078| 10.0k| } _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.06k| { 992| 5.06k| auto idx = pos.index(last); 993| 5.06k| auto node = pos.node(); 994| 5.06k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 5.06k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 5.06k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 5.06k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 5.06k| } else { 1002| 5.06k| using std::get; 1003| 5.06k| auto subs = 1004| 5.06k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 5.06k] ------------------ 1005| 5.06k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.06k| auto next = get<1>(subs); 1007| 5.06k| auto ts = get<2>(subs); 1008| 5.06k| auto tail = get<3>(subs); 1009| 5.06k| IMMER_TRY { ------------------ | | 49| 5.06k|#define IMMER_TRY try ------------------ 1010| 5.06k| if (next) { ------------------ | Branch (1010:21): [True: 719, False: 4.34k] ------------------ 1011| 719| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 719] ------------------ 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| 719| } else { 1016| 719| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 719| newn->inner()[idx] = next; 1018| 719| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 719] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 719| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 719| } 1022| 4.34k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 959, False: 3.38k] ------------------ 1023| 959| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 959] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 959| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.38k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 3.38k] | 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.38k| } else { 1034| 3.38k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 3.38k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 3.38k| } else { 1038| 3.38k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 3.38k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 3.38k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 3.38k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 3.38k| } 1043| 3.38k| } 1044| 5.06k| } 1045| 5.06k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 5.06k| } 1055| 5.06k| } _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| 406| { 1060| 406| auto old_tail_size = pos.count(); 1061| 406| auto new_tail_size = pos.index(last) + 1; 1062| 406| auto node = pos.node(); 1063| 406| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 406] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 406| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 194, False: 212] ------------------ 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| 212| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 212] ------------------ 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| 212| } else { 1073| 212| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 212| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 212] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 212| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 212| } 1078| 406| } _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.64k| { 1060| 1.64k| auto old_tail_size = pos.count(); 1061| 1.64k| auto new_tail_size = pos.index(last) + 1; 1062| 1.64k| auto node = pos.node(); 1063| 1.64k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.64k, Folded] | Branch (1063:42): [True: 201, False: 1.44k] ------------------ 1064| 1.64k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 626, False: 1.01k] ------------------ 1065| 626| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 626] ------------------ 1066| 0| node->inc(); 1067| 626| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.01k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 201, False: 818] ------------------ 1069| 201| detail::destroy_n(node->leaf() + new_tail_size, 1070| 201| old_tail_size - new_tail_size); 1071| 201| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 818| } else { 1073| 818| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 818| if (Mutating) ------------------ | Branch (1074:17): [True: 818, Folded] ------------------ 1075| 818| pos.visit(dec_visitor{}); 1076| 818| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 818| } 1078| 1.64k| } _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.66k| { 992| 3.66k| auto idx = pos.index(last); 993| 3.66k| auto node = pos.node(); 994| 3.66k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.66k, Folded] | Branch (994:35): [True: 2.74k, False: 920] ------------------ 995| 3.66k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.66k] | 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.66k| } else { 1002| 3.66k| using std::get; 1003| 3.66k| auto subs = 1004| 3.66k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.74k, False: 920] ------------------ 1005| 3.66k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.66k| auto next = get<1>(subs); 1007| 3.66k| auto ts = get<2>(subs); 1008| 3.66k| auto tail = get<3>(subs); 1009| 3.66k| IMMER_TRY { ------------------ | | 49| 3.66k|#define IMMER_TRY try ------------------ 1010| 3.66k| if (next) { ------------------ | Branch (1010:21): [True: 1.53k, False: 2.13k] ------------------ 1011| 1.53k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.07k, False: 462] ------------------ 1012| 1.07k| node->inner()[idx] = next; 1013| 1.07k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.07k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.07k| } else { 1016| 462| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 462| newn->inner()[idx] = next; 1018| 462| if (Mutating) ------------------ | Branch (1018:29): [True: 462, Folded] ------------------ 1019| 462| pos.visit(dec_visitor{}); 1020| 462| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 462| } 1022| 2.13k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.37k, False: 761] ------------------ 1023| 1.37k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.37k, Folded] ------------------ 1024| 1.37k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.37k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.37k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 761] | 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| 761| } else { 1034| 761| if (mutate) { ------------------ | Branch (1034:25): [True: 510, False: 251] ------------------ 1035| 510| pos.each_right(dec_visitor{}, idx + 1); 1036| 510| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 510| } else { 1038| 251| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 251| if (Mutating) ------------------ | Branch (1039:29): [True: 251, Folded] ------------------ 1040| 251| pos.visit(dec_visitor{}); 1041| 251| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 251| } 1043| 761| } 1044| 3.66k| } 1045| 3.66k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.66k| } 1055| 3.66k| } _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.37k| { 879| 1.37k| using node_t = node_type; 880| 1.37k| auto node = p.node(); 881| 1.37k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.16k, False: 207] ------------------ 882| 1.16k| p.each_right(dec_t{}, idx); 883| 1.16k| node_t::delete_inner(node, p.count()); 884| 1.16k| } 885| 1.37k| } _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.20k| { 1060| 2.20k| auto old_tail_size = pos.count(); 1061| 2.20k| auto new_tail_size = pos.index(last) + 1; 1062| 2.20k| auto node = pos.node(); 1063| 2.20k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.20k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.20k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 361, False: 1.84k] ------------------ 1065| 361| if (!Mutating) ------------------ | Branch (1065:17): [True: 361, Folded] ------------------ 1066| 361| node->inc(); 1067| 361| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.84k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 1.84k] ------------------ 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.84k| } else { 1073| 1.84k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.84k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 1.84k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 1.84k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.84k| } 1078| 2.20k| } _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.39k| { 992| 3.39k| auto idx = pos.index(last); 993| 3.39k| auto node = pos.node(); 994| 3.39k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.39k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.39k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.39k] | 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.39k| } else { 1002| 3.39k| using std::get; 1003| 3.39k| auto subs = 1004| 3.39k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.39k] ------------------ 1005| 3.39k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.39k| auto next = get<1>(subs); 1007| 3.39k| auto ts = get<2>(subs); 1008| 3.39k| auto tail = get<3>(subs); 1009| 3.39k| IMMER_TRY { ------------------ | | 49| 3.39k|#define IMMER_TRY try ------------------ 1010| 3.39k| if (next) { ------------------ | Branch (1010:21): [True: 752, False: 2.64k] ------------------ 1011| 752| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 752] ------------------ 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| 752| } else { 1016| 752| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 752| newn->inner()[idx] = next; 1018| 752| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 752] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 752| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 752| } 1022| 2.64k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 977, False: 1.66k] ------------------ 1023| 977| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 977] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 977| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.66k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.66k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 0] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.66k| } else { 1034| 1.66k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.66k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.66k| } else { 1038| 1.66k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.66k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.66k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.66k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.66k| } 1043| 1.66k| } 1044| 3.39k| } 1045| 3.39k| 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.39k| } 1055| 3.39k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 867| 23.8k| { 868| 23.8k| using node_t = node_type; 869| 23.8k| auto node = p.node(); 870| 23.8k| if (node->dec()) { ------------------ | Branch (870:13): [True: 19.0k, False: 4.76k] ------------------ 871| 19.0k| p.each_right(dec_t{}, idx); 872| 19.0k| node_t::delete_inner_r(node, p.count()); 873| 19.0k| } 874| 23.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.90k| { 1060| 1.90k| auto old_tail_size = pos.count(); 1061| 1.90k| auto new_tail_size = pos.index(last) + 1; 1062| 1.90k| auto node = pos.node(); 1063| 1.90k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.90k, Folded] | Branch (1063:42): [True: 348, False: 1.55k] ------------------ 1064| 1.90k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 440, False: 1.46k] ------------------ 1065| 440| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 440] ------------------ 1066| 0| node->inc(); 1067| 440| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.46k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 313, False: 1.14k] ------------------ 1069| 313| detail::destroy_n(node->leaf() + new_tail_size, 1070| 313| old_tail_size - new_tail_size); 1071| 313| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.14k| } else { 1073| 1.14k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.14k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.14k, Folded] ------------------ 1075| 1.14k| pos.visit(dec_visitor{}); 1076| 1.14k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.14k| } 1078| 1.90k| } _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.74k| { 914| 2.74k| auto idx = pos.index(last); 915| 2.74k| auto node = pos.node(); 916| 2.74k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 2.74k, Folded] | Branch (916:35): [True: 1.47k, False: 1.26k] ------------------ 917| 2.74k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 2.74k] | 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.74k| } else { 924| 2.74k| using std::get; 925| 2.74k| auto subs = 926| 2.74k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 1.47k, False: 1.26k] ------------------ 927| 2.74k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 2.74k| auto next = get<1>(subs); 929| 2.74k| auto ts = get<2>(subs); 930| 2.74k| auto tail = get<3>(subs); 931| 2.74k| IMMER_TRY { ------------------ | | 49| 2.74k|#define IMMER_TRY try ------------------ 932| 2.74k| if (next) { ------------------ | Branch (932:21): [True: 836, False: 1.90k] ------------------ 933| 836| if (mutate) { ------------------ | Branch (933:25): [True: 365, False: 471] ------------------ 934| 365| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 365| pos.each_right(dec_visitor{}, idx + 1); 936| 365| node->inner()[idx] = next; 937| 365| nodr->d.sizes[idx] = last + 1 - ts; 938| 365| nodr->d.count = idx + 1; 939| 365| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 365, False: 0] ------------------ 940| 365| return std::make_tuple(pos.shift(), node, ts, tail); 941| 471| } else { 942| 471| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 471| auto newr = newn->relaxed(); 944| 471| newn->inner()[idx] = next; 945| 471| newr->d.sizes[idx] = last + 1 - ts; 946| 471| newr->d.count = idx + 1; 947| 471| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 471, False: 0] ------------------ 948| 471| if (Mutating) ------------------ | Branch (948:29): [True: 471, Folded] ------------------ 949| 471| pos.visit(dec_visitor{}); 950| 471| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 471| } 952| 1.90k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 508, False: 1.40k] ------------------ 953| 508| if (Mutating) ------------------ | Branch (953:25): [True: 508, Folded] ------------------ 954| 508| pos.visit(dec_right_visitor{}, count_t{1}); 955| 508| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.40k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.40k] | 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.40k| } else { 964| 1.40k| if (mutate) { ------------------ | Branch (964:25): [True: 866, False: 534] ------------------ 965| 866| pos.each_right(dec_visitor{}, idx + 1); 966| 866| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 866| return std::make_tuple(pos.shift(), node, ts, tail); 968| 866| } else { 969| 534| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 534| if (Mutating) ------------------ | Branch (970:29): [True: 534, Folded] ------------------ 971| 534| pos.visit(dec_visitor{}); 972| 534| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 534| } 974| 1.40k| } 975| 2.74k| } 976| 2.74k| 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.74k| } 987| 2.74k| } _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.70k| { 992| 4.70k| auto idx = pos.index(last); 993| 4.70k| auto node = pos.node(); 994| 4.70k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.70k, Folded] | Branch (994:35): [True: 3.50k, False: 1.19k] ------------------ 995| 4.70k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.70k] | 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.70k| } else { 1002| 4.70k| using std::get; 1003| 4.70k| auto subs = 1004| 4.70k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.50k, False: 1.19k] ------------------ 1005| 4.70k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.70k| auto next = get<1>(subs); 1007| 4.70k| auto ts = get<2>(subs); 1008| 4.70k| auto tail = get<3>(subs); 1009| 4.70k| IMMER_TRY { ------------------ | | 49| 4.70k|#define IMMER_TRY try ------------------ 1010| 4.70k| if (next) { ------------------ | Branch (1010:21): [True: 3.32k, False: 1.37k] ------------------ 1011| 3.32k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.72k, False: 600] ------------------ 1012| 2.72k| node->inner()[idx] = next; 1013| 2.72k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.72k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.72k| } else { 1016| 600| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 600| newn->inner()[idx] = next; 1018| 600| if (Mutating) ------------------ | Branch (1018:29): [True: 600, Folded] ------------------ 1019| 600| pos.visit(dec_visitor{}); 1020| 600| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 600| } 1022| 3.32k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 698, False: 680] ------------------ 1023| 698| if (Mutating) ------------------ | Branch (1023:25): [True: 698, Folded] ------------------ 1024| 698| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 698| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 698| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 680] | 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| 680| } else { 1034| 680| if (mutate) { ------------------ | Branch (1034:25): [True: 358, False: 322] ------------------ 1035| 358| pos.each_right(dec_visitor{}, idx + 1); 1036| 358| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 358| } else { 1038| 322| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 322| if (Mutating) ------------------ | Branch (1039:29): [True: 322, Folded] ------------------ 1040| 322| pos.visit(dec_visitor{}); 1041| 322| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 322| } 1043| 680| } 1044| 4.70k| } 1045| 4.70k| 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.70k| } 1055| 4.70k| } _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.6k| { 879| 10.6k| using node_t = node_type; 880| 10.6k| auto node = p.node(); 881| 10.6k| if (node->dec()) { ------------------ | Branch (881:13): [True: 7.53k, False: 3.12k] ------------------ 882| 7.53k| p.each_right(dec_t{}, idx); 883| 7.53k| node_t::delete_inner(node, p.count()); 884| 7.53k| } 885| 10.6k| } _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.18k| { 1060| 4.18k| auto old_tail_size = pos.count(); 1061| 4.18k| auto new_tail_size = pos.index(last) + 1; 1062| 4.18k| auto node = pos.node(); 1063| 4.18k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 4.18k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 4.18k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 720, False: 3.46k] ------------------ 1065| 720| if (!Mutating) ------------------ | Branch (1065:17): [True: 720, Folded] ------------------ 1066| 720| node->inc(); 1067| 720| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 3.46k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 3.46k] ------------------ 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.46k| } else { 1073| 3.46k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 3.46k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 3.46k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 3.46k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 3.46k| } 1078| 4.18k| } _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.35k| { 914| 3.35k| auto idx = pos.index(last); 915| 3.35k| auto node = pos.node(); 916| 3.35k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 3.35k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 3.35k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 3.35k] | 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.35k| } else { 924| 3.35k| using std::get; 925| 3.35k| auto subs = 926| 3.35k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 3.35k] ------------------ 927| 3.35k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 3.35k| auto next = get<1>(subs); 929| 3.35k| auto ts = get<2>(subs); 930| 3.35k| auto tail = get<3>(subs); 931| 3.35k| IMMER_TRY { ------------------ | | 49| 3.35k|#define IMMER_TRY try ------------------ 932| 3.35k| if (next) { ------------------ | Branch (932:21): [True: 685, False: 2.67k] ------------------ 933| 685| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 685] ------------------ 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| 685| } else { 942| 685| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 685| auto newr = newn->relaxed(); 944| 685| newn->inner()[idx] = next; 945| 685| newr->d.sizes[idx] = last + 1 - ts; 946| 685| newr->d.count = idx + 1; 947| 685| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 685, False: 0] ------------------ 948| 685| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 685] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 685| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 685| } 952| 2.67k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 856, False: 1.81k] ------------------ 953| 856| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 856] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 856| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.81k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.81k] | Branch (956:40): [True: 0, False: 0] | Branch (956:52): [True: 0, False: 0] ------------------ 957| 0| auto newn = pos.node()->inner()[0]; 958| 0| if (!mutate) ------------------ | Branch (958:25): [True: 0, False: 0] ------------------ 959| 0| newn->inc(); 960| 0| if (Mutating) ------------------ | Branch (960:25): [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| 1.81k| } else { 964| 1.81k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 1.81k] ------------------ 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| 1.81k| } else { 969| 1.81k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 1.81k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 1.81k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 1.81k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 1.81k| } 974| 1.81k| } 975| 3.35k| } 976| 3.35k| 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.35k| } 987| 3.35k| } _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.18k| { 992| 3.18k| auto idx = pos.index(last); 993| 3.18k| auto node = pos.node(); 994| 3.18k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.18k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.18k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.18k] | 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.18k| } else { 1002| 3.18k| using std::get; 1003| 3.18k| auto subs = 1004| 3.18k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.18k] ------------------ 1005| 3.18k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.18k| auto next = get<1>(subs); 1007| 3.18k| auto ts = get<2>(subs); 1008| 3.18k| auto tail = get<3>(subs); 1009| 3.18k| IMMER_TRY { ------------------ | | 49| 3.18k|#define IMMER_TRY try ------------------ 1010| 3.18k| if (next) { ------------------ | Branch (1010:21): [True: 2.03k, False: 1.14k] ------------------ 1011| 2.03k| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 2.03k] ------------------ 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.03k| } else { 1016| 2.03k| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 2.03k| newn->inner()[idx] = next; 1018| 2.03k| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 2.03k] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 2.03k| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 2.03k| } 1022| 2.03k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 750, False: 397] ------------------ 1023| 750| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 750] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 750| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 750| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 397] | 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| 397| } else { 1034| 397| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 397] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 397| } else { 1038| 397| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 397| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 397] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 397| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 397| } 1043| 397| } 1044| 3.18k| } 1045| 3.18k| 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.18k| } 1055| 3.18k| } _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| 13.1k| { 992| 13.1k| auto idx = pos.index(last); 993| 13.1k| auto node = pos.node(); 994| 13.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 13.1k, Folded] | Branch (994:35): [True: 9.06k, False: 4.06k] ------------------ 995| 13.1k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 13.1k, Folded] | Branch (995:25): [True: 7.65k, False: 5.47k] ------------------ 996| 7.65k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 5.34k, False: 2.31k] ------------------ 997| 7.65k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 7.65k| if (Mutating) ------------------ | Branch (998:17): [True: 7.65k, Folded] ------------------ 999| 7.65k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 7.65k| return res; 1001| 7.65k| } else { 1002| 5.47k| using std::get; 1003| 5.47k| auto subs = 1004| 5.47k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.72k, False: 1.75k] ------------------ 1005| 5.47k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.47k| auto next = get<1>(subs); 1007| 5.47k| auto ts = get<2>(subs); 1008| 5.47k| auto tail = get<3>(subs); 1009| 5.47k| IMMER_TRY { ------------------ | | 49| 5.47k|#define IMMER_TRY try ------------------ 1010| 5.47k| if (next) { ------------------ | Branch (1010:21): [True: 1.27k, False: 4.20k] ------------------ 1011| 1.27k| if (mutate) { ------------------ | Branch (1011:25): [True: 650, False: 622] ------------------ 1012| 650| node->inner()[idx] = next; 1013| 650| pos.each_right(dec_visitor{}, idx + 1); 1014| 650| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 650| } else { 1016| 622| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 622| newn->inner()[idx] = next; 1018| 622| if (Mutating) ------------------ | Branch (1018:29): [True: 622, Folded] ------------------ 1019| 622| pos.visit(dec_visitor{}); 1020| 622| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 622| } 1022| 4.20k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 4.20k] ------------------ 1023| 0| if (Mutating) ------------------ | Branch (1023:25): [True: 0, Folded] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 4.20k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 4.20k, Folded] | Branch (1026:40): [True: 3.64k, False: 558] | Branch (1026:52): [True: 2.29k, False: 1.34k] ------------------ 1027| 2.29k| auto newn = pos.node()->inner()[0]; 1028| 2.29k| if (!mutate) ------------------ | Branch (1028:25): [True: 534, False: 1.76k] ------------------ 1029| 534| newn->inc(); 1030| 2.29k| if (Mutating) ------------------ | Branch (1030:25): [True: 2.29k, Folded] ------------------ 1031| 2.29k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 2.29k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 2.29k| } else { 1034| 1.90k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.30k, False: 594] ------------------ 1035| 1.30k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.30k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.30k| } else { 1038| 594| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 594| if (Mutating) ------------------ | Branch (1039:29): [True: 594, Folded] ------------------ 1040| 594| pos.visit(dec_visitor{}); 1041| 594| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 594| } 1043| 1.90k| } 1044| 5.47k| } 1045| 5.47k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 5.47k| } 1055| 13.1k| } _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.82k| { 1060| 1.82k| auto old_tail_size = pos.count(); 1061| 1.82k| auto new_tail_size = pos.index(last) + 1; 1062| 1.82k| auto node = pos.node(); 1063| 1.82k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.82k, Folded] | Branch (1063:42): [True: 689, False: 1.13k] ------------------ 1064| 1.82k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 266, False: 1.56k] ------------------ 1065| 266| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 266] ------------------ 1066| 0| node->inc(); 1067| 266| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.56k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 689, False: 873] ------------------ 1069| 689| detail::destroy_n(node->leaf() + new_tail_size, 1070| 689| old_tail_size - new_tail_size); 1071| 689| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 873| } else { 1073| 873| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 873| if (Mutating) ------------------ | Branch (1074:17): [True: 873, Folded] ------------------ 1075| 873| pos.visit(dec_visitor{}); 1076| 873| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 873| } 1078| 1.82k| } _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.97k| { 992| 3.97k| auto idx = pos.index(last); 993| 3.97k| auto node = pos.node(); 994| 3.97k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.97k, Folded] | Branch (994:35): [True: 2.15k, False: 1.81k] ------------------ 995| 3.97k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.97k, Folded] | Branch (995:25): [True: 2.11k, False: 1.85k] ------------------ 996| 2.11k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 1.23k, False: 880] ------------------ 997| 2.11k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 2.11k| if (Mutating) ------------------ | Branch (998:17): [True: 2.11k, Folded] ------------------ 999| 2.11k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 2.11k| return res; 1001| 2.11k| } else { 1002| 1.85k| using std::get; 1003| 1.85k| auto subs = 1004| 1.85k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 920, False: 935] ------------------ 1005| 1.85k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.85k| auto next = get<1>(subs); 1007| 1.85k| auto ts = get<2>(subs); 1008| 1.85k| auto tail = get<3>(subs); 1009| 1.85k| IMMER_TRY { ------------------ | | 49| 1.85k|#define IMMER_TRY try ------------------ 1010| 1.85k| if (next) { ------------------ | Branch (1010:21): [True: 470, False: 1.38k] ------------------ 1011| 470| if (mutate) { ------------------ | Branch (1011:25): [True: 198, False: 272] ------------------ 1012| 198| node->inner()[idx] = next; 1013| 198| pos.each_right(dec_visitor{}, idx + 1); 1014| 198| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 272| } else { 1016| 272| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 272| newn->inner()[idx] = next; 1018| 272| if (Mutating) ------------------ | Branch (1018:29): [True: 272, Folded] ------------------ 1019| 272| pos.visit(dec_visitor{}); 1020| 272| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 272| } 1022| 1.38k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.38k] ------------------ 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.38k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.38k, Folded] | Branch (1026:40): [True: 750, False: 635] | Branch (1026:52): [True: 529, False: 221] ------------------ 1027| 529| auto newn = pos.node()->inner()[0]; 1028| 529| if (!mutate) ------------------ | Branch (1028:25): [True: 267, False: 262] ------------------ 1029| 267| newn->inc(); 1030| 529| if (Mutating) ------------------ | Branch (1030:25): [True: 529, Folded] ------------------ 1031| 529| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 529| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 856| } else { 1034| 856| if (mutate) { ------------------ | Branch (1034:25): [True: 460, False: 396] ------------------ 1035| 460| pos.each_right(dec_visitor{}, idx + 1); 1036| 460| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 460| } else { 1038| 396| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 396| if (Mutating) ------------------ | Branch (1039:29): [True: 396, Folded] ------------------ 1040| 396| pos.visit(dec_visitor{}); 1041| 396| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 396| } 1043| 856| } 1044| 1.85k| } 1045| 1.85k| 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.85k| } 1055| 3.97k| } _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| 777| { 1060| 777| auto old_tail_size = pos.count(); 1061| 777| auto new_tail_size = pos.index(last) + 1; 1062| 777| auto node = pos.node(); 1063| 777| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 777, Folded] | Branch (1063:42): [True: 228, False: 549] ------------------ 1064| 777| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 200, False: 577] ------------------ 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| 577| } else if (mutate) { ------------------ | Branch (1068:20): [True: 227, False: 350] ------------------ 1069| 227| detail::destroy_n(node->leaf() + new_tail_size, 1070| 227| old_tail_size - new_tail_size); 1071| 227| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 350| } else { 1073| 350| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 350| if (Mutating) ------------------ | Branch (1074:17): [True: 350, Folded] ------------------ 1075| 350| pos.visit(dec_visitor{}); 1076| 350| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 350| } 1078| 777| } _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| 913| { 1378| 913| auto node = pos.node(); 1379| 913| auto idx = pos.index(first); 1380| 913| auto count = pos.count(); 1381| 913| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 913| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 622, False: 291] ------------------ 1384| 913| if (mutate) { ------------------ | Branch (1384:13): [True: 622, False: 291] ------------------ 1385| 622| auto data = node->leaf(); 1386| 622| auto newcount = count - idx; 1387| 622| std::move(data + idx, data + count, data); 1388| 622| detail::destroy_n(data + newcount, idx); 1389| 622| return std::make_tuple(0, node); 1390| 622| } else { 1391| 291| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 291| if (Mutating) ------------------ | Branch (1392:17): [True: 291, Folded] ------------------ 1393| 291| pos.visit(dec_visitor{}); 1394| 291| return std::make_tuple(0, newn); 1395| 291| } 1396| 913| } _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| 54.3k| { 1247| 54.3k| auto idx = pos.subindex(first); 1248| 54.3k| auto count = pos.count(); 1249| 54.3k| auto node = pos.node(); 1250| 54.3k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 54.3k, Folded] | Branch (1250:47): [True: 46.7k, False: 7.58k] ------------------ 1251| 54.3k| auto left_size = pos.size_before(idx); 1252| 54.3k| auto child_size = pos.size_sbh(idx, left_size); 1253| 54.3k| auto dropped_size = first; 1254| 54.3k| auto child_dropped_size = dropped_size - left_size; 1255| 54.3k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 54.3k, Folded] | Branch (1255:25): [True: 52.0k, False: 2.28k] | Branch (1255:45): [True: 5.01k, False: 47.0k] ------------------ 1256| 5.01k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 2.06k, False: 2.95k] ------------------ 1257| 5.01k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 5.01k| if (mutate) ------------------ | Branch (1258:17): [True: 2.06k, False: 2.95k] ------------------ 1259| 2.06k| pos.visit(dec_left_visitor{}, idx); 1260| 2.95k| else if (Mutating) ------------------ | Branch (1260:22): [True: 2.95k, Folded] ------------------ 1261| 2.95k| pos.visit(dec_visitor{}); 1262| 5.01k| return r; 1263| 49.3k| } else { 1264| 49.3k| using std::get; 1265| 49.3k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 44.7k, False: 4.63k] ------------------ 1266| 49.3k| : node_t::make_inner_r_e(e); 1267| 49.3k| auto newr = newn->relaxed(); 1268| 49.3k| auto newcount = count - idx; 1269| 49.3k| auto new_child_size = child_size - child_dropped_size; 1270| 49.3k| IMMER_TRY { ------------------ | | 49| 49.3k|#define IMMER_TRY try ------------------ 1271| 49.3k| auto subs = 1272| 49.3k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 44.7k, False: 4.63k] ------------------ 1273| 49.3k| : pos.towards_sub_oh( 1274| 4.63k| no_collapse_no_mut_t{}, first, idx, e); 1275| 49.3k| if (mutate) ------------------ | Branch (1275:21): [True: 44.7k, False: 4.63k] ------------------ 1276| 44.7k| pos.each_left(dec_visitor{}, idx); 1277| 49.3k| pos.copy_sizes( 1278| 49.3k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 49.3k| std::copy(node->inner() + idx + 1, 1280| 49.3k| node->inner() + count, 1281| 49.3k| newn->inner() + 1); 1282| 49.3k| newn->inner()[0] = get<1>(subs); 1283| 49.3k| newr->d.sizes[0] = new_child_size; 1284| 49.3k| newr->d.count = newcount; 1285| 49.3k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 49.3k, False: 0] ------------------ 1286| 49.3k| if (!mutate) { ------------------ | Branch (1286:21): [True: 4.63k, False: 44.7k] ------------------ 1287| 4.63k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 4.63k| if (Mutating) ------------------ | Branch (1288:25): [True: 4.63k, Folded] ------------------ 1289| 4.63k| pos.visit(dec_visitor{}); 1290| 4.63k| } 1291| 49.3k| return std::make_tuple(pos.shift(), newn); 1292| 49.3k| } 1293| 49.3k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 49.3k| } 1299| 54.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.42k| { 1247| 2.42k| auto idx = pos.subindex(first); 1248| 2.42k| auto count = pos.count(); 1249| 2.42k| auto node = pos.node(); 1250| 2.42k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.42k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.42k| auto left_size = pos.size_before(idx); 1252| 2.42k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.42k| auto dropped_size = first; 1254| 2.42k| auto child_dropped_size = dropped_size - left_size; 1255| 2.42k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.42k, Folded] | Branch (1255:25): [True: 967, False: 1.45k] | Branch (1255:45): [True: 761, False: 206] ------------------ 1256| 761| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 761] ------------------ 1257| 761| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 761| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 761] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 761| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 761] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 761| return r; 1263| 1.66k| } else { 1264| 1.66k| using std::get; 1265| 1.66k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.66k] ------------------ 1266| 1.66k| : node_t::make_inner_r_e(e); 1267| 1.66k| auto newr = newn->relaxed(); 1268| 1.66k| auto newcount = count - idx; 1269| 1.66k| auto new_child_size = child_size - child_dropped_size; 1270| 1.66k| IMMER_TRY { ------------------ | | 49| 1.66k|#define IMMER_TRY try ------------------ 1271| 1.66k| auto subs = 1272| 1.66k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.66k] ------------------ 1273| 1.66k| : pos.towards_sub_oh( 1274| 1.66k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.66k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.66k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.66k| pos.copy_sizes( 1278| 1.66k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.66k| std::copy(node->inner() + idx + 1, 1280| 1.66k| node->inner() + count, 1281| 1.66k| newn->inner() + 1); 1282| 1.66k| newn->inner()[0] = get<1>(subs); 1283| 1.66k| newr->d.sizes[0] = new_child_size; 1284| 1.66k| newr->d.count = newcount; 1285| 1.66k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.66k, False: 0] ------------------ 1286| 1.66k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.66k, False: 0] ------------------ 1287| 1.66k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.66k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.66k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.66k| } 1291| 1.66k| return std::make_tuple(pos.shift(), newn); 1292| 1.66k| } 1293| 1.66k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 1.66k| } 1299| 2.42k| } _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.00k| { 1304| 2.00k| auto idx = pos.subindex(first); 1305| 2.00k| auto count = pos.count(); 1306| 2.00k| auto node = pos.node(); 1307| 2.00k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.00k] ------------------ 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.00k| auto left_size = pos.size_before(idx); 1313| 2.00k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.00k| auto dropped_size = first; 1315| 2.00k| auto child_dropped_size = dropped_size - left_size; 1316| 2.00k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.00k, Folded] | Branch (1316:25): [True: 728, False: 1.27k] | Branch (1316:45): [True: 493, False: 235] ------------------ 1317| 493| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 493] ------------------ 1318| 493| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 493| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 493] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 493| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 493] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 493| return r; 1324| 1.51k| } else { 1325| 1.51k| 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.51k| auto newcount = count - idx; 1330| 1.51k| auto newn = 1331| 1.51k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.51k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.51k| : node_t::make_inner_r_e(e); 1336| 1.51k| auto newr = newn->relaxed(); 1337| 1.51k| IMMER_TRY { ------------------ | | 49| 1.51k|#define IMMER_TRY try ------------------ 1338| 1.51k| auto subs = 1339| 1.51k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.51k] ------------------ 1340| 1.51k| : pos.towards_sub_oh( 1341| 1.51k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.51k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.51k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.51k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.51k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.51k, False: 0] ------------------ 1346| 1.51k| pos.copy_sizes( 1347| 1.51k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.51k| newr->d.count = newcount; 1349| 1.51k| newn->inner()[0] = get<1>(subs); 1350| 1.51k| std::copy(node->inner() + idx + 1, 1351| 1.51k| node->inner() + count, 1352| 1.51k| newn->inner() + 1); 1353| 1.51k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.51k, False: 0] ------------------ 1354| 1.51k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.51k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.51k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.51k| } 1358| 1.51k| return std::make_tuple(pos.shift(), newn); 1359| 1.51k| } 1360| 1.51k| 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.51k| } 1373| 2.00k| } _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| 628| { 1304| 628| auto idx = pos.subindex(first); 1305| 628| auto count = pos.count(); 1306| 628| auto node = pos.node(); 1307| 628| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 628] ------------------ 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| 628| auto left_size = pos.size_before(idx); 1313| 628| auto child_size = pos.size_sbh(idx, left_size); 1314| 628| auto dropped_size = first; 1315| 628| auto child_dropped_size = dropped_size - left_size; 1316| 628| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 628, Folded] | Branch (1316:25): [True: 199, False: 429] | 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| 628| } else { 1325| 628| 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| 628| auto newcount = count - idx; 1330| 628| auto newn = 1331| 628| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 628] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 628| : node_t::make_inner_r_e(e); 1336| 628| auto newr = newn->relaxed(); 1337| 628| IMMER_TRY { ------------------ | | 49| 628|#define IMMER_TRY try ------------------ 1338| 628| auto subs = 1339| 628| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 628] ------------------ 1340| 628| : pos.towards_sub_oh( 1341| 628| no_collapse_no_mut_t{}, first, idx, e); 1342| 628| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 628] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 628| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 628| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 628, False: 0] ------------------ 1346| 628| pos.copy_sizes( 1347| 628| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 628| newr->d.count = newcount; 1349| 628| newn->inner()[0] = get<1>(subs); 1350| 628| std::copy(node->inner() + idx + 1, 1351| 628| node->inner() + count, 1352| 628| newn->inner() + 1); 1353| 628| if (!mutate) { ------------------ | Branch (1353:21): [True: 628, False: 0] ------------------ 1354| 628| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 628| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 628] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 628| } 1358| 628| return std::make_tuple(pos.shift(), newn); 1359| 628| } 1360| 628| 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| 628| } 1373| 628| } _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| 7.74k| { 1378| 7.74k| auto node = pos.node(); 1379| 7.74k| auto idx = pos.index(first); 1380| 7.74k| auto count = pos.count(); 1381| 7.74k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 7.74k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 7.74k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 7.74k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 7.74k| } else { 1391| 7.74k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 7.74k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 7.74k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 7.74k| return std::make_tuple(0, newn); 1395| 7.74k| } 1396| 7.74k| } _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| 1.59k| { 1304| 1.59k| auto idx = pos.subindex(first); 1305| 1.59k| auto count = pos.count(); 1306| 1.59k| auto node = pos.node(); 1307| 1.59k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.59k] ------------------ 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| 1.59k| auto left_size = pos.size_before(idx); 1313| 1.59k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.59k| auto dropped_size = first; 1315| 1.59k| auto child_dropped_size = dropped_size - left_size; 1316| 1.59k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.59k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 1.59k| } else { 1325| 1.59k| 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.59k| auto newcount = count - idx; 1330| 1.59k| auto newn = 1331| 1.59k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.59k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.59k| : node_t::make_inner_r_e(e); 1336| 1.59k| auto newr = newn->relaxed(); 1337| 1.59k| IMMER_TRY { ------------------ | | 49| 1.59k|#define IMMER_TRY try ------------------ 1338| 1.59k| auto subs = 1339| 1.59k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.59k] ------------------ 1340| 1.59k| : pos.towards_sub_oh( 1341| 1.59k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.59k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.59k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.59k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.59k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.59k, False: 0] ------------------ 1346| 1.59k| pos.copy_sizes( 1347| 1.59k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.59k| newr->d.count = newcount; 1349| 1.59k| newn->inner()[0] = get<1>(subs); 1350| 1.59k| std::copy(node->inner() + idx + 1, 1351| 1.59k| node->inner() + count, 1352| 1.59k| newn->inner() + 1); 1353| 1.59k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.59k, False: 0] ------------------ 1354| 1.59k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.59k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.59k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.59k| } 1358| 1.59k| return std::make_tuple(pos.shift(), newn); 1359| 1.59k| } 1360| 1.59k| 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.59k| } 1373| 1.59k| } _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.60k| { 1378| 4.60k| auto node = pos.node(); 1379| 4.60k| auto idx = pos.index(first); 1380| 4.60k| auto count = pos.count(); 1381| 4.60k| 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.60k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 2.02k, False: 2.58k] ------------------ 1384| 4.60k| if (mutate) { ------------------ | Branch (1384:13): [True: 2.02k, False: 2.58k] ------------------ 1385| 2.02k| auto data = node->leaf(); 1386| 2.02k| auto newcount = count - idx; 1387| 2.02k| std::move(data + idx, data + count, data); 1388| 2.02k| detail::destroy_n(data + newcount, idx); 1389| 2.02k| return std::make_tuple(0, node); 1390| 2.58k| } else { 1391| 2.58k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.58k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.58k, Folded] ------------------ 1393| 2.58k| pos.visit(dec_visitor{}); 1394| 2.58k| return std::make_tuple(0, newn); 1395| 2.58k| } 1396| 4.60k| } _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| 1.55k| { 1304| 1.55k| auto idx = pos.subindex(first); 1305| 1.55k| auto count = pos.count(); 1306| 1.55k| auto node = pos.node(); 1307| 1.55k| 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| 1.55k| auto left_size = pos.size_before(idx); 1313| 1.55k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.55k| auto dropped_size = first; 1315| 1.55k| auto child_dropped_size = dropped_size - left_size; 1316| 1.55k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.55k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [True: 0, Folded] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 1.55k| } else { 1325| 1.55k| 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.55k| auto newcount = count - idx; 1330| 1.55k| auto newn = 1331| 1.55k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.55k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.55k| : node_t::make_inner_r_e(e); 1336| 1.55k| auto newr = newn->relaxed(); 1337| 1.55k| IMMER_TRY { ------------------ | | 49| 1.55k|#define IMMER_TRY try ------------------ 1338| 1.55k| auto subs = 1339| 1.55k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.55k] ------------------ 1340| 1.55k| : pos.towards_sub_oh( 1341| 1.55k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.55k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.55k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.55k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.55k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.55k, False: 0] ------------------ 1346| 1.55k| pos.copy_sizes( 1347| 1.55k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.55k| newr->d.count = newcount; 1349| 1.55k| newn->inner()[0] = get<1>(subs); 1350| 1.55k| std::copy(node->inner() + idx + 1, 1351| 1.55k| node->inner() + count, 1352| 1.55k| newn->inner() + 1); 1353| 1.55k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.55k, False: 0] ------------------ 1354| 1.55k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.55k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.55k, Folded] ------------------ 1356| 1.55k| pos.visit(dec_visitor{}); 1357| 1.55k| } 1358| 1.55k| return std::make_tuple(pos.shift(), newn); 1359| 1.55k| } 1360| 1.55k| 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.55k| } 1373| 1.55k| } _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| 42.4k| { 1378| 42.4k| auto node = pos.node(); 1379| 42.4k| auto idx = pos.index(first); 1380| 42.4k| auto count = pos.count(); 1381| 42.4k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 42.4k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 42.4k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 42.4k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 42.4k| } else { 1391| 42.4k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 42.4k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 42.4k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 42.4k| return std::make_tuple(0, newn); 1395| 42.4k| } 1396| 42.4k| } _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.39k| { 1304| 2.39k| auto idx = pos.subindex(first); 1305| 2.39k| auto count = pos.count(); 1306| 2.39k| auto node = pos.node(); 1307| 2.39k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.39k] ------------------ 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.39k| auto left_size = pos.size_before(idx); 1313| 2.39k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.39k| auto dropped_size = first; 1315| 2.39k| auto child_dropped_size = dropped_size - left_size; 1316| 2.39k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.39k] | 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.39k| } else { 1325| 2.39k| 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.39k| auto newcount = count - idx; 1330| 2.39k| auto newn = 1331| 2.39k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.39k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.39k| : node_t::make_inner_r_e(e); 1336| 2.39k| auto newr = newn->relaxed(); 1337| 2.39k| IMMER_TRY { ------------------ | | 49| 2.39k|#define IMMER_TRY try ------------------ 1338| 2.39k| auto subs = 1339| 2.39k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.39k] ------------------ 1340| 2.39k| : pos.towards_sub_oh( 1341| 2.39k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.39k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.39k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.39k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.39k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.39k, False: 0] ------------------ 1346| 2.39k| pos.copy_sizes( 1347| 2.39k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.39k| newr->d.count = newcount; 1349| 2.39k| newn->inner()[0] = get<1>(subs); 1350| 2.39k| std::copy(node->inner() + idx + 1, 1351| 2.39k| node->inner() + count, 1352| 2.39k| newn->inner() + 1); 1353| 2.39k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.39k, False: 0] ------------------ 1354| 2.39k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.39k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.39k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.39k| } 1358| 2.39k| return std::make_tuple(pos.shift(), newn); 1359| 2.39k| } 1360| 2.39k| 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.39k| } 1373| 2.39k| } _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.06k| { 1199| 2.06k| using node_t = node_type; 1200| 2.06k| auto node = p.node(); 1201| 2.06k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 2.06k, False: 0] ------------------ 1202| 2.06k| p.each_left(dec_t{}, idx); 1203| 2.06k| node_t::delete_inner_r(node, p.count()); 1204| 2.06k| } 1205| 2.06k| } _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| 176k| { 1247| 176k| auto idx = pos.subindex(first); 1248| 176k| auto count = pos.count(); 1249| 176k| auto node = pos.node(); 1250| 176k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 176k, Folded] | Branch (1250:47): [True: 137k, False: 38.5k] ------------------ 1251| 176k| auto left_size = pos.size_before(idx); 1252| 176k| auto child_size = pos.size_sbh(idx, left_size); 1253| 176k| auto dropped_size = first; 1254| 176k| auto child_dropped_size = dropped_size - left_size; 1255| 176k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 176k] | 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| 176k| } else { 1264| 176k| using std::get; 1265| 176k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 137k, False: 38.5k] ------------------ 1266| 176k| : node_t::make_inner_r_e(e); 1267| 176k| auto newr = newn->relaxed(); 1268| 176k| auto newcount = count - idx; 1269| 176k| auto new_child_size = child_size - child_dropped_size; 1270| 176k| IMMER_TRY { ------------------ | | 49| 176k|#define IMMER_TRY try ------------------ 1271| 176k| auto subs = 1272| 176k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 137k, False: 38.5k] ------------------ 1273| 176k| : pos.towards_sub_oh( 1274| 38.5k| no_collapse_no_mut_t{}, first, idx, e); 1275| 176k| if (mutate) ------------------ | Branch (1275:21): [True: 137k, False: 38.5k] ------------------ 1276| 137k| pos.each_left(dec_visitor{}, idx); 1277| 176k| pos.copy_sizes( 1278| 176k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 176k| std::copy(node->inner() + idx + 1, 1280| 176k| node->inner() + count, 1281| 176k| newn->inner() + 1); 1282| 176k| newn->inner()[0] = get<1>(subs); 1283| 176k| newr->d.sizes[0] = new_child_size; 1284| 176k| newr->d.count = newcount; 1285| 176k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 176k, False: 0] ------------------ 1286| 176k| if (!mutate) { ------------------ | Branch (1286:21): [True: 38.5k, False: 137k] ------------------ 1287| 38.5k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 38.5k| if (Mutating) ------------------ | Branch (1288:25): [True: 38.5k, Folded] ------------------ 1289| 38.5k| pos.visit(dec_visitor{}); 1290| 38.5k| } 1291| 176k| return std::make_tuple(pos.shift(), newn); 1292| 176k| } 1293| 176k| 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| 176k| } 1299| 176k| } _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| 46.8k| { 1247| 46.8k| auto idx = pos.subindex(first); 1248| 46.8k| auto count = pos.count(); 1249| 46.8k| auto node = pos.node(); 1250| 46.8k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 46.8k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 46.8k| auto left_size = pos.size_before(idx); 1252| 46.8k| auto child_size = pos.size_sbh(idx, left_size); 1253| 46.8k| auto dropped_size = first; 1254| 46.8k| auto child_dropped_size = dropped_size - left_size; 1255| 46.8k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 46.8k] | 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| 46.8k| } else { 1264| 46.8k| using std::get; 1265| 46.8k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 46.8k] ------------------ 1266| 46.8k| : node_t::make_inner_r_e(e); 1267| 46.8k| auto newr = newn->relaxed(); 1268| 46.8k| auto newcount = count - idx; 1269| 46.8k| auto new_child_size = child_size - child_dropped_size; 1270| 46.8k| IMMER_TRY { ------------------ | | 49| 46.8k|#define IMMER_TRY try ------------------ 1271| 46.8k| auto subs = 1272| 46.8k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 46.8k] ------------------ 1273| 46.8k| : pos.towards_sub_oh( 1274| 46.8k| no_collapse_no_mut_t{}, first, idx, e); 1275| 46.8k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 46.8k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 46.8k| pos.copy_sizes( 1278| 46.8k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 46.8k| std::copy(node->inner() + idx + 1, 1280| 46.8k| node->inner() + count, 1281| 46.8k| newn->inner() + 1); 1282| 46.8k| newn->inner()[0] = get<1>(subs); 1283| 46.8k| newr->d.sizes[0] = new_child_size; 1284| 46.8k| newr->d.count = newcount; 1285| 46.8k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 46.8k, False: 0] ------------------ 1286| 46.8k| if (!mutate) { ------------------ | Branch (1286:21): [True: 46.8k, False: 0] ------------------ 1287| 46.8k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 46.8k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 46.8k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 46.8k| } 1291| 46.8k| return std::make_tuple(pos.shift(), newn); 1292| 46.8k| } 1293| 46.8k| 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| 46.8k| } 1299| 46.8k| } _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.50k| { 1304| 2.50k| auto idx = pos.subindex(first); 1305| 2.50k| auto count = pos.count(); 1306| 2.50k| auto node = pos.node(); 1307| 2.50k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.50k| auto left_size = pos.size_before(idx); 1313| 2.50k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.50k| auto dropped_size = first; 1315| 2.50k| auto child_dropped_size = dropped_size - left_size; 1316| 2.50k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.50k, Folded] | Branch (1316:25): [True: 1.49k, False: 1.01k] | Branch (1316:45): [True: 853, False: 643] ------------------ 1317| 853| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 853] ------------------ 1318| 853| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 853| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 853] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 853| else if (Mutating) ------------------ | Branch (1321:22): [True: 853, Folded] ------------------ 1322| 853| pos.visit(dec_visitor{}); 1323| 853| return r; 1324| 1.65k| } else { 1325| 1.65k| 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.65k| auto newcount = count - idx; 1330| 1.65k| auto newn = 1331| 1.65k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.65k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.65k| : node_t::make_inner_r_e(e); 1336| 1.65k| auto newr = newn->relaxed(); 1337| 1.65k| IMMER_TRY { ------------------ | | 49| 1.65k|#define IMMER_TRY try ------------------ 1338| 1.65k| auto subs = 1339| 1.65k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.65k] ------------------ 1340| 1.65k| : pos.towards_sub_oh( 1341| 1.65k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.65k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.65k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.65k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.65k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.65k, False: 0] ------------------ 1346| 1.65k| pos.copy_sizes( 1347| 1.65k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.65k| newr->d.count = newcount; 1349| 1.65k| newn->inner()[0] = get<1>(subs); 1350| 1.65k| std::copy(node->inner() + idx + 1, 1351| 1.65k| node->inner() + count, 1352| 1.65k| newn->inner() + 1); 1353| 1.65k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.65k, False: 0] ------------------ 1354| 1.65k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.65k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.65k, Folded] ------------------ 1356| 1.65k| pos.visit(dec_visitor{}); 1357| 1.65k| } 1358| 1.65k| return std::make_tuple(pos.shift(), newn); 1359| 1.65k| } 1360| 1.65k| 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.65k| } 1373| 2.50k| } _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.9k| { 350| 12.9k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 12.9k, False: 0] ------------------ 351| 12.9k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 12.0k, False: 873] ------------------ 352| 12.9k| ? visit_maybe_relaxed_sub(rootl, 353| 12.0k| shiftl, 354| 12.0k| sizel, 355| 12.0k| this_t{}, 356| 12.0k| posr, 357| 12.0k| first, 358| 12.0k| size_t{}) 359| 12.9k| : posr.first_sub_inner( 360| 873| rrb{}, first, rootl, shiftl, sizel); 361| 12.9k| } _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.8k| { 383| 33.8k| auto nl = posl.node(); 384| 33.8k| auto nr = posr.node(); 385| 33.8k| if (nl == nr) ------------------ | Branch (385:13): [True: 10.9k, False: 22.9k] ------------------ 386| 10.9k| return true; 387| 22.9k| auto cl = posl.count(); 388| 22.9k| auto cr = posr.count(); 389| 22.9k| assert(cr > 0); ------------------ | Branch (389:9): [True: 22.9k, False: 0] ------------------ 390| 22.9k| auto sbr = size_t{}; 391| 22.9k| auto i = count_t{}; 392| 22.9k| auto j = count_t{}; 393| 127k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 114k, False: 13.7k] ------------------ 394| 114k| auto sbl = posl.size_before(i); 395| 203k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 182k, False: 20.8k] | Branch (395:34): [True: 89.5k, False: 93.2k] ------------------ 396| 89.5k| ; 397| 114k| auto res = 398| 114k| sbl == sbr ------------------ | Branch (398:17): [True: 55.8k, False: 58.2k] ------------------ 399| 114k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 114k| : posl.nth_sub(i, 401| 58.2k| for_each_chunk_p_visitor{}, 402| 58.2k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 114k| if (!res) ------------------ | Branch (403:17): [True: 9.13k, False: 104k] ------------------ 404| 9.13k| return false; 405| 114k| } 406| 13.7k| return true; 407| 22.9k| } _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.1k| { 337| 26.1k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 26.1k| } _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.7k| { 428| 26.7k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 16.9k, False: 9.82k] ------------------ 429| 16.9k| return true; 430| 9.82k| auto cl = posl.count(); 431| 9.82k| auto cr = posr.count(); 432| 9.82k| auto mp = std::min(cl, cr); 433| 9.82k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 8.45k, False: 1.36k] ------------------ 434| 9.82k| posl.node()->leaf() + mp, 435| 9.82k| posr.node()->leaf()) && 436| 8.45k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 8.02k, False: 432] ------------------ 437| 8.45k| posl.node()->leaf() + posl.count(), 438| 8.45k| first + (idx + mp)); 439| 26.7k| } _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.8k| { 330| 24.8k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 24.8k| } _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.33k| { 413| 4.33k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.33k| } _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.33k| { 383| 4.33k| auto nl = posl.node(); 384| 4.33k| auto nr = posr.node(); 385| 4.33k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.33k] ------------------ 386| 0| return true; 387| 4.33k| auto cl = posl.count(); 388| 4.33k| auto cr = posr.count(); 389| 4.33k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.33k, False: 0] ------------------ 390| 4.33k| auto sbr = size_t{}; 391| 4.33k| auto i = count_t{}; 392| 4.33k| auto j = count_t{}; 393| 15.5k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 13.5k, False: 2.02k] ------------------ 394| 13.5k| auto sbl = posl.size_before(i); 395| 22.8k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 19.1k, False: 3.72k] | Branch (395:34): [True: 9.33k, False: 9.82k] ------------------ 396| 9.33k| ; 397| 13.5k| auto res = 398| 13.5k| sbl == sbr ------------------ | Branch (398:17): [True: 8.43k, False: 5.11k] ------------------ 399| 13.5k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 13.5k| : posl.nth_sub(i, 401| 5.11k| for_each_chunk_p_visitor{}, 402| 5.11k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 13.5k| if (!res) ------------------ | Branch (403:17): [True: 2.31k, False: 11.2k] ------------------ 404| 2.31k| return false; 405| 13.5k| } 406| 2.02k| return true; 407| 4.33k| } _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.52k| { 337| 5.52k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 5.52k| } _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.1k| { 428| 12.1k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 8.32k, False: 3.85k] ------------------ 429| 8.32k| return true; 430| 3.85k| auto cl = posl.count(); 431| 3.85k| auto cr = posr.count(); 432| 3.85k| auto mp = std::min(cl, cr); 433| 3.85k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 3.52k, False: 326] ------------------ 434| 3.85k| posl.node()->leaf() + mp, 435| 3.85k| posr.node()->leaf()) && 436| 3.52k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 3.25k, False: 271] ------------------ 437| 3.52k| posl.node()->leaf() + posl.count(), 438| 3.52k| first + (idx + mp)); 439| 12.1k| } _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| 2.06k| { 330| 2.06k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.06k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIX12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 412| 2.24k| { 413| 2.24k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.24k| } _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.24k| { 383| 2.24k| auto nl = posl.node(); 384| 2.24k| auto nr = posr.node(); 385| 2.24k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.24k] ------------------ 386| 0| return true; 387| 2.24k| auto cl = posl.count(); 388| 2.24k| auto cr = posr.count(); 389| 2.24k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.24k, False: 0] ------------------ 390| 2.24k| auto sbr = size_t{}; 391| 2.24k| auto i = count_t{}; 392| 2.24k| auto j = count_t{}; 393| 16.2k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 14.7k, False: 1.49k] ------------------ 394| 14.7k| auto sbl = posl.size_before(i); 395| 26.2k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 22.5k, False: 3.67k] | Branch (395:34): [True: 11.4k, False: 11.1k] ------------------ 396| 11.4k| ; 397| 14.7k| auto res = 398| 14.7k| sbl == sbr ------------------ | Branch (398:17): [True: 8.79k, False: 6.00k] ------------------ 399| 14.7k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 14.7k| : posl.nth_sub(i, 401| 6.00k| for_each_chunk_p_visitor{}, 402| 6.00k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 14.7k| if (!res) ------------------ | Branch (403:17): [True: 750, False: 14.0k] ------------------ 404| 750| return false; 405| 14.7k| } 406| 1.49k| return true; 407| 2.24k| } _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.33k| { 337| 7.33k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 7.33k| } _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| 501| { 330| 501| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 501| } _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| 959| { 330| 959| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 959| } _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.80k| { 420| 1.80k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.80k, False: 0] ------------------ 421| 1.80k| ? this_t::visit_regular(posl, posr.node()) 422| 1.80k| : this_t::visit_regular(posr, posl.node()); 423| 1.80k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 13.3k| { 444| 13.3k| auto node = pos.node(); 445| 13.3k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 9.40k, False: 3.94k] | Branch (445:33): [True: 2.03k, False: 1.90k] ------------------ 446| 13.3k| } _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| 23.8k| { 451| 23.8k| auto node = pos.node(); 452| 23.8k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 18.5k, False: 5.32k] | Branch (452:33): [True: 2.62k, False: 2.69k] ------------------ 453| 5.32k| node->leaf() + pos.count(), 454| 5.32k| other->leaf()); 455| 23.8k| } _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| 13.0k| { 444| 13.0k| auto node = pos.node(); 445| 13.0k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 7.55k, False: 5.54k] | Branch (445:33): [True: 2.14k, False: 3.39k] ------------------ 446| 13.0k| } _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.95k| { 451| 2.95k| auto node = pos.node(); 452| 2.95k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.43k, False: 1.51k] | Branch (452:33): [True: 425, False: 1.08k] ------------------ 453| 1.51k| node->leaf() + pos.count(), 454| 1.51k| other->leaf()); 455| 2.95k| } _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.15k| { 444| 3.15k| auto node = pos.node(); 445| 3.15k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 285, False: 2.87k] | Branch (445:33): [True: 1.49k, False: 1.38k] ------------------ 446| 3.15k| } _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| 379k| { 113| 379k| auto data = as_const(pos.node()->leaf()); 114| 379k| return fn(data, data + pos.count()); 115| 379k| } _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.33M| return [iter](auto f, auto e) mutable { 368| 1.33M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 77.5k, False: 1.25M] ------------------ 369| 77.5k| iter += e - f; 370| 77.5k| return true; 371| 77.5k| } 372| 10.8M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 9.54M, False: 1.25M] ------------------ 373| 9.54M| if (*f != *iter) ------------------ | Branch (373:21): [True: 5.23k, False: 9.54M] ------------------ 374| 5.23k| return false; 375| 1.25M| return true; 376| 1.25M| }; _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.88M| { 54| 4.88M| return pos.towards(this_t{}, idx); 55| 4.88M| } _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| 986k| { 60| 986k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 986k| } _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| 421k| { 54| 421k| return pos.towards(this_t{}, idx); 55| 421k| } _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| 394k| { 60| 394k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 394k| } _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| 422k| { 54| 422k| return pos.towards(this_t{}, idx); 55| 422k| } _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| 26.8k| { 60| 26.8k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 26.8k| } _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| 42.8k| { 54| 42.8k| return pos.towards(this_t{}, idx); 55| 42.8k| } _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| 33.4k| { 107| 33.4k| return pos.each_pred(this_t{}, fn); 108| 33.4k| } _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| 848| { 330| 848| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 848| } _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| 10.5k| { 420| 10.5k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 10.5k, False: 0] ------------------ 421| 10.5k| ? this_t::visit_regular(posl, posr.node()) 422| 10.5k| : this_t::visit_regular(posr, posl.node()); 423| 10.5k| } _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| 935k| { 113| 935k| auto data = as_const(pos.node()->leaf()); 114| 935k| return fn(data, data + pos.count()); 115| 935k| } _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| 22.4k| { 107| 22.4k| return pos.each_pred(this_t{}, fn); 108| 22.4k| } _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| 19.9k| { 113| 19.9k| auto data = as_const(pos.node()->leaf()); 114| 19.9k| return fn(data, data + pos.count()); 115| 19.9k| } _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.99k| { 107| 4.99k| return pos.each_pred(this_t{}, fn); 108| 4.99k| } _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| 5.35k| { 330| 5.35k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 5.35k| } _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.84k| { 383| 3.84k| auto nl = posl.node(); 384| 3.84k| auto nr = posr.node(); 385| 3.84k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 3.84k] ------------------ 386| 0| return true; 387| 3.84k| auto cl = posl.count(); 388| 3.84k| auto cr = posr.count(); 389| 3.84k| assert(cr > 0); ------------------ | Branch (389:9): [True: 3.84k, False: 0] ------------------ 390| 3.84k| auto sbr = size_t{}; 391| 3.84k| auto i = count_t{}; 392| 3.84k| auto j = count_t{}; 393| 16.8k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 14.8k, False: 1.95k] ------------------ 394| 14.8k| auto sbl = posl.size_before(i); 395| 24.2k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 21.3k, False: 2.87k] | Branch (395:34): [True: 9.40k, False: 11.9k] ------------------ 396| 9.40k| ; 397| 14.8k| auto res = 398| 14.8k| sbl == sbr ------------------ | Branch (398:17): [True: 8.63k, False: 6.22k] ------------------ 399| 14.8k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 14.8k| : posl.nth_sub(i, 401| 6.22k| for_each_chunk_p_visitor{}, 402| 6.22k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 14.8k| if (!res) ------------------ | Branch (403:17): [True: 1.89k, False: 12.9k] ------------------ 404| 1.89k| return false; 405| 14.8k| } 406| 1.95k| return true; 407| 3.84k| } _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| 12.1k| { 337| 12.1k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 12.1k| } _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| 12.1k| { 428| 12.1k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 9.20k, False: 2.95k] ------------------ 429| 9.20k| return true; 430| 2.95k| auto cl = posl.count(); 431| 2.95k| auto cr = posr.count(); 432| 2.95k| auto mp = std::min(cl, cr); 433| 2.95k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 2.59k, False: 363] ------------------ 434| 2.95k| posl.node()->leaf() + mp, 435| 2.95k| posr.node()->leaf()) && 436| 2.59k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.59k, False: 0] ------------------ 437| 2.59k| posl.node()->leaf() + posl.count(), 438| 2.59k| first + (idx + mp)); 439| 12.1k| } _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.36k| { 330| 4.36k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 4.36k| } _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| 1.85k| { 383| 1.85k| auto nl = posl.node(); 384| 1.85k| auto nr = posr.node(); 385| 1.85k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.85k] ------------------ 386| 0| return true; 387| 1.85k| auto cl = posl.count(); 388| 1.85k| auto cr = posr.count(); 389| 1.85k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.85k, False: 0] ------------------ 390| 1.85k| auto sbr = size_t{}; 391| 1.85k| auto i = count_t{}; 392| 1.85k| auto j = count_t{}; 393| 14.7k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 13.4k, False: 1.37k] ------------------ 394| 13.4k| auto sbl = posl.size_before(i); 395| 24.4k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 23.4k, False: 994] | Branch (395:34): [True: 11.0k, False: 12.4k] ------------------ 396| 11.0k| ; 397| 13.4k| auto res = 398| 13.4k| sbl == sbr ------------------ | Branch (398:17): [True: 8.44k, False: 4.97k] ------------------ 399| 13.4k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 13.4k| : posl.nth_sub(i, 401| 4.97k| for_each_chunk_p_visitor{}, 402| 4.97k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 13.4k| if (!res) ------------------ | Branch (403:17): [True: 482, False: 12.9k] ------------------ 404| 482| return false; 405| 13.4k| } 406| 1.37k| return true; 407| 1.85k| } _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.50k| { 420| 2.50k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 2.50k, False: 0] ------------------ 421| 2.50k| ? this_t::visit_regular(posl, posr.node()) 422| 2.50k| : this_t::visit_regular(posr, posl.node()); 423| 2.50k| } _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| 143k| { 107| 143k| return pos.each_pred(this_t{}, fn); 108| 143k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 366| 80.5k| { 367| 80.5k| return [iter](auto f, auto e) mutable { 368| 80.5k| if (f == &*iter) { 369| 80.5k| iter += e - f; 370| 80.5k| return true; 371| 80.5k| } 372| 80.5k| for (; f != e; ++f, ++iter) 373| 80.5k| if (*f != *iter) 374| 80.5k| return false; 375| 80.5k| return true; 376| 80.5k| }; 377| 80.5k| } _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.13k| { 350| 1.13k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 1.13k, False: 0] ------------------ 351| 1.13k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 873, False: 261] ------------------ 352| 1.13k| ? visit_maybe_relaxed_sub(rootl, 353| 873| shiftl, 354| 873| sizel, 355| 873| this_t{}, 356| 873| posr, 357| 873| first, 358| 873| size_t{}) 359| 1.13k| : posr.first_sub_inner( 360| 261| rrb{}, first, rootl, shiftl, sizel); 361| 1.13k| } _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| 9.08k| { 350| 9.08k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 9.08k, False: 0] ------------------ 351| 9.08k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 9.08k, False: 0] ------------------ 352| 9.08k| ? visit_maybe_relaxed_sub(rootl, 353| 9.08k| shiftl, 354| 9.08k| sizel, 355| 9.08k| this_t{}, 356| 9.08k| posr, 357| 9.08k| first, 358| 9.08k| size_t{}) 359| 9.08k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 9.08k| } _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.74k| { 451| 6.74k| auto node = pos.node(); 452| 6.74k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.77k, False: 4.96k] | Branch (452:33): [True: 2.16k, False: 2.80k] ------------------ 453| 4.96k| node->leaf() + pos.count(), 454| 4.96k| other->leaf()); 455| 6.74k| } _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| 174M|{ 1839| 174M| assert(node); ------------------ | Branch (1839:5): [True: 174M, False: 0] ------------------ 1840| 174M| auto relaxed = node->relaxed(); 1841| 174M| if (relaxed) { ------------------ | Branch (1841:9): [True: 159M, False: 14.7M] ------------------ 1842| 159M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 159M, False: 0] ------------------ 1843| 159M| return make_relaxed_pos(node, shift, relaxed) 1844| 159M| .visit(v, std::forward(args)...); 1845| 159M| } else { 1846| 14.7M| return make_regular_sub_pos(node, shift, size) 1847| 14.7M| .visit(v, std::forward(args)...); 1848| 14.7M| } 1849| 174M|} _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| 449M|{ 1829| 449M| assert(node); ------------------ | Branch (1829:5): [True: 449M, False: 0] ------------------ 1830| 449M| assert(relaxed); ------------------ | Branch (1830:5): [True: 449M, False: 0] ------------------ 1831| 449M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 449M, False: 0] ------------------ 1832| 449M| return {node, shift, relaxed}; 1833| 449M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 181M| { 1814| 181M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 181M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1431| 303M| 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| 36.5M| { 1477| 36.5M| each_left(v, relaxed_->d.count, args...); 1478| 36.5M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 36.7M| { 1624| 36.7M| auto p = node_->inner(); 1625| 36.7M| auto s = size_t{}; 1626| 36.7M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 8.35M, False: 28.3M] ------------------ 1627| 68.4M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 60.0M, False: 8.35M] ------------------ 1628| 60.0M| IMMER_PREFETCH(p + i + 1); 1629| 60.0M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 60.0M| .visit(v, args...); 1631| 60.0M| s = relaxed_->d.sizes[i]; 1632| 60.0M| assert(s); ------------------ | Branch (1632:17): [True: 60.0M, False: 0] ------------------ 1633| 60.0M| } 1634| 28.3M| } else { 1635| 28.3M| auto ss = shift_ - B; 1636| 200M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 172M, False: 28.3M] ------------------ 1637| 172M| visit_maybe_relaxed_sub( 1638| 172M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 172M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 172M, False: 0] ------------------ 1641| 172M| } 1642| 28.3M| } 1643| 36.7M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1430| 277M| 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| 26.5M|{ 1045| 26.5M| assert(node); ------------------ | Branch (1045:5): [True: 26.5M, False: 0] ------------------ 1046| 26.5M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 26.5M, False: 0] ------------------ 1047| 26.5M| assert(size > 0); ------------------ | Branch (1047:5): [True: 26.5M, False: 0] ------------------ 1048| 26.5M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 26.5M, False: 0] ------------------ 1049| 26.5M| return {node, shift, size}; 1050| 26.5M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1036| 14.8M| { 1037| 14.8M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 14.8M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 785| 26.2M| 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| 428k| { 826| 428k| return each_regular(*this, v, args...); 827| 428k| } _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| 428k|{ 344| 428k| constexpr auto B = bits; 345| 428k| constexpr auto BL = bits_leaf; 346| 428k| auto n = p.node()->inner(); 347| 428k| auto last = p.count() - 1; 348| 428k| auto e = n + last; 349| 428k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 88.5k, False: 340k] ------------------ 350| 231k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 142k, False: 88.5k] ------------------ 351| 142k| IMMER_PREFETCH(n + 1); 352| 142k| make_full_leaf_pos(*n).visit(v, args...); 353| 142k| } 354| 88.5k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 340k| } else { 356| 340k| auto ss = p.shift() - B; 357| 1.26M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 926k, False: 340k] ------------------ 358| 926k| make_full_pos(*n, ss).visit(v, args...); 359| 340k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 340k| } 361| 428k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 787| 10.3M| 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| 15.0M|{ 215| 15.0M| assert(node); ------------------ | Branch (215:5): [True: 15.0M, False: 0] ------------------ 216| 15.0M| return {node}; 217| 15.0M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 1.70M| { 208| 1.70M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.70M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 199| 9.03M| 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| 13.8M| 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.62M|{ 120| 1.62M| assert(node); ------------------ | Branch (120:5): [True: 1.62M, False: 0] ------------------ 121| 1.62M| assert(size > 0); ------------------ | Branch (121:5): [True: 1.62M, False: 0] ------------------ 122| 1.62M| return {node, size}; 123| 1.62M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 786| 7.54M| 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| 392k| { 113| 392k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 392k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 104| 1.62M| 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.42M| 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.49M| 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.36M|{ 1413| 4.36M| assert(node); ------------------ | Branch (1413:5): [True: 4.36M, False: 0] ------------------ 1414| 4.36M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 4.36M, False: 0] ------------------ 1415| 4.36M| return {node, shift}; 1416| 4.36M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 2.82M| { 1406| 2.82M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.82M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1159| 3.39M| 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.4k| { 1186| 97.4k| auto p = node_->inner(); 1187| 97.4k| auto e = p + branches; 1188| 97.4k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 84.9k, False: 12.5k] ------------------ 1189| 764k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 679k, False: 84.9k] ------------------ 1190| 679k| IMMER_PREFETCH(p + 1); 1191| 679k| make_full_leaf_pos(*p).visit(v, args...); 1192| 679k| } 1193| 84.9k| } else { 1194| 12.5k| auto ss = shift_ - B; 1195| 112k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 100k, False: 12.5k] ------------------ 1196| 100k| make_full_pos(*p, ss).visit(v, args...); 1197| 12.5k| } 1198| 97.4k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1158| 1.16M| 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.88M|{ 691| 2.88M| assert(node); ------------------ | Branch (691:5): [True: 2.88M, False: 0] ------------------ 692| 2.88M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 2.88M, False: 0] ------------------ 693| 2.88M| assert(size > 0); ------------------ | Branch (693:5): [True: 2.88M, False: 0] ------------------ 694| 2.88M| return {node, shift, size}; 695| 2.88M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 908k| { 337| 908k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 908k| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 231| 5.03M| 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| 857k| { 244| 857k| return each_regular(*this, v, args...); 245| 857k| } _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| 857k|{ 344| 857k| constexpr auto B = bits; 345| 857k| constexpr auto BL = bits_leaf; 346| 857k| auto n = p.node()->inner(); 347| 857k| auto last = p.count() - 1; 348| 857k| auto e = n + last; 349| 857k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 298k, False: 558k] ------------------ 350| 1.15M| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 861k, False: 298k] ------------------ 351| 861k| IMMER_PREFETCH(n + 1); 352| 861k| make_full_leaf_pos(*n).visit(v, args...); 353| 861k| } 354| 298k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 558k| } else { 356| 558k| auto ss = p.shift() - B; 357| 2.34M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 1.78M, False: 558k] ------------------ 358| 1.78M| make_full_pos(*n, ss).visit(v, args...); 359| 558k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 558k| } 361| 857k|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 233| 4.69M| 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.87M| 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.11M| 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.05M| 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| 20.5M| 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| 24.4M| count_t subindex(size_t idx) const { return idx >> shift_; } _ZN5immer6detail4rbts22make_empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_17empty_regular_posIT_EEPSE_: 64| 1.53M|{ 65| 1.53M| return {node}; 66| 1.53M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 1.53M| { 58| 1.53M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 1.53M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 41| 1.53M| 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| 86.7M|{ 152| 86.7M| assert(node); ------------------ | Branch (152:5): [True: 86.7M, False: 0] ------------------ 153| 86.7M| assert(count <= branches); ------------------ | Branch (153:5): [True: 86.7M, False: 0] ------------------ 154| 86.7M| return {node, count}; 155| 86.7M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 65.6M| { 145| 65.6M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 65.6M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 136| 78.3M| 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| 22.0M| count_t count() const { return count_; } _ZN5immer6detail4rbts19make_empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_14empty_leaf_posIT_EEPSE_: 88| 1.38M|{ 89| 1.38M| assert(node); ------------------ | Branch (89:5): [True: 1.38M, False: 0] ------------------ 90| 1.38M| return {node}; 91| 1.38M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 1.38M| { 82| 1.38M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 1.38M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 75| 1.38M| 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.32k| 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| 212k| { 1814| 212k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 212k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1433| 28.4M| 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| 13.6M| { 1444| 13.6M| return size_sbh(offset, size_before(offset)); 1445| 13.6M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1448| 14.0M| { 1449| 14.0M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 14.0M, False: 0] ------------------ 1450| 14.0M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 14.0M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 1438| 50.4M| { 1439| 50.4M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 33.0M, False: 17.4M] ------------------ 1440| 50.4M| } _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| 197k| { 1738| 197k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 197k, False: 0] ------------------ 1739| 197k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 197k, False: 0] ------------------ 1740| 197k| auto child = node_->inner()[offset_hint]; 1741| 197k| auto is_leaf = shift_ == BL; 1742| 197k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 197k] ------------------ 1743| 197k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 197k| : visit_maybe_relaxed_sub( 1745| 197k| child, shift_ - B, child_size_hint, v, args...); 1746| 197k| } _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| 197k|{ 1839| 197k| assert(node); ------------------ | Branch (1839:5): [True: 197k, False: 0] ------------------ 1840| 197k| auto relaxed = node->relaxed(); 1841| 197k| if (relaxed) { ------------------ | Branch (1841:9): [True: 156k, False: 41.7k] ------------------ 1842| 156k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 156k, False: 0] ------------------ 1843| 156k| return make_relaxed_pos(node, shift, relaxed) 1844| 156k| .visit(v, std::forward(args)...); 1845| 156k| } else { 1846| 41.7k| return make_regular_sub_pos(node, shift, size) 1847| 41.7k| .visit(v, std::forward(args)...); 1848| 41.7k| } 1849| 197k|} _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| 41.7k| { 1037| 41.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 41.7k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 788| 2.41M| 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| 304k| { 953| 304k| return last_oh_regular(*this, v, offset_hint, args...); 954| 304k| } _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| 304k|{ 678| 304k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 304k, False: 0] ------------------ 679| 304k| constexpr auto B = bits; 680| 304k| constexpr auto BL = bits_leaf; 681| 304k| auto child = p.node()->inner()[offset_hint]; 682| 304k| auto is_leaf = p.shift() == BL; 683| 304k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 304k] ------------------ 684| 304k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 304k| .visit(v, args...); 686| 304k|} _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| 817k| { 337| 817k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 817k| } _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| 512k| { 331| 512k| return last_oh_regular(*this, v, offset_hint, args...); 332| 512k| } _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| 512k|{ 678| 512k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 512k, False: 0] ------------------ 679| 512k| constexpr auto B = bits; 680| 512k| constexpr auto BL = bits_leaf; 681| 512k| auto child = p.node()->inner()[offset_hint]; 682| 512k| auto is_leaf = p.shift() == BL; 683| 512k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 512k] ------------------ 684| 512k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 512k| .visit(v, args...); 686| 512k|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1432| 120M| 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| 295k| { 1037| 295k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 295k| } 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| 77.9k| { 145| 77.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 77.9k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 139| 1.20M| 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| 240k|{ 1839| 240k| assert(node); ------------------ | Branch (1839:5): [True: 240k, False: 0] ------------------ 1840| 240k| auto relaxed = node->relaxed(); 1841| 240k| if (relaxed) { ------------------ | Branch (1841:9): [True: 194k, False: 45.8k] ------------------ 1842| 194k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 194k, False: 0] ------------------ 1843| 194k| return make_relaxed_pos(node, shift, relaxed) 1844| 194k| .visit(v, std::forward(args)...); 1845| 194k| } else { 1846| 45.8k| return make_regular_sub_pos(node, shift, size) 1847| 45.8k| .visit(v, std::forward(args)...); 1848| 45.8k| } 1849| 240k|} 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| 194k| { 1814| 194k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 194k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 1454| 17.0M| { 1455| 17.0M| auto offset = idx >> shift_; 1456| 24.2M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 7.22M, False: 17.0M] ------------------ 1457| 7.22M| ++offset; 1458| 17.0M| return offset; 1459| 17.0M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7relaxedEv: 1435| 194k| 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| 194k| { 1687| 194k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 194k, False: 0] ------------------ 1688| 194k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 28.0k, False: 166k] ------------------ 1689| 194k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 194k| } 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| 194k| { 1699| 194k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 194k| } 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| 194k| { 1718| 194k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 194k, False: 0] ------------------ 1719| 194k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 28.0k, False: 166k] | Branch (1719:9): [True: 194k, False: 0] ------------------ 1720| 194k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 194k| auto child = node_->inner()[offset_hint]; 1722| 194k| auto is_leaf = shift_ == BL; 1723| 194k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 194k| auto next_idx = idx - left_size_hint; 1725| 194k| return is_leaf ------------------ | Branch (1725:16): [True: 44.3k, False: 150k] ------------------ 1726| 194k| ? make_leaf_sub_pos(child, next_size) 1727| 44.3k| .visit(v, next_idx, args...) 1728| 194k| : visit_maybe_relaxed_sub( 1729| 150k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 194k| } 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| 44.3k| { 145| 44.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 44.3k| } 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| 45.8k| { 1037| 45.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 45.8k| } 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| 45.8k| { 939| 45.8k| return towards_oh_ch_regular( 940| 45.8k| *this, v, idx, offset_hint, count(), args...); 941| 45.8k| } 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| 45.8k|{ 633| 45.8k| constexpr auto B = bits; 634| 45.8k| constexpr auto BL = bits_leaf; 635| 45.8k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 45.8k, False: 0] ------------------ 636| 45.8k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 45.8k, False: 0] ------------------ 637| 45.8k| auto is_leaf = p.shift() == BL; 638| 45.8k| auto child = p.node()->inner()[offset_hint]; 639| 45.8k| auto is_full = offset_hint + 1 != count_hint; 640| 45.8k| return is_full ------------------ | Branch (640:12): [True: 11.0k, False: 34.7k] ------------------ 641| 45.8k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.79k, False: 8.27k] ------------------ 642| 11.0k| : make_full_pos(child, p.shift() - B) 643| 8.27k| .visit(v, idx, args...)) 644| 45.8k| : (is_leaf ------------------ | Branch (644:19): [True: 31.0k, False: 3.74k] ------------------ 645| 34.7k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 34.7k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.74k| .visit(v, idx, args...)); 648| 45.8k|} 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| 13.4k| { 208| 13.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 13.4k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 202| 453k| 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.8k| { 1406| 13.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 13.8k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 1162| 932k| 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.8k| { 1330| 13.8k| return towards_oh(v, idx, offset_hint, args...); 1331| 13.8k| } 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.8k| { 1337| 13.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 13.8k, False: 0] ------------------ 1338| 13.8k| auto is_leaf = shift_ == BL; 1339| 13.8k| auto child = node_->inner()[offset_hint]; 1340| 13.8k| return is_leaf ------------------ | Branch (1340:16): [True: 9.45k, False: 4.34k] ------------------ 1341| 13.8k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 13.8k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 13.8k| } 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| 32.4k| { 113| 32.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 32.4k| } 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| 4.05k| { 337| 4.05k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.05k| } 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| 4.05k| { 317| 4.05k| return towards_oh_ch_regular( 318| 4.05k| *this, v, idx, offset_hint, count(), args...); 319| 4.05k| } 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| 4.05k|{ 633| 4.05k| constexpr auto B = bits; 634| 4.05k| constexpr auto BL = bits_leaf; 635| 4.05k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.05k, False: 0] ------------------ 636| 4.05k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.05k, False: 0] ------------------ 637| 4.05k| auto is_leaf = p.shift() == BL; 638| 4.05k| auto child = p.node()->inner()[offset_hint]; 639| 4.05k| auto is_full = offset_hint + 1 != count_hint; 640| 4.05k| return is_full ------------------ | Branch (640:12): [True: 2.36k, False: 1.69k] ------------------ 641| 4.05k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.17k, False: 1.18k] ------------------ 642| 2.36k| : make_full_pos(child, p.shift() - B) 643| 1.18k| .visit(v, idx, args...)) 644| 4.05k| : (is_leaf ------------------ | Branch (644:19): [True: 1.38k, False: 306] ------------------ 645| 1.69k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.69k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 306| .visit(v, idx, args...)); 648| 4.05k|} _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| 40.1k|{ 1839| 40.1k| assert(node); ------------------ | Branch (1839:5): [True: 40.1k, False: 0] ------------------ 1840| 40.1k| auto relaxed = node->relaxed(); 1841| 40.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 31.7k, False: 8.36k] ------------------ 1842| 31.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 31.7k, False: 0] ------------------ 1843| 31.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 31.7k| .visit(v, std::forward(args)...); 1845| 31.7k| } else { 1846| 8.36k| return make_regular_sub_pos(node, shift, size) 1847| 8.36k| .visit(v, std::forward(args)...); 1848| 8.36k| } 1849| 40.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 31.7k| { 1814| 31.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 31.7k| } _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.3k| { 1687| 24.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 24.3k, False: 0] ------------------ 1688| 24.3k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 24.3k] ------------------ 1689| 24.3k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 24.3k| } _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.3k| { 1699| 24.3k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 24.3k| } _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.3k| { 1718| 24.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 24.3k, False: 0] ------------------ 1719| 24.3k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 24.3k] | Branch (1719:9): [True: 24.3k, False: 0] ------------------ 1720| 24.3k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 24.3k| auto child = node_->inner()[offset_hint]; 1722| 24.3k| auto is_leaf = shift_ == BL; 1723| 24.3k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 24.3k| auto next_idx = idx - left_size_hint; 1725| 24.3k| return is_leaf ------------------ | Branch (1725:16): [True: 1.92k, False: 22.4k] ------------------ 1726| 24.3k| ? make_leaf_sub_pos(child, next_size) 1727| 1.92k| .visit(v, next_idx, args...) 1728| 24.3k| : visit_maybe_relaxed_sub( 1729| 22.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 24.3k| } _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.92k| { 145| 1.92k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.92k| } _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.9k| { 1687| 10.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 10.9k, False: 0] ------------------ 1688| 10.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.42k, False: 1.50k] ------------------ 1689| 10.9k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 10.9k| } _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.9k| { 1699| 10.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 10.9k| } _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.9k| { 1718| 10.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 10.9k, False: 0] ------------------ 1719| 10.9k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.42k, False: 1.50k] | Branch (1719:9): [True: 10.9k, False: 0] ------------------ 1720| 10.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 10.9k| auto child = node_->inner()[offset_hint]; 1722| 10.9k| auto is_leaf = shift_ == BL; 1723| 10.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 10.9k| auto next_idx = idx - left_size_hint; 1725| 10.9k| return is_leaf ------------------ | Branch (1725:16): [True: 4.21k, False: 6.71k] ------------------ 1726| 10.9k| ? make_leaf_sub_pos(child, next_size) 1727| 4.21k| .visit(v, next_idx, args...) 1728| 10.9k| : visit_maybe_relaxed_sub( 1729| 6.71k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 10.9k| } _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.21k| { 145| 4.21k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.21k| } _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.71k|{ 1839| 6.71k| assert(node); ------------------ | Branch (1839:5): [True: 6.71k, False: 0] ------------------ 1840| 6.71k| auto relaxed = node->relaxed(); 1841| 6.71k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.52k, False: 3.18k] ------------------ 1842| 3.52k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.52k, False: 0] ------------------ 1843| 3.52k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.52k| .visit(v, std::forward(args)...); 1845| 3.52k| } else { 1846| 3.18k| return make_regular_sub_pos(node, shift, size) 1847| 3.18k| .visit(v, std::forward(args)...); 1848| 3.18k| } 1849| 6.71k|} _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.52k| { 1814| 3.52k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.52k| } _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| 3.18k| { 1037| 3.18k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.18k| } _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.98k| { 928| 5.98k| return towards_oh_ch_regular( 929| 5.98k| *this, v, idx, offset_hint, count(), args...); 930| 5.98k| } _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.98k|{ 633| 5.98k| constexpr auto B = bits; 634| 5.98k| constexpr auto BL = bits_leaf; 635| 5.98k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.98k, False: 0] ------------------ 636| 5.98k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.98k, False: 0] ------------------ 637| 5.98k| auto is_leaf = p.shift() == BL; 638| 5.98k| auto child = p.node()->inner()[offset_hint]; 639| 5.98k| auto is_full = offset_hint + 1 != count_hint; 640| 5.98k| return is_full ------------------ | Branch (640:12): [True: 1.83k, False: 4.14k] ------------------ 641| 5.98k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 926, False: 913] ------------------ 642| 1.83k| : make_full_pos(child, p.shift() - B) 643| 913| .visit(v, idx, args...)) 644| 5.98k| : (is_leaf ------------------ | Branch (644:19): [True: 1.46k, False: 2.68k] ------------------ 645| 4.14k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.14k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.68k| .visit(v, idx, args...)); 648| 5.98k|} _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.01k| { 208| 6.01k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.01k| } _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.37k| { 1406| 2.37k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.37k| } _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.36k| { 1337| 5.36k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 5.36k, False: 0] ------------------ 1338| 5.36k| auto is_leaf = shift_ == BL; 1339| 5.36k| auto child = node_->inner()[offset_hint]; 1340| 5.36k| return is_leaf ------------------ | Branch (1340:16): [True: 4.44k, False: 922] ------------------ 1341| 5.36k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 5.36k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 5.36k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1161| 43.3k| 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.96k| { 113| 2.96k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.96k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 336| 3.37k| { 337| 3.37k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.37k| } _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| 3.37k| { 306| 3.37k| return towards_oh_ch_regular( 307| 3.37k| *this, v, idx, offset_hint, count(), args...); 308| 3.37k| } _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| 3.37k|{ 633| 3.37k| constexpr auto B = bits; 634| 3.37k| constexpr auto BL = bits_leaf; 635| 3.37k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.37k, False: 0] ------------------ 636| 3.37k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.37k, False: 0] ------------------ 637| 3.37k| auto is_leaf = p.shift() == BL; 638| 3.37k| auto child = p.node()->inner()[offset_hint]; 639| 3.37k| auto is_full = offset_hint + 1 != count_hint; 640| 3.37k| return is_full ------------------ | Branch (640:12): [True: 1.17k, False: 2.19k] ------------------ 641| 3.37k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 642, False: 536] ------------------ 642| 1.17k| : make_full_pos(child, p.shift() - B) 643| 536| .visit(v, idx, args...)) 644| 3.37k| : (is_leaf ------------------ | Branch (644:19): [True: 1.50k, False: 690] ------------------ 645| 2.19k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.19k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 690| .visit(v, idx, args...)); 648| 3.37k|} _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.36k| { 1037| 8.36k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.36k| } _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.56k| { 928| 5.56k| return towards_oh_ch_regular( 929| 5.56k| *this, v, idx, offset_hint, count(), args...); 930| 5.56k| } _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.56k|{ 633| 5.56k| constexpr auto B = bits; 634| 5.56k| constexpr auto BL = bits_leaf; 635| 5.56k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.56k, False: 0] ------------------ 636| 5.56k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.56k, False: 0] ------------------ 637| 5.56k| auto is_leaf = p.shift() == BL; 638| 5.56k| auto child = p.node()->inner()[offset_hint]; 639| 5.56k| auto is_full = offset_hint + 1 != count_hint; 640| 5.56k| return is_full ------------------ | Branch (640:12): [True: 4.80k, False: 764] ------------------ 641| 5.56k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.05k, False: 3.74k] ------------------ 642| 4.80k| : make_full_pos(child, p.shift() - B) 643| 3.74k| .visit(v, idx, args...)) 644| 5.56k| : (is_leaf ------------------ | Branch (644:19): [True: 764, False: 0] ------------------ 645| 764| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 764| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.56k|} _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.80k| { 208| 1.80k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.80k| } _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.31k| { 1406| 5.31k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.31k| } _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: 751, False: 1.56k] ------------------ 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| 764| { 113| 764| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 764| } _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| 32.9k|{ 1839| 32.9k| assert(node); ------------------ | Branch (1839:5): [True: 32.9k, False: 0] ------------------ 1840| 32.9k| auto relaxed = node->relaxed(); 1841| 32.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 24.4k, False: 8.54k] ------------------ 1842| 24.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 24.4k, False: 0] ------------------ 1843| 24.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 24.4k| .visit(v, std::forward(args)...); 1845| 24.4k| } else { 1846| 8.54k| return make_regular_sub_pos(node, shift, size) 1847| 8.54k| .visit(v, std::forward(args)...); 1848| 8.54k| } 1849| 32.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 24.4k| { 1814| 24.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 24.4k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1434| 5.27M| 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| 4.03k| { 1706| 4.03k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.03k, False: 0] ------------------ 1707| 4.03k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.72k, False: 313] ------------------ 1708| 4.03k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.03k| } _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| 4.03k| { 1718| 4.03k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.03k, False: 0] ------------------ 1719| 4.03k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.72k, False: 313] | Branch (1719:9): [True: 4.03k, False: 0] ------------------ 1720| 4.03k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.03k| auto child = node_->inner()[offset_hint]; 1722| 4.03k| auto is_leaf = shift_ == BL; 1723| 4.03k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.03k| auto next_idx = idx - left_size_hint; 1725| 4.03k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.03k] ------------------ 1726| 4.03k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.03k| : visit_maybe_relaxed_sub( 1729| 4.03k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.03k| } _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| 111k| { 1706| 111k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 111k, False: 0] ------------------ 1707| 111k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 34.5k, False: 77.4k] ------------------ 1708| 111k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 111k| } _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| 111k| { 1718| 111k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 111k, False: 0] ------------------ 1719| 111k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 34.5k, False: 77.4k] | Branch (1719:9): [True: 111k, False: 0] ------------------ 1720| 111k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 111k| auto child = node_->inner()[offset_hint]; 1722| 111k| auto is_leaf = shift_ == BL; 1723| 111k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 111k| auto next_idx = idx - left_size_hint; 1725| 111k| return is_leaf ------------------ | Branch (1725:16): [True: 18.9k, False: 92.9k] ------------------ 1726| 111k| ? make_leaf_sub_pos(child, next_size) 1727| 18.9k| .visit(v, next_idx, args...) 1728| 111k| : visit_maybe_relaxed_sub( 1729| 92.9k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 111k| } _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| 18.9k| { 145| 18.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 18.9k| } _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| 92.9k|{ 1839| 92.9k| assert(node); ------------------ | Branch (1839:5): [True: 92.9k, False: 0] ------------------ 1840| 92.9k| auto relaxed = node->relaxed(); 1841| 92.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 91.5k, False: 1.42k] ------------------ 1842| 91.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 91.5k, False: 0] ------------------ 1843| 91.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 91.5k| .visit(v, std::forward(args)...); 1845| 91.5k| } else { 1846| 1.42k| return make_regular_sub_pos(node, shift, size) 1847| 1.42k| .visit(v, std::forward(args)...); 1848| 1.42k| } 1849| 92.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 91.5k| { 1814| 91.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 91.5k| } _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.42k| { 1037| 1.42k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.42k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 791| 1.98M| { 792| 1.98M| return size_t{offset} << shift_; 793| 1.98M| } _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: 8.68k, False: 11.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.21k| { 947| 9.21k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 9.21k| } _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.21k|{ 654| 9.21k| constexpr auto B = bits; 655| 9.21k| constexpr auto BL = bits_leaf; 656| 9.21k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 9.21k, False: 0] ------------------ 657| 9.21k| auto is_leaf = p.shift() == BL; 658| 9.21k| auto child = p.node()->inner()[offset_hint]; 659| 9.21k| auto lsize = offset_hint << p.shift(); 660| 9.21k| auto size = p.this_size(); 661| 9.21k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 9.21k| return is_full ------------------ | Branch (662:12): [True: 9.21k, False: 0] ------------------ 663| 9.21k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.67k, False: 4.54k] ------------------ 664| 9.21k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 9.21k| : make_full_pos(child, p.shift() - B) 666| 4.54k| .visit(v, idx - lsize, args...)) 667| 9.21k| : (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.21k|} _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| 9.97k| { 208| 9.97k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.97k| } _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.22k| { 1406| 7.22k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 7.22k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1163| 10.2k| count_t subindex(size_t idx) const { return idx >> shift_; } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 1170| 48.4k| { 1171| 48.4k| return size_t{offset} << shift_; 1172| 48.4k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1166| 10.2k| { 1167| 10.2k| return size_t{1} << shift_; 1168| 10.2k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1348| 7.98k| { 1349| 7.98k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 7.98k, False: 0] ------------------ 1350| 7.98k| auto is_leaf = shift_ == BL; 1351| 7.98k| auto child = node_->inner()[offset_hint]; 1352| 7.98k| auto lsize = size_t{offset_hint} << shift_; 1353| 7.98k| return is_leaf ------------------ | Branch (1353:16): [True: 5.30k, False: 2.68k] ------------------ 1354| 7.98k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 7.98k| : make_full_pos(child, shift_ - B) 1356| 2.68k| .visit(v, idx - lsize, args...); 1357| 7.98k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1175| 10.2k| { 1176| 10.2k| auto e = sizes + n; 1177| 58.0k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 47.8k, False: 10.2k] ------------------ 1178| 47.8k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 47.8k, False: 0] ------------------ 1180| 47.8k| } 1181| 10.2k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1160| 511k| 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.80M| { 811| 3.80M| if (n) { ------------------ | Branch (811:13): [True: 3.79M, False: 4.49k] ------------------ 812| 3.79M| auto last = offset + n - 1; 813| 3.79M| auto e = sizes + n - 1; 814| 15.1M| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 11.3M, False: 3.79M] ------------------ 815| 11.3M| init = *sizes = init + (size_t{1} << shift_); 816| 11.3M| assert(init); ------------------ | Branch (816:17): [True: 11.3M, False: 0] ------------------ 817| 11.3M| } 818| 3.79M| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 3.79M, False: 0] ------------------ 820| 3.79M| } 821| 3.80M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEj: 797| 3.81M| { 798| 3.81M| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 1.90M, False: 1.91M] ------------------ 799| 3.81M| : size_t{1} << shift_; 800| 3.81M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1462| 22.0M| { 1463| 22.0M| auto e = sizes + n; 1464| 22.0M| auto prev = size_before(offset); 1465| 22.0M| auto these = relaxed_->d.sizes + offset; 1466| 101M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 79.8M, False: 22.0M] ------------------ 1467| 79.8M| auto this_size = *these; 1468| 79.8M| init = *sizes = init + (this_size - prev); 1469| 79.8M| assert(init); ------------------ | Branch (1469:13): [True: 79.8M, False: 0] ------------------ 1470| 79.8M| prev = this_size; 1471| 79.8M| } 1472| 22.0M| } _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.54k| { 1037| 8.54k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.54k| } _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.85k| { 947| 2.85k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.85k| } _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.85k|{ 654| 2.85k| constexpr auto B = bits; 655| 2.85k| constexpr auto BL = bits_leaf; 656| 2.85k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.85k, False: 0] ------------------ 657| 2.85k| auto is_leaf = p.shift() == BL; 658| 2.85k| auto child = p.node()->inner()[offset_hint]; 659| 2.85k| auto lsize = offset_hint << p.shift(); 660| 2.85k| auto size = p.this_size(); 661| 2.85k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.85k| return is_full ------------------ | Branch (662:12): [True: 760, False: 2.09k] ------------------ 663| 2.85k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 760] ------------------ 664| 760| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 760| : make_full_pos(child, p.shift() - B) 666| 760| .visit(v, idx - lsize, args...)) 667| 2.85k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 2.09k] ------------------ 668| 2.09k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 2.09k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 2.09k| .visit(v, idx - lsize, args...)); 672| 2.85k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1405| 760| { 1406| 760| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 760| } _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| 2.09k| { 1037| 2.09k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.09k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaPT_j: 766| 7.32k|{ 767| 7.32k| assert(leaf); ------------------ | Branch (767:5): [True: 7.32k, False: 0] ------------------ 768| 7.32k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 7.32k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 7.32k, False: 0] ------------------ 769| 7.32k| assert(count > 0); ------------------ | Branch (769:5): [True: 7.32k, False: 0] ------------------ 770| 7.32k| return singleton_regular_sub_pos{leaf, count}; 771| 7.32k|} _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.32k| { 760| 7.32k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 7.32k| } _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.32k|{ 1839| 7.32k| assert(node); ------------------ | Branch (1839:5): [True: 7.32k, False: 0] ------------------ 1840| 7.32k| auto relaxed = node->relaxed(); 1841| 7.32k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.99k, False: 2.32k] ------------------ 1842| 4.99k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.99k, False: 0] ------------------ 1843| 4.99k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.99k| .visit(v, std::forward(args)...); 1845| 4.99k| } else { 1846| 2.32k| return make_regular_sub_pos(node, shift, size) 1847| 2.32k| .visit(v, std::forward(args)...); 1848| 2.32k| } 1849| 7.32k|} _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| 4.99k| { 1814| 4.99k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.99k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 735| 25.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.32k| { 745| 7.32k| } _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| 8.51M| { 145| 8.51M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.51M| } _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| 119M| { 1814| 119M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 119M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 707| 3.58M| { 708| 3.58M| } _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.32k| { 745| 7.32k| } _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| 8.51M| { 145| 8.51M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.51M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 137| 8.51M| 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| 119M| { 1814| 119M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 119M| } _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.58M| { 708| 3.58M| } _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| 17.0k| { 1763| 17.0k| auto child = node_->inner()[0]; 1764| 17.0k| auto child_size = relaxed_->d.sizes[0]; 1765| 17.0k| auto is_leaf = shift_ == BL; 1766| 17.0k| assert(child_size); ------------------ | Branch (1766:9): [True: 17.0k, False: 0] ------------------ 1767| 17.0k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 17.0k] ------------------ 1768| 17.0k| : visit_maybe_relaxed_sub( 1769| 17.0k| child, shift_ - B, child_size, v, args...); 1770| 17.0k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 76| 7.32k| 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| 4.18M| 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| 17.0k|{ 1839| 17.0k| assert(node); ------------------ | Branch (1839:5): [True: 17.0k, False: 0] ------------------ 1840| 17.0k| auto relaxed = node->relaxed(); 1841| 17.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 16.7k, False: 297] ------------------ 1842| 16.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 16.7k, False: 0] ------------------ 1843| 16.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 16.7k| .visit(v, std::forward(args)...); 1845| 16.7k| } else { 1846| 297| return make_regular_sub_pos(node, shift, size) 1847| 297| .visit(v, std::forward(args)...); 1848| 297| } 1849| 17.0k|} _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| 16.7k| { 1814| 16.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 16.7k| } _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| 297| { 1037| 297| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 297| } _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| 722| { 971| 722| auto is_leaf = shift_ == BL; 972| 722| auto child = node_->inner()[0]; 973| 722| auto is_full = size_ >= (size_t{1} << shift_); 974| 722| return is_full ------------------ | Branch (974:16): [True: 722, False: 0] ------------------ 975| 722| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 722] ------------------ 976| 722| ? make_full_leaf_pos(child).visit(v, args...) 977| 722| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 722| : (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| 722| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 201| 413k| 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| 1.03k| { 1406| 1.03k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.03k| } _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| 313| { 1362| 313| auto is_leaf = shift_ == BL; 1363| 313| auto child = node_->inner()[0]; 1364| 313| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 313] ------------------ 1365| 313| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 313| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 711| 61.9k| { 712| 61.9k| } _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| 12.5k| { 1305| 12.5k| each_i(v, 1, branches, args...); 1306| 12.5k| } _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| 12.5k| { 1264| 12.5k| auto p = node_->inner() + i; 1265| 12.5k| auto e = node_->inner() + n; 1266| 12.5k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 8.27k, False: 4.25k] ------------------ 1267| 66.2k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 57.9k, False: 8.27k] ------------------ 1268| 57.9k| IMMER_PREFETCH(p + 1); 1269| 57.9k| make_full_leaf_pos(*p).visit(v, args...); 1270| 57.9k| } 1271| 8.27k| } else { 1272| 4.25k| auto ss = shift_ - B; 1273| 34.0k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 29.8k, False: 4.25k] ------------------ 1274| 29.8k| make_full_pos(*p, ss).visit(v, args...); 1275| 4.25k| } 1276| 12.5k| } _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| 6.01M| { 208| 6.01M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.01M| } _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| 503k| { 1406| 503k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 503k| } _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| 61.9k| { 712| 61.9k| } _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| 12.5k| { 1305| 12.5k| each_i(v, 1, branches, args...); 1306| 12.5k| } _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| 12.5k| { 1264| 12.5k| auto p = node_->inner() + i; 1265| 12.5k| auto e = node_->inner() + n; 1266| 12.5k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 8.27k, False: 4.25k] ------------------ 1267| 66.2k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 57.9k, False: 8.27k] ------------------ 1268| 57.9k| IMMER_PREFETCH(p + 1); 1269| 57.9k| make_full_leaf_pos(*p).visit(v, args...); 1270| 57.9k| } 1271| 8.27k| } else { 1272| 4.25k| auto ss = shift_ - B; 1273| 34.0k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 29.8k, False: 4.25k] ------------------ 1274| 29.8k| make_full_pos(*p, ss).visit(v, args...); 1275| 4.25k| } 1276| 12.5k| } _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| 6.01M| { 208| 6.01M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.01M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 200| 6.01M| 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| 503k| { 1406| 503k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 503k| } _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| 722| { 754| 722| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 722| } _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| 722| { 145| 722| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 722| } _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| 722| { 1371| 722| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 722, False: 0] ------------------ 1372| 722| auto child = node_->inner()[0]; 1373| 722| return make_full_leaf_pos(child).visit(v, args...); 1374| 722| } _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.62k| { 208| 2.62k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.62k| } _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| 413k| { 907| 413k| if (count() > 1) ------------------ | Branch (907:13): [True: 404k, False: 9.34k] ------------------ 908| 404k| each_right_sub_(v, 1, args...); 909| 413k| } _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| 404k| { 880| 404k| auto last = count() - 1; 881| 404k| auto lsize = size_ - (last << shift_); 882| 404k| auto n = node()->inner() + i; 883| 404k| auto e = node()->inner() + last; 884| 404k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 396k, False: 8.27k] ------------------ 885| 2.76M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.36M, False: 396k] ------------------ 886| 2.36M| IMMER_PREFETCH(n + 1); 887| 2.36M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.36M| } 889| 396k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 396k| } else { 891| 8.27k| auto ss = shift_ - B; 892| 20.9k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 12.6k, False: 8.27k] ------------------ 893| 12.6k| make_full_pos(*n, ss).visit(v, args...); 894| 8.27k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 8.27k| } 896| 404k| } _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| 4.25M| { 1037| 4.25M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.25M| } _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| 413k| { 907| 413k| if (count() > 1) ------------------ | Branch (907:13): [True: 404k, False: 9.34k] ------------------ 908| 404k| each_right_sub_(v, 1, args...); 909| 413k| } _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| 404k| { 880| 404k| auto last = count() - 1; 881| 404k| auto lsize = size_ - (last << shift_); 882| 404k| auto n = node()->inner() + i; 883| 404k| auto e = node()->inner() + last; 884| 404k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 396k, False: 8.27k] ------------------ 885| 2.76M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.36M, False: 396k] ------------------ 886| 2.36M| IMMER_PREFETCH(n + 1); 887| 2.36M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.36M| } 889| 396k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 396k| } else { 891| 8.27k| auto ss = shift_ - B; 892| 20.9k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 12.6k, False: 8.27k] ------------------ 893| 12.6k| make_full_pos(*n, ss).visit(v, args...); 894| 8.27k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 8.27k| } 896| 404k| } _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| 4.25M| { 1037| 4.25M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.25M| } _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.90k| { 754| 1.90k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 1.90k| } _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.90k| { 145| 1.90k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.90k| } _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.90k| { 987| 1.90k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 1.90k, False: 0] ------------------ 988| 1.90k| auto child = node_->inner()[0]; 989| 1.90k| auto is_full = size_ >= branches; 990| 1.90k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 1.90k, False: 0] ------------------ 991| 1.90k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 1.90k| } _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| 4.69k| { 145| 4.69k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.69k| } _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| 10.1M| { 1648| 10.1M| each_right(v, 1, std::forward(args)...); 1649| 10.1M| } _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| 10.1M| { 1654| 10.1M| assert(start > 0); ------------------ | Branch (1654:9): [True: 10.1M, False: 0] ------------------ 1655| 10.1M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 10.1M, False: 0] ------------------ 1656| 10.1M| auto s = relaxed_->d.sizes[start - 1]; 1657| 10.1M| auto p = node_->inner(); 1658| 10.1M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 735k, False: 9.41M] ------------------ 1659| 3.75M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 3.02M, False: 735k] ------------------ 1660| 3.02M| IMMER_PREFETCH(p + i + 1); 1661| 3.02M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 3.02M| .visit(v, args...); 1663| 3.02M| s = relaxed_->d.sizes[i]; 1664| 3.02M| assert(s); ------------------ | Branch (1664:17): [True: 3.02M, False: 0] ------------------ 1665| 3.02M| } 1666| 9.41M| } else { 1667| 9.41M| auto ss = shift_ - B; 1668| 68.4M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 59.0M, False: 9.41M] ------------------ 1669| 59.0M| visit_maybe_relaxed_sub( 1670| 59.0M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 59.0M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 59.0M, False: 0] ------------------ 1673| 59.0M| } 1674| 9.41M| } 1675| 10.1M| } _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| 101M|{ 1839| 101M| assert(node); ------------------ | Branch (1839:5): [True: 101M, False: 0] ------------------ 1840| 101M| auto relaxed = node->relaxed(); 1841| 101M| if (relaxed) { ------------------ | Branch (1841:9): [True: 97.4M, False: 4.24M] ------------------ 1842| 97.4M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 97.4M, False: 0] ------------------ 1843| 97.4M| return make_relaxed_pos(node, shift, relaxed) 1844| 97.4M| .visit(v, std::forward(args)...); 1845| 97.4M| } else { 1846| 4.24M| return make_regular_sub_pos(node, shift, size) 1847| 4.24M| .visit(v, std::forward(args)...); 1848| 4.24M| } 1849| 101M|} _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| 10.1M| { 1648| 10.1M| each_right(v, 1, std::forward(args)...); 1649| 10.1M| } _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| 10.1M| { 1654| 10.1M| assert(start > 0); ------------------ | Branch (1654:9): [True: 10.1M, False: 0] ------------------ 1655| 10.1M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 10.1M, False: 0] ------------------ 1656| 10.1M| auto s = relaxed_->d.sizes[start - 1]; 1657| 10.1M| auto p = node_->inner(); 1658| 10.1M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 735k, False: 9.41M] ------------------ 1659| 3.75M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 3.02M, False: 735k] ------------------ 1660| 3.02M| IMMER_PREFETCH(p + i + 1); 1661| 3.02M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 3.02M| .visit(v, args...); 1663| 3.02M| s = relaxed_->d.sizes[i]; 1664| 3.02M| assert(s); ------------------ | Branch (1664:17): [True: 3.02M, False: 0] ------------------ 1665| 3.02M| } 1666| 9.41M| } else { 1667| 9.41M| auto ss = shift_ - B; 1668| 68.4M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 59.0M, False: 9.41M] ------------------ 1669| 59.0M| visit_maybe_relaxed_sub( 1670| 59.0M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 59.0M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 59.0M, False: 0] ------------------ 1673| 59.0M| } 1674| 9.41M| } 1675| 10.1M| } _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| 101M|{ 1839| 101M| assert(node); ------------------ | Branch (1839:5): [True: 101M, False: 0] ------------------ 1840| 101M| auto relaxed = node->relaxed(); 1841| 101M| if (relaxed) { ------------------ | Branch (1841:9): [True: 97.4M, False: 4.24M] ------------------ 1842| 97.4M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 97.4M, False: 0] ------------------ 1843| 97.4M| return make_relaxed_pos(node, shift, relaxed) 1844| 97.4M| .visit(v, std::forward(args)...); 1845| 97.4M| } else { 1846| 4.24M| return make_regular_sub_pos(node, shift, size) 1847| 4.24M| .visit(v, std::forward(args)...); 1848| 4.24M| } 1849| 101M|} _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| 4.69k| { 754| 4.69k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 4.69k| } _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| 4.69k| { 145| 4.69k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.69k| } _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| 4.69k| { 1775| 4.69k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 4.69k, False: 0] ------------------ 1776| 4.69k| auto child = node_->inner()[0]; 1777| 4.69k| auto child_size = relaxed_->d.sizes[0]; 1778| 4.69k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 4.69k| } _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.32k| { 1037| 2.32k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.32k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcPT_jmT0_DpOT1_: 1838| 1.14M|{ 1839| 1.14M| assert(node); ------------------ | Branch (1839:5): [True: 1.14M, False: 0] ------------------ 1840| 1.14M| auto relaxed = node->relaxed(); 1841| 1.14M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.12M, False: 16.7k] ------------------ 1842| 1.12M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.12M, False: 0] ------------------ 1843| 1.12M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.12M| .visit(v, std::forward(args)...); 1845| 1.12M| } else { 1846| 16.7k| return make_regular_sub_pos(node, shift, size) 1847| 16.7k| .visit(v, std::forward(args)...); 1848| 16.7k| } 1849| 1.14M|} _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.12M| { 1814| 1.12M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.12M| } _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.12M|{ 1839| 1.12M| assert(node); ------------------ | Branch (1839:5): [True: 1.12M, False: 0] ------------------ 1840| 1.12M| auto relaxed = node->relaxed(); 1841| 1.12M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.11M, False: 6.83k] ------------------ 1842| 1.11M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.11M, False: 0] ------------------ 1843| 1.11M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.11M| .visit(v, std::forward(args)...); 1845| 1.11M| } else { 1846| 6.83k| return make_regular_sub_pos(node, shift, size) 1847| 6.83k| .visit(v, std::forward(args)...); 1848| 6.83k| } 1849| 1.12M|} _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.11M| { 1814| 1.11M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.11M| } _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.56M| { 1751| 3.56M| auto offset = relaxed_->d.count - 1; 1752| 3.56M| auto child = node_->inner()[offset]; 1753| 3.56M| auto child_size = size(offset); 1754| 3.56M| auto is_leaf = shift_ == BL; 1755| 3.56M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 3.56M] ------------------ 1756| 3.56M| : visit_maybe_relaxed_sub( 1757| 3.56M| child, shift_ - B, child_size, v, args...); 1758| 3.56M| } _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.56M|{ 1839| 3.56M| assert(node); ------------------ | Branch (1839:5): [True: 3.56M, False: 0] ------------------ 1840| 3.56M| auto relaxed = node->relaxed(); 1841| 3.56M| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.56M, False: 2.23k] ------------------ 1842| 3.56M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.56M, False: 0] ------------------ 1843| 3.56M| return make_relaxed_pos(node, shift, relaxed) 1844| 3.56M| .visit(v, std::forward(args)...); 1845| 3.56M| } else { 1846| 2.23k| return make_regular_sub_pos(node, shift, size) 1847| 2.23k| .visit(v, std::forward(args)...); 1848| 2.23k| } 1849| 3.56M|} _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.56M| { 1814| 3.56M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.56M| } _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.76k| { 1037| 4.76k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.76k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 958| 2.52k| { 959| 2.52k| auto offset = count() - 1; 960| 2.52k| auto child = node_->inner()[offset]; 961| 2.52k| auto is_leaf = shift_ == BL; 962| 2.52k| auto lsize = size_ - (size_t{offset} << shift_); 963| 2.52k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 2.52k] ------------------ 964| 2.52k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 2.52k| .visit(v, args...); 966| 2.52k| } _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.54M| { 914| 1.54M| each_left(v, count() - 1, args...); 915| 1.54M| } _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.54M| { 874| 1.54M| return each_left_regular(*this, v, last, args...); 875| 1.54M| } _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.54M|{ 576| 1.54M| constexpr auto B = bits; 577| 1.54M| constexpr auto BL = bits_leaf; 578| 1.54M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.54M, False: 0] ------------------ 579| 1.54M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 865k, False: 680k] ------------------ 580| 865k| auto n = p.node()->inner(); 581| 865k| auto e = n + last; 582| 4.45M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.58M, False: 865k] ------------------ 583| 3.58M| IMMER_PREFETCH(n + 1); 584| 3.58M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.58M| } 586| 865k| } else { 587| 680k| auto n = p.node()->inner(); 588| 680k| auto e = n + last; 589| 680k| auto ss = p.shift() - B; 590| 1.14M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 460k, False: 680k] ------------------ 591| 460k| make_full_pos(*n, ss).visit(v, args...); 592| 680k| } 593| 1.54M|} _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.54M| { 914| 1.54M| each_left(v, count() - 1, args...); 915| 1.54M| } _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.54M| { 874| 1.54M| return each_left_regular(*this, v, last, args...); 875| 1.54M| } _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.54M|{ 576| 1.54M| constexpr auto B = bits; 577| 1.54M| constexpr auto BL = bits_leaf; 578| 1.54M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.54M, False: 0] ------------------ 579| 1.54M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 865k, False: 680k] ------------------ 580| 865k| auto n = p.node()->inner(); 581| 865k| auto e = n + last; 582| 4.45M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.58M, False: 865k] ------------------ 583| 3.58M| IMMER_PREFETCH(n + 1); 584| 3.58M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.58M| } 586| 865k| } else { 587| 680k| auto n = p.node()->inner(); 588| 680k| auto e = n + last; 589| 680k| auto ss = p.shift() - B; 590| 1.14M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 460k, False: 680k] ------------------ 591| 460k| make_full_pos(*n, ss).visit(v, args...); 592| 680k| } 593| 1.54M|} _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.52M| { 1763| 1.52M| auto child = node_->inner()[0]; 1764| 1.52M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.52M| auto is_leaf = shift_ == BL; 1766| 1.52M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.52M, False: 0] ------------------ 1767| 1.52M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.52M] ------------------ 1768| 1.52M| : visit_maybe_relaxed_sub( 1769| 1.52M| child, shift_ - B, child_size, v, args...); 1770| 1.52M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 106| 1.14M| 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.52M|{ 1839| 1.52M| assert(node); ------------------ | Branch (1839:5): [True: 1.52M, False: 0] ------------------ 1840| 1.52M| auto relaxed = node->relaxed(); 1841| 1.52M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.12M, False: 393k] ------------------ 1842| 1.12M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.12M, False: 0] ------------------ 1843| 1.12M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.12M| .visit(v, std::forward(args)...); 1845| 1.12M| } else { 1846| 393k| return make_regular_sub_pos(node, shift, size) 1847| 393k| .visit(v, std::forward(args)...); 1848| 393k| } 1849| 1.52M|} _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.12M| { 1814| 1.12M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.12M| } _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| 393k| { 1037| 393k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 393k| } _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| 887| { 959| 887| auto offset = count() - 1; 960| 887| auto child = node_->inner()[offset]; 961| 887| auto is_leaf = shift_ == BL; 962| 887| auto lsize = size_ - (size_t{offset} << shift_); 963| 887| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 887] ------------------ 964| 887| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 887| .visit(v, args...); 966| 887| } _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| 6.43k| { 971| 6.43k| auto is_leaf = shift_ == BL; 972| 6.43k| auto child = node_->inner()[0]; 973| 6.43k| auto is_full = size_ >= (size_t{1} << shift_); 974| 6.43k| return is_full ------------------ | Branch (974:16): [True: 6.43k, False: 0] ------------------ 975| 6.43k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 6.43k] ------------------ 976| 6.43k| ? make_full_leaf_pos(child).visit(v, args...) 977| 6.43k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 6.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| 6.43k| } _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| 9.89k| { 1406| 9.89k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 9.89k| } _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| 3.45k| { 1362| 3.45k| auto is_leaf = shift_ == BL; 1363| 3.45k| auto child = node_->inner()[0]; 1364| 3.45k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 3.45k] ------------------ 1365| 3.45k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 3.45k| } _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| 9.68k| { 959| 9.68k| auto offset = count() - 1; 960| 9.68k| auto child = node_->inner()[offset]; 961| 9.68k| auto is_leaf = shift_ == BL; 962| 9.68k| auto lsize = size_ - (size_t{offset} << shift_); 963| 9.68k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 6.64k, False: 3.03k] ------------------ 964| 9.68k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 3.03k| .visit(v, args...); 966| 9.68k| } _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| 7.55k| { 145| 7.55k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.55k| } _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| 7.55k| { 1371| 7.55k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 7.55k, False: 0] ------------------ 1372| 7.55k| auto child = node_->inner()[0]; 1373| 7.55k| return make_full_leaf_pos(child).visit(v, args...); 1374| 7.55k| } _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| 411k| { 208| 411k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 411k| } _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| 3.25k| { 1037| 3.25k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.25k| } _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| 403k| { 959| 403k| auto offset = count() - 1; 960| 403k| auto child = node_->inner()[offset]; 961| 403k| auto is_leaf = shift_ == BL; 962| 403k| auto lsize = size_ - (size_t{offset} << shift_); 963| 403k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 401k, False: 2.23k] ------------------ 964| 403k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 2.23k| .visit(v, args...); 966| 403k| } _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| 403k| { 145| 403k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 403k| } _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| 403k| { 987| 403k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 403k, False: 0] ------------------ 988| 403k| auto child = node_->inner()[0]; 989| 403k| auto is_full = size_ >= branches; 990| 403k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 403k, False: 0] ------------------ 991| 403k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 403k| } _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| 730k| { 145| 730k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 730k| } _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| 5.97k| { 1037| 5.97k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.97k| } _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.12M| { 959| 1.12M| auto offset = count() - 1; 960| 1.12M| auto child = node_->inner()[offset]; 961| 1.12M| auto is_leaf = shift_ == BL; 962| 1.12M| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.12M| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 457k, False: 671k] ------------------ 964| 1.12M| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 671k| .visit(v, args...); 966| 1.12M| } _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| 730k| { 145| 730k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 730k| } _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| 730k| { 1775| 730k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 730k, False: 0] ------------------ 1776| 730k| auto child = node_->inner()[0]; 1777| 730k| auto child_size = relaxed_->d.sizes[0]; 1778| 730k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 730k| } _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.51M| { 1037| 1.51M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.51M| } _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| 12.5M| { 1618| 12.5M| each_left(v, relaxed_->d.count - 1, args...); 1619| 12.5M| } _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| 12.5M| { 1624| 12.5M| auto p = node_->inner(); 1625| 12.5M| auto s = size_t{}; 1626| 12.5M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 276k, False: 12.2M] ------------------ 1627| 1.93M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 1.65M, False: 276k] ------------------ 1628| 1.65M| IMMER_PREFETCH(p + i + 1); 1629| 1.65M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 1.65M| .visit(v, args...); 1631| 1.65M| s = relaxed_->d.sizes[i]; 1632| 1.65M| assert(s); ------------------ | Branch (1632:17): [True: 1.65M, False: 0] ------------------ 1633| 1.65M| } 1634| 12.2M| } else { 1635| 12.2M| auto ss = shift_ - B; 1636| 54.9M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 42.6M, False: 12.2M] ------------------ 1637| 42.6M| visit_maybe_relaxed_sub( 1638| 42.6M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 42.6M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 42.6M, False: 0] ------------------ 1641| 42.6M| } 1642| 12.2M| } 1643| 12.5M| } _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| 12.5M| { 1618| 12.5M| each_left(v, relaxed_->d.count - 1, args...); 1619| 12.5M| } _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| 12.5M| { 1624| 12.5M| auto p = node_->inner(); 1625| 12.5M| auto s = size_t{}; 1626| 12.5M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 276k, False: 12.2M] ------------------ 1627| 1.93M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 1.65M, False: 276k] ------------------ 1628| 1.65M| IMMER_PREFETCH(p + i + 1); 1629| 1.65M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 1.65M| .visit(v, args...); 1631| 1.65M| s = relaxed_->d.sizes[i]; 1632| 1.65M| assert(s); ------------------ | Branch (1632:17): [True: 1.65M, False: 0] ------------------ 1633| 1.65M| } 1634| 12.2M| } else { 1635| 12.2M| auto ss = shift_ - B; 1636| 54.9M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 42.6M, False: 12.2M] ------------------ 1637| 42.6M| visit_maybe_relaxed_sub( 1638| 42.6M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 42.6M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 42.6M, False: 0] ------------------ 1641| 42.6M| } 1642| 12.2M| } 1643| 12.5M| } _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.87M| { 1763| 7.87M| auto child = node_->inner()[0]; 1764| 7.87M| auto child_size = relaxed_->d.sizes[0]; 1765| 7.87M| auto is_leaf = shift_ == BL; 1766| 7.87M| assert(child_size); ------------------ | Branch (1766:9): [True: 7.87M, False: 0] ------------------ 1767| 7.87M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 7.87M] ------------------ 1768| 7.87M| : visit_maybe_relaxed_sub( 1769| 7.87M| child, shift_ - B, child_size, v, args...); 1770| 7.87M| } _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.87M|{ 1839| 7.87M| assert(node); ------------------ | Branch (1839:5): [True: 7.87M, False: 0] ------------------ 1840| 7.87M| auto relaxed = node->relaxed(); 1841| 7.87M| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.87M, False: 572] ------------------ 1842| 7.87M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.87M, False: 0] ------------------ 1843| 7.87M| return make_relaxed_pos(node, shift, relaxed) 1844| 7.87M| .visit(v, std::forward(args)...); 1845| 7.87M| } else { 1846| 572| return make_regular_sub_pos(node, shift, size) 1847| 572| .visit(v, std::forward(args)...); 1848| 572| } 1849| 7.87M|} _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.87M| { 1814| 7.87M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.87M| } _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| 572| { 1037| 572| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 572| } _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| 10.1k| { 1751| 10.1k| auto offset = relaxed_->d.count - 1; 1752| 10.1k| auto child = node_->inner()[offset]; 1753| 10.1k| auto child_size = size(offset); 1754| 10.1k| auto is_leaf = shift_ == BL; 1755| 10.1k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 10.1k] ------------------ 1756| 10.1k| : visit_maybe_relaxed_sub( 1757| 10.1k| child, shift_ - B, child_size, v, args...); 1758| 10.1k| } _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| 10.1k|{ 1839| 10.1k| assert(node); ------------------ | Branch (1839:5): [True: 10.1k, False: 0] ------------------ 1840| 10.1k| auto relaxed = node->relaxed(); 1841| 10.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.72k, False: 451] ------------------ 1842| 9.72k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.72k, False: 0] ------------------ 1843| 9.72k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.72k| .visit(v, std::forward(args)...); 1845| 9.72k| } else { 1846| 451| return make_regular_sub_pos(node, shift, size) 1847| 451| .visit(v, std::forward(args)...); 1848| 451| } 1849| 10.1k|} _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| 9.72k| { 1814| 9.72k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 9.72k| } _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.11k| { 971| 1.11k| auto is_leaf = shift_ == BL; 972| 1.11k| auto child = node_->inner()[0]; 973| 1.11k| auto is_full = size_ >= (size_t{1} << shift_); 974| 1.11k| return is_full ------------------ | Branch (974:16): [True: 1.11k, False: 0] ------------------ 975| 1.11k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 1.11k] ------------------ 976| 1.11k| ? make_full_leaf_pos(child).visit(v, args...) 977| 1.11k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 1.11k| : (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.11k| } _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.61k| { 1406| 1.61k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.61k| } _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| 494| { 1362| 494| auto is_leaf = shift_ == BL; 1363| 494| auto child = node_->inner()[0]; 1364| 494| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 494] ------------------ 1365| 494| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 494| } _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.41k| { 1751| 1.41k| auto offset = relaxed_->d.count - 1; 1752| 1.41k| auto child = node_->inner()[offset]; 1753| 1.41k| auto child_size = size(offset); 1754| 1.41k| auto is_leaf = shift_ == BL; 1755| 1.41k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 907, False: 509] ------------------ 1756| 1.41k| : visit_maybe_relaxed_sub( 1757| 509| child, shift_ - B, child_size, v, args...); 1758| 1.41k| } _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| 509|{ 1839| 509| assert(node); ------------------ | Branch (1839:5): [True: 509, False: 0] ------------------ 1840| 509| auto relaxed = node->relaxed(); 1841| 509| if (relaxed) { ------------------ | Branch (1841:9): [True: 298, False: 211] ------------------ 1842| 298| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 298, False: 0] ------------------ 1843| 298| return make_relaxed_pos(node, shift, relaxed) 1844| 298| .visit(v, std::forward(args)...); 1845| 298| } else { 1846| 211| return make_regular_sub_pos(node, shift, size) 1847| 211| .visit(v, std::forward(args)...); 1848| 211| } 1849| 509|} _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| 298| { 1814| 298| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 298| } _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| 6.28k| { 1751| 6.28k| auto offset = relaxed_->d.count - 1; 1752| 6.28k| auto child = node_->inner()[offset]; 1753| 6.28k| auto child_size = size(offset); 1754| 6.28k| auto is_leaf = shift_ == BL; 1755| 6.28k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 2.10k, False: 4.18k] ------------------ 1756| 6.28k| : visit_maybe_relaxed_sub( 1757| 4.18k| child, shift_ - B, child_size, v, args...); 1758| 6.28k| } _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| 4.18k|{ 1839| 4.18k| assert(node); ------------------ | Branch (1839:5): [True: 4.18k, False: 0] ------------------ 1840| 4.18k| auto relaxed = node->relaxed(); 1841| 4.18k| if (relaxed) { ------------------ | Branch (1841:9): [True: 448, False: 3.74k] ------------------ 1842| 448| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 448, False: 0] ------------------ 1843| 448| return make_relaxed_pos(node, shift, relaxed) 1844| 448| .visit(v, std::forward(args)...); 1845| 3.74k| } else { 1846| 3.74k| return make_regular_sub_pos(node, shift, size) 1847| 3.74k| .visit(v, std::forward(args)...); 1848| 3.74k| } 1849| 4.18k|} _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| 448| { 1814| 448| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 448| } _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.95M| { 1751| 8.95M| auto offset = relaxed_->d.count - 1; 1752| 8.95M| auto child = node_->inner()[offset]; 1753| 8.95M| auto child_size = size(offset); 1754| 8.95M| auto is_leaf = shift_ == BL; 1755| 8.95M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 273k, False: 8.68M] ------------------ 1756| 8.95M| : visit_maybe_relaxed_sub( 1757| 8.68M| child, shift_ - B, child_size, v, args...); 1758| 8.95M| } _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| 8.68M|{ 1839| 8.68M| assert(node); ------------------ | Branch (1839:5): [True: 8.68M, False: 0] ------------------ 1840| 8.68M| auto relaxed = node->relaxed(); 1841| 8.68M| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.83M, False: 841k] ------------------ 1842| 7.83M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.83M, False: 0] ------------------ 1843| 7.83M| return make_relaxed_pos(node, shift, relaxed) 1844| 7.83M| .visit(v, std::forward(args)...); 1845| 7.83M| } else { 1846| 841k| return make_regular_sub_pos(node, shift, size) 1847| 841k| .visit(v, std::forward(args)...); 1848| 841k| } 1849| 8.68M|} _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.83M| { 1814| 7.83M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.83M| } _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| 6.83k| { 1037| 6.83k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.83k| } _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.7k| { 1037| 16.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 16.7k| } _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.7k|{ 1839| 16.7k| assert(node); ------------------ | Branch (1839:5): [True: 16.7k, False: 0] ------------------ 1840| 16.7k| auto relaxed = node->relaxed(); 1841| 16.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.89k, False: 9.84k] ------------------ 1842| 6.89k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.89k, False: 0] ------------------ 1843| 6.89k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.89k| .visit(v, std::forward(args)...); 1845| 9.84k| } else { 1846| 9.84k| return make_regular_sub_pos(node, shift, size) 1847| 9.84k| .visit(v, std::forward(args)...); 1848| 9.84k| } 1849| 16.7k|} _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.89k| { 1814| 6.89k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.89k| } _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| 9.84k| { 1037| 9.84k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 9.84k| } _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| 215k| { 1814| 215k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 215k| } _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| 209k| { 1738| 209k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 209k, False: 0] ------------------ 1739| 209k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 209k, False: 0] ------------------ 1740| 209k| auto child = node_->inner()[offset_hint]; 1741| 209k| auto is_leaf = shift_ == BL; 1742| 209k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 209k] ------------------ 1743| 209k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 209k| : visit_maybe_relaxed_sub( 1745| 209k| child, shift_ - B, child_size_hint, v, args...); 1746| 209k| } _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| 209k|{ 1839| 209k| assert(node); ------------------ | Branch (1839:5): [True: 209k, False: 0] ------------------ 1840| 209k| auto relaxed = node->relaxed(); 1841| 209k| if (relaxed) { ------------------ | Branch (1841:9): [True: 39.2k, False: 170k] ------------------ 1842| 39.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 39.2k, False: 0] ------------------ 1843| 39.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 39.2k| .visit(v, std::forward(args)...); 1845| 170k| } else { 1846| 170k| return make_regular_sub_pos(node, shift, size) 1847| 170k| .visit(v, std::forward(args)...); 1848| 170k| } 1849| 209k|} _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| 170k| { 1037| 170k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 170k| } _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| 339k| { 953| 339k| return last_oh_regular(*this, v, offset_hint, args...); 954| 339k| } _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| 339k|{ 678| 339k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 339k, False: 0] ------------------ 679| 339k| constexpr auto B = bits; 680| 339k| constexpr auto BL = bits_leaf; 681| 339k| auto child = p.node()->inner()[offset_hint]; 682| 339k| auto is_leaf = p.shift() == BL; 683| 339k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 339k] ------------------ 684| 339k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 339k| .visit(v, args...); 686| 339k|} _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.08M| { 337| 1.08M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.08M| } _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| 748k| { 331| 748k| return last_oh_regular(*this, v, offset_hint, args...); 332| 748k| } _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| 748k|{ 678| 748k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 748k, False: 0] ------------------ 679| 748k| constexpr auto B = bits; 680| 748k| constexpr auto BL = bits_leaf; 681| 748k| auto child = p.node()->inner()[offset_hint]; 682| 748k| auto is_leaf = p.shift() == BL; 683| 748k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 748k] ------------------ 684| 748k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 748k| .visit(v, args...); 686| 748k|} _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.69k| { 331| 2.69k| return last_oh_regular(*this, v, offset_hint, args...); 332| 2.69k| } _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.69k|{ 678| 2.69k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 2.69k, False: 0] ------------------ 679| 2.69k| constexpr auto B = bits; 680| 2.69k| constexpr auto BL = bits_leaf; 681| 2.69k| auto child = p.node()->inner()[offset_hint]; 682| 2.69k| auto is_leaf = p.shift() == BL; 683| 2.69k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 2.69k] ------------------ 684| 2.69k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 2.69k| .visit(v, args...); 686| 2.69k|} _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.33k| { 337| 4.33k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.33k| } _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| 8.09k| { 1738| 8.09k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 8.09k, False: 0] ------------------ 1739| 8.09k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 8.09k, False: 0] ------------------ 1740| 8.09k| auto child = node_->inner()[offset_hint]; 1741| 8.09k| auto is_leaf = shift_ == BL; 1742| 8.09k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 8.09k] ------------------ 1743| 8.09k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 8.09k| : visit_maybe_relaxed_sub( 1745| 8.09k| child, shift_ - B, child_size_hint, v, args...); 1746| 8.09k| } _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| 8.09k|{ 1839| 8.09k| assert(node); ------------------ | Branch (1839:5): [True: 8.09k, False: 0] ------------------ 1840| 8.09k| auto relaxed = node->relaxed(); 1841| 8.09k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.01k, False: 1.08k] ------------------ 1842| 7.01k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.01k, False: 0] ------------------ 1843| 7.01k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.01k| .visit(v, std::forward(args)...); 1845| 7.01k| } else { 1846| 1.08k| return make_regular_sub_pos(node, shift, size) 1847| 1.08k| .visit(v, std::forward(args)...); 1848| 1.08k| } 1849| 8.09k|} _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| 7.01k| { 1814| 7.01k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.01k| } _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.08k| { 1037| 1.08k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.08k| } _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| 181k| { 1037| 181k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 181k| } _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| 21.6k|{ 1839| 21.6k| assert(node); ------------------ | Branch (1839:5): [True: 21.6k, False: 0] ------------------ 1840| 21.6k| auto relaxed = node->relaxed(); 1841| 21.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 18.6k, False: 2.98k] ------------------ 1842| 18.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 18.6k, False: 0] ------------------ 1843| 18.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 18.6k| .visit(v, std::forward(args)...); 1845| 18.6k| } else { 1846| 2.98k| return make_regular_sub_pos(node, shift, size) 1847| 2.98k| .visit(v, std::forward(args)...); 1848| 2.98k| } 1849| 21.6k|} _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| 18.6k| { 1814| 18.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 18.6k| } _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| 113k| { 1687| 113k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 113k, False: 0] ------------------ 1688| 113k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 23.2k, False: 90.3k] ------------------ 1689| 113k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 113k| } _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| 113k| { 1699| 113k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 113k| } _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| 113k| { 1718| 113k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 113k, False: 0] ------------------ 1719| 113k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 23.2k, False: 90.3k] | Branch (1719:9): [True: 113k, False: 0] ------------------ 1720| 113k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 113k| auto child = node_->inner()[offset_hint]; 1722| 113k| auto is_leaf = shift_ == BL; 1723| 113k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 113k| auto next_idx = idx - left_size_hint; 1725| 113k| return is_leaf ------------------ | Branch (1725:16): [True: 16.8k, False: 96.8k] ------------------ 1726| 113k| ? make_leaf_sub_pos(child, next_size) 1727| 16.8k| .visit(v, next_idx, args...) 1728| 113k| : visit_maybe_relaxed_sub( 1729| 96.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 113k| } _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| 16.8k| { 145| 16.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 16.8k| } _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| 96.8k|{ 1839| 96.8k| assert(node); ------------------ | Branch (1839:5): [True: 96.8k, False: 0] ------------------ 1840| 96.8k| auto relaxed = node->relaxed(); 1841| 96.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 95.0k, False: 1.82k] ------------------ 1842| 95.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 95.0k, False: 0] ------------------ 1843| 95.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 95.0k| .visit(v, std::forward(args)...); 1845| 95.0k| } else { 1846| 1.82k| return make_regular_sub_pos(node, shift, size) 1847| 1.82k| .visit(v, std::forward(args)...); 1848| 1.82k| } 1849| 96.8k|} _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| 95.0k| { 1814| 95.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 95.0k| } _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| 1.82k| { 1037| 1.82k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.82k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 938| 4.81k| { 939| 4.81k| return towards_oh_ch_regular( 940| 4.81k| *this, v, idx, offset_hint, count(), args...); 941| 4.81k| } _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.81k|{ 633| 4.81k| constexpr auto B = bits; 634| 4.81k| constexpr auto BL = bits_leaf; 635| 4.81k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.81k, False: 0] ------------------ 636| 4.81k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.81k, False: 0] ------------------ 637| 4.81k| auto is_leaf = p.shift() == BL; 638| 4.81k| auto child = p.node()->inner()[offset_hint]; 639| 4.81k| auto is_full = offset_hint + 1 != count_hint; 640| 4.81k| return is_full ------------------ | Branch (640:12): [True: 2.18k, False: 2.63k] ------------------ 641| 4.81k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.06k, False: 1.11k] ------------------ 642| 2.18k| : make_full_pos(child, p.shift() - B) 643| 1.11k| .visit(v, idx, args...)) 644| 4.81k| : (is_leaf ------------------ | Branch (644:19): [True: 1.35k, False: 1.27k] ------------------ 645| 2.63k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.63k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.27k| .visit(v, idx, args...)); 648| 4.81k|} _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.84k| { 208| 2.84k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.84k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1405| 2.10k| { 1406| 2.10k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.10k| } _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.10k| { 1330| 2.10k| return towards_oh(v, idx, offset_hint, args...); 1331| 2.10k| } _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.10k| { 1337| 2.10k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.10k, False: 0] ------------------ 1338| 2.10k| auto is_leaf = shift_ == BL; 1339| 2.10k| auto child = node_->inner()[offset_hint]; 1340| 2.10k| return is_leaf ------------------ | Branch (1340:16): [True: 1.39k, False: 714] ------------------ 1341| 2.10k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.10k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.10k| } _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.97k| { 113| 1.97k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.97k| } _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.77k| { 337| 1.77k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.77k| } _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.77k| { 317| 1.77k| return towards_oh_ch_regular( 318| 1.77k| *this, v, idx, offset_hint, count(), args...); 319| 1.77k| } _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.77k|{ 633| 1.77k| constexpr auto B = bits; 634| 1.77k| constexpr auto BL = bits_leaf; 635| 1.77k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 1.77k, False: 0] ------------------ 636| 1.77k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 1.77k, False: 0] ------------------ 637| 1.77k| auto is_leaf = p.shift() == BL; 638| 1.77k| auto child = p.node()->inner()[offset_hint]; 639| 1.77k| auto is_full = offset_hint + 1 != count_hint; 640| 1.77k| return is_full ------------------ | Branch (640:12): [True: 662, False: 1.11k] ------------------ 641| 1.77k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 383, False: 279] ------------------ 642| 662| : make_full_pos(child, p.shift() - B) 643| 279| .visit(v, idx, args...)) 644| 1.77k| : (is_leaf ------------------ | Branch (644:19): [True: 613, False: 504] ------------------ 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| 504| .visit(v, idx, args...)); 648| 1.77k|} _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.98k| { 1037| 2.98k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.98k| } _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| 46.9k|{ 1839| 46.9k| assert(node); ------------------ | Branch (1839:5): [True: 46.9k, False: 0] ------------------ 1840| 46.9k| auto relaxed = node->relaxed(); 1841| 46.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 33.7k, False: 13.1k] ------------------ 1842| 33.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 33.7k, False: 0] ------------------ 1843| 33.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 33.7k| .visit(v, std::forward(args)...); 1845| 33.7k| } else { 1846| 13.1k| return make_regular_sub_pos(node, shift, size) 1847| 13.1k| .visit(v, std::forward(args)...); 1848| 13.1k| } 1849| 46.9k|} _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| 33.7k| { 1814| 33.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 33.7k| } _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| 17.8k| { 1687| 17.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 17.8k, False: 0] ------------------ 1688| 17.8k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 17.8k] ------------------ 1689| 17.8k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 17.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_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 17.8k| { 1699| 17.8k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 17.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_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 17.8k| { 1718| 17.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 17.8k, False: 0] ------------------ 1719| 17.8k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 17.8k] | Branch (1719:9): [True: 17.8k, False: 0] ------------------ 1720| 17.8k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 17.8k| auto child = node_->inner()[offset_hint]; 1722| 17.8k| auto is_leaf = shift_ == BL; 1723| 17.8k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 17.8k| auto next_idx = idx - left_size_hint; 1725| 17.8k| return is_leaf ------------------ | Branch (1725:16): [True: 850, False: 16.9k] ------------------ 1726| 17.8k| ? make_leaf_sub_pos(child, next_size) 1727| 850| .visit(v, next_idx, args...) 1728| 17.8k| : visit_maybe_relaxed_sub( 1729| 16.9k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 17.8k| } _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| 850| { 145| 850| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 850| } _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| 12.2k| { 1687| 12.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 12.2k, False: 0] ------------------ 1688| 12.2k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 12.2k] ------------------ 1689| 12.2k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 12.2k| } _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| 12.2k| { 1699| 12.2k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 12.2k| } _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| 12.2k| { 1718| 12.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 12.2k, False: 0] ------------------ 1719| 12.2k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 12.2k] | Branch (1719:9): [True: 12.2k, False: 0] ------------------ 1720| 12.2k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 12.2k| auto child = node_->inner()[offset_hint]; 1722| 12.2k| auto is_leaf = shift_ == BL; 1723| 12.2k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 12.2k| auto next_idx = idx - left_size_hint; 1725| 12.2k| return is_leaf ------------------ | Branch (1725:16): [True: 807, False: 11.4k] ------------------ 1726| 12.2k| ? make_leaf_sub_pos(child, next_size) 1727| 807| .visit(v, next_idx, args...) 1728| 12.2k| : visit_maybe_relaxed_sub( 1729| 11.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 12.2k| } _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| 807| { 145| 807| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 807| } _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| 11.4k|{ 1839| 11.4k| assert(node); ------------------ | Branch (1839:5): [True: 11.4k, False: 0] ------------------ 1840| 11.4k| auto relaxed = node->relaxed(); 1841| 11.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.2k, False: 1.20k] ------------------ 1842| 10.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 10.2k, False: 0] ------------------ 1843| 10.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 10.2k| .visit(v, std::forward(args)...); 1845| 10.2k| } else { 1846| 1.20k| return make_regular_sub_pos(node, shift, size) 1847| 1.20k| .visit(v, std::forward(args)...); 1848| 1.20k| } 1849| 11.4k|} _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| 10.2k| { 1814| 10.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 10.2k| } _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.20k| { 1037| 1.20k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.20k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 2.60k| { 928| 2.60k| return towards_oh_ch_regular( 929| 2.60k| *this, v, idx, offset_hint, count(), args...); 930| 2.60k| } _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.60k|{ 633| 2.60k| constexpr auto B = bits; 634| 2.60k| constexpr auto BL = bits_leaf; 635| 2.60k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.60k, False: 0] ------------------ 636| 2.60k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.60k, False: 0] ------------------ 637| 2.60k| auto is_leaf = p.shift() == BL; 638| 2.60k| auto child = p.node()->inner()[offset_hint]; 639| 2.60k| auto is_full = offset_hint + 1 != count_hint; 640| 2.60k| return is_full ------------------ | Branch (640:12): [True: 2.20k, False: 406] ------------------ 641| 2.60k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 706, False: 1.49k] ------------------ 642| 2.20k| : make_full_pos(child, p.shift() - B) 643| 1.49k| .visit(v, idx, args...)) 644| 2.60k| : (is_leaf ------------------ | Branch (644:19): [True: 406, False: 0] ------------------ 645| 406| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 406| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.60k|} _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.87k| { 208| 1.87k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.87k| } _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.80k| { 1406| 1.80k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.80k| } _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.48k| { 1337| 1.48k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.48k, False: 0] ------------------ 1338| 1.48k| auto is_leaf = shift_ == BL; 1339| 1.48k| auto child = node_->inner()[offset_hint]; 1340| 1.48k| return is_leaf ------------------ | Branch (1340:16): [True: 1.17k, False: 308] ------------------ 1341| 1.48k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.48k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.48k| } _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.53k| { 1337| 2.53k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.53k, False: 0] ------------------ 1338| 2.53k| auto is_leaf = shift_ == BL; 1339| 2.53k| auto child = node_->inner()[offset_hint]; 1340| 2.53k| return is_leaf ------------------ | Branch (1340:16): [True: 1.58k, False: 952] ------------------ 1341| 2.53k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.53k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.53k| } _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.39k| { 208| 3.39k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.39k| } _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.80k| { 1406| 3.80k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.80k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 3.61k| { 1406| 3.61k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.61k| } _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.39k| { 1337| 9.39k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 9.39k, False: 0] ------------------ 1338| 9.39k| auto is_leaf = shift_ == BL; 1339| 9.39k| auto child = node_->inner()[offset_hint]; 1340| 9.39k| return is_leaf ------------------ | Branch (1340:16): [True: 7.09k, False: 2.30k] ------------------ 1341| 9.39k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 9.39k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 9.39k| } _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.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_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 5.06k| { 1406| 5.06k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.06k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 3.77k| { 1311| 3.77k| each_i(v, start, branches, args...); 1312| 3.77k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 3.77k| { 1264| 3.77k| auto p = node_->inner() + i; 1265| 3.77k| auto e = node_->inner() + n; 1266| 3.77k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 2.29k, False: 1.47k] ------------------ 1267| 14.5k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 12.2k, False: 2.29k] ------------------ 1268| 12.2k| IMMER_PREFETCH(p + 1); 1269| 12.2k| make_full_leaf_pos(*p).visit(v, args...); 1270| 12.2k| } 1271| 2.29k| } else { 1272| 1.47k| auto ss = shift_ - B; 1273| 11.3k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 9.88k, False: 1.47k] ------------------ 1274| 9.88k| make_full_pos(*p, ss).visit(v, args...); 1275| 1.47k| } 1276| 3.77k| } _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| 406| { 113| 406| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 406| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 305| 2.74k| { 306| 2.74k| return towards_oh_ch_regular( 307| 2.74k| *this, v, idx, offset_hint, count(), args...); 308| 2.74k| } _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.74k|{ 633| 2.74k| constexpr auto B = bits; 634| 2.74k| constexpr auto BL = bits_leaf; 635| 2.74k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.74k, False: 0] ------------------ 636| 2.74k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.74k, False: 0] ------------------ 637| 2.74k| auto is_leaf = p.shift() == BL; 638| 2.74k| auto child = p.node()->inner()[offset_hint]; 639| 2.74k| auto is_full = offset_hint + 1 != count_hint; 640| 2.74k| return is_full ------------------ | Branch (640:12): [True: 1.69k, False: 1.04k] ------------------ 641| 2.74k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 828, False: 871] ------------------ 642| 1.69k| : make_full_pos(child, p.shift() - B) 643| 871| .visit(v, idx, args...)) 644| 2.74k| : (is_leaf ------------------ | Branch (644:19): [True: 696, False: 352] ------------------ 645| 1.04k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.04k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 352| .visit(v, idx, args...)); 648| 2.74k|} _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.64k| { 113| 1.64k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.64k| } _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.66k| { 337| 3.66k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.66k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 1.37k| { 337| 1.37k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.37k| } _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.31k| { 306| 4.31k| return towards_oh_ch_regular( 307| 4.31k| *this, v, idx, offset_hint, count(), args...); 308| 4.31k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 4.31k|{ 633| 4.31k| constexpr auto B = bits; 634| 4.31k| constexpr auto BL = bits_leaf; 635| 4.31k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.31k, False: 0] ------------------ 636| 4.31k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.31k, False: 0] ------------------ 637| 4.31k| auto is_leaf = p.shift() == BL; 638| 4.31k| auto child = p.node()->inner()[offset_hint]; 639| 4.31k| auto is_full = offset_hint + 1 != count_hint; 640| 4.31k| return is_full ------------------ | Branch (640:12): [True: 2.21k, False: 2.10k] ------------------ 641| 4.31k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.39k, False: 815] ------------------ 642| 2.21k| : make_full_pos(child, p.shift() - B) 643| 815| .visit(v, idx, args...)) 644| 4.31k| : (is_leaf ------------------ | Branch (644:19): [True: 1.35k, False: 745] ------------------ 645| 2.10k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.10k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 745| .visit(v, idx, args...)); 648| 4.31k|} _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.20k| { 113| 2.20k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.20k| } _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.39k| { 337| 3.39k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.39k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 2.74k| { 286| 2.74k| return each_right_regular(*this, v, start, args...); 287| 2.74k| } _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.74k|{ 598| 2.74k| constexpr auto B = bits; 599| 2.74k| constexpr auto BL = bits_leaf; 600| | 601| 2.74k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 1.52k, False: 1.22k] ------------------ 602| 1.52k| auto n = p.node()->inner() + start; 603| 1.52k| auto last = p.count() - 1; 604| 1.52k| auto e = p.node()->inner() + last; 605| 1.52k| if (n <= e) { ------------------ | Branch (605:13): [True: 828, False: 696] ------------------ 606| 2.81k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.98k, False: 828] ------------------ 607| 1.98k| IMMER_PREFETCH(n + 1); 608| 1.98k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.98k| } 610| 828| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 828| } 612| 1.52k| } else { 613| 1.22k| auto n = p.node()->inner() + start; 614| 1.22k| auto last = p.count() - 1; 615| 1.22k| auto e = p.node()->inner() + last; 616| 1.22k| auto ss = p.shift() - B; 617| 1.22k| if (n <= e) { ------------------ | Branch (617:13): [True: 871, False: 352] ------------------ 618| 1.85k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 988, False: 871] ------------------ 619| 988| make_full_pos(*n, ss).visit(v, args...); 620| 871| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 871| } 622| 1.22k| } 623| 2.74k|} _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| 7.23k| { 928| 7.23k| return towards_oh_ch_regular( 929| 7.23k| *this, v, idx, offset_hint, count(), args...); 930| 7.23k| } _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| 7.23k|{ 633| 7.23k| constexpr auto B = bits; 634| 7.23k| constexpr auto BL = bits_leaf; 635| 7.23k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.23k, False: 0] ------------------ 636| 7.23k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.23k, False: 0] ------------------ 637| 7.23k| auto is_leaf = p.shift() == BL; 638| 7.23k| auto child = p.node()->inner()[offset_hint]; 639| 7.23k| auto is_full = offset_hint + 1 != count_hint; 640| 7.23k| return is_full ------------------ | Branch (640:12): [True: 2.96k, False: 4.26k] ------------------ 641| 7.23k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 983, False: 1.98k] ------------------ 642| 2.96k| : make_full_pos(child, p.shift() - B) 643| 1.98k| .visit(v, idx, args...)) 644| 7.23k| : (is_leaf ------------------ | Branch (644:19): [True: 949, False: 3.31k] ------------------ 645| 4.26k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.26k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.31k| .visit(v, idx, args...)); 648| 7.23k|} _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| 7.03k| { 928| 7.03k| return towards_oh_ch_regular( 929| 7.03k| *this, v, idx, offset_hint, count(), args...); 930| 7.03k| } _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| 7.03k|{ 633| 7.03k| constexpr auto B = bits; 634| 7.03k| constexpr auto BL = bits_leaf; 635| 7.03k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.03k, False: 0] ------------------ 636| 7.03k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.03k, False: 0] ------------------ 637| 7.03k| auto is_leaf = p.shift() == BL; 638| 7.03k| auto child = p.node()->inner()[offset_hint]; 639| 7.03k| auto is_full = offset_hint + 1 != count_hint; 640| 7.03k| return is_full ------------------ | Branch (640:12): [True: 3.54k, False: 3.49k] ------------------ 641| 7.03k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.60k, False: 1.94k] ------------------ 642| 3.54k| : make_full_pos(child, p.shift() - B) 643| 1.94k| .visit(v, idx, args...)) 644| 7.03k| : (is_leaf ------------------ | Branch (644:19): [True: 844, False: 2.65k] ------------------ 645| 3.49k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.49k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.65k| .visit(v, idx, args...)); 648| 7.03k|} _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.5k| { 868| 12.5k| return each_right_regular(*this, v, start, args...); 869| 12.5k| } _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.5k|{ 598| 12.5k| constexpr auto B = bits; 599| 12.5k| constexpr auto BL = bits_leaf; 600| | 601| 12.5k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 3.82k, False: 8.74k] ------------------ 602| 3.82k| auto n = p.node()->inner() + start; 603| 3.82k| auto last = p.count() - 1; 604| 3.82k| auto e = p.node()->inner() + last; 605| 3.82k| if (n <= e) { ------------------ | Branch (605:13): [True: 2.10k, False: 1.72k] ------------------ 606| 3.80k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.70k, False: 2.10k] ------------------ 607| 1.70k| IMMER_PREFETCH(n + 1); 608| 1.70k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.70k| } 610| 2.10k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 2.10k| } 612| 8.74k| } else { 613| 8.74k| auto n = p.node()->inner() + start; 614| 8.74k| auto last = p.count() - 1; 615| 8.74k| auto e = p.node()->inner() + last; 616| 8.74k| auto ss = p.shift() - B; 617| 8.74k| if (n <= e) { ------------------ | Branch (617:13): [True: 5.43k, False: 3.31k] ------------------ 618| 6.55k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.12k, False: 5.43k] ------------------ 619| 1.12k| make_full_pos(*n, ss).visit(v, args...); 620| 5.43k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 5.43k| } 622| 8.74k| } 623| 12.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 23.8k| { 1814| 23.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 23.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.34k| { 1687| 9.34k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 9.34k, False: 0] ------------------ 1688| 9.34k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 8.93k, False: 409] ------------------ 1689| 9.34k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 9.34k| } _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.34k| { 1699| 9.34k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 9.34k| } _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.34k| { 1718| 9.34k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 9.34k, False: 0] ------------------ 1719| 9.34k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 8.93k, False: 409] | Branch (1719:9): [True: 9.34k, False: 0] ------------------ 1720| 9.34k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 9.34k| auto child = node_->inner()[offset_hint]; 1722| 9.34k| auto is_leaf = shift_ == BL; 1723| 9.34k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 9.34k| auto next_idx = idx - left_size_hint; 1725| 9.34k| return is_leaf ------------------ | Branch (1725:16): [True: 1.90k, False: 7.44k] ------------------ 1726| 9.34k| ? make_leaf_sub_pos(child, next_size) 1727| 1.90k| .visit(v, next_idx, args...) 1728| 9.34k| : visit_maybe_relaxed_sub( 1729| 7.44k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 9.34k| } _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.90k| { 145| 1.90k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.90k| } _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.44k|{ 1839| 7.44k| assert(node); ------------------ | Branch (1839:5): [True: 7.44k, False: 0] ------------------ 1840| 7.44k| auto relaxed = node->relaxed(); 1841| 7.44k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.74k, False: 4.70k] ------------------ 1842| 2.74k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.74k, False: 0] ------------------ 1843| 2.74k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.74k| .visit(v, std::forward(args)...); 1845| 4.70k| } else { 1846| 4.70k| return make_regular_sub_pos(node, shift, size) 1847| 4.70k| .visit(v, std::forward(args)...); 1848| 4.70k| } 1849| 7.44k|} _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.74k| { 1814| 2.74k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.74k| } _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.70k| { 1037| 4.70k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.70k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1036| 10.6k| { 1037| 10.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.6k| } _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| 10.7k| { 1687| 10.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 10.7k, False: 0] ------------------ 1688| 10.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.08k, False: 1.64k] ------------------ 1689| 10.7k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 10.7k| } _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| 10.7k| { 1699| 10.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 10.7k| } _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| 10.7k| { 1718| 10.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 10.7k, False: 0] ------------------ 1719| 10.7k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.08k, False: 1.64k] | Branch (1719:9): [True: 10.7k, False: 0] ------------------ 1720| 10.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 10.7k| auto child = node_->inner()[offset_hint]; 1722| 10.7k| auto is_leaf = shift_ == BL; 1723| 10.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 10.7k| auto next_idx = idx - left_size_hint; 1725| 10.7k| return is_leaf ------------------ | Branch (1725:16): [True: 4.18k, False: 6.54k] ------------------ 1726| 10.7k| ? make_leaf_sub_pos(child, next_size) 1727| 4.18k| .visit(v, next_idx, args...) 1728| 10.7k| : visit_maybe_relaxed_sub( 1729| 6.54k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 10.7k| } _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.18k| { 145| 4.18k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.18k| } _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.54k|{ 1839| 6.54k| assert(node); ------------------ | Branch (1839:5): [True: 6.54k, False: 0] ------------------ 1840| 6.54k| auto relaxed = node->relaxed(); 1841| 6.54k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.35k, False: 3.18k] ------------------ 1842| 3.35k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.35k, False: 0] ------------------ 1843| 3.35k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.35k| .visit(v, std::forward(args)...); 1845| 3.35k| } else { 1846| 3.18k| return make_regular_sub_pos(node, shift, size) 1847| 3.18k| .visit(v, std::forward(args)...); 1848| 3.18k| } 1849| 6.54k|} _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.35k| { 1814| 3.35k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.35k| } _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.18k| { 1037| 3.18k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.18k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 27.1k| { 1654| 27.1k| assert(start > 0); ------------------ | Branch (1654:9): [True: 27.1k, False: 0] ------------------ 1655| 27.1k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 27.1k, False: 0] ------------------ 1656| 27.1k| auto s = relaxed_->d.sizes[start - 1]; 1657| 27.1k| auto p = node_->inner(); 1658| 27.1k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 2.75k, False: 24.3k] ------------------ 1659| 8.46k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 5.71k, False: 2.75k] ------------------ 1660| 5.71k| IMMER_PREFETCH(p + i + 1); 1661| 5.71k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 5.71k| .visit(v, args...); 1663| 5.71k| s = relaxed_->d.sizes[i]; 1664| 5.71k| assert(s); ------------------ | Branch (1664:17): [True: 5.71k, False: 0] ------------------ 1665| 5.71k| } 1666| 24.3k| } else { 1667| 24.3k| auto ss = shift_ - B; 1668| 138k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 114k, False: 24.3k] ------------------ 1669| 114k| visit_maybe_relaxed_sub( 1670| 114k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 114k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 114k, False: 0] ------------------ 1673| 114k| } 1674| 24.3k| } 1675| 27.1k| } _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| 13.1k| { 1037| 13.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 13.1k| } _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.34k| { 928| 5.34k| return towards_oh_ch_regular( 929| 5.34k| *this, v, idx, offset_hint, count(), args...); 930| 5.34k| } _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.34k|{ 633| 5.34k| constexpr auto B = bits; 634| 5.34k| constexpr auto BL = bits_leaf; 635| 5.34k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.34k, False: 0] ------------------ 636| 5.34k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.34k, False: 0] ------------------ 637| 5.34k| auto is_leaf = p.shift() == BL; 638| 5.34k| auto child = p.node()->inner()[offset_hint]; 639| 5.34k| auto is_full = offset_hint + 1 != count_hint; 640| 5.34k| return is_full ------------------ | Branch (640:12): [True: 4.56k, False: 777] ------------------ 641| 5.34k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.11k, False: 3.44k] ------------------ 642| 4.56k| : make_full_pos(child, p.shift() - B) 643| 3.44k| .visit(v, idx, args...)) 644| 5.34k| : (is_leaf ------------------ | Branch (644:19): [True: 777, False: 0] ------------------ 645| 777| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 777| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.34k|} _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.82k| { 208| 1.82k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.82k| } _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.97k| { 1406| 3.97k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.97k| } _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.23k| { 1337| 1.23k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.23k, False: 0] ------------------ 1338| 1.23k| auto is_leaf = shift_ == BL; 1339| 1.23k| auto child = node_->inner()[offset_hint]; 1340| 1.23k| return is_leaf ------------------ | Branch (1340:16): [True: 711, False: 527] ------------------ 1341| 1.23k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.23k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.23k| } _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| 777| { 113| 777| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 777| } _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| 913| { 145| 913| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 913| } _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| 56.8k|{ 1839| 56.8k| assert(node); ------------------ | Branch (1839:5): [True: 56.8k, False: 0] ------------------ 1840| 56.8k| auto relaxed = node->relaxed(); 1841| 56.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 54.3k, False: 2.50k] ------------------ 1842| 54.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 54.3k, False: 0] ------------------ 1843| 54.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 54.3k| .visit(v, std::forward(args)...); 1845| 54.3k| } else { 1846| 2.50k| return make_regular_sub_pos(node, shift, size) 1847| 2.50k| .visit(v, std::forward(args)...); 1848| 2.50k| } 1849| 56.8k|} _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| 54.3k| { 1814| 54.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 54.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.06k| { 1706| 2.06k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 2.06k, False: 0] ------------------ 1707| 2.06k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 1.62k, False: 438] ------------------ 1708| 2.06k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 2.06k| } _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.06k| { 1718| 2.06k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 2.06k, False: 0] ------------------ 1719| 2.06k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 1.62k, False: 438] | Branch (1719:9): [True: 2.06k, False: 0] ------------------ 1720| 2.06k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 2.06k| auto child = node_->inner()[offset_hint]; 1722| 2.06k| auto is_leaf = shift_ == BL; 1723| 2.06k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 2.06k| auto next_idx = idx - left_size_hint; 1725| 2.06k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 2.06k] ------------------ 1726| 2.06k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 2.06k| : visit_maybe_relaxed_sub( 1729| 2.06k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 2.06k| } _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.71k| { 1706| 3.71k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.71k, False: 0] ------------------ 1707| 3.71k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.19k, False: 512] ------------------ 1708| 3.71k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.71k| } _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.71k| { 1718| 3.71k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.71k, False: 0] ------------------ 1719| 3.71k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.19k, False: 512] | Branch (1719:9): [True: 3.71k, False: 0] ------------------ 1720| 3.71k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.71k| auto child = node_->inner()[offset_hint]; 1722| 3.71k| auto is_leaf = shift_ == BL; 1723| 3.71k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.71k| auto next_idx = idx - left_size_hint; 1725| 3.71k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.71k] ------------------ 1726| 3.71k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.71k| : visit_maybe_relaxed_sub( 1729| 3.71k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.71k| } _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.71k|{ 1839| 3.71k| assert(node); ------------------ | Branch (1839:5): [True: 3.71k, False: 0] ------------------ 1840| 3.71k| auto relaxed = node->relaxed(); 1841| 3.71k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.42k, False: 1.28k] ------------------ 1842| 2.42k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.42k, False: 0] ------------------ 1843| 2.42k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.42k| .visit(v, std::forward(args)...); 1845| 2.42k| } else { 1846| 1.28k| return make_regular_sub_pos(node, shift, size) 1847| 1.28k| .visit(v, std::forward(args)...); 1848| 1.28k| } 1849| 3.71k|} _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.42k| { 1814| 2.42k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.42k| } _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.28k| { 1037| 1.28k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.28k| } _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.34k| { 947| 1.34k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 1.34k| } _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.34k|{ 654| 1.34k| constexpr auto B = bits; 655| 1.34k| constexpr auto BL = bits_leaf; 656| 1.34k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 1.34k, False: 0] ------------------ 657| 1.34k| auto is_leaf = p.shift() == BL; 658| 1.34k| auto child = p.node()->inner()[offset_hint]; 659| 1.34k| auto lsize = offset_hint << p.shift(); 660| 1.34k| auto size = p.this_size(); 661| 1.34k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 1.34k| return is_full ------------------ | Branch (662:12): [True: 628, False: 718] ------------------ 663| 1.34k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 628] ------------------ 664| 628| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 628| : make_full_pos(child, p.shift() - B) 666| 628| .visit(v, idx - lsize, args...)) 667| 1.34k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 718] ------------------ 668| 718| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 718| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 718| .visit(v, idx - lsize, args...)); 672| 1.34k|} _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| 628| { 1406| 628| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 628| } _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.22k| { 1349| 2.22k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 2.22k, False: 0] ------------------ 1350| 2.22k| auto is_leaf = shift_ == BL; 1351| 2.22k| auto child = node_->inner()[offset_hint]; 1352| 2.22k| auto lsize = size_t{offset_hint} << shift_; 1353| 2.22k| return is_leaf ------------------ | Branch (1353:16): [True: 1.63k, False: 586] ------------------ 1354| 2.22k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 2.22k| : make_full_pos(child, shift_ - B) 1356| 586| .visit(v, idx - lsize, args...); 1357| 2.22k| } _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| 7.74k| { 208| 7.74k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 7.74k| } _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| 1.59k| { 1406| 1.59k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.59k| } _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| 718| { 1037| 718| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 718| } _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.11k| { 947| 7.11k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 7.11k| } _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.11k|{ 654| 7.11k| constexpr auto B = bits; 655| 7.11k| constexpr auto BL = bits_leaf; 656| 7.11k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 7.11k, False: 0] ------------------ 657| 7.11k| auto is_leaf = p.shift() == BL; 658| 7.11k| auto child = p.node()->inner()[offset_hint]; 659| 7.11k| auto lsize = offset_hint << p.shift(); 660| 7.11k| auto size = p.this_size(); 661| 7.11k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 7.11k| return is_full ------------------ | Branch (662:12): [True: 7.11k, False: 0] ------------------ 663| 7.11k| ? (is_leaf ------------------ | Branch (663:19): [True: 6.10k, False: 1.00k] ------------------ 664| 7.11k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 7.11k| : make_full_pos(child, p.shift() - B) 666| 1.00k| .visit(v, idx - lsize, args...)) 667| 7.11k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 7.11k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 2.06k| { 1814| 2.06k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.06k| } _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| 182k| { 1706| 182k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 182k, False: 0] ------------------ 1707| 182k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 42.6k, False: 139k] ------------------ 1708| 182k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 182k| } _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| 182k| { 1718| 182k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 182k, False: 0] ------------------ 1719| 182k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 42.6k, False: 139k] | Branch (1719:9): [True: 182k, False: 0] ------------------ 1720| 182k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 182k| auto child = node_->inner()[offset_hint]; 1722| 182k| auto is_leaf = shift_ == BL; 1723| 182k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 182k| auto next_idx = idx - left_size_hint; 1725| 182k| return is_leaf ------------------ | Branch (1725:16): [True: 4.60k, False: 177k] ------------------ 1726| 182k| ? make_leaf_sub_pos(child, next_size) 1727| 4.60k| .visit(v, next_idx, args...) 1728| 182k| : visit_maybe_relaxed_sub( 1729| 177k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 182k| } _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.60k| { 145| 4.60k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.60k| } _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| 177k|{ 1839| 177k| assert(node); ------------------ | Branch (1839:5): [True: 177k, False: 0] ------------------ 1840| 177k| auto relaxed = node->relaxed(); 1841| 177k| if (relaxed) { ------------------ | Branch (1841:9): [True: 176k, False: 1.55k] ------------------ 1842| 176k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 176k, False: 0] ------------------ 1843| 176k| return make_relaxed_pos(node, shift, relaxed) 1844| 176k| .visit(v, std::forward(args)...); 1845| 176k| } else { 1846| 1.55k| return make_regular_sub_pos(node, shift, size) 1847| 1.55k| .visit(v, std::forward(args)...); 1848| 1.55k| } 1849| 177k|} _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| 176k| { 1814| 176k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 176k| } _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| 1.55k| { 1037| 1.55k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.55k| } _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| 91.7k| { 1706| 91.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 91.7k, False: 0] ------------------ 1707| 91.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 56.2k, False: 35.4k] ------------------ 1708| 91.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 91.7k| } _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| 91.7k| { 1718| 91.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 91.7k, False: 0] ------------------ 1719| 91.7k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 56.2k, False: 35.4k] | Branch (1719:9): [True: 91.7k, False: 0] ------------------ 1720| 91.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 91.7k| auto child = node_->inner()[offset_hint]; 1722| 91.7k| auto is_leaf = shift_ == BL; 1723| 91.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 91.7k| auto next_idx = idx - left_size_hint; 1725| 91.7k| return is_leaf ------------------ | Branch (1725:16): [True: 42.4k, False: 49.2k] ------------------ 1726| 91.7k| ? make_leaf_sub_pos(child, next_size) 1727| 42.4k| .visit(v, next_idx, args...) 1728| 91.7k| : visit_maybe_relaxed_sub( 1729| 49.2k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 91.7k| } _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| 42.4k| { 145| 42.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 42.4k| } _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.2k|{ 1839| 49.2k| assert(node); ------------------ | Branch (1839:5): [True: 49.2k, False: 0] ------------------ 1840| 49.2k| auto relaxed = node->relaxed(); 1841| 49.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 46.8k, False: 2.39k] ------------------ 1842| 46.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 46.8k, False: 0] ------------------ 1843| 46.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 46.8k| .visit(v, std::forward(args)...); 1845| 46.8k| } else { 1846| 2.39k| return make_regular_sub_pos(node, shift, size) 1847| 2.39k| .visit(v, std::forward(args)...); 1848| 2.39k| } 1849| 49.2k|} _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| 46.8k| { 1814| 46.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 46.8k| } _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.39k| { 1037| 2.39k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.39k| } _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.50k| { 1037| 2.50k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.50k| } _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| 22.0k|{ 1839| 22.0k| assert(node); ------------------ | Branch (1839:5): [True: 22.0k, False: 0] ------------------ 1840| 22.0k| auto relaxed = node->relaxed(); 1841| 22.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.9k, False: 9.08k] ------------------ 1842| 12.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.9k, False: 0] ------------------ 1843| 12.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 12.9k| .visit(v, std::forward(args)...); 1845| 12.9k| } else { 1846| 9.08k| return make_regular_sub_pos(node, shift, size) 1847| 9.08k| .visit(v, std::forward(args)...); 1848| 9.08k| } 1849| 22.0k|} _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.9k| { 1814| 12.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 12.9k| } _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.9k|{ 1839| 12.9k| assert(node); ------------------ | Branch (1839:5): [True: 12.9k, False: 0] ------------------ 1840| 12.9k| auto relaxed = node->relaxed(); 1841| 12.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.81k, False: 3.12k] ------------------ 1842| 9.81k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.81k, False: 0] ------------------ 1843| 9.81k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.81k| .visit(v, std::forward(args)...); 1845| 9.81k| } else { 1846| 3.12k| return make_regular_sub_pos(node, shift, size) 1847| 3.12k| .visit(v, std::forward(args)...); 1848| 3.12k| } 1849| 12.9k|} _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.81k| { 1814| 9.81k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 9.81k| } _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| 55.8k| { 1794| 55.8k| auto child = node_->inner()[offset]; 1795| 55.8k| auto child_size = size(offset); 1796| 55.8k| auto is_leaf = shift_ == BL; 1797| 55.8k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 25.5k, False: 30.2k] ------------------ 1798| 55.8k| : visit_maybe_relaxed_sub( 1799| 30.2k| child, shift_ - B, child_size, v, args...); 1800| 55.8k| } _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.1k| { 145| 26.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 26.1k| } _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.1k| { 1805| 26.1k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 26.1k, False: 0] ------------------ 1806| 26.1k| auto child = node_->inner()[offset]; 1807| 26.1k| auto child_size = size(offset); 1808| 26.1k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 26.1k| } _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.7k| { 145| 26.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 26.7k| } _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| 30.2k|{ 1839| 30.2k| assert(node); ------------------ | Branch (1839:5): [True: 30.2k, False: 0] ------------------ 1840| 30.2k| auto relaxed = node->relaxed(); 1841| 30.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 24.8k, False: 5.35k] ------------------ 1842| 24.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 24.8k, False: 0] ------------------ 1843| 24.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 24.8k| .visit(v, std::forward(args)...); 1845| 24.8k| } else { 1846| 5.35k| return make_regular_sub_pos(node, shift, size) 1847| 5.35k| .visit(v, std::forward(args)...); 1848| 5.35k| } 1849| 30.2k|} _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.8k| { 1814| 24.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 24.8k| } _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.8k| { 1794| 24.8k| auto child = node_->inner()[offset]; 1795| 24.8k| auto child_size = size(offset); 1796| 24.8k| auto is_leaf = shift_ == BL; 1797| 24.8k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 24.8k] ------------------ 1798| 24.8k| : visit_maybe_relaxed_sub( 1799| 24.8k| child, shift_ - B, child_size, v, args...); 1800| 24.8k| } _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.8k|{ 1839| 24.8k| assert(node); ------------------ | Branch (1839:5): [True: 24.8k, False: 0] ------------------ 1840| 24.8k| auto relaxed = node->relaxed(); 1841| 24.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 24.0k, False: 881] ------------------ 1842| 24.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 24.0k, False: 0] ------------------ 1843| 24.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 24.0k| .visit(v, std::forward(args)...); 1845| 24.0k| } else { 1846| 881| return make_regular_sub_pos(node, shift, size) 1847| 881| .visit(v, std::forward(args)...); 1848| 881| } 1849| 24.8k|} _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| 24.0k| { 1814| 24.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 24.0k| } _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.20k| { 1037| 1.20k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.20k| } _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| 8.43k| { 1794| 8.43k| auto child = node_->inner()[offset]; 1795| 8.43k| auto child_size = size(offset); 1796| 8.43k| auto is_leaf = shift_ == BL; 1797| 8.43k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 5.52k, False: 2.91k] ------------------ 1798| 8.43k| : visit_maybe_relaxed_sub( 1799| 2.91k| child, shift_ - B, child_size, v, args...); 1800| 8.43k| } _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.52k| { 145| 5.52k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.52k| } _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.52k| { 1026| 5.52k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 5.52k, False: 0] ------------------ 1027| 5.52k| auto child = node_->inner()[idx]; 1028| 5.52k| auto lsize = size(idx); 1029| 5.52k| auto is_full = idx + 1 < count(); 1030| 5.52k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 4.84k, False: 672] ------------------ 1031| 5.52k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 5.52k| } _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.1k| { 208| 12.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 12.1k| } _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.91k|{ 1839| 2.91k| assert(node); ------------------ | Branch (1839:5): [True: 2.91k, False: 0] ------------------ 1840| 2.91k| auto relaxed = node->relaxed(); 1841| 2.91k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.06k, False: 848] ------------------ 1842| 2.06k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.06k, False: 0] ------------------ 1843| 2.06k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.06k| .visit(v, std::forward(args)...); 1845| 2.06k| } else { 1846| 848| return make_regular_sub_pos(node, shift, size) 1847| 848| .visit(v, std::forward(args)...); 1848| 848| } 1849| 2.91k|} _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| 2.06k| { 1814| 2.06k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.06k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1007| 2.06k| { 1008| 2.06k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.06k, False: 0] ------------------ 1009| 2.06k| auto is_leaf = shift_ == BL; 1010| 2.06k| auto child = node_->inner()[idx]; 1011| 2.06k| auto lsize = size(idx); 1012| 2.06k| auto is_full = idx + 1 < count(); 1013| 2.06k| return is_full ------------------ | Branch (1013:16): [True: 1.74k, False: 324] ------------------ 1014| 2.06k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.74k] ------------------ 1015| 1.74k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.74k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.06k| : (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| 2.06k| } _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.24k| { 1406| 2.24k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.24k| } _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| 8.79k| { 1794| 8.79k| auto child = node_->inner()[offset]; 1795| 8.79k| auto child_size = size(offset); 1796| 8.79k| auto is_leaf = shift_ == BL; 1797| 8.79k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 7.33k, False: 1.46k] ------------------ 1798| 8.79k| : visit_maybe_relaxed_sub( 1799| 1.46k| child, shift_ - B, child_size, v, args...); 1800| 8.79k| } _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.33k| { 145| 7.33k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.33k| } _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.33k| { 1397| 7.33k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 7.33k, False: 0] ------------------ 1398| 7.33k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 7.33k, False: 0] ------------------ 1399| 7.33k| auto child = node_->inner()[idx]; 1400| 7.33k| return make_full_leaf_pos(child).visit(v, args...); 1401| 7.33k| } _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.46k|{ 1839| 1.46k| assert(node); ------------------ | Branch (1839:5): [True: 1.46k, False: 0] ------------------ 1840| 1.46k| auto relaxed = node->relaxed(); 1841| 1.46k| if (relaxed) { ------------------ | Branch (1841:9): [True: 501, False: 959] ------------------ 1842| 501| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 501, False: 0] ------------------ 1843| 501| return make_relaxed_pos(node, shift, relaxed) 1844| 501| .visit(v, std::forward(args)...); 1845| 959| } else { 1846| 959| return make_regular_sub_pos(node, shift, size) 1847| 959| .visit(v, std::forward(args)...); 1848| 959| } 1849| 1.46k|} _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| 501| { 1814| 501| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 501| } _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| 501| { 1387| 501| assert(idx < count()); ------------------ | Branch (1387:9): [True: 501, False: 0] ------------------ 1388| 501| auto is_leaf = shift_ == BL; 1389| 501| auto child = node_->inner()[idx]; 1390| 501| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 501] ------------------ 1391| 501| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 501| } _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| 959| { 1037| 959| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 959| } _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| 959| { 1387| 959| assert(idx < count()); ------------------ | Branch (1387:9): [True: 959, False: 0] ------------------ 1388| 959| auto is_leaf = shift_ == BL; 1389| 959| auto child = node_->inner()[idx]; 1390| 959| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 959] ------------------ 1391| 959| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 959| } _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.80k| { 1406| 1.80k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.80k| } _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| 3.94k| { 1223| 3.94k| auto p = node_->inner(); 1224| 3.94k| auto p2 = other->inner(); 1225| 3.94k| auto e = p + branches; 1226| 3.94k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 2.92k, False: 1.01k] ------------------ 1227| 18.1k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 16.6k, False: 1.43k] ------------------ 1228| 16.6k| IMMER_PREFETCH(p + 1); 1229| 16.6k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 1.48k, False: 15.2k] ------------------ 1230| 1.48k| return false; 1231| 16.6k| } 1232| 2.92k| } else { 1233| 1.01k| auto ss = shift_ - B; 1234| 6.56k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 5.97k, False: 594] ------------------ 1235| 5.97k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 425, False: 5.54k] ------------------ 1236| 425| return false; 1237| 1.01k| } 1238| 2.03k| return true; 1239| 3.94k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 23.8k| { 208| 23.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 23.8k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 11.5k| { 1406| 11.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 11.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.54k| { 838| 5.54k| return each_pred_zip_regular(*this, v, other, args...); 839| 5.54k| } _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.54k|{ 393| 5.54k| constexpr auto B = bits; 394| 5.54k| constexpr auto BL = bits_leaf; 395| | 396| 5.54k| auto n = p.node()->inner(); 397| 5.54k| auto n2 = other->inner(); 398| 5.54k| auto last = p.count() - 1; 399| 5.54k| auto e = n + last; 400| 5.54k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.22k, False: 3.32k] ------------------ 401| 6.32k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 5.09k, False: 1.23k] ------------------ 402| 5.09k| IMMER_PREFETCH(n + 1); 403| 5.09k| IMMER_PREFETCH(n2 + 1); 404| 5.09k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 985, False: 4.10k] ------------------ 405| 985| return false; 406| 5.09k| } 407| 1.23k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 3.32k| } else { 409| 3.32k| auto ss = p.shift() - B; 410| 6.59k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 4.15k, False: 2.44k] ------------------ 411| 4.15k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 878, False: 3.27k] ------------------ 412| 878| return false; 413| 2.44k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 3.32k| } 415| 5.54k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 2.95k| { 113| 2.95k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.95k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 3.15k| { 337| 3.15k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.15k| } _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.87k| { 256| 2.87k| return each_pred_zip_regular(*this, v, other, args...); 257| 2.87k| } _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.87k|{ 393| 2.87k| constexpr auto B = bits; 394| 2.87k| constexpr auto BL = bits_leaf; 395| | 396| 2.87k| auto n = p.node()->inner(); 397| 2.87k| auto n2 = other->inner(); 398| 2.87k| auto last = p.count() - 1; 399| 2.87k| auto e = n + last; 400| 2.87k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.94k, False: 932] ------------------ 401| 3.78k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 2.07k, False: 1.71k] ------------------ 402| 2.07k| IMMER_PREFETCH(n + 1); 403| 2.07k| IMMER_PREFETCH(n2 + 1); 404| 2.07k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 228, False: 1.84k] ------------------ 405| 228| return false; 406| 2.07k| } 407| 1.71k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 1.94k| } else { 409| 932| auto ss = p.shift() - B; 410| 2.12k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 1.41k, False: 714] ------------------ 411| 1.41k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 218, False: 1.19k] ------------------ 412| 218| return false; 413| 714| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 932| } 415| 2.87k|} _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.00k| { 1387| 6.00k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 6.00k, False: 0] ------------------ 1388| 6.00k| auto is_leaf = shift_ == BL; 1389| 6.00k| auto child = node_->inner()[idx]; 1390| 6.00k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 5.00k, False: 1.00k] ------------------ 1391| 6.00k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 6.00k| } _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| 379k| { 208| 379k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 379k| } _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| 5.30M|{ 1839| 5.30M| assert(node); ------------------ | Branch (1839:5): [True: 5.30M, False: 0] ------------------ 1840| 5.30M| auto relaxed = node->relaxed(); 1841| 5.30M| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.88M, False: 421k] ------------------ 1842| 4.88M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.88M, False: 0] ------------------ 1843| 4.88M| return make_relaxed_pos(node, shift, relaxed) 1844| 4.88M| .visit(v, std::forward(args)...); 1845| 4.88M| } else { 1846| 421k| return make_regular_sub_pos(node, shift, size) 1847| 421k| .visit(v, std::forward(args)...); 1848| 421k| } 1849| 5.30M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 4.88M| { 1814| 4.88M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.88M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 4.88M| { 1680| 4.88M| return towards_oh(v, idx, subindex(idx), args...); 1681| 4.88M| } _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.88M| { 1687| 4.88M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 4.88M, False: 0] ------------------ 1688| 4.88M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 3.37M, False: 1.50M] ------------------ 1689| 4.88M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 4.88M| } _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.88M| { 1699| 4.88M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 4.88M| } _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.88M| { 1718| 4.88M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.88M, False: 0] ------------------ 1719| 4.88M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.37M, False: 1.50M] | Branch (1719:9): [True: 4.88M, False: 0] ------------------ 1720| 4.88M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.88M| auto child = node_->inner()[offset_hint]; 1722| 4.88M| auto is_leaf = shift_ == BL; 1723| 4.88M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.88M| auto next_idx = idx - left_size_hint; 1725| 4.88M| return is_leaf ------------------ | Branch (1725:16): [True: 986k, False: 3.89M] ------------------ 1726| 4.88M| ? make_leaf_sub_pos(child, next_size) 1727| 986k| .visit(v, next_idx, args...) 1728| 4.88M| : visit_maybe_relaxed_sub( 1729| 3.89M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.88M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 144| 986k| { 145| 986k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 986k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 421k| { 1037| 421k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 421k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 421k| { 920| 421k| return towards_oh_ch_regular( 921| 421k| *this, v, idx, index(idx), count(), args...); 922| 421k| } _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| 421k|{ 633| 421k| constexpr auto B = bits; 634| 421k| constexpr auto BL = bits_leaf; 635| 421k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 421k, False: 0] ------------------ 636| 421k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 421k, False: 0] ------------------ 637| 421k| auto is_leaf = p.shift() == BL; 638| 421k| auto child = p.node()->inner()[offset_hint]; 639| 421k| auto is_full = offset_hint + 1 != count_hint; 640| 421k| return is_full ------------------ | Branch (640:12): [True: 360k, False: 61.5k] ------------------ 641| 421k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 116k, False: 243k] ------------------ 642| 360k| : make_full_pos(child, p.shift() - B) 643| 243k| .visit(v, idx, args...)) 644| 421k| : (is_leaf ------------------ | Branch (644:19): [True: 21.2k, False: 40.2k] ------------------ 645| 61.5k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 61.5k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 40.2k| .visit(v, idx, args...)); 648| 421k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 394k| { 208| 394k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 394k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 422k| { 1406| 422k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 422k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 422k| { 1323| 422k| return towards_oh(v, idx, index(idx), args...); 1324| 422k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 422k| { 1337| 422k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 422k, False: 0] ------------------ 1338| 422k| auto is_leaf = shift_ == BL; 1339| 422k| auto child = node_->inner()[offset_hint]; 1340| 422k| return is_leaf ------------------ | Branch (1340:16): [True: 262k, False: 160k] ------------------ 1341| 422k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 422k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 422k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 26.8k| { 113| 26.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 26.8k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 42.8k| { 337| 42.8k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 42.8k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 42.8k| { 298| 42.8k| return towards_oh_ch_regular( 299| 42.8k| *this, v, idx, index(idx), count(), args...); 300| 42.8k| } _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| 42.8k|{ 633| 42.8k| constexpr auto B = bits; 634| 42.8k| constexpr auto BL = bits_leaf; 635| 42.8k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 42.8k, False: 0] ------------------ 636| 42.8k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 42.8k, False: 0] ------------------ 637| 42.8k| auto is_leaf = p.shift() == BL; 638| 42.8k| auto child = p.node()->inner()[offset_hint]; 639| 42.8k| auto is_full = offset_hint + 1 != count_hint; 640| 42.8k| return is_full ------------------ | Branch (640:12): [True: 34.6k, False: 8.13k] ------------------ 641| 42.8k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 15.9k, False: 18.7k] ------------------ 642| 34.6k| : make_full_pos(child, p.shift() - B) 643| 18.7k| .visit(v, idx, args...)) 644| 42.8k| : (is_leaf ------------------ | Branch (644:19): [True: 5.61k, False: 2.52k] ------------------ 645| 8.13k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 8.13k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.52k| .visit(v, idx, args...)); 648| 42.8k|} _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| 33.4k| { 1406| 33.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 33.4k| } _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| 33.4k| { 1203| 33.4k| auto p = node_->inner(); 1204| 33.4k| auto e = p + branches; 1205| 33.4k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 31.6k, False: 1.75k] ------------------ 1206| 276k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 246k, False: 30.1k] ------------------ 1207| 246k| IMMER_PREFETCH(p + 1); 1208| 246k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 1.52k, False: 244k] ------------------ 1209| 1.52k| return false; 1210| 246k| } 1211| 31.6k| } else { 1212| 1.75k| auto ss = shift_ - B; 1213| 14.2k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 12.8k, False: 1.37k] ------------------ 1214| 12.8k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 387, False: 12.5k] ------------------ 1215| 387| return false; 1216| 1.75k| } 1217| 31.4k| return true; 1218| 33.4k| } _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| 848| { 1037| 848| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 848| } _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| 848| { 1008| 848| assert(idx < count()); ------------------ | Branch (1008:9): [True: 848, False: 0] ------------------ 1009| 848| auto is_leaf = shift_ == BL; 1010| 848| auto child = node_->inner()[idx]; 1011| 848| auto lsize = size(idx); 1012| 848| auto is_full = idx + 1 < count(); 1013| 848| return is_full ------------------ | Branch (1013:16): [True: 848, False: 0] ------------------ 1014| 848| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 848] ------------------ 1015| 848| ? make_full_leaf_pos(child).visit(v, args...) 1016| 848| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 848| : (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| 848| } _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| 4.26k| { 1037| 4.26k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.26k| } _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.11k| { 1008| 5.11k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 5.11k, False: 0] ------------------ 1009| 5.11k| auto is_leaf = shift_ == BL; 1010| 5.11k| auto child = node_->inner()[idx]; 1011| 5.11k| auto lsize = size(idx); 1012| 5.11k| auto is_full = idx + 1 < count(); 1013| 5.11k| return is_full ------------------ | Branch (1013:16): [True: 3.10k, False: 2.00k] ------------------ 1014| 5.11k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.66k, False: 444] ------------------ 1015| 3.10k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 3.10k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 5.11k| : (is_leaf ------------------ | Branch (1017:23): [True: 1.20k, False: 802] ------------------ 1018| 2.00k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 2.00k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 802| .visit(v, args...)); 1021| 5.11k| } _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| 935k| { 145| 935k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 935k| } _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| 22.4k| { 1037| 22.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 22.4k| } _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| 22.4k| { 832| 22.4k| return each_pred_regular(*this, v, args...); 833| 22.4k| } _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| 22.4k|{ 366| 22.4k| constexpr auto B = bits; 367| 22.4k| constexpr auto BL = bits_leaf; 368| 22.4k| auto n = p.node()->inner(); 369| 22.4k| auto last = p.count() - 1; 370| 22.4k| auto e = n + last; 371| 22.4k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 17.3k, False: 5.12k] ------------------ 372| 126k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 110k, False: 16.3k] ------------------ 373| 110k| IMMER_PREFETCH(n + 1); 374| 110k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 1.04k, False: 109k] ------------------ 375| 1.04k| return false; 376| 110k| } 377| 16.3k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 17.3k| } else { 379| 5.12k| auto ss = p.shift() - B; 380| 22.0k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 18.0k, False: 4.06k] ------------------ 381| 18.0k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 1.05k, False: 16.9k] ------------------ 382| 1.05k| return false; 383| 4.06k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 5.12k| } 385| 22.4k|} _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| 19.9k| { 113| 19.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 19.9k| } _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.99k| { 337| 4.99k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.99k| } _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.99k| { 250| 4.99k| return each_pred_regular(*this, v, args...); 251| 4.99k| } _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.99k|{ 366| 4.99k| constexpr auto B = bits; 367| 4.99k| constexpr auto BL = bits_leaf; 368| 4.99k| auto n = p.node()->inner(); 369| 4.99k| auto last = p.count() - 1; 370| 4.99k| auto e = n + last; 371| 4.99k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 3.85k, False: 1.14k] ------------------ 372| 18.8k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 15.2k, False: 3.60k] ------------------ 373| 15.2k| IMMER_PREFETCH(n + 1); 374| 15.2k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 246, False: 14.9k] ------------------ 375| 246| return false; 376| 15.2k| } 377| 3.60k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 3.85k| } else { 379| 1.14k| auto ss = p.shift() - B; 380| 1.97k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 1.04k, False: 929] ------------------ 381| 1.04k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 217, False: 829] ------------------ 382| 217| return false; 383| 929| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 1.14k| } 385| 4.99k|} _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| 5.35k| { 1037| 5.35k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.35k| } _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| 5.35k| { 1794| 5.35k| auto child = node_->inner()[offset]; 1795| 5.35k| auto child_size = size(offset); 1796| 5.35k| auto is_leaf = shift_ == BL; 1797| 5.35k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 5.35k] ------------------ 1798| 5.35k| : visit_maybe_relaxed_sub( 1799| 5.35k| child, shift_ - B, child_size, v, args...); 1800| 5.35k| } _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| 5.35k|{ 1839| 5.35k| assert(node); ------------------ | Branch (1839:5): [True: 5.35k, False: 0] ------------------ 1840| 5.35k| auto relaxed = node->relaxed(); 1841| 5.35k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.09k, False: 4.26k] ------------------ 1842| 1.09k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.09k, False: 0] ------------------ 1843| 1.09k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.09k| .visit(v, std::forward(args)...); 1845| 4.26k| } else { 1846| 4.26k| return make_regular_sub_pos(node, shift, size) 1847| 4.26k| .visit(v, std::forward(args)...); 1848| 4.26k| } 1849| 5.35k|} _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| 1.09k| { 1814| 1.09k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.09k| } _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| 8.63k| { 1008| 8.63k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 8.63k, False: 0] ------------------ 1009| 8.63k| auto is_leaf = shift_ == BL; 1010| 8.63k| auto child = node_->inner()[idx]; 1011| 8.63k| auto lsize = size(idx); 1012| 8.63k| auto is_full = idx + 1 < count(); 1013| 8.63k| return is_full ------------------ | Branch (1013:16): [True: 8.07k, False: 555] ------------------ 1014| 8.63k| ? (is_leaf ------------------ | Branch (1014:23): [True: 5.57k, False: 2.50k] ------------------ 1015| 8.07k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 8.07k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 8.63k| : (is_leaf ------------------ | Branch (1017:23): [True: 555, False: 0] ------------------ 1018| 555| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 555| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 8.63k| } _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| 12.1k| { 208| 12.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 12.1k| } _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| 12.1k| { 1805| 12.1k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 12.1k, False: 0] ------------------ 1806| 12.1k| auto child = node_->inner()[offset]; 1807| 12.1k| auto child_size = size(offset); 1808| 12.1k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 12.1k| } _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| 12.1k| { 145| 12.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 12.1k| } _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.36k| { 1406| 4.36k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.36k| } _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.36k| { 1794| 4.36k| auto child = node_->inner()[offset]; 1795| 4.36k| auto child_size = size(offset); 1796| 4.36k| auto is_leaf = shift_ == BL; 1797| 4.36k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 4.36k] ------------------ 1798| 4.36k| : visit_maybe_relaxed_sub( 1799| 4.36k| child, shift_ - B, child_size, v, args...); 1800| 4.36k| } _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.36k|{ 1839| 4.36k| assert(node); ------------------ | Branch (1839:5): [True: 4.36k, False: 0] ------------------ 1840| 4.36k| auto relaxed = node->relaxed(); 1841| 4.36k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.85k, False: 2.50k] ------------------ 1842| 1.85k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.85k, False: 0] ------------------ 1843| 1.85k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.85k| .visit(v, std::forward(args)...); 1845| 2.50k| } else { 1846| 2.50k| return make_regular_sub_pos(node, shift, size) 1847| 2.50k| .visit(v, std::forward(args)...); 1848| 2.50k| } 1849| 4.36k|} _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| 1.85k| { 1814| 1.85k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.85k| } _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| 8.44k| { 1387| 8.44k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 8.44k, False: 0] ------------------ 1388| 8.44k| auto is_leaf = shift_ == BL; 1389| 8.44k| auto child = node_->inner()[idx]; 1390| 8.44k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 6.57k, False: 1.86k] ------------------ 1391| 8.44k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 8.44k| } _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.50k| { 1037| 2.50k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.50k| } _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| 69.4k| { 1794| 69.4k| auto child = node_->inner()[offset]; 1795| 69.4k| auto child_size = size(offset); 1796| 69.4k| auto is_leaf = shift_ == BL; 1797| 69.4k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 31.1k, False: 38.2k] ------------------ 1798| 69.4k| : visit_maybe_relaxed_sub( 1799| 38.2k| child, shift_ - B, child_size, v, args...); 1800| 69.4k| } _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| 165k|{ 1839| 165k| assert(node); ------------------ | Branch (1839:5): [True: 165k, False: 0] ------------------ 1840| 165k| auto relaxed = node->relaxed(); 1841| 165k| if (relaxed) { ------------------ | Branch (1841:9): [True: 143k, False: 21.6k] ------------------ 1842| 143k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 143k, False: 0] ------------------ 1843| 143k| return make_relaxed_pos(node, shift, relaxed) 1844| 143k| .visit(v, std::forward(args)...); 1845| 143k| } else { 1846| 21.6k| return make_regular_sub_pos(node, shift, size) 1847| 21.6k| .visit(v, std::forward(args)...); 1848| 21.6k| } 1849| 165k|} _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| 143k| { 1814| 143k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 143k| } _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| 143k| { 1483| 143k| auto p = node_->inner(); 1484| 143k| auto s = size_t{}; 1485| 143k| auto n = count(); 1486| 143k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 124k, False: 18.9k] ------------------ 1487| 1.02M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 903k, False: 123k] ------------------ 1488| 903k| IMMER_PREFETCH(p + i + 1); 1489| 903k| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 930, False: 902k] ------------------ 1490| 903k| .visit(v, args...)) 1491| 930| return false; 1492| 902k| s = relaxed_->d.sizes[i]; 1493| 902k| } 1494| 124k| } else { 1495| 18.9k| auto ss = shift_ - B; 1496| 145k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 126k, False: 18.1k] ------------------ 1497| 126k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 790, False: 126k] ------------------ 1498| 126k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 790| return false; 1500| 126k| s = relaxed_->d.sizes[i]; 1501| 126k| } 1502| 18.9k| } 1503| 141k| return true; 1504| 143k| } _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| 3.12k| { 1037| 3.12k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.12k| } _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.13k| { 1784| 1.13k| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 1.13k, False: 0] ------------------ 1785| 1.13k| auto child = node_->inner()[0]; 1786| 1.13k| auto child_size = relaxed_->d.sizes[0]; 1787| 1.13k| return visit_maybe_relaxed_sub( 1788| 1.13k| child, shift_ - B, child_size, v, args...); 1789| 1.13k| } _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.13k|{ 1839| 1.13k| assert(node); ------------------ | Branch (1839:5): [True: 1.13k, False: 0] ------------------ 1840| 1.13k| auto relaxed = node->relaxed(); 1841| 1.13k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.13k, False: 0] ------------------ 1842| 1.13k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.13k, False: 0] ------------------ 1843| 1.13k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.13k| .visit(v, std::forward(args)...); 1845| 1.13k| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 1.13k|} _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.13k| { 1814| 1.13k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.13k| } _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| 9.08k|{ 1839| 9.08k| assert(node); ------------------ | Branch (1839:5): [True: 9.08k, False: 0] ------------------ 1840| 9.08k| auto relaxed = node->relaxed(); 1841| 9.08k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.75k, False: 6.32k] ------------------ 1842| 2.75k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.75k, False: 0] ------------------ 1843| 2.75k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.75k| .visit(v, std::forward(args)...); 1845| 6.32k| } else { 1846| 6.32k| return make_regular_sub_pos(node, shift, size) 1847| 6.32k| .visit(v, std::forward(args)...); 1848| 6.32k| } 1849| 9.08k|} _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.75k| { 1814| 2.75k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.75k| } _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.32k| { 1037| 6.32k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.32k| } _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| 9.08k| { 1037| 9.08k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 9.08k| } _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.74k| { 145| 6.74k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.74k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 114| 1.38M| : size{0} 115| 1.38M| , shift{BL} 116| 1.38M| , root{empty_root()} 117| 1.38M| , tail{empty_tail()} 118| 1.38M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 1.38M, False: 0] ------------------ 120| 1.38M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_rootEv: 61| 1.39M| { 62| 1.39M| static const auto empty_ = [] { 63| 1.39M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1.39M| static std::aligned_storage_t 65| 1.39M| storage; 66| 1.39M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1.39M| }(); 68| 1.39M| return empty_->inc(); 69| 1.39M| } _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.38M| { 73| 1.38M| static const auto empty_ = [] { 74| 1.38M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1.38M| static std::aligned_storage_t 76| 1.38M| storage; 77| 1.38M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1.38M| }(); 79| 1.38M| return empty_->inc(); 80| 1.38M| } _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.44M| { 1373| 3.44M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 3.44M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.44M] | | ------------------ | | 33| 3.44M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 3.44M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 3.44M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.44M] | | ------------------ | | 33| 3.44M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 3.44M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 3.44M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.44M] | | ------------------ | | 33| 3.44M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 3.44M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 3.44M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.44M] | | ------------------ | | 33| 3.44M| 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.44M| return true; 1382| 3.44M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11tail_offsetEv: 197| 18.9M| { 198| 18.9M| auto r = root->relaxed(); 199| 18.9M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 7.57M, False: 11.4M] | Branch (199:9): [True: 11.4M, False: 0] | Branch (199:9): [True: 18.9M, False: 0] ------------------ 200| 18.9M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 11.4M, False: 7.57M] ------------------ 201| 18.9M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 3.41M, False: 4.16M] ------------------ 202| | /* otherwise */ 203| 7.57M| : 0; 204| 18.9M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9tail_sizeEv: 194| 3.84M| 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.44M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3decEv: 192| 3.44M| 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.44M| { 209| 3.44M| auto tail_off = tail_offset(); 210| 3.44M| auto tail_size = size - tail_off; 211| | 212| 3.44M| if (tail_off) ------------------ | Branch (212:13): [True: 1.91M, False: 1.53M] ------------------ 213| 1.91M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 1.53M| else 215| 1.53M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 3.44M| if (tail_size) ------------------ | Branch (217:13): [True: 2.06M, False: 1.38M] ------------------ 218| 2.06M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 1.38M| else 220| 1.38M| make_empty_leaf_pos(tail).visit(v, args...); 221| 3.44M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 500| 349k| { 501| 349k| auto ts = tail_size(); 502| 349k| if (ts < branches) { ------------------ | Branch (502:13): [True: 296k, False: 52.7k] ------------------ 503| 296k| auto new_tail = 504| 296k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 296k| return {size + 1, shift, root->inc(), new_tail}; 506| 296k| } else { 507| 52.7k| using std::get; 508| 52.7k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 52.7k| auto tail_off = tail_offset(); 510| 52.7k| IMMER_TRY { ------------------ | | 49| 52.7k|#define IMMER_TRY try ------------------ 511| 52.7k| auto new_root = 512| 52.7k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 52.7k| tail->inc(); 514| 52.7k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 52.7k| } 516| 52.7k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 52.7k| } 521| 349k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2EmjPNS1_4nodeIiSA_Lj3ELj3EEESE_: 127| 2.06M| : size{sz} 128| 2.06M| , shift{sh} 129| 2.06M| , root{r} 130| 2.06M| , tail{t} 131| 2.06M| { 132| 2.06M|#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| 2.06M| try { 137| 2.06M| check_tree(); 138| 2.06M| } 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| 2.06M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_tailEPNS1_4nodeIiSA_Lj3ELj3EEEjmSE_j: 369| 369k| { 370| 369k| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 56.6k, False: 312k] ------------------ 371| 56.6k| auto new_root = 372| 56.6k| make_relaxed_pos(root, shift, r) 373| 56.6k| .visit(push_tail_visitor{}, tail, tail_size); 374| 56.6k| if (new_root) ------------------ | Branch (374:17): [True: 54.6k, False: 2.01k] ------------------ 375| 54.6k| return std::make_tuple(shift, new_root); 376| 2.01k| else { 377| 2.01k| auto new_root = node_t::make_inner_r_n(2); 378| 2.01k| IMMER_TRY { ------------------ | | 49| 2.01k|#define IMMER_TRY try ------------------ 379| 2.01k| auto new_path = node_t::make_path(shift, tail); 380| 2.01k| new_root->inner()[0] = root->inc(); 381| 2.01k| new_root->inner()[1] = new_path; 382| 2.01k| new_root->relaxed()->d.sizes[0] = size; 383| 2.01k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 2.01k| assert(size); ------------------ | Branch (384:21): [True: 2.01k, False: 0] ------------------ 385| 2.01k| assert(tail_size); ------------------ | Branch (385:21): [True: 2.01k, False: 0] ------------------ 386| 2.01k| new_root->relaxed()->d.count = 2u; 387| 2.01k| } 388| 2.01k| IMMER_CATCH (...) { 389| 0| node_t::delete_inner_r(new_root, 2); 390| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 391| 0| } 392| 2.01k| return std::make_tuple(shift + B, new_root); 393| 2.01k| } 394| 312k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 4.14k, False: 308k] ------------------ 395| 4.14k| auto new_root = node_t::make_inner_n(2); 396| 4.14k| IMMER_TRY { ------------------ | | 49| 4.14k|#define IMMER_TRY try ------------------ 397| 4.14k| auto new_path = node_t::make_path(shift, tail); 398| 4.14k| new_root->inner()[0] = root->inc(); 399| 4.14k| new_root->inner()[1] = new_path; 400| 4.14k| } 401| 4.14k| IMMER_CATCH (...) { 402| 0| node_t::delete_inner(new_root, 2); 403| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 404| 0| } 405| 4.14k| return std::make_tuple(shift + B, new_root); 406| 308k| } else if (size) { ------------------ | Branch (406:20): [True: 295k, False: 13.2k] ------------------ 407| 295k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 295k| .visit(push_tail_visitor{}, tail); 409| 295k| return std::make_tuple(shift, new_root); 410| 295k| } else { 411| 13.2k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 13.2k| } 413| 369k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2EOSB_: 157| 1.28M| : rrbtree{} 158| 1.28M| { 159| 1.28M| swap(*this, other); 160| 1.28M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESC_: 176| 4.64M| { 177| 4.64M| using std::swap; 178| 4.64M| swap(x.size, y.size); 179| 4.64M| swap(x.shift, y.shift); 180| 4.64M| swap(x.root, y.root); 181| 4.64M| swap(x.tail, y.tail); 182| 4.64M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEaSEOSB_: 170| 3.35M| { 171| 3.35M| swap(*this, other); 172| 3.35M| return *this; 173| 3.35M| } 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| 168k| { 581| 168k| auto tail_off = tail_offset(); 582| 168k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 77.9k, False: 90.2k] ------------------ 583| 77.9k| auto tail_size = size - tail_off; 584| 77.9k| auto new_tail = 585| 77.9k| make_leaf_sub_pos(tail, tail_size) 586| 77.9k| .visit(update_visitor{}, idx - tail_off, fn); 587| 77.9k| return {size, shift, root->inc(), new_tail}; 588| 90.2k| } else { 589| 90.2k| auto new_root = visit_maybe_relaxed_sub( 590| 90.2k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 90.2k| return {size, shift, new_root, tail->inc()}; 592| 90.2k| } 593| 168k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 647| 24.4k| { 648| 24.4k| auto tail_off = tail_offset(); 649| 24.4k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 4.02k, False: 20.4k] ------------------ 650| 4.02k| return {}; 651| 20.4k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 1.18k, False: 19.2k] ------------------ 652| 1.18k| return *this; 653| 19.2k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 1.54k, False: 17.6k] ------------------ 654| 1.54k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 1.54k| return {new_size, shift, root->inc(), new_tail}; 656| 17.6k| } else { 657| 17.6k| using std::get; 658| 17.6k| auto l = new_size - 1; 659| 17.6k| auto v = slice_right_visitor(); 660| 17.6k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 17.6k| auto new_shift = get<0>(r); 662| 17.6k| auto new_root = get<1>(r); 663| 17.6k| auto new_tail = get<3>(r); 664| 17.6k| if (new_root) { ------------------ | Branch (664:17): [True: 13.1k, False: 4.49k] ------------------ 665| 13.1k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 13.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 13.1k, False: 0] ------------------ 666| 13.1k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 13.1k, False: 0] ------------------ 667| 13.1k| return {new_size, new_shift, new_root, new_tail}; 668| 13.1k| } else { 669| 4.49k| return {new_size, BL, empty_root(), new_tail}; 670| 4.49k| } 671| 17.6k| } 672| 24.4k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKSB_: 151| 9.04k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 9.04k| { 153| 9.04k| inc(); 154| 9.04k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 187| 9.04k| { 188| 9.04k| root->inc(); 189| 9.04k| tail->inc(); 190| 9.04k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 711| 37.2k| { 712| 37.2k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.52k, False: 34.6k] ------------------ 713| 2.52k| return *this; 714| 34.6k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 2.00k, False: 32.6k] ------------------ 715| 2.00k| return {}; 716| 32.6k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 2.08k, False: 30.5k] ------------------ 717| 2.08k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 30.5k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 1.66k, False: 28.9k] ------------------ 719| 1.66k| auto tail_off = tail_offset(); 720| 1.66k| auto new_tail = 721| 1.66k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 1.66k| return {size - elems, BL, empty_root(), new_tail}; 723| 28.9k| } else { 724| 28.9k| using std::get; 725| 28.9k| auto v = slice_left_visitor(); 726| 28.9k| auto r = 727| 28.9k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 28.9k| auto new_root = get<1>(r); 729| 28.9k| auto new_shift = get<0>(r); 730| 28.9k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 28.9k| } 732| 37.2k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8max_sizeEv: 54| 2.54M| { 55| 2.54M| auto S = sizeof(size_t) * 8; 56| 2.54M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 2.54M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 2.54M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6concatERKSB_: 735| 677k| { 736| 677k| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 677k, False: 0] ------------------ 737| 677k| using std::get; 738| 677k| if (size == 0) ------------------ | Branch (738:13): [True: 1.53k, False: 676k] ------------------ 739| 1.53k| return r; 740| 676k| else if (r.size == 0) ------------------ | Branch (740:18): [True: 1.05k, False: 675k] ------------------ 741| 1.05k| return *this; 742| 675k| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 335k, False: 340k] ------------------ 743| | // just concat the tail, similar to push_back 744| 335k| auto tail_offst = tail_offset(); 745| 335k| auto tail_size = size - tail_offst; 746| 335k| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 68.7k, False: 266k] ------------------ 747| 68.7k| auto new_root = 748| 68.7k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 68.7k| tail->inc(); 750| 68.7k| return {size + r.size, 751| 68.7k| get<0>(new_root), 752| 68.7k| get<1>(new_root), 753| 68.7k| r.tail->inc()}; 754| 266k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 19.6k, False: 246k] ------------------ 755| 19.6k| auto new_tail = 756| 19.6k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 19.6k| return {size + r.size, shift, root->inc(), new_tail}; 758| 246k| } else { 759| 246k| auto remaining = branches - tail_size; 760| 246k| auto add_tail = 761| 246k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 246k| IMMER_TRY { ------------------ | | 49| 246k|#define IMMER_TRY try ------------------ 763| 246k| auto new_tail = 764| 246k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 246k| IMMER_TRY { ------------------ | | 49| 246k|#define IMMER_TRY try ------------------ 766| 246k| auto new_root = push_tail( 767| 246k| root, shift, tail_offst, add_tail, branches); 768| 246k| return {size + r.size, 769| 246k| get<0>(new_root), 770| 246k| get<1>(new_root), 771| 246k| new_tail}; 772| 246k| } 773| 246k| 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| 246k| } 778| 246k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 246k| } 783| 340k| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 2.80k, False: 337k] ------------------ 784| 2.80k| auto tail_offst = tail_offset(); 785| 2.80k| auto tail_size = size - tail_offst; 786| 2.80k| auto concated = 787| 2.80k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 2.80k| auto new_shift = concated.shift(); 789| 2.80k| auto new_root = concated.node(); 790| 2.80k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 2.80k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 2.80k, False: 0] ------------------ 791| 2.80k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 2.80k, False: 0] ------------------ 792| 2.80k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 337k| } else { 794| 337k| auto tail_offst = tail_offset(); 795| 337k| auto tail_size = size - tail_offst; 796| 337k| auto concated = concat_trees(root, 797| 337k| shift, 798| 337k| tail_offst, 799| 337k| tail, 800| 337k| tail_size, 801| 337k| r.root, 802| 337k| r.shift, 803| 337k| r.tail_offset()); 804| 337k| auto new_shift = concated.shift(); 805| 337k| auto new_root = concated.node(); 806| 337k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 337k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 337k, False: 0] ------------------ 807| 337k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 337k, False: 0] ------------------ 808| 337k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 337k| } 810| 677k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 40.6k| { 479| 40.6k| auto ts = tail_size(); 480| 40.6k| if (ts < branches) { ------------------ | Branch (480:13): [True: 30.6k, False: 9.91k] ------------------ 481| 30.6k| ensure_mutable_tail(e, ts); 482| 30.6k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 30.6k| } else { 484| 9.91k| using std::get; 485| 9.91k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 9.91k| auto tail_off = tail_offset(); 487| 9.91k| IMMER_TRY { ------------------ | | 49| 9.91k|#define IMMER_TRY try ------------------ 488| 9.91k| push_tail_mut(e, tail_off, tail, ts); 489| 9.91k| tail = new_tail; 490| 9.91k| } 491| 9.91k| 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.91k| } 496| 40.6k| ++size; 497| 40.6k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 347k| { 470| 347k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 9.21k, False: 338k] ------------------ 471| 9.21k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 9.21k| dec_leaf(tail, n); 473| 9.21k| tail = new_tail; 474| 9.21k| } 475| 347k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj3ELj3EEEj: 417| 362k| { 418| 362k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 176k, False: 185k] ------------------ 419| 176k| auto new_root = 420| 176k| make_relaxed_pos(root, shift, r) 421| 176k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 176k| if (new_root) { ------------------ | Branch (422:17): [True: 175k, False: 743] ------------------ 423| 175k| root = new_root; 424| 175k| } else { 425| 743| auto new_root = node_t::make_inner_r_e(e); 426| 743| IMMER_TRY { ------------------ | | 49| 743|#define IMMER_TRY try ------------------ 427| 743| auto new_path = node_t::make_path_e(e, shift, tail); 428| 743| new_root->inner()[0] = root; 429| 743| new_root->inner()[1] = new_path; 430| 743| new_root->relaxed()->d.sizes[0] = tail_off; 431| 743| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 743| assert(tail_off); ------------------ | Branch (432:21): [True: 743, False: 0] ------------------ 433| 743| assert(tail_size); ------------------ | Branch (433:21): [True: 743, False: 0] ------------------ 434| 743| new_root->relaxed()->d.count = 2u; 435| 743| root = new_root; 436| 743| shift += B; 437| 743| } 438| 743| 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| 743| } 443| 185k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 1.93k, False: 183k] ------------------ 444| 1.93k| auto new_root = node_t::make_inner_e(e); 445| 1.93k| IMMER_TRY { ------------------ | | 49| 1.93k|#define IMMER_TRY try ------------------ 446| 1.93k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 1.93k| new_root->inner()[0] = root; 448| 1.93k| new_root->inner()[1] = new_path; 449| 1.93k| root = new_root; 450| 1.93k| shift += B; 451| 1.93k| } 452| 1.93k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 183k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 181k, False: 2.26k] ------------------ 457| 181k| auto new_root = 458| 181k| make_regular_sub_pos(root, shift, tail_off) 459| 181k| .visit(push_tail_mut_visitor{}, e, tail); 460| 181k| root = new_root; 461| 181k| } else { 462| 2.26k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 2.26k| dec_empty_regular(root); 464| 2.26k| root = new_root; 465| 2.26k| } 466| 362k| } 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| 33.3k| { 574| 33.3k| auto& elem = get_mut(e, idx); 575| 33.3k| elem = std::forward(fn)(std::move(elem)); 576| 33.3k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 33.3k| { 540| 33.3k| auto tail_off = tail_offset(); 541| 33.3k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 11.7k, False: 21.6k] ------------------ 542| 11.7k| ensure_mutable_tail(e, size - tail_off); 543| 11.7k| return tail->leaf()[(idx - tail_off) & mask]; 544| 21.6k| } else { 545| 21.6k| return visit_maybe_relaxed_sub(root, 546| 21.6k| shift, 547| 21.6k| tail_off, 548| 21.6k| get_mut_visitor{}, 549| 21.6k| idx, 550| 21.6k| e, 551| 21.6k| &root); 552| 21.6k| } 553| 33.3k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 31.7k| { 607| 31.7k| auto tail_off = tail_offset(); 608| 31.7k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 753, False: 31.0k] ------------------ 609| 753| *this = {}; 610| 31.0k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 493, False: 30.5k] ------------------ 611| 493| return; 612| 30.5k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 582, False: 29.9k] ------------------ 613| 582| auto ts = size - tail_off; 614| 582| auto newts = new_size - tail_off; 615| 582| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 321, False: 261] ------------------ 616| 321| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 321| } else { 618| 261| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 261| dec_leaf(tail, ts); 620| 261| tail = new_tail; 621| 261| } 622| 582| size = new_size; 623| 582| 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.54k] ------------------ 633| 23.4k| root = new_root; 634| 23.4k| shift = new_shift; 635| 23.4k| } else { 636| 6.54k| root = empty_root(); 637| 6.54k| shift = BL; 638| 6.54k| } 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.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 62.3k| { 676| 62.3k| using std::get; 677| 62.3k| auto tail_off = tail_offset(); 678| 62.3k| if (elems == 0) { ------------------ | Branch (678:13): [True: 6.13k, False: 56.2k] ------------------ 679| 6.13k| return; 680| 56.2k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 272, False: 55.9k] ------------------ 681| 272| *this = {}; 682| 55.9k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 207, False: 55.7k] ------------------ 683| 207| dec_inner(root, shift, tail_off); 684| 207| shift = BL; 685| 207| root = empty_root(); 686| 207| size -= elems; 687| 207| return; 688| 55.7k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 913, False: 54.8k] ------------------ 689| 913| auto v = slice_left_mut_visitor(); 690| 913| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 913| .visit(v, elems - tail_off, e)); 692| 913| if (tail_off) { ------------------ | Branch (692:17): [True: 234, False: 679] ------------------ 693| 234| dec_inner(root, shift, tail_off); 694| 234| shift = BL; 695| 234| root = empty_root(); 696| 234| } 697| 913| size -= elems; 698| 913| return; 699| 54.8k| } else { 700| 54.8k| auto v = slice_left_mut_visitor(); 701| 54.8k| auto r = 702| 54.8k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 54.8k| shift = get<0>(r); 704| 54.8k| root = get<1>(r); 705| 54.8k| size -= elems; 706| 54.8k| return; 707| 54.8k| } 708| 62.3k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editERKSB_: 816| 216k| { 817| 216k| assert(&l != &r); ------------------ | Branch (817:9): [True: 216k, False: 0] ------------------ 818| 216k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 216k, False: 0] ------------------ 819| 216k| using std::get; 820| 216k| if (l.size == 0) ------------------ | Branch (820:13): [True: 436, False: 216k] ------------------ 821| 436| l = r; 822| 216k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 555, False: 215k] ------------------ 823| 555| return; 824| 215k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 68.3k, False: 147k] ------------------ 825| | // just concat the tail, similar to push_back 826| 68.3k| auto tail_offst = l.tail_offset(); 827| 68.3k| auto tail_size = l.size - tail_offst; 828| 68.3k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 11.5k, False: 56.7k] ------------------ 829| 11.5k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 11.5k| l.tail = r.tail->inc(); 831| 11.5k| l.size += r.size; 832| 11.5k| return; 833| 56.7k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 869, False: 55.9k] ------------------ 834| 869| l.ensure_mutable_tail(el, tail_size); 835| 869| detail::uninitialized_copy(r.tail->leaf(), 836| 869| r.tail->leaf() + r.size, 837| 869| l.tail->leaf() + tail_size); 838| 869| l.size += r.size; 839| 869| return; 840| 55.9k| } else { 841| 55.9k| auto remaining = branches - tail_size; 842| 55.9k| l.ensure_mutable_tail(el, tail_size); 843| 55.9k| detail::uninitialized_copy(r.tail->leaf(), 844| 55.9k| r.tail->leaf() + remaining, 845| 55.9k| l.tail->leaf() + tail_size); 846| 55.9k| IMMER_TRY { ------------------ | | 49| 55.9k|#define IMMER_TRY try ------------------ 847| 55.9k| auto new_tail = 848| 55.9k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 55.9k| IMMER_TRY { ------------------ | | 49| 55.9k|#define IMMER_TRY try ------------------ 850| 55.9k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 55.9k| l.tail = new_tail; 852| 55.9k| l.size += r.size; 853| 55.9k| return; 854| 55.9k| } 855| 55.9k| 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| 55.9k| } 860| 55.9k| 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| 55.9k| } 865| 147k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 426, False: 147k] ------------------ 866| 426| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 426] ------------------ 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| 426| } else { 886| 426| auto tail_offst = l.tail_offset(); 887| 426| auto tail_size = l.size - tail_offst; 888| 426| auto concated = concat_trees( 889| 426| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 426| l = {l.size + r.size, 891| 426| concated.shift(), 892| 426| concated.node(), 893| 426| r.tail->inc()}; 894| 426| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 426, False: 0] ------------------ 895| 426| return; 896| 426| } 897| 147k| } else { 898| 147k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 147k] ------------------ 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| 147k| } else { 923| 147k| auto tail_offst = l.tail_offset(); 924| 147k| auto tail_size = l.size - tail_offst; 925| 147k| auto concated = concat_trees(l.root, 926| 147k| l.shift, 927| 147k| tail_offst, 928| 147k| l.tail, 929| 147k| tail_size, 930| 147k| r.root, 931| 147k| r.shift, 932| 147k| r.tail_offset()); 933| 147k| l = {l.size + r.size, 934| 147k| concated.shift(), 935| 147k| concated.node(), 936| 147k| r.tail->inc()}; 937| 147k| } 938| 147k| } 939| 216k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEaSERKSB_: 163| 2.73k| { 164| 2.73k| auto next{other}; 165| 2.73k| swap(*this, next); 166| 2.73k| return *this; 167| 2.73k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERSB_NS9_5applyIS6_E4type4editE: 942| 3.63k| { 943| 3.63k| assert(&l != &r); ------------------ | Branch (943:9): [True: 3.63k, False: 0] ------------------ 944| 3.63k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 3.63k, False: 0] ------------------ 945| 3.63k| using std::get; 946| 3.63k| if (r.size == 0) ------------------ | Branch (946:13): [True: 237, False: 3.40k] ------------------ 947| 237| r = std::move(l); 948| 3.40k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 197, False: 3.20k] ------------------ 949| 197| return; 950| 3.20k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 1.23k, False: 1.97k] ------------------ 951| | // just concat the tail, similar to push_back 952| 1.23k| auto tail_offst = l.tail_offset(); 953| 1.23k| auto tail_size = l.size - tail_offst; 954| 1.23k| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 327, False: 907] ------------------ 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| 327| auto res = 959| 327| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 327| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 327| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 327| return; 965| 907| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 426, False: 481] ------------------ 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| 426| auto new_tail = 974| 426| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 426| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 426| return; 977| 481| } else { 978| | // like the immutable version 979| 481| auto remaining = branches - tail_size; 980| 481| auto add_tail = node_t::copy_leaf_e( 981| 481| er, l.tail, tail_size, r.tail, remaining); 982| 481| IMMER_TRY { ------------------ | | 49| 481|#define IMMER_TRY try ------------------ 983| 481| auto new_tail = 984| 481| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 481| IMMER_TRY { ------------------ | | 49| 481|#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| 481| auto new_root = l.push_tail(l.root, 990| 481| l.shift, 991| 481| tail_offst, 992| 481| add_tail, 993| 481| branches); 994| 481| r = {l.size + r.size, 995| 481| get<0>(new_root), 996| 481| get<1>(new_root), 997| 481| new_tail}; 998| 481| return; 999| 481| } 1000| 481| 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| 481| } 1005| 481| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 481| } 1010| 1.97k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 610, False: 1.36k] ------------------ 1011| 610| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 610] ------------------ 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| 610| } else { 1030| 610| auto tail_offst = l.tail_offset(); 1031| 610| auto tail_size = l.size - tail_offst; 1032| 610| auto concated = concat_trees( 1033| 610| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 610| r = {l.size + r.size, 1035| 610| concated.shift(), 1036| 610| concated.node(), 1037| 610| r.tail->inc()}; 1038| 610| return; 1039| 610| } 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.63k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 952k| { 1085| 952k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 952k, False: 0] ------------------ 1086| 952k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 952k, False: 0] ------------------ 1087| 952k| using std::get; 1088| 952k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 2.06k, False: 950k] ------------------ 1089| 2.06k| l = r; 1090| 950k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 2.31k, False: 947k] ------------------ 1091| 2.31k| return; 1092| 947k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 288k, False: 659k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 288k| auto tail_offst = l.tail_offset(); 1095| 288k| auto tail_size = l.size - tail_offst; 1096| 288k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 40.1k, False: 248k] ------------------ 1097| 40.1k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 40.1k| l.tail = r.tail->inc(); 1099| 40.1k| l.size += r.size; 1100| 40.1k| return; 1101| 248k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 3.53k, False: 244k] ------------------ 1102| 3.53k| l.ensure_mutable_tail(el, tail_size); 1103| 3.53k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 1.69k, False: 1.84k] ------------------ 1104| 1.69k| detail::uninitialized_move(r.tail->leaf(), 1105| 1.69k| r.tail->leaf() + r.size, 1106| 1.69k| l.tail->leaf() + tail_size); 1107| 1.84k| else 1108| 1.84k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.84k| r.tail->leaf() + r.size, 1110| 1.84k| l.tail->leaf() + tail_size); 1111| 3.53k| l.size += r.size; 1112| 3.53k| return; 1113| 244k| } else { 1114| 244k| auto remaining = branches - tail_size; 1115| 244k| l.ensure_mutable_tail(el, tail_size); 1116| 244k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 103k, False: 140k] ------------------ 1117| 103k| detail::uninitialized_move(r.tail->leaf(), 1118| 103k| r.tail->leaf() + remaining, 1119| 103k| l.tail->leaf() + tail_size); 1120| 140k| else 1121| 140k| detail::uninitialized_copy(r.tail->leaf(), 1122| 140k| r.tail->leaf() + remaining, 1123| 140k| l.tail->leaf() + tail_size); 1124| 244k| IMMER_TRY { ------------------ | | 49| 244k|#define IMMER_TRY try ------------------ 1125| 244k| auto new_tail = 1126| 244k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 244k| IMMER_TRY { ------------------ | | 49| 244k|#define IMMER_TRY try ------------------ 1128| 244k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 244k| l.tail = new_tail; 1130| 244k| l.size += r.size; 1131| 244k| return; 1132| 244k| } 1133| 244k| 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| 244k| } 1138| 244k| 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| 244k| } 1143| 659k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.47k, False: 656k] ------------------ 1144| 3.47k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.47k] ------------------ 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.47k| } else { 1165| 3.47k| auto tail_offst = l.tail_offset(); 1166| 3.47k| auto tail_size = l.size - tail_offst; 1167| 3.47k| auto concated = concat_trees( 1168| 3.47k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.47k| l = {l.size + r.size, 1170| 3.47k| concated.shift(), 1171| 3.47k| concated.node(), 1172| 3.47k| r.tail->inc()}; 1173| 3.47k| return; 1174| 3.47k| } 1175| 656k| } else { 1176| 656k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 656k] ------------------ 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| 656k| } else { 1200| 656k| auto tail_offst = l.tail_offset(); 1201| 656k| auto tail_size = l.size - tail_offst; 1202| 656k| auto concated = concat_trees(l.root, 1203| 656k| l.shift, 1204| 656k| tail_offst, 1205| 656k| l.tail, 1206| 656k| tail_size, 1207| 656k| r.root, 1208| 656k| r.shift, 1209| 656k| r.tail_offset()); 1210| 656k| l = {l.size + r.size, 1211| 656k| concated.shift(), 1212| 656k| concated.node(), 1213| 656k| r.tail->inc()}; 1214| 656k| return; 1215| 656k| } 1216| 656k| } 1217| 952k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6equalsERKSB_: 315| 78.5k| { 316| 78.5k| using iter_t = rrbtree_iterator; 317| 78.5k| if (size != other.size) ------------------ | Branch (317:13): [True: 55.0k, False: 23.4k] ------------------ 318| 55.0k| return false; 319| 23.4k| if (size == 0) ------------------ | Branch (319:13): [True: 209, False: 23.2k] ------------------ 320| 209| return true; 321| 23.2k| auto tail_off = tail_offset(); 322| 23.2k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 23.2k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 22.2k, False: 1.01k] | Branch (324:29): [True: 22.0k, 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| 22.0k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 21.3k, False: 706] ------------------ 329| 21.3k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 11.4k, False: 9.84k] ------------------ 330| 21.3k| other.shift, 331| 21.3k| tail_off_other, 332| 21.3k| equals_visitor::rrb{}, 333| 21.3k| iter_t{other}, 334| 21.3k| root, 335| 21.3k| shift, 336| 21.3k| tail_off)) 337| 11.4k| return false; 338| 21.3k| } else { 339| 706| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 301, False: 405] ------------------ 340| 706| shift, 341| 706| tail_off, 342| 706| equals_visitor::rrb{}, 343| 706| iter_t{*this}, 344| 706| other.root, 345| 706| other.shift, 346| 706| tail_off_other)) 347| 301| return false; 348| 706| } 349| 22.0k| } 350| 11.4k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 6.74k, False: 4.72k] ------------------ 351| 11.4k| ? make_leaf_sub_pos(tail, tail_size()) 352| 6.74k| .visit(equals_visitor{}, other.tail) 353| 11.4k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 2.10k, False: 2.61k] ------------------ 354| 4.72k| ? std::equal(tail->leaf(), 355| 2.10k| tail->leaf() + (size - tail_off), 356| 2.10k| other.tail->leaf() + 357| 2.10k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 4.72k| : std::equal(tail->leaf(), 360| 2.61k| tail->leaf() + (size - tail_off), 361| 2.61k| iter_t{other} + tail_off); 362| 23.2k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10region_forEm: 524| 1.41M| { 525| 1.41M| using std::get; 526| 1.41M| auto tail_off = tail_offset(); 527| 1.41M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 4.60k, False: 1.40M] ------------------ 528| 4.60k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.40M| } else { 530| 1.40M| auto subs = visit_maybe_relaxed_sub( 531| 1.40M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.40M| auto first = idx - get<1>(subs); 533| 1.40M| auto end = first + get<2>(subs); 534| 1.40M| return std::make_tuple(get<0>(subs), first, end); 535| 1.40M| } 536| 1.41M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11dereferenceEv: 90| 10.9M| { 91| 10.9M| using std::get; 92| 10.9M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 88.2k, False: 10.8M] | Branch (92:35): [True: 1.32M, False: 9.50M] ------------------ 93| 1.41M| curr_ = v_->region_for(i_); 94| 10.9M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 10.9M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7advanceEl: 74| 175k| { 75| 175k| using std::get; 76| 175k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 399, False: 174k] | Branch (76:9): [True: 174k, False: 0] | Branch (76:9): [True: 175k, False: 0] ------------------ 77| 175k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 175k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 175k, False: 0] ------------------ 78| 175k| i_ += n; 79| 175k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9incrementEv: 60| 9.57M| { 61| 9.57M| using std::get; 62| 9.57M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 9.57M, False: 0] ------------------ 63| 9.57M| ++i_; 64| 9.57M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKNS1_7rrbtreeIiSA_Lj3ELj3EEE: 39| 24.6k| : v_{&v} 40| 24.6k| , i_{0} 41| 24.6k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 24.6k| { 43| 24.6k| } _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| 24.4k| { 32| 24.4k| return Deriv::visit_inner(std::forward(args)...); 33| 24.4k| } _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| 91.5k| { 32| 91.5k| return Deriv::visit_inner(std::forward(args)...); 33| 91.5k| } _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.42k| { 38| 1.42k| return Deriv::visit_inner(std::forward(args)...); 39| 1.42k| } _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.22k| { 38| 7.22k| return Deriv::visit_inner(std::forward(args)...); 39| 7.22k| } _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.54k| { 38| 8.54k| return Deriv::visit_inner(std::forward(args)...); 39| 8.54k| } _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| 760| { 38| 760| return Deriv::visit_inner(std::forward(args)...); 39| 760| } _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| 2.09k| { 38| 2.09k| return Deriv::visit_inner(std::forward(args)...); 39| 2.09k| } _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.32k| { 38| 7.32k| return Deriv::visit_inner(std::forward(args)...); 39| 7.32k| } _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.32k| { 44| 7.32k| return Deriv::visit_node(std::forward(args)...); 45| 7.32k| } _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| 4.99k| { 32| 4.99k| return Deriv::visit_inner(std::forward(args)...); 33| 4.99k| } _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| 4.99k| { 44| 4.99k| return Deriv::visit_node(std::forward(args)...); 45| 4.99k| } _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| 8.51M| { 50| 8.51M| return Deriv::visit_node(std::forward(args)...); 51| 8.51M| } _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| 119M| { 32| 119M| return Deriv::visit_inner(std::forward(args)...); 33| 119M| } _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| 119M| { 44| 119M| return Deriv::visit_node(std::forward(args)...); 45| 119M| } _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| 119M| { 32| 119M| return Deriv::visit_inner(std::forward(args)...); 33| 119M| } _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| 16.7k| { 32| 16.7k| return Deriv::visit_inner(std::forward(args)...); 33| 16.7k| } _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| 297| { 38| 297| return Deriv::visit_inner(std::forward(args)...); 39| 297| } _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| 1.03k| { 38| 1.03k| return Deriv::visit_inner(std::forward(args)...); 39| 1.03k| } _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| 6.01M| { 50| 6.01M| return Deriv::visit_node(std::forward(args)...); 51| 6.01M| } _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| 503k| { 38| 503k| return Deriv::visit_inner(std::forward(args)...); 39| 503k| } _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| 503k| { 44| 503k| return Deriv::visit_node(std::forward(args)...); 45| 503k| } _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| 503k| { 38| 503k| return Deriv::visit_inner(std::forward(args)...); 39| 503k| } _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| 4.25M| { 38| 4.25M| return Deriv::visit_inner(std::forward(args)...); 39| 4.25M| } _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| 4.25M| { 44| 4.25M| return Deriv::visit_node(std::forward(args)...); 45| 4.25M| } _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| 4.25M| { 38| 4.25M| return Deriv::visit_inner(std::forward(args)...); 39| 4.25M| } _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.32k| { 38| 2.32k| return Deriv::visit_inner(std::forward(args)...); 39| 2.32k| } _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.32k| { 44| 2.32k| return Deriv::visit_node(std::forward(args)...); 45| 2.32k| } _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.12M| { 32| 1.12M| return Deriv::visit_inner(std::forward(args)...); 33| 1.12M| } _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.12M| { 44| 1.12M| return Deriv::visit_node(std::forward(args)...); 45| 1.12M| } _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.11M| { 32| 1.11M| return Deriv::visit_inner(std::forward(args)...); 33| 1.11M| } _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.11M| { 44| 1.11M| return Deriv::visit_node(std::forward(args)...); 45| 1.11M| } _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.56M| { 32| 3.56M| return Deriv::visit_inner(std::forward(args)...); 33| 3.56M| } _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.76k| { 38| 4.76k| return Deriv::visit_inner(std::forward(args)...); 39| 4.76k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 1.12M| { 32| 1.12M| return Deriv::visit_inner(std::forward(args)...); 33| 1.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_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 393k| { 38| 393k| return Deriv::visit_inner(std::forward(args)...); 39| 393k| } _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| 9.89k| { 38| 9.89k| return Deriv::visit_inner(std::forward(args)...); 39| 9.89k| } _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| 3.25k| { 38| 3.25k| return Deriv::visit_inner(std::forward(args)...); 39| 3.25k| } _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| 5.97k| { 38| 5.97k| return Deriv::visit_inner(std::forward(args)...); 39| 5.97k| } _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.51M| { 38| 1.51M| return Deriv::visit_inner(std::forward(args)...); 39| 1.51M| } _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.87M| { 32| 7.87M| return Deriv::visit_inner(std::forward(args)...); 33| 7.87M| } _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| 572| { 38| 572| return Deriv::visit_inner(std::forward(args)...); 39| 572| } _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| 9.72k| { 32| 9.72k| return Deriv::visit_inner(std::forward(args)...); 33| 9.72k| } _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.61k| { 38| 1.61k| return Deriv::visit_inner(std::forward(args)...); 39| 1.61k| } _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| 298| { 32| 298| return Deriv::visit_inner(std::forward(args)...); 33| 298| } _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| 448| { 32| 448| return Deriv::visit_inner(std::forward(args)...); 33| 448| } _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.83M| { 32| 7.83M| return Deriv::visit_inner(std::forward(args)...); 33| 7.83M| } _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| 6.83k| { 38| 6.83k| return Deriv::visit_inner(std::forward(args)...); 39| 6.83k| } _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| 6.83k| { 44| 6.83k| return Deriv::visit_node(std::forward(args)...); 45| 6.83k| } _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.7k| { 38| 16.7k| return Deriv::visit_inner(std::forward(args)...); 39| 16.7k| } _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.7k| { 44| 16.7k| return Deriv::visit_node(std::forward(args)...); 45| 16.7k| } _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.89k| { 32| 6.89k| return Deriv::visit_inner(std::forward(args)...); 33| 6.89k| } _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.89k| { 44| 6.89k| return Deriv::visit_node(std::forward(args)...); 45| 6.89k| } _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| 9.84k| { 38| 9.84k| return Deriv::visit_inner(std::forward(args)...); 39| 9.84k| } _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| 9.84k| { 44| 9.84k| return Deriv::visit_node(std::forward(args)...); 45| 9.84k| } _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.9k| { 32| 12.9k| return Deriv::visit_inner(std::forward(args)...); 33| 12.9k| } _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.9k| { 44| 12.9k| return Deriv::visit_node(std::forward(args)...); 45| 12.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 24.8k| { 32| 24.8k| return Deriv::visit_inner(std::forward(args)...); 33| 24.8k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_15regular_sub_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 2.06k| { 32| 2.06k| return Deriv::visit_inner(std::forward(args)...); 33| 2.06k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_8full_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 501| { 32| 501| return Deriv::visit_inner(std::forward(args)...); 33| 501| } _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| 959| { 38| 959| return Deriv::visit_inner(std::forward(args)...); 39| 959| } _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.88M| { 32| 4.88M| return Deriv::visit_inner(std::forward(args)...); 33| 4.88M| } _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| 421k| { 38| 421k| return Deriv::visit_inner(std::forward(args)...); 39| 421k| } _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| 422k| { 38| 422k| return Deriv::visit_inner(std::forward(args)...); 39| 422k| } _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| 42.8k| { 38| 42.8k| return Deriv::visit_inner(std::forward(args)...); 39| 42.8k| } _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| 33.4k| { 38| 33.4k| return Deriv::visit_inner(std::forward(args)...); 39| 33.4k| } _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| 848| { 38| 848| return Deriv::visit_inner(std::forward(args)...); 39| 848| } _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| 22.4k| { 38| 22.4k| return Deriv::visit_inner(std::forward(args)...); 39| 22.4k| } _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.99k| { 38| 4.99k| return Deriv::visit_inner(std::forward(args)...); 39| 4.99k| } _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| 5.35k| { 38| 5.35k| return Deriv::visit_inner(std::forward(args)...); 39| 5.35k| } _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.36k| { 38| 4.36k| return Deriv::visit_inner(std::forward(args)...); 39| 4.36k| } _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| 143k| { 32| 143k| return Deriv::visit_inner(std::forward(args)...); 33| 143k| } _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.13k| { 32| 1.13k| return Deriv::visit_inner(std::forward(args)...); 33| 1.13k| } _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.13k| { 44| 1.13k| return Deriv::visit_node(std::forward(args)...); 45| 1.13k| } _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| 9.08k| { 38| 9.08k| return Deriv::visit_inner(std::forward(args)...); 39| 9.08k| } _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| 9.08k| { 44| 9.08k| return Deriv::visit_node(std::forward(args)...); 45| 9.08k| } _ZN5immer6detail15auto_const_castINS_22unsafe_refcount_policyEEERT_RKS3_: 143| 504M|{ 144| 504M| return const_cast(x); 145| 504M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 312M| { 114| 312M| check_base(); 115| 312M| auto* base = static_cast(this); 116| 312M| return reinterpret_cast(base + 1); 117| 312M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 312M| { 135| 312M| static_assert(std::is_standard_layout::value && 136| 312M| !std::is_empty::value, 137| 312M| "Please add 'true' if the derived class is emtpy"); 138| 312M| } _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| 36.5M|{ 335| 36.5M|} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 1.61M|{ 189| 1.61M| return first + n; 190| 1.61M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6leaf_tEiLb1EE15get_storage_ptrEv: 75| 11.6M| { 76| 11.6M| check_base(); 77| 11.6M| return reinterpret_cast(this); 78| 11.6M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6leaf_tEiLb1EE10check_baseEv: 94| 11.6M| { 95| | // is_standard_layout requires that only one class in the hierarchy 96| | // contains non-static data members. Since this class contains one 97| | // member, the static_assert will only hold when the derived class is 98| | // empty. 99| 11.6M| static_assert(std::is_standard_layout::value, 100| 11.6M| "Please remove 'true' if the derived class is non emtpy"); 101| 11.6M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 2.14M|{ 237| 2.14M| return std::copy(first, last, out); 238| 2.14M|} _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| 194k|{ 340| 194k| return std::forward(f1)(empty_t{}); 341| 194k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 53.3M|{ 324| 53.3M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 2.54M, False: 50.8M] ------------------ 325| 53.3M|} _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| 219k|{ 340| 219k| return std::forward(f1)(empty_t{}); 341| 219k|} _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| 147k|{ 335| 147k|} _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| 28.8k|{ 340| 28.8k| return std::forward(f1)(empty_t{}); 341| 28.8k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 321|{ 189| 321| return first + n; 190| 321|} _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| 182k|{ 340| 182k| return std::forward(f1)(empty_t{}); 341| 182k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 105k|{ 211| 105k| return std::copy(first, last, out); 212| 105k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.33M|{ 30| 1.33M| return x; 31| 1.33M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 15.9k|{ 261| 15.9k| auto ptr = Heap::allocate(sizeof(T)); 262| 15.9k| IMMER_TRY { ------------------ | | 49| 15.9k|#define IMMER_TRY try ------------------ 263| 15.9k| return new (ptr) T(std::forward(args)...); 264| 15.9k| } 265| 15.9k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 15.9k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 96| 88.6k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 246| 349k| { 247| 349k| return impl_.push_back(std::move(value)); 248| 349k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj3ELj3EEE: 536| 1.25M| : impl_(std::move(impl)) 537| 1.25M| { 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.25M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4sizeEv: 181| 4.18M| 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| 168k| { 324| 168k| return impl_.update(index, std::forward(fn)); 325| 168k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 350| 24.4k| { 351| 24.4k| return impl_.take(elems); 352| 24.4k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 376| 37.2k| { 377| 37.2k| return impl_.drop(elems); 378| 37.2k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8max_sizeEv: 90| 1.86M| 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| 677k| { 404| 677k| return l.impl_.concat(r.impl_); 405| 677k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 251| 40.6k| { 252| 40.6k| return push_back_move(move_t{}, std::move(value)); 253| 40.6k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 40.6k| { 548| 40.6k| impl_.push_back_mut({}, std::move(value)); 549| 40.6k| return std::move(*this); 550| 40.6k| } 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| 33.3k| { 330| 33.3k| return update_move(move_t{}, index, std::forward(fn)); 331| 33.3k| } 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| 33.3k| { 569| 33.3k| impl_.update_mut({}, index, std::forward(fn)); 570| 33.3k| return std::move(*this); 571| 33.3k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 355| 31.7k| { 356| 31.7k| return take_move(move_t{}, elems); 357| 31.7k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 31.7k| { 580| 31.7k| impl_.take_mut({}, elems); 581| 31.7k| return std::move(*this); 582| 31.7k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 381| 62.3k| { 382| 62.3k| return drop_move(move_t{}, elems); 383| 62.3k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 62.3k| { 590| 62.3k| impl_.drop_mut({}, elems); 591| 62.3k| return std::move(*this); 592| 62.3k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERKS9_: 409| 216k| { 410| 216k| return concat_move(move_t{}, std::move(l), r); 411| 216k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 216k| { 601| 216k| concat_mut_l(l.impl_, {}, r.impl_); 602| 216k| return std::move(l); 603| 216k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEOS9_: 415| 3.63k| { 416| 3.63k| return concat_move(move_t{}, l, std::move(r)); 417| 3.63k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 3.63k| { 607| 3.63k| concat_mut_r(l.impl_, r.impl_, {}); 608| 3.63k| return std::move(r); 609| 3.63k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESA_: 421| 952k| { 422| 952k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 952k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 952k| { 613| 952k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 952k| return std::move(l); 615| 952k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEeqERKS9_: 222| 78.5k| { 223| 78.5k| return impl_.equals(other.impl_); 224| 78.5k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5eraseEm: 480| 6.55k| { 481| 6.55k| return take(pos) + drop(pos + 1); 482| 6.55k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6insertEmi: 442| 15.9k| { 443| 15.9k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 15.9k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 39.5M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 39.5M| { 28| 39.5M| return ::operator new(size); 29| 39.5M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 15.9k| { 50| 15.9k| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 15.9k| new (p) std::size_t{size}; 52| 15.9k| return ((char*) p) + extra_size; 53| 15.9k| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 15.9k| { 58| 15.9k| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 15.9k| assert(*p == size); ------------------ | Branch (59:9): [True: 15.9k, False: 0] ------------------ 60| 15.9k| Base::deallocate(size + extra_size, p, tags...); 61| 15.9k| } _ZN5immer15refcount_policyC2Ev: 28| 15.9k| : refcount{1} {}; _ZN5immer15refcount_policy3decEv: 36| 15.9k| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer22unsafe_refcount_policyC2Ev: 27| 39.5M| : refcount{1} {}; _ZN5immer22unsafe_refcount_policy3incEv: 33| 231M| void inc() { ++refcount; } _ZN5immer22unsafe_refcount_policy3decEv: 34| 270M| bool dec() { return --refcount == 0; } _ZN5immer22unsafe_refcount_policy6uniqueEv: 35| 2.70M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee5ownedEv: 36| 39.5M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee10can_mutateENS6_4editE: 35| 284k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeaSENS6_4editE: 34| 641k| ownee& operator=(edit) { return *this; };