LLVMFuzzerTestOneInput: 24| 10.7k|{ 25| 10.7k| constexpr auto var_count = 8; 26| 10.7k| constexpr auto bits = 3; 27| | 28| 10.7k| using vector_t = immer::flex_vector; 29| 10.7k| using size_t = std::uint8_t; 30| | 31| 10.7k| auto vars = std::array{}; 32| | 33| 10.7k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 34| 10.7k| auto is_valid_var_neq = [](auto other) { 35| 10.7k| return [=](auto idx) { 36| 10.7k| return idx >= 0 && idx < var_count && idx != other; 37| 10.7k| }; 38| 10.7k| }; 39| 10.7k| auto is_valid_index = [](auto& v) { 40| 10.7k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 10.7k| }; 42| 10.7k| auto is_valid_size = [](auto& v) { 43| 10.7k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 10.7k| }; 45| 10.7k| auto can_concat = [](auto&& v1, auto&& v2) { 46| 10.7k| return v1.size() + v2.size() < vector_t::max_size(); 47| 10.7k| }; 48| 10.7k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 10.7k| return v.size() < (1 << 15); 51| 10.7k| }; 52| 10.7k| return fuzzer_input{data, size}.run([&](auto& in) { 53| 10.7k| enum ops 54| 10.7k| { 55| 10.7k| op_push_back, 56| 10.7k| op_update, 57| 10.7k| op_take, 58| 10.7k| op_drop, 59| 10.7k| op_concat, 60| 10.7k| op_push_back_move, 61| 10.7k| op_update_move, 62| 10.7k| op_take_move, 63| 10.7k| op_drop_move, 64| 10.7k| op_concat_move_l, 65| 10.7k| op_concat_move_r, 66| 10.7k| op_concat_move_lr, 67| 10.7k| op_insert, 68| 10.7k| op_erase, 69| 10.7k| op_compare, 70| 10.7k| }; 71| 10.7k| auto src = read(in, is_valid_var); 72| 10.7k| auto dst = read(in, is_valid_var); 73| 10.7k| switch (read(in)) { 74| 10.7k| case op_push_back: { 75| 10.7k| vars[dst] = vars[src].push_back(42); 76| 10.7k| break; 77| 10.7k| } 78| 10.7k| case op_update: { 79| 10.7k| auto idx = read(in, is_valid_index(vars[src])); 80| 10.7k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 10.7k| break; 82| 10.7k| } 83| 10.7k| case op_take: { 84| 10.7k| auto idx = read(in, is_valid_size(vars[src])); 85| 10.7k| vars[dst] = vars[src].take(idx); 86| 10.7k| break; 87| 10.7k| } 88| 10.7k| case op_drop: { 89| 10.7k| auto idx = read(in, is_valid_size(vars[src])); 90| 10.7k| vars[dst] = vars[src].drop(idx); 91| 10.7k| break; 92| 10.7k| } 93| 10.7k| case op_concat: { 94| 10.7k| auto src2 = read(in, is_valid_var); 95| 10.7k| if (can_concat(vars[src], vars[src2])) 96| 10.7k| vars[dst] = vars[src] + vars[src2]; 97| 10.7k| break; 98| 10.7k| } 99| 10.7k| case op_push_back_move: { 100| 10.7k| vars[dst] = std::move(vars[src]).push_back(21); 101| 10.7k| break; 102| 10.7k| } 103| 10.7k| case op_update_move: { 104| 10.7k| auto idx = read(in, is_valid_index(vars[src])); 105| 10.7k| vars[dst] = 106| 10.7k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 10.7k| break; 108| 10.7k| } 109| 10.7k| case op_take_move: { 110| 10.7k| auto idx = read(in, is_valid_size(vars[src])); 111| 10.7k| vars[dst] = std::move(vars[src]).take(idx); 112| 10.7k| break; 113| 10.7k| } 114| 10.7k| case op_drop_move: { 115| 10.7k| auto idx = read(in, is_valid_size(vars[src])); 116| 10.7k| vars[dst] = std::move(vars[src]).drop(idx); 117| 10.7k| break; 118| 10.7k| } 119| 10.7k| case op_concat_move_l: { 120| 10.7k| auto src2 = read(in, is_valid_var_neq(src)); 121| 10.7k| if (can_concat(vars[src], vars[src2])) 122| 10.7k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 10.7k| break; 124| 10.7k| } 125| 10.7k| case op_concat_move_r: { 126| 10.7k| auto src2 = read(in, is_valid_var_neq(src)); 127| 10.7k| if (can_concat(vars[src], vars[src2])) 128| 10.7k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 10.7k| break; 130| 10.7k| } 131| 10.7k| case op_concat_move_lr: { 132| 10.7k| auto src2 = read(in, is_valid_var_neq(src)); 133| 10.7k| if (can_concat(vars[src], vars[src2])) 134| 10.7k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 10.7k| break; 136| 10.7k| } 137| 10.7k| case op_compare: { 138| 10.7k| using std::swap; 139| 10.7k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 140| 10.7k| swap(vars[src], vars[dst]); 141| 10.7k| break; 142| 10.7k| } 143| 10.7k| case op_erase: { 144| 10.7k| auto idx = read(in, is_valid_index(vars[src])); 145| 10.7k| vars[dst] = vars[src].erase(idx); 146| 10.7k| break; 147| 10.7k| } 148| 10.7k| case op_insert: { 149| 10.7k| auto idx = read(in, is_valid_size(vars[src])); 150| 10.7k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 10.7k| break; 152| 10.7k| } 153| 10.7k| default: 154| 10.7k| break; 155| 10.7k| }; 156| 10.7k| return true; 157| 10.7k| }); 158| 10.7k|} flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 52| 2.70M| return fuzzer_input{data, size}.run([&](auto& in) { 53| 2.70M| enum ops 54| 2.70M| { 55| 2.70M| op_push_back, 56| 2.70M| op_update, 57| 2.70M| op_take, 58| 2.70M| op_drop, 59| 2.70M| op_concat, 60| 2.70M| op_push_back_move, 61| 2.70M| op_update_move, 62| 2.70M| op_take_move, 63| 2.70M| op_drop_move, 64| 2.70M| op_concat_move_l, 65| 2.70M| op_concat_move_r, 66| 2.70M| op_concat_move_lr, 67| 2.70M| op_insert, 68| 2.70M| op_erase, 69| 2.70M| op_compare, 70| 2.70M| }; 71| 2.70M| auto src = read(in, is_valid_var); 72| 2.70M| auto dst = read(in, is_valid_var); 73| 2.70M| switch (read(in)) { 74| 352k| case op_push_back: { ------------------ | Branch (74:9): [True: 352k, False: 2.35M] ------------------ 75| 352k| vars[dst] = vars[src].push_back(42); 76| 352k| break; 77| 0| } 78| 151k| case op_update: { ------------------ | Branch (78:9): [True: 151k, False: 2.55M] ------------------ 79| 151k| auto idx = read(in, is_valid_index(vars[src])); 80| 151k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 151k| break; 82| 0| } 83| 1.96k| case op_take: { ------------------ | Branch (83:9): [True: 1.96k, False: 2.70M] ------------------ 84| 1.96k| auto idx = read(in, is_valid_size(vars[src])); 85| 1.96k| vars[dst] = vars[src].take(idx); 86| 1.96k| break; 87| 0| } 88| 14.3k| case op_drop: { ------------------ | Branch (88:9): [True: 14.3k, False: 2.68M] ------------------ 89| 14.3k| auto idx = read(in, is_valid_size(vars[src])); 90| 14.3k| vars[dst] = vars[src].drop(idx); 91| 14.3k| break; 92| 0| } 93| 681k| case op_concat: { ------------------ | Branch (93:9): [True: 681k, False: 2.02M] ------------------ 94| 681k| auto src2 = read(in, is_valid_var); 95| 681k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (95:17): [True: 655k, False: 25.9k] ------------------ 96| 655k| vars[dst] = vars[src] + vars[src2]; 97| 681k| break; 98| 0| } 99| 24.6k| case op_push_back_move: { ------------------ | Branch (99:9): [True: 24.6k, False: 2.67M] ------------------ 100| 24.6k| vars[dst] = std::move(vars[src]).push_back(21); 101| 24.6k| break; 102| 0| } 103| 32.1k| case op_update_move: { ------------------ | Branch (103:9): [True: 32.1k, False: 2.67M] ------------------ 104| 32.1k| auto idx = read(in, is_valid_index(vars[src])); 105| 32.1k| vars[dst] = 106| 32.1k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 32.1k| break; 108| 0| } 109| 32.2k| case op_take_move: { ------------------ | Branch (109:9): [True: 32.2k, False: 2.67M] ------------------ 110| 32.2k| auto idx = read(in, is_valid_size(vars[src])); 111| 32.2k| vars[dst] = std::move(vars[src]).take(idx); 112| 32.2k| break; 113| 0| } 114| 61.3k| case op_drop_move: { ------------------ | Branch (114:9): [True: 61.3k, False: 2.64M] ------------------ 115| 61.3k| auto idx = read(in, is_valid_size(vars[src])); 116| 61.3k| vars[dst] = std::move(vars[src]).drop(idx); 117| 61.3k| break; 118| 0| } 119| 226k| case op_concat_move_l: { ------------------ | Branch (119:9): [True: 226k, False: 2.47M] ------------------ 120| 226k| auto src2 = read(in, is_valid_var_neq(src)); 121| 226k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (121:17): [True: 222k, False: 3.98k] ------------------ 122| 222k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 226k| break; 124| 0| } 125| 4.59k| case op_concat_move_r: { ------------------ | Branch (125:9): [True: 4.59k, False: 2.69M] ------------------ 126| 4.59k| auto src2 = read(in, is_valid_var_neq(src)); 127| 4.59k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (127:17): [True: 4.06k, False: 538] ------------------ 128| 4.06k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 4.59k| break; 130| 0| } 131| 975k| case op_concat_move_lr: { ------------------ | Branch (131:9): [True: 975k, False: 1.72M] ------------------ 132| 975k| auto src2 = read(in, is_valid_var_neq(src)); 133| 975k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (133:17): [True: 966k, False: 9.28k] ------------------ 134| 966k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 975k| break; 136| 0| } 137| 90.8k| case op_compare: { ------------------ | Branch (137:9): [True: 90.8k, False: 2.61M] ------------------ 138| 90.8k| using std::swap; 139| 90.8k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (139:17): [True: 79.6k, False: 11.1k] | Branch (139:43): [True: 5.59k, False: 74.0k] ------------------ 140| 5.59k| swap(vars[src], vars[dst]); 141| 90.8k| break; 142| 0| } 143| 6.86k| case op_erase: { ------------------ | Branch (143:9): [True: 6.86k, False: 2.69M] ------------------ 144| 6.86k| auto idx = read(in, is_valid_index(vars[src])); 145| 6.86k| vars[dst] = vars[src].erase(idx); 146| 6.86k| break; 147| 0| } 148| 15.5k| case op_insert: { ------------------ | Branch (148:9): [True: 15.5k, False: 2.68M] ------------------ 149| 15.5k| auto idx = read(in, is_valid_size(vars[src])); 150| 15.5k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 15.5k| break; 152| 0| } 153| 21.0k| default: ------------------ | Branch (153:9): [True: 21.0k, False: 2.68M] ------------------ 154| 21.0k| break; 155| 2.70M| }; 156| 2.69M| return true; 157| 2.70M| }); 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.27M, False: 184k] | Branch (33:60): [True: 6.06M, False: 201k] ------------------ 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| 217k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (40:39): [True: 217k, False: 0] | Branch (40:51): [True: 190k, False: 27.2k] ------------------ flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_: 39| 190k| auto is_valid_index = [](auto& v) { 40| 190k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 190k| }; flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 80| 151k| 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| 137k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (43:39): [True: 137k, False: 0] | Branch (43:51): [True: 125k, False: 11.8k] ------------------ flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_: 42| 125k| auto is_valid_size = [](auto& v) { 43| 125k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 125k| }; 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.88M| auto can_concat = [](auto&& v1, auto&& v2) { 46| 1.88M| return v1.size() + v2.size() < vector_t::max_size(); 47| 1.88M| }; flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 106| 32.1k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 35| 1.26M| return [=](auto idx) { 36| 1.26M| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (36:20): [True: 1.25M, False: 11.1k] | Branch (36:32): [True: 1.23M, False: 20.5k] | Branch (36:51): [True: 1.20M, False: 28.5k] ------------------ 37| 1.26M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 34| 1.20M| auto is_valid_var_neq = [](auto other) { 35| 1.20M| return [=](auto idx) { 36| 1.20M| return idx >= 0 && idx < var_count && idx != other; 37| 1.20M| }; 38| 1.20M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 48| 90.8k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 90.8k| return v.size() < (1 << 15); 51| 90.8k| }; flex-vector-bo.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 10.7k| { 51| 10.7k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 6, False: 10.7k] ------------------ 52| 6| return 0; 53| 10.7k| try { 54| 2.70M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.69M, False: 10.7k] ------------------ 55| 2.69M| continue; 56| 10.7k| } catch (const no_more_input&) { 57| 10.7k| }; 58| 10.7k| return 0; 59| 10.7k| } 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: 385k, False: 6.07M] ------------------ 73| 385k| x = read(fz); 74| 6.07M| return x; 75| 6.07M|} _Z4readIcERKT_R12fuzzer_input: 64| 10.4M|{ 65| 10.4M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 10.4M|} _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: 10.7k, False: 10.7M] ------------------ 44| 10.7k| 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| 190k|{ 71| 190k| auto x = read(fz); 72| 217k| while (!cond(x)) ------------------ | Branch (72:12): [True: 27.2k, False: 190k] ------------------ 73| 27.2k| x = read(fz); 74| 190k| return x; 75| 190k|} _Z4readIhERKT_R12fuzzer_input: 64| 355k|{ 65| 355k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 355k|} 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| 125k|{ 71| 125k| auto x = read(fz); 72| 137k| while (!cond(x)) ------------------ | Branch (72:12): [True: 11.8k, False: 125k] ------------------ 73| 11.8k| x = read(fz); 74| 125k| return x; 75| 125k|} flex-vector-bo.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 1.20M|{ 71| 1.20M| auto x = read(fz); 72| 1.26M| while (!cond(x)) ------------------ | Branch (72:12): [True: 60.3k, False: 1.20M] ------------------ 73| 60.3k| x = read(fz); 74| 1.20M| return x; 75| 1.20M|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 15.5k| : impl_{detail::make(std::forward(arg))} 86| 15.5k| { 87| 15.5k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 15.5k| : value(std::forward(args)...) 48| 15.5k| { 49| 15.5k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 15.5k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 15.5k| IMMER_NODISCARD const T& get() const { return impl_->value; } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEED2Ev: 131| 15.5k| { 132| 15.5k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 15.5k, False: 0] | Branch (132:22): [True: 15.5k, False: 0] ------------------ 133| 15.5k| impl_->~holder(); 134| 15.5k| heap::deallocate(sizeof(holder), impl_); 135| 15.5k| } 136| 15.5k| } _ZN5immer6detail3csl3getINS_22unsafe_refcount_policyEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEES3_NS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11impl_data_tENS1_6memberIS3_NS1_7inheritINSC_5applyISA_E4type5owneeEvE4typeEE4typeEE4typeE: 170| 514M| { 171| 514M| return x.get_(type_t{}); 172| 514M| } _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| 514M| { 185| 514M| return n.get_(t); 186| 514M| } _ZNK5immer6detail3csl6memberINS_22unsafe_refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 514M| 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.8M| { 166| 40.8M| return x.get_(type_t{}); 167| 40.8M| } _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.8M| { 180| 40.8M| return n.get_(t); 181| 40.8M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 40.8M| 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| 290k| { 171| 290k| return x.get_(type_t{}); 172| 290k| } _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| 290k| { 185| 290k| return n.get_(t); 186| 290k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 290k| const T& get_(type_t) const { return *this; } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EdeEv: 99| 9.08M| ReferenceT operator*() const { return access_t::dereference(derived()); } _ZN5immer6detail20iterator_core_access11dereferenceIRKNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDcOT_: 22| 9.08M| { 23| 9.08M| return x.dereference(); 24| 9.08M| } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_E7derivedEv: 86| 9.17M| { 87| 9.17M| static_assert(std::is_base_of::value, 88| 9.17M| "must pass a derived thing"); 89| 9.17M| return *static_cast(this); 90| 9.17M| } _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| 174k| { 152| 174k| access_t::advance(derived(), n); 153| 174k| return derived(); 154| 174k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEElEEDcOT_T0_: 46| 174k| { 47| 174k| return x.advance(d); 48| 174k| } _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| 16.2M| { 93| 16.2M| static_assert(std::is_base_of::value, 94| 16.2M| "must pass a derived thing"); 95| 16.2M| return *static_cast(this); 96| 16.2M| } _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| 7.93M| { 120| 7.93M| access_t::increment(derived()); 121| 7.93M| return derived(); 122| 7.93M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDcOT_: 28| 7.93M| { 29| 7.93M| return x.increment(); 30| 7.93M| } _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| 94.0k| { 165| 94.0k| auto tmp = derived(); 166| 94.0k| return tmp += n; 167| 94.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17make_inner_n_intoEPvmj: 213| 1.28M| { 214| 1.28M| assert(n <= branches); ------------------ | Branch (214:9): [True: 1.28M, False: 0] ------------------ 215| 1.28M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 1.28M, False: 0] ------------------ 216| 1.28M| auto p = new (buffer) node_t; 217| 1.28M| p->impl.d.data.inner.relaxed = nullptr; 218| 1.28M|#if IMMER_TAGGED_NODE 219| 1.28M| p->impl.d.kind = node_t::kind_t::inner; 220| 1.28M|#endif 221| 1.28M| return p; 222| 1.28M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14sizeof_inner_nEj: 145| 42.3M| { 146| 42.3M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 42.3M, Folded] ------------------ 147| 42.3M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 956| 134M| { 957| 134M| refs(this).inc(); 958| 134M| return this; 959| 134M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4refsEPKSB_: 203| 514M| { 204| 514M| return auto_const_cast(get(x->impl)); 205| 514M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE16make_leaf_n_intoEPvmj: 330| 1.19M| { 331| 1.19M| assert(n <= branches); ------------------ | Branch (331:9): [True: 1.19M, False: 0] ------------------ 332| 1.19M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 1.19M, False: 0] ------------------ 333| 1.19M| auto p = new (buffer) node_t; 334| 1.19M|#if IMMER_TAGGED_NODE 335| 1.19M| p->impl.d.kind = node_t::kind_t::leaf; 336| 1.19M|#endif 337| 1.19M| return p; 338| 1.19M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13sizeof_leaf_nEj: 160| 5.18M| { 161| 5.18M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 5.18M, Folded] ------------------ 162| 5.18M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7relaxedEv: 172| 734M| { 173| 734M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 734M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 734M, False: 0] ------------------ 174| 734M| return impl.d.data.inner.relaxed; 175| 734M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4kindEv: 168| 1.11G| 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| 275M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5innerEv: 184| 318M| { 185| 318M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 318M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 318M, False: 0] ------------------ 186| 318M| return impl.d.data.inner.get_storage_ptr(); 187| 318M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14delete_inner_rEPSB_j: 832| 37.2M| { 833| 37.2M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 37.2M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 37.2M, False: 0] ------------------ 834| 37.2M| auto r = p->relaxed(); 835| 37.2M| assert(r); ------------------ | Branch (835:9): [True: 37.2M, False: 0] ------------------ 836| 37.2M| static_if([&](auto) { 837| 37.2M| if (node_t::refs(r).dec()) 838| 37.2M| heap::deallocate(node_t::ownee(r).owned() 839| 37.2M| ? node_t::max_sizeof_relaxed 840| 37.2M| : node_t::sizeof_relaxed_n(n), 841| 37.2M| r); 842| 37.2M| }); 843| 37.2M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 37.2M] ------------------ 844| 37.2M| : node_t::sizeof_inner_r_n(n), 845| 37.2M| p); 846| 37.2M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPSB_: 210| 40.8M| 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| 74.3M| { 151| 74.3M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 74.3M, Folded] ------------------ 152| 74.3M| } _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.2M| { 191| 11.2M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 11.2M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 11.2M, False: 0] ------------------ 192| 11.2M| return impl.d.data.leaf.get_storage_ptr(); 193| 11.2M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12delete_innerEPSB_j: 808| 1.37M| { 809| 1.37M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 1.37M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 1.37M, False: 0] ------------------ 810| 1.37M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 1.37M, False: 0] ------------------ 811| 1.37M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 1.37M] ------------------ 812| 1.37M| : node_t::sizeof_inner_n(n), 813| 1.37M| p); 814| 1.37M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 298k| { 795| 298k| auto dst = copy_leaf_n(n + 1, src, n); 796| 298k| IMMER_TRY { ------------------ | | 49| 298k|#define IMMER_TRY try ------------------ 797| 298k| new (dst->leaf() + n) T(std::forward(x)); 798| 298k| } 799| 298k| 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| 298k| return dst; 805| 298k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_nEjPSB_j: 696| 298k| { 697| 298k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 298k, False: 0] ------------------ 698| 298k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 298k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 298k, False: 0] ------------------ 699| 298k| auto dst = make_leaf_n(allocn); 700| 298k| IMMER_TRY { ------------------ | | 49| 298k|#define IMMER_TRY try ------------------ 701| 298k| detail::uninitialized_copy( 702| 298k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 298k| } 704| 298k| 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| 298k| return dst; 709| 298k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nEj: 341| 1.19M| { 342| 1.19M| assert(n <= branches); ------------------ | Branch (342:9): [True: 1.19M, False: 0] ------------------ 343| 1.19M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 1.19M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 1.19M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nIiEEPSB_jOT_: 470| 53.8k| { 471| 53.8k| assert(n >= 1); ------------------ | Branch (471:9): [True: 53.8k, False: 0] ------------------ 472| 53.8k| auto p = make_leaf_n(n); 473| 53.8k| IMMER_TRY { ------------------ | | 49| 53.8k|#define IMMER_TRY try ------------------ 474| 53.8k| new (p->leaf()) T(std::forward(x)); 475| 53.8k| } 476| 53.8k| 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| 53.8k| return p; 481| 53.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13do_copy_innerEPSB_SC_j: 558| 1.16M| { 559| 1.16M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 1.16M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 1.16M, False: 0] ------------------ 560| 1.16M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 1.16M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 1.16M, False: 0] ------------------ 561| 1.16M| auto p = src->inner(); 562| 1.16M| inc_nodes(p, n); 563| 1.16M| std::copy(p, p + n, dst->inner()); 564| 1.16M| return dst; 565| 1.16M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9inc_nodesEPPSB_j: 970| 27.9M| { 971| 129M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 101M, False: 27.9M] ------------------ 972| 101M| refs(*i).inc(); 973| 27.9M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14copy_inner_r_nEjPSB_j: 588| 230k| { 589| 230k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 230k, False: 0] ------------------ 590| 230k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 230k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 230k, False: 0] ------------------ 591| 230k| auto dst = make_inner_r_n(allocn); 592| 230k| return do_copy_inner_r(dst, src, n); 593| 230k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15do_copy_inner_rEPSB_SC_j: 610| 280k| { 611| 280k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 280k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 280k, False: 0] ------------------ 612| 280k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 280k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 280k, False: 0] ------------------ 613| 280k| auto src_r = src->relaxed(); 614| 280k| auto dst_r = dst->relaxed(); 615| 280k| inc_nodes(src->inner(), n); 616| 280k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 280k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 280k| dst_r->d.count = n; 619| 280k| return dst; 620| 280k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_nEj: 243| 37.1M| { 244| 37.1M| assert(n <= branches); ------------------ | Branch (244:9): [True: 37.1M, False: 0] ------------------ 245| 37.1M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 37.1M| auto mr = static_cast(nullptr); 247| 37.1M| if (embed_relaxed) { ------------------ | Branch (247:13): [True: 37.1M, Folded] ------------------ 248| 37.1M| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 37.1M| } 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| 37.1M| auto p = new (mp) node_t; 259| 37.1M| auto r = new (mr) relaxed_t; 260| 37.1M| r->d.count = 0; 261| 37.1M| p->impl.d.data.inner.relaxed = r; 262| 37.1M|#if IMMER_TAGGED_NODE 263| 37.1M| p->impl.d.kind = node_t::kind_t::inner; 264| 37.1M|#endif 265| 37.1M| return p; 266| 37.1M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9make_pathEjPSB_: 498| 435k| { 499| 435k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 435k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 435k, False: 0] ------------------ 500| 435k| if (shift == endshift) ------------------ | Branch (500:13): [True: 360k, False: 75.2k] ------------------ 501| 360k| return node; 502| 75.2k| else { 503| 75.2k| auto n = node_t::make_inner_n(1); 504| 75.2k| IMMER_TRY { ------------------ | | 49| 75.2k|#define IMMER_TRY try ------------------ 505| 75.2k| n->inner()[0] = make_path(shift - B, node); 506| 75.2k| } 507| 75.2k| 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.2k| return n; 512| 75.2k| } 513| 435k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_nEj: 224| 1.28M| { 225| 1.28M| assert(n <= branches); ------------------ | Branch (225:9): [True: 1.28M, False: 0] ------------------ 226| 1.28M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 1.28M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 1.28M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_j: 666| 165k| { 667| 165k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 165k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 165k, False: 0] ------------------ 668| 165k| auto dst = make_leaf_n(n); 669| 165k| IMMER_TRY { ------------------ | | 49| 165k|#define IMMER_TRY try ------------------ 670| 165k| detail::uninitialized_copy( 671| 165k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 165k| } 673| 165k| 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| 165k| return dst; 678| 165k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_nEjPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeE: 269| 190k| { 270| 190k| return static_if( 271| 190k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 190k| [&](auto) { 273| 190k| auto p = 274| 190k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 190k| assert(r->d.count >= n); 276| 190k| node_t::refs(r).inc(); 277| 190k| p->impl.d.data.inner.relaxed = r; 278| 190k|#if IMMER_TAGGED_NODE 279| 190k| p->impl.d.kind = node_t::kind_t::inner; 280| 190k|#endif 281| 190k| return p; 282| 190k| }); 283| 190k| } _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| 190k| [&](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| 190k| { 653| 190k| if (embed_relaxed) ------------------ | Branch (653:13): [True: 190k, Folded] ------------------ 654| 190k| 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| 190k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE23do_copy_inner_replace_rEPSB_SC_jjSC_: 624| 190k| { 625| 190k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 190k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (625:9): [True: 190k, False: 0] ------------------ 626| 190k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 190k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (626:9): [True: 190k, False: 0] ------------------ 627| 190k| auto src_r = src->relaxed(); 628| 190k| auto dst_r = dst->relaxed(); 629| 190k| auto p = src->inner(); 630| 190k| inc_nodes(p, offset); 631| 190k| inc_nodes(p + offset + 1, n - offset - 1); 632| 190k| std::copy(src->inner(), src->inner() + n, dst->inner()); 633| 190k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 634| 190k| dst_r->d.count = n; 635| 190k| dst->inner()[offset] = child; 636| 190k| return dst; 637| 190k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 68.3k| { 570| 68.3k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 68.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 68.3k, False: 0] ------------------ 571| 68.3k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 68.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 68.3k, False: 0] ------------------ 572| 68.3k| auto p = src->inner(); 573| 68.3k| inc_nodes(p, offset); 574| 68.3k| inc_nodes(p + offset + 1, n - offset - 1); 575| 68.3k| std::copy(p, p + n, dst->inner()); 576| 68.3k| dst->inner()[offset] = child; 577| 68.3k| return dst; 578| 68.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_nEjPSB_j: 543| 11.4k| { 544| 11.4k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 11.4k, False: 0] ------------------ 545| 11.4k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 11.4k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 11.4k, False: 0] ------------------ 546| 11.4k| auto dst = make_inner_n(allocn); 547| 11.4k| return do_copy_inner(dst, src, n); 548| 11.4k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_rEPSB_j: 581| 4.01k| { 582| 4.01k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 4.01k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 4.01k, False: 0] ------------------ 583| 4.01k| auto dst = make_inner_r_n(n); 584| 4.01k| return do_copy_inner_r(dst, src, n); 585| 4.01k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13compute_shiftEv: 977| 3.88M| { 978| 3.88M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 341k, False: 3.54M] ------------------ 979| 341k| return endshift; 980| 3.54M| else 981| 3.54M| return B + inner()[0]->compute_shift(); 982| 3.88M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5checkEjm: 986| 341k| { 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| 341k| return true; 1023| 341k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jj: 778| 271k| { 779| 271k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 271k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 271k, False: 0] ------------------ 780| 271k| auto dst = make_leaf_n(last - idx); 781| 271k| IMMER_TRY { ------------------ | | 49| 271k|#define IMMER_TRY try ------------------ 782| 271k| detail::uninitialized_copy( 783| 271k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 271k| } 785| 271k| 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| 271k| return dst; 790| 271k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jSC_j: 712| 260k| { 713| 260k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 260k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 260k, False: 0] ------------------ 714| 260k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 260k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 260k, False: 0] ------------------ 715| 260k| auto dst = make_leaf_n(n1 + n2); 716| 260k| IMMER_TRY { ------------------ | | 49| 260k|#define IMMER_TRY try ------------------ 717| 260k| detail::uninitialized_copy( 718| 260k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 260k| } 720| 260k| 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| 260k| IMMER_TRY { ------------------ | | 49| 260k|#define IMMER_TRY try ------------------ 725| 260k| detail::uninitialized_copy( 726| 260k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 260k| } 728| 260k| 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| 260k| return dst; 734| 260k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 2.79M| { 871| 2.79M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 2.50M, False: 290k] | Branch (871:39): [True: 0, False: 290k] ------------------ 872| 2.79M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPKSB_: 207| 290k| { 208| 290k| return get(x->impl); 209| 290k| } _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| 420k| { 349| 420k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 420k| ownee(p) = e; 351| 420k|#if IMMER_TAGGED_NODE 352| 420k| p->impl.d.kind = node_t::kind_t::leaf; 353| 420k|#endif 354| 420k| return p; 355| 420k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 9.72k| { 486| 9.72k| auto p = make_leaf_e(e); 487| 9.72k| IMMER_TRY { ------------------ | | 49| 9.72k|#define IMMER_TRY try ------------------ 488| 9.72k| new (p->leaf()) T(std::forward(x)); 489| 9.72k| } 490| 9.72k| 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.72k| return p; 495| 9.72k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 223k| { 931| 223k| auto src_r = relaxed(); 932| 223k| return static_if( 933| 223k| [&](auto) { return src_r; }, 934| 223k| [&](auto) { 935| 223k| if (node_t::refs(src_r).unique() || 936| 223k| node_t::ownee(src_r).can_mutate(e)) 937| 223k| return src_r; 938| 223k| else { 939| 223k| auto dst_r = 940| 223k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 223k| if (src_r) { 942| 223k| std::copy( 943| 223k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 223k| if (node_t::refs(src_r).dec()) 945| 223k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 223k| src_r); 947| 223k| } 948| 223k| dst_r->d.count = n; 949| 223k| node_t::ownee(dst_r) = e; 950| 223k| return impl.d.data.inner.relaxed = dst_r; 951| 223k| } 952| 223k| }); 953| 223k| } _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| 223k| [&](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| 17.6k| { 597| 17.6k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 17.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (597:9): [True: 17.6k, False: 0] ------------------ 598| 17.6k| auto dst = make_inner_r_e(e); 599| 17.6k| return do_copy_inner_r(dst, src, n); 600| 17.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 286| 148k| { 287| 148k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 148k| auto mr = static_cast(nullptr); 289| 148k| if (embed_relaxed) { ------------------ | Branch (289:13): [True: 148k, Folded] ------------------ 290| 148k| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 148k| } 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| 148k| auto p = new (mp) node_t; 301| 148k| auto r = new (mr) relaxed_t; 302| 148k| ownee(p) = e; 303| 148k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 148k| r->d.count = 0; 305| 148k| p->impl.d.data.inner.relaxed = r; 306| 148k|#if IMMER_TAGGED_NODE 307| 148k| p->impl.d.kind = node_t::kind_t::inner; 308| 148k|#endif 309| 148k| return p; 310| 148k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_path_eENS9_5applyIS6_E4type4editEjPSB_: 516| 434k| { 517| 434k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 434k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 434k, False: 0] ------------------ 518| 434k| if (shift == endshift) ------------------ | Branch (518:13): [True: 377k, False: 57.6k] ------------------ 519| 377k| return node; 520| 57.6k| else { 521| 57.6k| auto n = node_t::make_inner_e(e); 522| 57.6k| IMMER_TRY { ------------------ | | 49| 57.6k|#define IMMER_TRY try ------------------ 523| 57.6k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 57.6k| } 525| 57.6k| 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| 57.6k| return n; 530| 57.6k| } 531| 434k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 87.8k| { 232| 87.8k| auto m = heap::allocate(max_sizeof_inner); 233| 87.8k| auto p = new (m) node_t; 234| 87.8k| ownee(p) = e; 235| 87.8k| p->impl.d.data.inner.relaxed = nullptr; 236| 87.8k|#if IMMER_TAGGED_NODE 237| 87.8k| p->impl.d.kind = node_t::kind_t::inner; 238| 87.8k|#endif 239| 87.8k| return p; 240| 87.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 19.3k| { 552| 19.3k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 19.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 19.3k, False: 0] ------------------ 553| 19.3k| auto dst = make_inner_e(e); 554| 19.3k| return do_copy_inner(dst, src, n); 555| 19.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 27.6k| { 604| 27.6k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 27.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 27.6k, False: 0] ------------------ 605| 27.6k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 27.6k| return do_copy_inner_sr(dst, src, n); 607| 27.6k| } _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| 27.6k| { 314| 27.6k| return static_if( 315| 27.6k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 27.6k| [&](auto) { 317| 27.6k| auto p = 318| 27.6k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 27.6k| node_t::refs(r).inc(); 320| 27.6k| p->impl.d.data.inner.relaxed = r; 321| 27.6k| node_t::ownee(p) = e; 322| 27.6k|#if IMMER_TAGGED_NODE 323| 27.6k| p->impl.d.kind = node_t::kind_t::inner; 324| 27.6k|#endif 325| 27.6k| return p; 326| 27.6k| }); 327| 27.6k| } _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| 27.6k| [&](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| 27.6k| { 641| 27.6k| if (embed_relaxed) ------------------ | Branch (641:13): [True: 27.6k, Folded] ------------------ 642| 27.6k| 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| 27.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 366k| { 764| 366k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 366k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 366k, False: 0] ------------------ 765| 366k| auto dst = make_leaf_e(e); 766| 366k| IMMER_TRY { ------------------ | | 49| 366k|#define IMMER_TRY try ------------------ 767| 366k| detail::uninitialized_copy( 768| 366k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 366k| } 770| 366k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 366k| return dst; 775| 366k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 178k| { 878| 178k| auto src_r = relaxed(); 879| 178k| return static_if( 880| 178k| [&](auto) { return src_r; }, 881| 178k| [&](auto) { 882| 178k| if (node_t::refs(src_r).unique() || 883| 178k| node_t::ownee(src_r).can_mutate(e)) 884| 178k| return src_r; 885| 178k| else { 886| 178k| auto dst_r = impl.d.data.inner.relaxed = 887| 178k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 178k| if (src_r) { 889| 178k| auto n = dst_r->d.count = src_r->d.count; 890| 178k| std::copy( 891| 178k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 178k| if (node_t::refs(src_r).dec()) 893| 178k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 178k| src_r); 895| 178k| } 896| 178k| node_t::ownee(dst_r) = e; 897| 178k| return dst_r; 898| 178k| } 899| 178k| }); 900| 178k| } _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| 178k| [&](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| 540| { 739| 540| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 540|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 540, False: 0] ------------------ 740| 540| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 540|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 540, False: 0] ------------------ 741| 540| auto dst = make_leaf_e(e); 742| 540| IMMER_TRY { ------------------ | | 49| 540|#define IMMER_TRY try ------------------ 743| 540| detail::uninitialized_copy( 744| 540| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 540| } 746| 540| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 540| IMMER_TRY { ------------------ | | 49| 540|#define IMMER_TRY try ------------------ 751| 540| detail::uninitialized_copy( 752| 540| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 540| } 754| 540| 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| 540| return dst; 760| 540| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 523| 186M| { 524| 186M| using node_t = node_type; 525| 186M| auto node = p.node(); 526| 186M| if (node->dec()) { ------------------ | Branch (526:13): [True: 37.2M, False: 149M] ------------------ 527| 37.2M| p.each(this_t{}); 528| 37.2M| node_t::delete_inner_r(node, p.count()); 529| 37.2M| } 530| 186M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 15.3M| { 535| 15.3M| using node_t = node_type; 536| 15.3M| auto node = p.node(); 537| 15.3M| if (node->dec()) { ------------------ | Branch (537:13): [True: 425k, False: 14.9M] ------------------ 538| 425k| p.each(this_t{}); 539| 425k| node_t::delete_inner(node, p.count()); 540| 425k| } 541| 15.3M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.69M| { 546| 1.69M| using node_t = node_type; 547| 1.69M| auto node = p.node(); 548| 1.69M| if (node->dec()) { ------------------ | Branch (548:13): [True: 578k, False: 1.11M] ------------------ 549| 578k| node_t::delete_leaf(node, p.count()); 550| 578k| } 551| 1.69M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 390k| { 546| 390k| using node_t = node_type; 547| 390k| auto node = p.node(); 548| 390k| if (node->dec()) { ------------------ | Branch (548:13): [True: 47.8k, False: 342k] ------------------ 549| 47.8k| node_t::delete_leaf(node, p.count()); 550| 47.8k| } 551| 390k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 2.74M| { 535| 2.74M| using node_t = node_type; 536| 2.74M| auto node = p.node(); 537| 2.74M| if (node->dec()) { ------------------ | Branch (537:13): [True: 98.1k, False: 2.65M] ------------------ 538| 98.1k| p.each(this_t{}); 539| 98.1k| node_t::delete_inner(node, p.count()); 540| 98.1k| } 541| 2.74M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 887k| { 535| 887k| using node_t = node_type; 536| 887k| auto node = p.node(); 537| 887k| if (node->dec()) { ------------------ | Branch (537:13): [True: 837k, False: 49.2k] ------------------ 538| 837k| p.each(this_t{}); 539| 837k| node_t::delete_inner(node, p.count()); 540| 837k| } 541| 887k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 1.47M| { 535| 1.47M| using node_t = node_type; 536| 1.47M| auto node = p.node(); 537| 1.47M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 1.47M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 1.47M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 65.3M| { 546| 65.3M| using node_t = node_type; 547| 65.3M| auto node = p.node(); 548| 65.3M| if (node->dec()) { ------------------ | Branch (548:13): [True: 986k, False: 64.3M] ------------------ 549| 986k| node_t::delete_leaf(node, p.count()); 550| 986k| } 551| 65.3M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.34M| { 546| 1.34M| using node_t = node_type; 547| 1.34M| auto node = p.node(); 548| 1.34M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 1.34M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 1.34M| } _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| 233k| { 792| 233k| auto level = pos.shift(); 793| 233k| auto idx = pos.count() - 1; 794| 233k| auto children = pos.size(idx); 795| 233k| auto new_idx = 796| 233k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 14.3k, False: 219k] | Branch (796:47): [True: 687, False: 218k] ------------------ 797| 233k| auto new_child = static_cast(nullptr); 798| 233k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 4.64k, False: 229k] ------------------ 799| 4.64k| return nullptr; 800| 229k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 218k, False: 10.4k] ------------------ 801| 218k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 218k| if (!new_child) { ------------------ | Branch (802:17): [True: 5.78k, False: 212k] ------------------ 803| 5.78k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 2.73k, False: 3.05k] ------------------ 804| 2.73k| new_child = node_t::make_path(level - B, tail); 805| 3.05k| else 806| 3.05k| return nullptr; 807| 5.78k| } 808| 218k| } else 809| 10.4k| new_child = node_t::make_path(level - B, tail); 810| 226k| IMMER_TRY { ------------------ | | 49| 226k|#define IMMER_TRY try ------------------ 811| 226k| auto count = new_idx + 1; 812| 226k| auto new_parent = 813| 226k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 226k| auto new_relaxed = new_parent->relaxed(); 815| 226k| new_parent->inner()[new_idx] = new_child; 816| 226k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 226k| new_relaxed->d.count = count; 818| 226k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 226k, False: 0] ------------------ 819| 226k| return new_parent; 820| 226k| } 821| 226k| 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| 226k| } _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| 42.6k| { 835| 42.6k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 42.6k, False: 0] ------------------ 836| 42.6k| auto idx = pos.index(pos.size() - 1); 837| 42.6k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 42.6k| auto count = new_idx + 1; 839| 42.6k| auto new_parent = node_t::make_inner_n(count); 840| 42.6k| IMMER_TRY { ------------------ | | 49| 42.6k|#define IMMER_TRY try ------------------ 841| 42.6k| new_parent->inner()[new_idx] = 842| 42.6k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 31.5k, False: 11.1k] ------------------ 843| | /* otherwise */ 844| 42.6k| : node_t::make_path(pos.shift() - B, tail); 845| 42.6k| } 846| 42.6k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 42.6k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 42.6k| } _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| 797k| { 835| 797k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 797k, False: 0] ------------------ 836| 797k| auto idx = pos.index(pos.size() - 1); 837| 797k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 797k| auto count = new_idx + 1; 839| 797k| auto new_parent = node_t::make_inner_n(count); 840| 797k| IMMER_TRY { ------------------ | | 49| 797k|#define IMMER_TRY try ------------------ 841| 797k| new_parent->inner()[new_idx] = 842| 797k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 501k, False: 296k] ------------------ 843| | /* otherwise */ 844| 797k| : node_t::make_path(pos.shift() - B, tail); 845| 797k| } 846| 797k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 797k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 797k| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_jm: 562| 422|{ 563| 422| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 422|} _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| 285k| { 835| 285k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 285k, False: 0] ------------------ 836| 285k| auto idx = pos.index(pos.size() - 1); 837| 285k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 285k| auto count = new_idx + 1; 839| 285k| auto new_parent = node_t::make_inner_n(count); 840| 285k| IMMER_TRY { ------------------ | | 49| 285k|#define IMMER_TRY try ------------------ 841| 285k| new_parent->inner()[new_idx] = 842| 285k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 264k, False: 21.2k] ------------------ 843| | /* otherwise */ 844| 285k| : node_t::make_path(pos.shift() - B, tail); 845| 285k| } 846| 285k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 285k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 285k| } 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| 100k| { 503| 100k| auto offset = pos.index(idx); 504| 100k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 100k| IMMER_TRY { ------------------ | | 49| 100k|#define IMMER_TRY try ------------------ 506| 100k| node->leaf()[offset] = 507| 100k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 100k| return node; 509| 100k| } 510| 100k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 100k| } 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| 190k| { 467| 190k| auto offset = pos.index(idx); 468| 190k| auto count = pos.count(); 469| 190k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 190k| IMMER_TRY { ------------------ | | 49| 190k|#define IMMER_TRY try ------------------ 471| 190k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 190k| node_t::do_copy_inner_replace_sr( 473| 190k| node, pos.node(), count, offset, child); 474| 190k| return node; 475| 190k| } 476| 190k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 190k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 50.8k| { 485| 50.8k| auto offset = pos.index(idx); 486| 50.8k| auto count = pos.count(); 487| 50.8k| auto node = node_t::make_inner_n(count); 488| 50.8k| IMMER_TRY { ------------------ | | 49| 50.8k|#define IMMER_TRY try ------------------ 489| 50.8k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 50.8k| node_t::do_copy_inner_replace( 491| 50.8k| node, pos.node(), count, offset, child); 492| 50.8k| return node; 493| 50.8k| } 494| 50.8k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 50.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| 17.7k| { 503| 17.7k| auto offset = pos.index(idx); 504| 17.7k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 17.7k| IMMER_TRY { ------------------ | | 49| 17.7k|#define IMMER_TRY try ------------------ 506| 17.7k| node->leaf()[offset] = 507| 17.7k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 17.7k| return node; 509| 17.7k| } 510| 17.7k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 17.7k| } 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.4k| { 485| 13.4k| auto offset = pos.index(idx); 486| 13.4k| auto count = pos.count(); 487| 13.4k| auto node = node_t::make_inner_n(count); 488| 13.4k| IMMER_TRY { ------------------ | | 49| 13.4k|#define IMMER_TRY try ------------------ 489| 13.4k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 13.4k| node_t::do_copy_inner_replace( 491| 13.4k| node, pos.node(), count, offset, child); 492| 13.4k| return node; 493| 13.4k| } 494| 13.4k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 13.4k| } 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| 33.1k| { 503| 33.1k| auto offset = pos.index(idx); 504| 33.1k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 33.1k| IMMER_TRY { ------------------ | | 49| 33.1k|#define IMMER_TRY try ------------------ 506| 33.1k| node->leaf()[offset] = 507| 33.1k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 33.1k| return node; 509| 33.1k| } 510| 33.1k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 33.1k| } 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| 3.99k| { 485| 3.99k| auto offset = pos.index(idx); 486| 3.99k| auto count = pos.count(); 487| 3.99k| auto node = node_t::make_inner_n(count); 488| 3.99k| IMMER_TRY { ------------------ | | 49| 3.99k|#define IMMER_TRY try ------------------ 489| 3.99k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 3.99k| node_t::do_copy_inner_replace( 491| 3.99k| node, pos.node(), count, offset, child); 492| 3.99k| return node; 493| 3.99k| } 494| 3.99k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 3.99k| } _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| 35.7k| { 1097| 35.7k| auto idx = pos.index(last); 1098| 35.7k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 35.7k, Folded] | Branch (1098:25): [True: 28.1k, False: 7.59k] ------------------ 1099| 28.1k| return pos.towards_oh(this_t{}, last, idx); 1100| 28.1k| } else { 1101| 7.59k| using std::get; 1102| 7.59k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 7.59k| auto next = get<1>(subs); 1104| 7.59k| auto ts = get<2>(subs); 1105| 7.59k| auto tail = get<3>(subs); 1106| 7.59k| IMMER_TRY { ------------------ | | 49| 7.59k|#define IMMER_TRY try ------------------ 1107| 7.59k| if (next) { ------------------ | Branch (1107:21): [True: 4.20k, False: 3.38k] ------------------ 1108| 4.20k| auto count = idx + 1; 1109| 4.20k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 4.20k| auto newr = newn->relaxed(); 1111| 4.20k| newn->inner()[idx] = next; 1112| 4.20k| newr->d.sizes[idx] = last + 1 - ts; 1113| 4.20k| newr->d.count = count; 1114| 4.20k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 4.20k, False: 0] ------------------ 1115| 4.20k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 4.20k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 3.38k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 3.38k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 3.38k, Folded] | Branch (1118:40): [True: 1.71k, False: 1.67k] | Branch (1118:52): [True: 960, False: 755] ------------------ 1119| 960| auto newn = pos.node()->inner()[0]; 1120| 960| return std::make_tuple( 1121| 960| pos.shift() - B, newn->inc(), ts, tail); 1122| 2.42k| } else { 1123| 2.42k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 2.42k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 2.42k| } 1126| 7.59k| } 1127| 7.59k| 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.59k| } 1138| 35.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.72k| { 1182| 1.72k| auto old_tail_size = pos.count(); 1183| 1.72k| auto new_tail_size = pos.index(last) + 1; 1184| 1.72k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 414, False: 1.30k] ------------------ 1185| 1.72k| ? pos.node()->inc() 1186| 1.72k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.72k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.72k| } _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.36k| { 1182| 4.36k| auto old_tail_size = pos.count(); 1183| 4.36k| auto new_tail_size = pos.index(last) + 1; 1184| 4.36k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.45k, False: 2.91k] ------------------ 1185| 4.36k| ? pos.node()->inc() 1186| 4.36k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 4.36k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 4.36k| } _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.51k| { 1097| 3.51k| auto idx = pos.index(last); 1098| 3.51k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 3.51k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 3.51k| } else { 1101| 3.51k| using std::get; 1102| 3.51k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 3.51k| auto next = get<1>(subs); 1104| 3.51k| auto ts = get<2>(subs); 1105| 3.51k| auto tail = get<3>(subs); 1106| 3.51k| IMMER_TRY { ------------------ | | 49| 3.51k|#define IMMER_TRY try ------------------ 1107| 3.51k| if (next) { ------------------ | Branch (1107:21): [True: 769, False: 2.74k] ------------------ 1108| 769| auto count = idx + 1; 1109| 769| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 769| auto newr = newn->relaxed(); 1111| 769| newn->inner()[idx] = next; 1112| 769| newr->d.sizes[idx] = last + 1 - ts; 1113| 769| newr->d.count = count; 1114| 769| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 769, False: 0] ------------------ 1115| 769| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 2.74k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 1.16k, False: 1.58k] ------------------ 1117| 1.16k| 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.51k| } 1127| 3.51k| 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.51k| } 1138| 3.51k| } _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.23k| { 1143| 3.23k| auto idx = pos.index(last); 1144| 3.23k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.23k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 3.23k| } else { 1147| 3.23k| using std::get; 1148| 3.23k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.23k| auto next = get<1>(subs); 1150| 3.23k| auto ts = get<2>(subs); 1151| 3.23k| auto tail = get<3>(subs); 1152| 3.23k| IMMER_TRY { ------------------ | | 49| 3.23k|#define IMMER_TRY try ------------------ 1153| 3.23k| if (next) { ------------------ | Branch (1153:21): [True: 1.83k, False: 1.39k] ------------------ 1154| 1.83k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.83k| newn->inner()[idx] = next; 1156| 1.83k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.83k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 611, False: 782] ------------------ 1158| 611| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 782| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 782] | 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| 782| } else { 1164| 782| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 782| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 782| } 1167| 3.23k| } 1168| 3.23k| 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.23k| } 1177| 3.23k| } _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.30k| { 1182| 6.30k| auto old_tail_size = pos.count(); 1183| 6.30k| auto new_tail_size = pos.index(last) + 1; 1184| 6.30k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.69k, False: 4.61k] ------------------ 1185| 6.30k| ? pos.node()->inc() 1186| 6.30k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 6.30k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 6.30k| } _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.32k| { 1143| 2.32k| auto idx = pos.index(last); 1144| 2.32k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.32k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.32k| } else { 1147| 2.32k| using std::get; 1148| 2.32k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.32k| auto next = get<1>(subs); 1150| 2.32k| auto ts = get<2>(subs); 1151| 2.32k| auto tail = get<3>(subs); 1152| 2.32k| IMMER_TRY { ------------------ | | 49| 2.32k|#define IMMER_TRY try ------------------ 1153| 2.32k| if (next) { ------------------ | Branch (1153:21): [True: 238, False: 2.08k] ------------------ 1154| 238| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 238| newn->inner()[idx] = next; 1156| 238| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.08k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 483, False: 1.60k] ------------------ 1158| 483| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.60k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.60k] | 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.60k| } else { 1164| 1.60k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.60k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.60k| } 1167| 2.32k| } 1168| 2.32k| 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.32k| } 1177| 2.32k| } _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.71k| { 1182| 2.71k| auto old_tail_size = pos.count(); 1183| 2.71k| auto new_tail_size = pos.index(last) + 1; 1184| 2.71k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.35k, False: 1.36k] ------------------ 1185| 2.71k| ? pos.node()->inc() 1186| 2.71k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.71k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.71k| } _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.11k| { 1143| 3.11k| auto idx = pos.index(last); 1144| 3.11k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.11k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 3.11k| } else { 1147| 3.11k| using std::get; 1148| 3.11k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.11k| auto next = get<1>(subs); 1150| 3.11k| auto ts = get<2>(subs); 1151| 3.11k| auto tail = get<3>(subs); 1152| 3.11k| IMMER_TRY { ------------------ | | 49| 3.11k|#define IMMER_TRY try ------------------ 1153| 3.11k| if (next) { ------------------ | Branch (1153:21): [True: 824, False: 2.29k] ------------------ 1154| 824| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 824| newn->inner()[idx] = next; 1156| 824| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.29k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 963, False: 1.32k] ------------------ 1158| 963| 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.11k| } 1168| 3.11k| 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.11k| } 1177| 3.11k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_j: 556| 39.7k|{ 557| 39.7k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 39.7k|} _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.37k| { 1143| 8.37k| auto idx = pos.index(last); 1144| 8.37k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 8.37k, Folded] | Branch (1144:25): [True: 5.58k, False: 2.78k] ------------------ 1145| 5.58k| return pos.towards_oh(this_t{}, last, idx); 1146| 5.58k| } else { 1147| 2.78k| using std::get; 1148| 2.78k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.78k| auto next = get<1>(subs); 1150| 2.78k| auto ts = get<2>(subs); 1151| 2.78k| auto tail = get<3>(subs); 1152| 2.78k| IMMER_TRY { ------------------ | | 49| 2.78k|#define IMMER_TRY try ------------------ 1153| 2.78k| if (next) { ------------------ | Branch (1153:21): [True: 708, False: 2.07k] ------------------ 1154| 708| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 708| newn->inner()[idx] = next; 1156| 708| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.07k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.07k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.07k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.07k, Folded] | Branch (1159:40): [True: 1.30k, False: 775] | Branch (1159:52): [True: 692, False: 612] ------------------ 1160| 692| auto newn = pos.node()->inner()[0]; 1161| 692| return std::make_tuple( 1162| 692| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.38k| } else { 1164| 1.38k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.38k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.38k| } 1167| 2.78k| } 1168| 2.78k| 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.78k| } 1177| 8.37k| } _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.82k| { 1182| 1.82k| auto old_tail_size = pos.count(); 1183| 1.82k| auto new_tail_size = pos.index(last) + 1; 1184| 1.82k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 667, False: 1.16k] ------------------ 1185| 1.82k| ? pos.node()->inc() 1186| 1.82k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.82k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.82k| } _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.36k| { 1143| 5.36k| auto idx = pos.index(last); 1144| 5.36k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 5.36k, Folded] | Branch (1144:25): [True: 2.36k, False: 2.99k] ------------------ 1145| 2.36k| 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: 384, False: 2.61k] ------------------ 1154| 384| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 384| newn->inner()[idx] = next; 1156| 384| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.61k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.61k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.61k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.61k, Folded] | Branch (1159:40): [True: 710, False: 1.90k] | Branch (1159:52): [True: 259, False: 451] ------------------ 1160| 259| auto newn = pos.node()->inner()[0]; 1161| 259| return std::make_tuple( 1162| 259| pos.shift() - B, newn->inc(), ts, tail); 1163| 2.35k| } else { 1164| 2.35k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 2.35k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 2.35k| } 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.36k| } _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| 760| { 1182| 760| auto old_tail_size = pos.count(); 1183| 760| auto new_tail_size = pos.index(last) + 1; 1184| 760| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 336, False: 424] ------------------ 1185| 760| ? pos.node()->inc() 1186| 760| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 760| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 760| } _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| 23.9k| { 1415| 23.9k| auto idx = pos.subindex(first); 1416| 23.9k| auto count = pos.count(); 1417| 23.9k| auto left_size = pos.size_before(idx); 1418| 23.9k| auto child_size = pos.size_sbh(idx, left_size); 1419| 23.9k| auto dropped_size = first; 1420| 23.9k| auto child_dropped_size = dropped_size - left_size; 1421| 23.9k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 23.9k, Folded] | Branch (1421:25): [True: 22.0k, False: 1.91k] | Branch (1421:45): [True: 4.04k, False: 17.9k] ------------------ 1422| 4.04k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 19.8k| } else { 1424| 19.8k| using std::get; 1425| 19.8k| auto n = pos.node(); 1426| 19.8k| auto newc = count - idx; 1427| 19.8k| auto newn = node_t::make_inner_r_n(newc); 1428| 19.8k| IMMER_TRY { ------------------ | | 49| 19.8k|#define IMMER_TRY try ------------------ 1429| 19.8k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 19.8k| auto newr = newn->relaxed(); 1431| 19.8k| newr->d.count = count - idx; 1432| 19.8k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 19.8k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 19.8k, False: 0] ------------------ 1434| 19.8k| pos.copy_sizes(idx + 1, 1435| 19.8k| newr->d.count - 1, 1436| 19.8k| newr->d.sizes[0], 1437| 19.8k| newr->d.sizes + 1); 1438| 19.8k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 19.8k, False: 0] ------------------ 1439| 19.8k| pos.size() - dropped_size); 1440| 19.8k| newn->inner()[0] = get<1>(subs); 1441| 19.8k| std::copy(n->inner() + idx + 1, 1442| 19.8k| n->inner() + count, 1443| 19.8k| newn->inner() + 1); 1444| 19.8k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 19.8k| return std::make_tuple(pos.shift(), newn); 1446| 19.8k| } 1447| 19.8k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 19.8k| } 1452| 23.9k| } _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.3k| { 1457| 18.3k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 18.3k| return std::make_tuple(0, n); 1459| 18.3k| } _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| 93.6k| { 1415| 93.6k| auto idx = pos.subindex(first); 1416| 93.6k| auto count = pos.count(); 1417| 93.6k| auto left_size = pos.size_before(idx); 1418| 93.6k| auto child_size = pos.size_sbh(idx, left_size); 1419| 93.6k| auto dropped_size = first; 1420| 93.6k| auto child_dropped_size = dropped_size - left_size; 1421| 93.6k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 93.6k] | 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| 93.6k| } else { 1424| 93.6k| using std::get; 1425| 93.6k| auto n = pos.node(); 1426| 93.6k| auto newc = count - idx; 1427| 93.6k| auto newn = node_t::make_inner_r_n(newc); 1428| 93.6k| IMMER_TRY { ------------------ | | 49| 93.6k|#define IMMER_TRY try ------------------ 1429| 93.6k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 93.6k| auto newr = newn->relaxed(); 1431| 93.6k| newr->d.count = count - idx; 1432| 93.6k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 93.6k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 93.6k, False: 0] ------------------ 1434| 93.6k| pos.copy_sizes(idx + 1, 1435| 93.6k| newr->d.count - 1, 1436| 93.6k| newr->d.sizes[0], 1437| 93.6k| newr->d.sizes + 1); 1438| 93.6k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 93.6k, False: 0] ------------------ 1439| 93.6k| pos.size() - dropped_size); 1440| 93.6k| newn->inner()[0] = get<1>(subs); 1441| 93.6k| std::copy(n->inner() + idx + 1, 1442| 93.6k| n->inner() + count, 1443| 93.6k| newn->inner() + 1); 1444| 93.6k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 93.6k| return std::make_tuple(pos.shift(), newn); 1446| 93.6k| } 1447| 93.6k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 93.6k| } 1452| 93.6k| } _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.53k| { 1415| 1.53k| auto idx = pos.subindex(first); 1416| 1.53k| auto count = pos.count(); 1417| 1.53k| auto left_size = pos.size_before(idx); 1418| 1.53k| auto child_size = pos.size_sbh(idx, left_size); 1419| 1.53k| auto dropped_size = first; 1420| 1.53k| auto child_dropped_size = dropped_size - left_size; 1421| 1.53k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 1.53k] | 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.53k| } else { 1424| 1.53k| using std::get; 1425| 1.53k| auto n = pos.node(); 1426| 1.53k| auto newc = count - idx; 1427| 1.53k| auto newn = node_t::make_inner_r_n(newc); 1428| 1.53k| IMMER_TRY { ------------------ | | 49| 1.53k|#define IMMER_TRY try ------------------ 1429| 1.53k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 1.53k| auto newr = newn->relaxed(); 1431| 1.53k| newr->d.count = count - idx; 1432| 1.53k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 1.53k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 1.53k, False: 0] ------------------ 1434| 1.53k| pos.copy_sizes(idx + 1, 1435| 1.53k| newr->d.count - 1, 1436| 1.53k| newr->d.sizes[0], 1437| 1.53k| newr->d.sizes + 1); 1438| 1.53k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 1.53k, False: 0] ------------------ 1439| 1.53k| pos.size() - dropped_size); 1440| 1.53k| newn->inner()[0] = get<1>(subs); 1441| 1.53k| std::copy(n->inner() + idx + 1, 1442| 1.53k| n->inner() + count, 1443| 1.53k| newn->inner() + 1); 1444| 1.53k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 1.53k| return std::make_tuple(pos.shift(), newn); 1446| 1.53k| } 1447| 1.53k| 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.53k| } 1452| 1.53k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 10.1k| { 1457| 10.1k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 10.1k| return std::make_tuple(0, n); 1459| 10.1k| } _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.25k| { 1415| 7.25k| auto idx = pos.subindex(first); 1416| 7.25k| auto count = pos.count(); 1417| 7.25k| auto left_size = pos.size_before(idx); 1418| 7.25k| auto child_size = pos.size_sbh(idx, left_size); 1419| 7.25k| auto dropped_size = first; 1420| 7.25k| auto child_dropped_size = dropped_size - left_size; 1421| 7.25k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 7.25k] | 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.25k| } else { 1424| 7.25k| using std::get; 1425| 7.25k| auto n = pos.node(); 1426| 7.25k| auto newc = count - idx; 1427| 7.25k| auto newn = node_t::make_inner_r_n(newc); 1428| 7.25k| IMMER_TRY { ------------------ | | 49| 7.25k|#define IMMER_TRY try ------------------ 1429| 7.25k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 7.25k| auto newr = newn->relaxed(); 1431| 7.25k| newr->d.count = count - idx; 1432| 7.25k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 7.25k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 7.25k, False: 0] ------------------ 1434| 7.25k| pos.copy_sizes(idx + 1, 1435| 7.25k| newr->d.count - 1, 1436| 7.25k| newr->d.sizes[0], 1437| 7.25k| newr->d.sizes + 1); 1438| 7.25k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 7.25k, False: 0] ------------------ 1439| 7.25k| pos.size() - dropped_size); 1440| 7.25k| newn->inner()[0] = get<1>(subs); 1441| 7.25k| std::copy(n->inner() + idx + 1, 1442| 7.25k| n->inner() + count, 1443| 7.25k| newn->inner() + 1); 1444| 7.25k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 7.25k| return std::make_tuple(pos.shift(), newn); 1446| 7.25k| } 1447| 7.25k| 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.25k| } 1452| 7.25k| } _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.4k| { 1415| 10.4k| auto idx = pos.subindex(first); 1416| 10.4k| auto count = pos.count(); 1417| 10.4k| auto left_size = pos.size_before(idx); 1418| 10.4k| auto child_size = pos.size_sbh(idx, left_size); 1419| 10.4k| auto dropped_size = first; 1420| 10.4k| auto child_dropped_size = dropped_size - left_size; 1421| 10.4k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 10.4k, Folded] | Branch (1421:25): [True: 7.05k, False: 3.38k] | Branch (1421:45): [True: 2.60k, False: 4.45k] ------------------ 1422| 2.60k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 7.83k| } else { 1424| 7.83k| using std::get; 1425| 7.83k| auto n = pos.node(); 1426| 7.83k| auto newc = count - idx; 1427| 7.83k| auto newn = node_t::make_inner_r_n(newc); 1428| 7.83k| IMMER_TRY { ------------------ | | 49| 7.83k|#define IMMER_TRY try ------------------ 1429| 7.83k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 7.83k| auto newr = newn->relaxed(); 1431| 7.83k| newr->d.count = count - idx; 1432| 7.83k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 7.83k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 7.83k, False: 0] ------------------ 1434| 7.83k| pos.copy_sizes(idx + 1, 1435| 7.83k| newr->d.count - 1, 1436| 7.83k| newr->d.sizes[0], 1437| 7.83k| newr->d.sizes + 1); 1438| 7.83k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 7.83k, False: 0] ------------------ 1439| 7.83k| pos.size() - dropped_size); 1440| 7.83k| newn->inner()[0] = get<1>(subs); 1441| 7.83k| std::copy(n->inner() + idx + 1, 1442| 7.83k| n->inner() + count, 1443| 7.83k| newn->inner() + 1); 1444| 7.83k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 7.83k| return std::make_tuple(pos.shift(), newn); 1446| 7.83k| } 1447| 7.83k| 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.83k| } 1452| 10.4k| } _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| 744| { 1415| 744| auto idx = pos.subindex(first); 1416| 744| auto count = pos.count(); 1417| 744| auto left_size = pos.size_before(idx); 1418| 744| auto child_size = pos.size_sbh(idx, left_size); 1419| 744| auto dropped_size = first; 1420| 744| auto child_dropped_size = dropped_size - left_size; 1421| 744| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 744, Folded] | Branch (1421:25): [True: 281, False: 463] | Branch (1421:45): [True: 0, False: 281] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 744| } else { 1424| 744| using std::get; 1425| 744| auto n = pos.node(); 1426| 744| auto newc = count - idx; 1427| 744| auto newn = node_t::make_inner_r_n(newc); 1428| 744| IMMER_TRY { ------------------ | | 49| 744|#define IMMER_TRY try ------------------ 1429| 744| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 744| auto newr = newn->relaxed(); 1431| 744| newr->d.count = count - idx; 1432| 744| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 744| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 744, False: 0] ------------------ 1434| 744| pos.copy_sizes(idx + 1, 1435| 744| newr->d.count - 1, 1436| 744| newr->d.sizes[0], 1437| 744| newr->d.sizes + 1); 1438| 744| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 744, False: 0] ------------------ 1439| 744| pos.size() - dropped_size); 1440| 744| newn->inner()[0] = get<1>(subs); 1441| 744| std::copy(n->inner() + idx + 1, 1442| 744| n->inner() + count, 1443| 744| newn->inner() + 1); 1444| 744| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 744| return std::make_tuple(pos.shift(), newn); 1446| 744| } 1447| 744| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 744| } 1452| 744| } _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.25k|{ 2002| 7.25k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 7.25k| .visit(concat_trees_left_visitor{}, 2004| 7.25k| empty_leaf_pos{}, 2005| 7.25k| rroot, 2006| 7.25k| rshift, 2007| 7.25k| rsize) 2008| 7.25k| .realize(); 2009| 7.25k|} _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.25k| { 1972| 7.25k| return visit_maybe_relaxed_sub( 1973| 7.25k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 7.25k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 5.00k| { 1959| 5.00k| return concat_inners(lpos, tpos, rpos); 1960| 5.00k| } _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| 22.3k|{ 1873| 22.3k| auto lshift = lpos.shift(); 1874| 22.3k| auto rshift = rpos.shift(); 1875| 22.3k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 22.3k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 22.3k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 17.5k, False: 4.70k] ------------------ 1879| 17.5k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 17.5k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 17.5k| } else { 1882| 4.70k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 4.70k, False: 0] ------------------ 1883| 4.70k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 4.70k] | Branch (1883:9): [True: 4.70k, False: 0] | Branch (1883:9): [True: 4.70k, False: 0] ------------------ 1884| 4.70k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 4.70k| return concat_rebalance(lpos, cpos, rpos); 1886| 4.70k| } 1887| 22.3k|} _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.4M| { 1513| 14.4M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.16M, False: 13.2M] ------------------ 1514| 1.16M| auto s = size_t{}; 1515| 4.65M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.48M, False: 1.16M] ------------------ 1516| 3.48M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.48M| s = sizes_[i]; 1518| 3.48M| } 1519| 13.2M| } else { 1520| 35.9M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 22.6M, False: 13.2M] ------------------ 1521| 22.6M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 22.6M| .visit(v, args...); 1523| 13.2M| } 1524| 14.4M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 8.34M| { 1734| 8.34M| auto count = p.count(); 1735| 8.34M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 8.34M, False: 0] ------------------ 1736| 8.34M| plan.counts[plan.n++] = count; 1737| 8.34M| plan.total += count; 1738| 8.34M| } _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| 122M| { 1734| 122M| auto count = p.count(); 1735| 122M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 122M, False: 0] ------------------ 1736| 122M| plan.counts[plan.n++] = count; 1737| 122M| plan.total += count; 1738| 122M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE7shuffleEj: 1762| 14.4M| { 1763| | // gcc seems to not really understand this code... :( 1764| 14.4M|#if !defined(_MSC_VER) 1765| 14.4M|#pragma GCC diagnostic push 1766| 14.4M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 14.4M|#endif 1768| 14.4M| constexpr count_t rrb_extras = 2; 1769| 14.4M| constexpr count_t rrb_invariant = 1; 1770| 14.4M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 1.16M, False: 13.2M] ------------------ 1771| 14.4M| const auto branches = count_t{1} << bits; 1772| 14.4M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 14.4M| count_t i = 0; 1774| 17.8M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 3.41M, False: 14.4M] ------------------ 1775| | // skip ok nodes 1776| 7.50M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 4.09M, False: 3.41M] ------------------ 1777| 4.09M| i++; 1778| 3.41M| assert(i < n); ------------------ | Branch (1778:13): [True: 3.41M, False: 0] ------------------ 1779| | // short node, redistribute 1780| 3.41M| auto remaining = counts[i]; 1781| 13.3M| do { 1782| 13.3M| auto next = counts[i + 1]; 1783| 13.3M| auto count = std::min(remaining + next, branches); 1784| 13.3M| counts[i] = count; 1785| 13.3M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 13.3M, False: 0] ------------------ 1786| 13.3M| remaining += next - count; 1787| 13.3M| ++i; 1788| 13.3M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 9.89M, False: 3.41M] ------------------ 1789| | // remove node 1790| 3.41M| std::move(counts + i + 1, counts + n, counts + i); 1791| 3.41M| --n; 1792| 3.41M| --i; 1793| 3.41M| } 1794| 14.4M|#if !defined(_MSC_VER) 1795| 14.4M|#pragma GCC diagnostic pop 1796| 14.4M|#endif 1797| 14.4M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1478| 28.9M| 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.4M| : curr_{counts} 1578| 14.4M| , n_{n} 1579| 14.4M| , result_{ 1580| 14.4M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 14.4M| { 1582| 14.4M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_m: 1481| 14.4M| : shift_{s} 1482| 14.4M| , count_{1} 1483| 14.4M| , nodes_{n0} 1484| 14.4M| , sizes_{s0} 1485| 14.4M| { 1486| 14.4M| } _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.4M| { 1513| 14.4M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.16M, False: 13.2M] ------------------ 1514| 1.16M| auto s = size_t{}; 1515| 4.65M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.48M, False: 1.16M] ------------------ 1516| 3.48M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.48M| s = sizes_[i]; 1518| 3.48M| } 1519| 13.2M| } else { 1520| 35.9M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 22.6M, False: 13.2M] ------------------ 1521| 22.6M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 22.6M| .visit(v, args...); 1523| 13.2M| } 1524| 14.4M| } _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.34M| { 1722| 8.34M| merger.merge_leaf(p); 1723| 8.34M| } _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.34M| { 1615| 8.34M| auto from = p.node(); 1616| 8.34M| auto from_size = p.size(); 1617| 8.34M| auto from_count = p.count(); 1618| 8.34M| assert(from_size); ------------------ | Branch (1618:9): [True: 8.34M, False: 0] ------------------ 1619| 8.34M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 8.20M, False: 145k] | Branch (1619:21): [True: 8.13M, False: 66.7k] ------------------ 1620| 8.13M| add_child(from, from_size); 1621| 8.13M| from->inc(); 1622| 8.13M| } else { 1623| 212k| auto from_offset = count_t{}; 1624| 212k| auto from_data = from->leaf(); 1625| 288k| do { 1626| 288k| if (!to_) { ------------------ | Branch (1626:21): [True: 142k, False: 145k] ------------------ 1627| 142k| to_ = node_t::make_leaf_n(*curr_); 1628| 142k| to_offset_ = 0; 1629| 142k| } 1630| 288k| auto data = to_->leaf(); 1631| 288k| auto to_copy = 1632| 288k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 288k| detail::uninitialized_copy(from_data + from_offset, 1634| 288k| from_data + from_offset + to_copy, 1635| 288k| data + to_offset_); 1636| 288k| to_offset_ += to_copy; 1637| 288k| from_offset += to_copy; 1638| 288k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 142k, False: 145k] ------------------ 1639| 142k| add_child(to_, to_offset_); 1640| 142k| to_ = nullptr; 1641| 142k| } 1642| 288k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 76.0k, False: 212k] ------------------ 1643| 212k| } 1644| 8.34M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9add_childEPSC_m: 1589| 138M| { 1590| 138M| assert(size); ------------------ | Branch (1590:9): [True: 138M, False: 0] ------------------ 1591| 138M| ++curr_; 1592| 138M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 138M| auto relaxed = parent->relaxed(); 1594| 138M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 9.42M, False: 129M] ------------------ 1595| 9.42M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 9.42M, False: 0] ------------------ 1596| 9.42M| n_ -= branches; 1597| 9.42M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 9.42M| relaxed = parent->relaxed(); 1599| 9.42M| result_.nodes_[result_.count_] = parent; 1600| 9.42M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 9.42M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 9.42M, False: 0] ------------------ 1602| 9.42M| ++result_.count_; 1603| 9.42M| } 1604| 138M| auto idx = relaxed->d.count++; 1605| 138M| result_.sizes_[result_.count_ - 1] += size; 1606| 138M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 138M, False: 0] ------------------ 1607| 138M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 114M, False: 23.8M] ------------------ 1608| 138M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 138M, False: 0] ------------------ 1609| 138M| parent->inner()[idx] = p; 1610| 138M| }; _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| 122M| { 1716| 122M| merger.merge_inner(p); 1717| 122M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 122M| { 1649| 122M| auto from = p.node(); 1650| 122M| auto from_size = p.size(); 1651| 122M| auto from_count = p.count(); 1652| 122M| assert(from_size); ------------------ | Branch (1652:9): [True: 122M, False: 0] ------------------ 1653| 122M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 111M, False: 11.1M] | Branch (1653:21): [True: 108M, False: 2.78M] ------------------ 1654| 108M| add_child(from, from_size); 1655| 108M| from->inc(); 1656| 108M| } else { 1657| 13.9M| auto from_offset = count_t{}; 1658| 13.9M| auto from_data = from->inner(); 1659| 21.8M| do { 1660| 21.8M| if (!to_) { ------------------ | Branch (1660:21): [True: 10.6M, False: 11.1M] ------------------ 1661| 10.6M| to_ = node_t::make_inner_r_n(*curr_); 1662| 10.6M| to_offset_ = 0; 1663| 10.6M| to_size_ = 0; 1664| 10.6M| } 1665| 21.8M| auto data = to_->inner(); 1666| 21.8M| auto to_copy = 1667| 21.8M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 21.8M| std::copy(from_data + from_offset, 1669| 21.8M| from_data + from_offset + to_copy, 1670| 21.8M| data + to_offset_); 1671| 21.8M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 21.8M| auto sizes = to_->relaxed()->d.sizes; 1673| 21.8M| p.copy_sizes( 1674| 21.8M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 21.8M| to_offset_ += to_copy; 1676| 21.8M| from_offset += to_copy; 1677| 21.8M| to_size_ = sizes[to_offset_ - 1]; 1678| 21.8M| assert(to_size_); ------------------ | Branch (1678:17): [True: 21.8M, False: 0] ------------------ 1679| 21.8M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 10.6M, False: 11.1M] ------------------ 1680| 10.6M| to_->relaxed()->d.count = to_offset_; 1681| 10.6M| add_child(to_, to_size_); 1682| 10.6M| to_ = nullptr; 1683| 10.6M| } 1684| 21.8M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 7.83M, False: 13.9M] ------------------ 1685| 13.9M| } 1686| 122M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6finishEv: 1689| 14.4M| { 1690| 14.4M| assert(!to_); ------------------ | Branch (1690:9): [True: 14.4M, False: 0] ------------------ 1691| 14.4M| return result_; 1692| 14.4M| } _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.4M| { 1513| 14.4M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.16M, False: 13.2M] ------------------ 1514| 1.16M| auto s = size_t{}; 1515| 4.65M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.48M, False: 1.16M] ------------------ 1516| 3.48M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.48M| s = sizes_[i]; 1518| 3.48M| } 1519| 13.2M| } else { 1520| 35.9M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 22.6M, False: 13.2M] ------------------ 1521| 22.6M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 22.6M| .visit(v, args...); 1523| 13.2M| } 1524| 14.4M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_mSE_m: 1503| 1.15M| : shift_{s} 1504| 1.15M| , count_{3} 1505| 1.15M| , nodes_{n0, n1, n2} 1506| 1.15M| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 1.15M| { 1508| 1.15M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_m: 1489| 7.25k| : shift_{s} 1490| 7.25k| , count_{2} 1491| 7.25k| , nodes_{n0, n1} 1492| 7.25k| , sizes_{s0, s0 + s1} 1493| 7.25k| { 1494| 7.25k| } _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| 17.2k| { 1918| 17.2k| return concat_inners(lpos, tpos, rpos); 1919| 17.2k| } _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| 300| { 1918| 300| return concat_inners(lpos, tpos, rpos); 1919| 300| } _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.55k|{ 1873| 2.55k| auto lshift = lpos.shift(); 1874| 2.55k| auto rshift = rpos.shift(); 1875| 2.55k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.55k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.55k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 658, False: 1.89k] ------------------ 1879| 658| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 658| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.89k| } else { 1882| 1.89k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.89k, False: 0] ------------------ 1883| 1.89k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.89k] | Branch (1883:9): [True: 1.89k, False: 0] | Branch (1883:9): [True: 1.89k, False: 0] ------------------ 1884| 1.89k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.89k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.89k| } 1887| 2.55k|} _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| 906| { 1918| 906| return concat_inners(lpos, tpos, rpos); 1919| 906| } _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| 906|{ 1873| 906| auto lshift = lpos.shift(); 1874| 906| auto rshift = rpos.shift(); 1875| 906| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 906] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 906| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 248, False: 658] ------------------ 1879| 248| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 248| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 658| } else { 1882| 658| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 658, False: 0] ------------------ 1883| 658| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 658] | Branch (1883:9): [True: 658, False: 0] | Branch (1883:9): [True: 658, False: 0] ------------------ 1884| 658| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 658| return concat_rebalance(lpos, cpos, rpos); 1886| 658| } 1887| 906|} _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| 661|{ 1824| 661| auto plan = concat_rebalance_plan{}; 1825| 661| plan.fill(lpos, cpos, rpos); 1826| 661| plan.shuffle(cpos.shift()); 1827| 661| IMMER_TRY { ------------------ | | 49| 661|#define IMMER_TRY try ------------------ 1828| 661| return plan.merge(lpos, cpos, rpos); 1829| 661| } 1830| 661| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 661|} _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| 661| { 1753| 661| assert(n == 0u); ------------------ | Branch (1753:9): [True: 661, False: 0] ------------------ 1754| 661| assert(total == 0u); ------------------ | Branch (1754:9): [True: 661, False: 0] ------------------ 1755| 661| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 661| lpos.each_left_sub(visitor_t{}, *this); 1757| 661| cpos.each_sub(visitor_t{}, *this); 1758| 661| rpos.each_right_sub(visitor_t{}, *this); 1759| 661| } _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.31M| { 1734| 6.31M| auto count = p.count(); 1735| 6.31M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 6.31M, False: 0] ------------------ 1736| 6.31M| plan.counts[plan.n++] = count; 1737| 6.31M| plan.total += count; 1738| 6.31M| } _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| 611k| { 1734| 611k| auto count = p.count(); 1735| 611k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 611k, False: 0] ------------------ 1736| 611k| plan.counts[plan.n++] = count; 1737| 611k| plan.total += count; 1738| 611k| } _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| 661| { 1803| 661| using node_t = node_type; 1804| 661| using merger_t = concat_merger; 1805| 661| using visitor_t = concat_merger_visitor; 1806| 661| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 661| IMMER_TRY { ------------------ | | 49| 661|#define IMMER_TRY try ------------------ 1808| 661| lpos.each_left_sub(visitor_t{}, merger); 1809| 661| cpos.each_sub(visitor_t{}, merger); 1810| 661| rpos.each_right_sub(visitor_t{}, merger); 1811| 661| cpos.each_sub(dec_visitor{}); 1812| 661| return merger.finish(); 1813| 661| } 1814| 661| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 661| } _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.31M| { 1722| 6.31M| merger.merge_leaf(p); 1723| 6.31M| } _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.31M| { 1615| 6.31M| auto from = p.node(); 1616| 6.31M| auto from_size = p.size(); 1617| 6.31M| auto from_count = p.count(); 1618| 6.31M| assert(from_size); ------------------ | Branch (1618:9): [True: 6.31M, False: 0] ------------------ 1619| 6.31M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 6.31M, False: 0] | Branch (1619:21): [True: 6.31M, False: 0] ------------------ 1620| 6.31M| add_child(from, from_size); 1621| 6.31M| from->inc(); 1622| 6.31M| } 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.31M| } _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| 611k| { 1716| 611k| merger.merge_inner(p); 1717| 611k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 611k| { 1649| 611k| auto from = p.node(); 1650| 611k| auto from_size = p.size(); 1651| 611k| auto from_count = p.count(); 1652| 611k| assert(from_size); ------------------ | Branch (1652:9): [True: 611k, False: 0] ------------------ 1653| 611k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 611k, False: 0] | Branch (1653:21): [True: 611k, False: 0] ------------------ 1654| 611k| add_child(from, from_size); 1655| 611k| from->inc(); 1656| 611k| } 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| 611k| } _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| 658| { 1945| 658| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 658| } _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.55k| { 1925| 2.55k| return concat_leafs(lpos, tpos, rpos); 1926| 2.55k| } _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.55k|{ 1839| 2.55k| static_assert(Node::bits >= 2, ""); 1840| 2.55k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 2.55k, False: 0] ------------------ 1841| 2.55k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 2.55k, False: 0] ------------------ 1842| 2.55k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 2.55k, False: 0] ------------------ 1843| 2.55k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 2.55k] ------------------ 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.55k| else 1854| 2.55k| return { 1855| 2.55k| Node::bits_leaf, 1856| 2.55k| lpos.node()->inc(), 1857| 2.55k| lpos.count(), 1858| 2.55k| rpos.node()->inc(), 1859| 2.55k| rpos.count(), 1860| 2.55k| }; 1861| 2.55k|} _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| 658|{ 1824| 658| auto plan = concat_rebalance_plan{}; 1825| 658| plan.fill(lpos, cpos, rpos); 1826| 658| plan.shuffle(cpos.shift()); 1827| 658| IMMER_TRY { ------------------ | | 49| 658|#define IMMER_TRY try ------------------ 1828| 658| return plan.merge(lpos, cpos, rpos); 1829| 658| } 1830| 658| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 658|} _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| 658| { 1753| 658| assert(n == 0u); ------------------ | Branch (1753:9): [True: 658, False: 0] ------------------ 1754| 658| assert(total == 0u); ------------------ | Branch (1754:9): [True: 658, False: 0] ------------------ 1755| 658| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 658| lpos.each_left_sub(visitor_t{}, *this); 1757| 658| cpos.each_sub(visitor_t{}, *this); 1758| 658| rpos.each_right_sub(visitor_t{}, *this); 1759| 658| } _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| 658| { 1803| 658| using node_t = node_type; 1804| 658| using merger_t = concat_merger; 1805| 658| using visitor_t = concat_merger_visitor; 1806| 658| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 658| IMMER_TRY { ------------------ | | 49| 658|#define IMMER_TRY try ------------------ 1808| 658| lpos.each_left_sub(visitor_t{}, merger); 1809| 658| cpos.each_sub(visitor_t{}, merger); 1810| 658| rpos.each_right_sub(visitor_t{}, merger); 1811| 658| cpos.each_sub(dec_visitor{}); 1812| 658| return merger.finish(); 1813| 658| } 1814| 658| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 658| } _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.74k|{ 1824| 1.74k| auto plan = concat_rebalance_plan{}; 1825| 1.74k| plan.fill(lpos, cpos, rpos); 1826| 1.74k| plan.shuffle(cpos.shift()); 1827| 1.74k| IMMER_TRY { ------------------ | | 49| 1.74k|#define IMMER_TRY try ------------------ 1828| 1.74k| return plan.merge(lpos, cpos, rpos); 1829| 1.74k| } 1830| 1.74k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.74k|} _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.74k| { 1753| 1.74k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.74k, False: 0] ------------------ 1754| 1.74k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.74k, False: 0] ------------------ 1755| 1.74k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.74k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.74k| cpos.each_sub(visitor_t{}, *this); 1758| 1.74k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.74k| } _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.46M| { 1734| 4.46M| auto count = p.count(); 1735| 4.46M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 4.46M, False: 0] ------------------ 1736| 4.46M| plan.counts[plan.n++] = count; 1737| 4.46M| plan.total += count; 1738| 4.46M| } _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.74k| { 1803| 1.74k| using node_t = node_type; 1804| 1.74k| using merger_t = concat_merger; 1805| 1.74k| using visitor_t = concat_merger_visitor; 1806| 1.74k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.74k| IMMER_TRY { ------------------ | | 49| 1.74k|#define IMMER_TRY try ------------------ 1808| 1.74k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.74k| cpos.each_sub(visitor_t{}, merger); 1810| 1.74k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.74k| cpos.each_sub(dec_visitor{}); 1812| 1.74k| return merger.finish(); 1813| 1.74k| } 1814| 1.74k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.74k| } _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.46M| { 1716| 4.46M| merger.merge_inner(p); 1717| 4.46M| } _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.46M| { 1649| 4.46M| auto from = p.node(); 1650| 4.46M| auto from_size = p.size(); 1651| 4.46M| auto from_count = p.count(); 1652| 4.46M| assert(from_size); ------------------ | Branch (1652:9): [True: 4.46M, False: 0] ------------------ 1653| 4.46M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 2.47M, False: 1.98M] | Branch (1653:21): [True: 2.47M, False: 0] ------------------ 1654| 2.47M| add_child(from, from_size); 1655| 2.47M| from->inc(); 1656| 2.47M| } else { 1657| 1.98M| auto from_offset = count_t{}; 1658| 1.98M| auto from_data = from->inner(); 1659| 3.96M| do { 1660| 3.96M| if (!to_) { ------------------ | Branch (1660:21): [True: 1.98M, False: 1.98M] ------------------ 1661| 1.98M| to_ = node_t::make_inner_r_n(*curr_); 1662| 1.98M| to_offset_ = 0; 1663| 1.98M| to_size_ = 0; 1664| 1.98M| } 1665| 3.96M| auto data = to_->inner(); 1666| 3.96M| auto to_copy = 1667| 3.96M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 3.96M| std::copy(from_data + from_offset, 1669| 3.96M| from_data + from_offset + to_copy, 1670| 3.96M| data + to_offset_); 1671| 3.96M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 3.96M| auto sizes = to_->relaxed()->d.sizes; 1673| 3.96M| p.copy_sizes( 1674| 3.96M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 3.96M| to_offset_ += to_copy; 1676| 3.96M| from_offset += to_copy; 1677| 3.96M| to_size_ = sizes[to_offset_ - 1]; 1678| 3.96M| assert(to_size_); ------------------ | Branch (1678:17): [True: 3.96M, False: 0] ------------------ 1679| 3.96M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 1.98M, False: 1.98M] ------------------ 1680| 1.98M| to_->relaxed()->d.count = to_offset_; 1681| 1.98M| add_child(to_, to_size_); 1682| 1.98M| to_ = nullptr; 1683| 1.98M| } 1684| 3.96M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.98M, False: 1.98M] ------------------ 1685| 1.98M| } 1686| 4.46M| } _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.89k| { 1945| 1.89k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 1.89k| } _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.70k| { 1925| 4.70k| return concat_leafs(lpos, tpos, rpos); 1926| 4.70k| } _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.70k|{ 1839| 4.70k| static_assert(Node::bits >= 2, ""); 1840| 4.70k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 4.70k, False: 0] ------------------ 1841| 4.70k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 4.70k, False: 0] ------------------ 1842| 4.70k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 4.70k, False: 0] ------------------ 1843| 4.70k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 4.70k] ------------------ 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.70k| else 1854| 4.70k| return { 1855| 4.70k| Node::bits_leaf, 1856| 4.70k| lpos.node()->inc(), 1857| 4.70k| lpos.count(), 1858| 4.70k| rpos.node()->inc(), 1859| 4.70k| rpos.count(), 1860| 4.70k| }; 1861| 4.70k|} _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.89k|{ 1824| 1.89k| auto plan = concat_rebalance_plan{}; 1825| 1.89k| plan.fill(lpos, cpos, rpos); 1826| 1.89k| plan.shuffle(cpos.shift()); 1827| 1.89k| IMMER_TRY { ------------------ | | 49| 1.89k|#define IMMER_TRY try ------------------ 1828| 1.89k| return plan.merge(lpos, cpos, rpos); 1829| 1.89k| } 1830| 1.89k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.89k|} _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.89k| { 1753| 1.89k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.89k, False: 0] ------------------ 1754| 1.89k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.89k, False: 0] ------------------ 1755| 1.89k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.89k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.89k| cpos.each_sub(visitor_t{}, *this); 1758| 1.89k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.89k| } _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.89k| { 1803| 1.89k| using node_t = node_type; 1804| 1.89k| using merger_t = concat_merger; 1805| 1.89k| using visitor_t = concat_merger_visitor; 1806| 1.89k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.89k| IMMER_TRY { ------------------ | | 49| 1.89k|#define IMMER_TRY try ------------------ 1808| 1.89k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.89k| cpos.each_sub(visitor_t{}, merger); 1810| 1.89k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.89k| cpos.each_sub(dec_visitor{}); 1812| 1.89k| return merger.finish(); 1813| 1.89k| } 1814| 1.89k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.89k| } _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| 67.3k|{ 1824| 67.3k| auto plan = concat_rebalance_plan{}; 1825| 67.3k| plan.fill(lpos, cpos, rpos); 1826| 67.3k| plan.shuffle(cpos.shift()); 1827| 67.3k| IMMER_TRY { ------------------ | | 49| 67.3k|#define IMMER_TRY try ------------------ 1828| 67.3k| return plan.merge(lpos, cpos, rpos); 1829| 67.3k| } 1830| 67.3k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 67.3k|} _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| 67.3k| { 1753| 67.3k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 67.3k, False: 0] ------------------ 1754| 67.3k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 67.3k, False: 0] ------------------ 1755| 67.3k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 67.3k| lpos.each_left_sub(visitor_t{}, *this); 1757| 67.3k| cpos.each_sub(visitor_t{}, *this); 1758| 67.3k| rpos.each_right_sub(visitor_t{}, *this); 1759| 67.3k| } _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| 67.3k| { 1803| 67.3k| using node_t = node_type; 1804| 67.3k| using merger_t = concat_merger; 1805| 67.3k| using visitor_t = concat_merger_visitor; 1806| 67.3k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 67.3k| IMMER_TRY { ------------------ | | 49| 67.3k|#define IMMER_TRY try ------------------ 1808| 67.3k| lpos.each_left_sub(visitor_t{}, merger); 1809| 67.3k| cpos.each_sub(visitor_t{}, merger); 1810| 67.3k| rpos.each_right_sub(visitor_t{}, merger); 1811| 67.3k| cpos.each_sub(dec_visitor{}); 1812| 67.3k| return merger.finish(); 1813| 67.3k| } 1814| 67.3k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 67.3k| } _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.70k| { 1945| 4.70k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 4.70k| } _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.70k|{ 1824| 4.70k| auto plan = concat_rebalance_plan{}; 1825| 4.70k| plan.fill(lpos, cpos, rpos); 1826| 4.70k| plan.shuffle(cpos.shift()); 1827| 4.70k| IMMER_TRY { ------------------ | | 49| 4.70k|#define IMMER_TRY try ------------------ 1828| 4.70k| return plan.merge(lpos, cpos, rpos); 1829| 4.70k| } 1830| 4.70k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.70k|} _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.70k| { 1753| 4.70k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.70k, False: 0] ------------------ 1754| 4.70k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.70k, False: 0] ------------------ 1755| 4.70k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.70k| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.70k| cpos.each_sub(visitor_t{}, *this); 1758| 4.70k| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.70k| } _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.70k| { 1803| 4.70k| using node_t = node_type; 1804| 4.70k| using merger_t = concat_merger; 1805| 4.70k| using visitor_t = concat_merger_visitor; 1806| 4.70k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.70k| IMMER_TRY { ------------------ | | 49| 4.70k|#define IMMER_TRY try ------------------ 1808| 4.70k| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.70k| cpos.each_sub(visitor_t{}, merger); 1810| 4.70k| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.70k| cpos.each_sub(dec_visitor{}); 1812| 4.70k| return merger.finish(); 1813| 4.70k| } 1814| 4.70k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.70k| } _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.25k| { 1959| 2.25k| return concat_inners(lpos, tpos, rpos); 1960| 2.25k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7realizeEv: 1527| 1.16M| { 1528| 1.16M| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 48.6k, False: 1.11M] ------------------ 1529| 48.6k| IMMER_TRY { ------------------ | | 49| 48.6k|#define IMMER_TRY try ------------------ 1530| 48.6k| auto result = node_t::make_inner_r_n(count_); 1531| 48.6k| auto r = result->relaxed(); 1532| 48.6k| r->d.count = count_; 1533| 48.6k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 48.6k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 48.6k| return {result, shift_, r}; 1536| 48.6k| } 1537| 48.6k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 1.11M| } else { 1542| 1.11M| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 1.11M, False: 0] ------------------ 1543| 1.11M| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 1.11M| } 1545| 1.16M| } _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.15M|{ 1987| 1.15M| return visit_maybe_relaxed_sub(lroot, 1988| 1.15M| lshift, 1989| 1.15M| lsize, 1990| 1.15M| concat_trees_left_visitor{}, 1991| 1.15M| make_leaf_pos(ltail, ltcount), 1992| 1.15M| rroot, 1993| 1.15M| rshift, 1994| 1.15M| rsize) 1995| 1.15M| .realize(); 1996| 1.15M|} _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.14M| { 1972| 1.14M| return visit_maybe_relaxed_sub( 1973| 1.14M| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 1.14M| } _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.13M| { 1959| 1.13M| return concat_inners(lpos, tpos, rpos); 1960| 1.13M| } _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.7M|{ 1873| 12.7M| auto lshift = lpos.shift(); 1874| 12.7M| auto rshift = rpos.shift(); 1875| 12.7M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 3.58M, False: 9.20M] ------------------ 1876| 3.58M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 3.58M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 9.20M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 41.9k, False: 9.16M] ------------------ 1879| 41.9k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 41.9k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 9.16M| } else { 1882| 9.16M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 9.16M, False: 0] ------------------ 1883| 9.16M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 9.16M] | Branch (1883:9): [True: 9.16M, False: 0] | Branch (1883:9): [True: 9.16M, False: 0] ------------------ 1884| 9.16M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 9.16M| return concat_rebalance(lpos, cpos, rpos); 1886| 9.16M| } 1887| 12.7M|} _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.57M| { 1898| 3.57M| return concat_inners(lpos, tpos, rpos); 1899| 3.57M| } _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.87k| { 1898| 4.87k| return concat_inners(lpos, tpos, rpos); 1899| 4.87k| } _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.17M|{ 1873| 1.17M| auto lshift = lpos.shift(); 1874| 1.17M| auto rshift = rpos.shift(); 1875| 1.17M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.51k, False: 1.17M] ------------------ 1876| 2.51k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.51k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.17M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 7.76k, False: 1.16M] ------------------ 1879| 7.76k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 7.76k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.16M| } else { 1882| 1.16M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.16M, False: 0] ------------------ 1883| 1.16M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.16M] | Branch (1883:9): [True: 1.16M, False: 0] | Branch (1883:9): [True: 1.16M, False: 0] ------------------ 1884| 1.16M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.16M| return concat_rebalance(lpos, cpos, rpos); 1886| 1.16M| } 1887| 1.17M|} _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.39k|{ 1824| 3.39k| auto plan = concat_rebalance_plan{}; 1825| 3.39k| plan.fill(lpos, cpos, rpos); 1826| 3.39k| plan.shuffle(cpos.shift()); 1827| 3.39k| IMMER_TRY { ------------------ | | 49| 3.39k|#define IMMER_TRY try ------------------ 1828| 3.39k| return plan.merge(lpos, cpos, rpos); 1829| 3.39k| } 1830| 3.39k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.39k|} _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.39k| { 1753| 3.39k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.39k, False: 0] ------------------ 1754| 3.39k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.39k, False: 0] ------------------ 1755| 3.39k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.39k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.39k| cpos.each_sub(visitor_t{}, *this); 1758| 3.39k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.39k| } _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.39k| { 1803| 3.39k| using node_t = node_type; 1804| 3.39k| using merger_t = concat_merger; 1805| 3.39k| using visitor_t = concat_merger_visitor; 1806| 3.39k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.39k| IMMER_TRY { ------------------ | | 49| 3.39k|#define IMMER_TRY try ------------------ 1808| 3.39k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.39k| cpos.each_sub(visitor_t{}, merger); 1810| 3.39k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.39k| cpos.each_sub(dec_visitor{}); 1812| 3.39k| return merger.finish(); 1813| 3.39k| } 1814| 3.39k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.39k| } _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.16M| { 1918| 1.16M| return concat_inners(lpos, tpos, rpos); 1919| 1.16M| } _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| 421k| { 1918| 421k| return concat_inners(lpos, tpos, rpos); 1919| 421k| } _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| 432k|{ 1873| 432k| auto lshift = lpos.shift(); 1874| 432k| auto rshift = rpos.shift(); 1875| 432k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 881, False: 431k] ------------------ 1876| 881| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 881| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 431k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 486, False: 431k] ------------------ 1879| 486| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 486| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 431k| } else { 1882| 431k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 431k, False: 0] ------------------ 1883| 431k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 431k] | Branch (1883:9): [True: 431k, False: 0] | Branch (1883:9): [True: 431k, False: 0] ------------------ 1884| 431k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 431k| return concat_rebalance(lpos, cpos, rpos); 1886| 431k| } 1887| 432k|} _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.28k| { 1898| 1.28k| return concat_inners(lpos, tpos, rpos); 1899| 1.28k| } _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| 20.4k| { 1918| 20.4k| return concat_inners(lpos, tpos, rpos); 1919| 20.4k| } _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| 20.4k|{ 1873| 20.4k| auto lshift = lpos.shift(); 1874| 20.4k| auto rshift = rpos.shift(); 1875| 20.4k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 20.4k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 20.4k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 217, False: 20.2k] ------------------ 1879| 217| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 217| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 20.2k| } else { 1882| 20.2k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 20.2k, False: 0] ------------------ 1883| 20.2k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 20.2k] | Branch (1883:9): [True: 20.2k, False: 0] | Branch (1883:9): [True: 20.2k, False: 0] ------------------ 1884| 20.2k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 20.2k| return concat_rebalance(lpos, cpos, rpos); 1886| 20.2k| } 1887| 20.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_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 16.0k| { 1945| 16.0k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 16.0k| } _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| 439k| { 1925| 439k| return concat_leafs(lpos, tpos, rpos); 1926| 439k| } _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| 439k|{ 1839| 439k| static_assert(Node::bits >= 2, ""); 1840| 439k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 439k, False: 0] ------------------ 1841| 439k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 439k, False: 0] ------------------ 1842| 439k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 439k, False: 0] ------------------ 1843| 439k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 439k, False: 0] ------------------ 1844| 439k| return { 1845| 439k| Node::bits_leaf, 1846| 439k| lpos.node()->inc(), 1847| 439k| lpos.count(), 1848| 439k| tpos.node()->inc(), 1849| 439k| tpos.count(), 1850| 439k| rpos.node()->inc(), 1851| 439k| rpos.count(), 1852| 439k| }; 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| 439k|} _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| 5.27k| { 1938| 5.27k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 5.27k| } _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| 20.2k|{ 1824| 20.2k| auto plan = concat_rebalance_plan{}; 1825| 20.2k| plan.fill(lpos, cpos, rpos); 1826| 20.2k| plan.shuffle(cpos.shift()); 1827| 20.2k| IMMER_TRY { ------------------ | | 49| 20.2k|#define IMMER_TRY try ------------------ 1828| 20.2k| return plan.merge(lpos, cpos, rpos); 1829| 20.2k| } 1830| 20.2k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 20.2k|} _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| 20.2k| { 1753| 20.2k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 20.2k, False: 0] ------------------ 1754| 20.2k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 20.2k, False: 0] ------------------ 1755| 20.2k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 20.2k| lpos.each_left_sub(visitor_t{}, *this); 1757| 20.2k| cpos.each_sub(visitor_t{}, *this); 1758| 20.2k| rpos.each_right_sub(visitor_t{}, *this); 1759| 20.2k| } _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| 20.2k| { 1803| 20.2k| using node_t = node_type; 1804| 20.2k| using merger_t = concat_merger; 1805| 20.2k| using visitor_t = concat_merger_visitor; 1806| 20.2k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 20.2k| IMMER_TRY { ------------------ | | 49| 20.2k|#define IMMER_TRY try ------------------ 1808| 20.2k| lpos.each_left_sub(visitor_t{}, merger); 1809| 20.2k| cpos.each_sub(visitor_t{}, merger); 1810| 20.2k| rpos.each_right_sub(visitor_t{}, merger); 1811| 20.2k| cpos.each_sub(dec_visitor{}); 1812| 20.2k| return merger.finish(); 1813| 20.2k| } 1814| 20.2k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 20.2k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 423k| { 1945| 423k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 423k| } _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| 717k| { 1925| 717k| return concat_leafs(lpos, tpos, rpos); 1926| 717k| } _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| 717k|{ 1839| 717k| static_assert(Node::bits >= 2, ""); 1840| 717k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 717k, False: 0] ------------------ 1841| 717k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 717k, False: 0] ------------------ 1842| 717k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 717k, False: 0] ------------------ 1843| 717k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 717k, False: 0] ------------------ 1844| 717k| return { 1845| 717k| Node::bits_leaf, 1846| 717k| lpos.node()->inc(), 1847| 717k| lpos.count(), 1848| 717k| tpos.node()->inc(), 1849| 717k| tpos.count(), 1850| 717k| rpos.node()->inc(), 1851| 717k| rpos.count(), 1852| 717k| }; 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| 717k|} _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| 14.4k| { 1938| 14.4k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 14.4k| } _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| 431k|{ 1824| 431k| auto plan = concat_rebalance_plan{}; 1825| 431k| plan.fill(lpos, cpos, rpos); 1826| 431k| plan.shuffle(cpos.shift()); 1827| 431k| IMMER_TRY { ------------------ | | 49| 431k|#define IMMER_TRY try ------------------ 1828| 431k| return plan.merge(lpos, cpos, rpos); 1829| 431k| } 1830| 431k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 431k|} _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| 431k| { 1753| 431k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 431k, False: 0] ------------------ 1754| 431k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 431k, False: 0] ------------------ 1755| 431k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 431k| lpos.each_left_sub(visitor_t{}, *this); 1757| 431k| cpos.each_sub(visitor_t{}, *this); 1758| 431k| rpos.each_right_sub(visitor_t{}, *this); 1759| 431k| } _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| 431k| { 1803| 431k| using node_t = node_type; 1804| 431k| using merger_t = concat_merger; 1805| 431k| using visitor_t = concat_merger_visitor; 1806| 431k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 431k| IMMER_TRY { ------------------ | | 49| 431k|#define IMMER_TRY try ------------------ 1808| 431k| lpos.each_left_sub(visitor_t{}, merger); 1809| 431k| cpos.each_sub(visitor_t{}, merger); 1810| 431k| rpos.each_right_sub(visitor_t{}, merger); 1811| 431k| cpos.each_sub(dec_visitor{}); 1812| 431k| return merger.finish(); 1813| 431k| } 1814| 431k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 431k| } _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| 717k| { 1945| 717k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 717k| } _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.57M| { 1938| 1.57M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.57M| } _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.16M|{ 1824| 1.16M| auto plan = concat_rebalance_plan{}; 1825| 1.16M| plan.fill(lpos, cpos, rpos); 1826| 1.16M| plan.shuffle(cpos.shift()); 1827| 1.16M| IMMER_TRY { ------------------ | | 49| 1.16M|#define IMMER_TRY try ------------------ 1828| 1.16M| return plan.merge(lpos, cpos, rpos); 1829| 1.16M| } 1830| 1.16M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.16M|} _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.16M| { 1753| 1.16M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.16M, False: 0] ------------------ 1754| 1.16M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.16M, False: 0] ------------------ 1755| 1.16M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.16M| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.16M| cpos.each_sub(visitor_t{}, *this); 1758| 1.16M| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.16M| } _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.16M| { 1803| 1.16M| using node_t = node_type; 1804| 1.16M| using merger_t = concat_merger; 1805| 1.16M| using visitor_t = concat_merger_visitor; 1806| 1.16M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.16M| IMMER_TRY { ------------------ | | 49| 1.16M|#define IMMER_TRY try ------------------ 1808| 1.16M| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.16M| cpos.each_sub(visitor_t{}, merger); 1810| 1.16M| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.16M| cpos.each_sub(dec_visitor{}); 1812| 1.16M| return merger.finish(); 1813| 1.16M| } 1814| 1.16M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.16M| } _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.59M|{ 1824| 3.59M| auto plan = concat_rebalance_plan{}; 1825| 3.59M| plan.fill(lpos, cpos, rpos); 1826| 3.59M| plan.shuffle(cpos.shift()); 1827| 3.59M| IMMER_TRY { ------------------ | | 49| 3.59M|#define IMMER_TRY try ------------------ 1828| 3.59M| return plan.merge(lpos, cpos, rpos); 1829| 3.59M| } 1830| 3.59M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.59M|} _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.59M| { 1753| 3.59M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.59M, False: 0] ------------------ 1754| 3.59M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.59M, False: 0] ------------------ 1755| 3.59M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.59M| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.59M| cpos.each_sub(visitor_t{}, *this); 1758| 3.59M| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.59M| } _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.59M| { 1803| 3.59M| using node_t = node_type; 1804| 3.59M| using merger_t = concat_merger; 1805| 3.59M| using visitor_t = concat_merger_visitor; 1806| 3.59M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.59M| IMMER_TRY { ------------------ | | 49| 3.59M|#define IMMER_TRY try ------------------ 1808| 3.59M| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.59M| cpos.each_sub(visitor_t{}, merger); 1810| 3.59M| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.59M| cpos.each_sub(dec_visitor{}); 1812| 3.59M| return merger.finish(); 1813| 3.59M| } 1814| 3.59M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.59M| } _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| 8.07M| { 1918| 8.07M| return concat_inners(lpos, tpos, rpos); 1919| 8.07M| } _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| 768| { 1918| 768| return concat_inners(lpos, tpos, rpos); 1919| 768| } _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| 18.9k|{ 1873| 18.9k| auto lshift = lpos.shift(); 1874| 18.9k| auto rshift = rpos.shift(); 1875| 18.9k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 11.0k, False: 7.89k] ------------------ 1876| 11.0k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 11.0k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 11.0k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 596, False: 7.29k] ------------------ 1879| 596| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 596| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 7.29k| } else { 1882| 7.29k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 7.29k, False: 0] ------------------ 1883| 7.29k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 7.29k] | Branch (1883:9): [True: 7.29k, False: 0] | Branch (1883:9): [True: 7.29k, False: 0] ------------------ 1884| 7.29k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 7.29k| return concat_rebalance(lpos, cpos, rpos); 1886| 7.29k| } 1887| 18.9k|} _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| 10.6k| { 1898| 10.6k| return concat_inners(lpos, tpos, rpos); 1899| 10.6k| } _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.50k| { 1918| 1.50k| return concat_inners(lpos, tpos, rpos); 1919| 1.50k| } _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.50k|{ 1873| 1.50k| auto lshift = lpos.shift(); 1874| 1.50k| auto rshift = rpos.shift(); 1875| 1.50k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 1.50k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.50k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 196, False: 1.31k] ------------------ 1879| 196| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 196| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.31k| } else { 1882| 1.31k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.31k, False: 0] ------------------ 1883| 1.31k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.31k] | Branch (1883:9): [True: 1.31k, False: 0] | Branch (1883:9): [True: 1.31k, False: 0] ------------------ 1884| 1.31k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.31k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.31k| } 1887| 1.50k|} _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| 252| { 1938| 252| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 252| } _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.31k|{ 1824| 1.31k| auto plan = concat_rebalance_plan{}; 1825| 1.31k| plan.fill(lpos, cpos, rpos); 1826| 1.31k| plan.shuffle(cpos.shift()); 1827| 1.31k| IMMER_TRY { ------------------ | | 49| 1.31k|#define IMMER_TRY try ------------------ 1828| 1.31k| return plan.merge(lpos, cpos, rpos); 1829| 1.31k| } 1830| 1.31k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.31k|} _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.31k| { 1753| 1.31k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.31k, False: 0] ------------------ 1754| 1.31k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.31k, False: 0] ------------------ 1755| 1.31k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.31k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.31k| cpos.each_sub(visitor_t{}, *this); 1758| 1.31k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.31k| } _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.31k| { 1803| 1.31k| using node_t = node_type; 1804| 1.31k| using merger_t = concat_merger; 1805| 1.31k| using visitor_t = concat_merger_visitor; 1806| 1.31k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.31k| IMMER_TRY { ------------------ | | 49| 1.31k|#define IMMER_TRY try ------------------ 1808| 1.31k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.31k| cpos.each_sub(visitor_t{}, merger); 1810| 1.31k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.31k| cpos.each_sub(dec_visitor{}); 1812| 1.31k| return merger.finish(); 1813| 1.31k| } 1814| 1.31k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.31k| } _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| 465| { 1938| 465| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 465| } _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| 7.29k|{ 1824| 7.29k| auto plan = concat_rebalance_plan{}; 1825| 7.29k| plan.fill(lpos, cpos, rpos); 1826| 7.29k| plan.shuffle(cpos.shift()); 1827| 7.29k| IMMER_TRY { ------------------ | | 49| 7.29k|#define IMMER_TRY try ------------------ 1828| 7.29k| return plan.merge(lpos, cpos, rpos); 1829| 7.29k| } 1830| 7.29k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 7.29k|} _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| 7.29k| { 1753| 7.29k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 7.29k, False: 0] ------------------ 1754| 7.29k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 7.29k, False: 0] ------------------ 1755| 7.29k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 7.29k| lpos.each_left_sub(visitor_t{}, *this); 1757| 7.29k| cpos.each_sub(visitor_t{}, *this); 1758| 7.29k| rpos.each_right_sub(visitor_t{}, *this); 1759| 7.29k| } _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| 7.29k| { 1803| 7.29k| using node_t = node_type; 1804| 7.29k| using merger_t = concat_merger; 1805| 7.29k| using visitor_t = concat_merger_visitor; 1806| 7.29k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 7.29k| IMMER_TRY { ------------------ | | 49| 7.29k|#define IMMER_TRY try ------------------ 1808| 7.29k| lpos.each_left_sub(visitor_t{}, merger); 1809| 7.29k| cpos.each_sub(visitor_t{}, merger); 1810| 7.29k| rpos.each_right_sub(visitor_t{}, merger); 1811| 7.29k| cpos.each_sub(dec_visitor{}); 1812| 7.29k| return merger.finish(); 1813| 7.29k| } 1814| 7.29k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 7.29k| } _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| 8.03M| { 1938| 8.03M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 8.03M| } _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| 9.16M|{ 1824| 9.16M| auto plan = concat_rebalance_plan{}; 1825| 9.16M| plan.fill(lpos, cpos, rpos); 1826| 9.16M| plan.shuffle(cpos.shift()); 1827| 9.16M| IMMER_TRY { ------------------ | | 49| 9.16M|#define IMMER_TRY try ------------------ 1828| 9.16M| return plan.merge(lpos, cpos, rpos); 1829| 9.16M| } 1830| 9.16M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 9.16M|} _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| 9.16M| { 1753| 9.16M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 9.16M, False: 0] ------------------ 1754| 9.16M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 9.16M, False: 0] ------------------ 1755| 9.16M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 9.16M| lpos.each_left_sub(visitor_t{}, *this); 1757| 9.16M| cpos.each_sub(visitor_t{}, *this); 1758| 9.16M| rpos.each_right_sub(visitor_t{}, *this); 1759| 9.16M| } _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| 9.16M| { 1803| 9.16M| using node_t = node_type; 1804| 9.16M| using merger_t = concat_merger; 1805| 9.16M| using visitor_t = concat_merger_visitor; 1806| 9.16M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 9.16M| IMMER_TRY { ------------------ | | 49| 9.16M|#define IMMER_TRY try ------------------ 1808| 9.16M| lpos.each_left_sub(visitor_t{}, merger); 1809| 9.16M| cpos.each_sub(visitor_t{}, merger); 1810| 9.16M| rpos.each_right_sub(visitor_t{}, merger); 1811| 9.16M| cpos.each_sub(dec_visitor{}); 1812| 9.16M| return merger.finish(); 1813| 9.16M| } 1814| 9.16M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 9.16M| } _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| 7.52k| { 1959| 7.52k| return concat_inners(lpos, tpos, rpos); 1960| 7.52k| } _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.5k| { 1972| 16.5k| return visit_maybe_relaxed_sub( 1973| 16.5k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 16.5k| } _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.79k| { 1959| 6.79k| return concat_inners(lpos, tpos, rpos); 1960| 6.79k| } _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.72k| { 1959| 9.72k| return concat_inners(lpos, tpos, rpos); 1960| 9.72k| } _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| 219k| { 681| 219k| auto node = pos.node(); 682| 219k| auto level = pos.shift(); 683| 219k| auto idx = pos.count() - 1; 684| 219k| auto children = pos.size(idx); 685| 219k| auto new_idx = 686| 219k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 2.80k, False: 216k] | Branch (686:47): [True: 397, False: 216k] ------------------ 687| 219k| auto new_child = static_cast(nullptr); 688| 219k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 219k, Folded] | Branch (688:38): [True: 216k, False: 2.97k] ------------------ 689| | 690| 219k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 739, False: 218k] ------------------ 691| 739| return nullptr; 692| 218k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 216k, False: 2.46k] ------------------ 693| 216k| new_child = 694| 216k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 213k, False: 2.54k] ------------------ 695| 216k| : pos.last_oh_csh( 696| 2.54k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 216k| if (!new_child) { ------------------ | Branch (697:17): [True: 1.04k, False: 215k] ------------------ 698| 1.04k| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 315, False: 726] ------------------ 699| 315| new_child = node_t::make_path_e(e, level - B, tail); 700| 726| else 701| 726| return nullptr; 702| 1.04k| } 703| 216k| } else 704| 2.46k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 218k| if (mutate) { ------------------ | Branch (706:13): [True: 215k, False: 2.65k] ------------------ 707| 215k| auto count = new_idx + 1; 708| 215k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 215k| node->inner()[new_idx] = new_child; 710| 215k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 215k| relaxed->d.count = count; 712| 215k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 215k, False: 0] ------------------ 713| 215k| return node; 714| 215k| } else { 715| 2.65k| IMMER_TRY { ------------------ | | 49| 2.65k|#define IMMER_TRY try ------------------ 716| 2.65k| auto count = new_idx + 1; 717| 2.65k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 2.65k| auto relaxed = new_node->relaxed(); 719| 2.65k| new_node->inner()[new_idx] = new_child; 720| 2.65k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 2.65k| relaxed->d.count = count; 722| 2.65k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 2.65k, False: 0] ------------------ 723| 2.65k| if (Mutating) ------------------ | Branch (723:21): [True: 2.65k, Folded] ------------------ 724| 2.65k| pos.visit(dec_visitor{}); 725| 2.65k| return new_node; 726| 2.65k| } 727| 2.65k| 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.65k| } 737| 218k| } _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| 174k| { 742| 174k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 174k, False: 0] ------------------ 743| 174k| auto node = pos.node(); 744| 174k| auto idx = pos.index(pos.size() - 1); 745| 174k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 174k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 174k, Folded] | Branch (746:36): [True: 173k, False: 1.05k] ------------------ 747| 174k| if (mutate) { ------------------ | Branch (747:13): [True: 173k, False: 1.05k] ------------------ 748| 173k| node->inner()[new_idx] = 749| 173k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 171k, False: 2.68k] ------------------ 750| | /* otherwise */ 751| 173k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 173k| return node; 753| 173k| } else { 754| 1.05k| auto new_parent = node_t::make_inner_e(e); 755| 1.05k| IMMER_TRY { ------------------ | | 49| 1.05k|#define IMMER_TRY try ------------------ 756| 1.05k| new_parent->inner()[new_idx] = 757| 1.05k| idx == new_idx ------------------ | Branch (757:21): [True: 721, False: 332] ------------------ 758| 1.05k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.05k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.05k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.05k| if (Mutating) ------------------ | Branch (762:21): [True: 1.05k, Folded] ------------------ 763| 1.05k| pos.visit(dec_visitor{}); 764| 1.05k| return new_parent; 765| 1.05k| } 766| 1.05k| 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.05k| } 771| 174k| } _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.14M| { 742| 1.14M| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.14M, False: 0] ------------------ 743| 1.14M| auto node = pos.node(); 744| 1.14M| auto idx = pos.index(pos.size() - 1); 745| 1.14M| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.14M| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 1.14M, Folded] | Branch (746:36): [True: 1.13M, False: 1.87k] ------------------ 747| 1.14M| if (mutate) { ------------------ | Branch (747:13): [True: 1.13M, False: 1.87k] ------------------ 748| 1.13M| node->inner()[new_idx] = 749| 1.13M| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 785k, False: 352k] ------------------ 750| | /* otherwise */ 751| 1.13M| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 1.13M| return node; 753| 1.13M| } else { 754| 1.87k| auto new_parent = node_t::make_inner_e(e); 755| 1.87k| IMMER_TRY { ------------------ | | 49| 1.87k|#define IMMER_TRY try ------------------ 756| 1.87k| new_parent->inner()[new_idx] = 757| 1.87k| idx == new_idx ------------------ | Branch (757:21): [True: 1.18k, False: 687] ------------------ 758| 1.87k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.87k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.87k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.87k| if (Mutating) ------------------ | Branch (762:21): [True: 1.87k, Folded] ------------------ 763| 1.87k| pos.visit(dec_visitor{}); 764| 1.87k| return new_parent; 765| 1.87k| } 766| 1.87k| 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.87k| } 771| 1.14M| } _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.30k| { 742| 4.30k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 4.30k, False: 0] ------------------ 743| 4.30k| auto node = pos.node(); 744| 4.30k| auto idx = pos.index(pos.size() - 1); 745| 4.30k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 4.30k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 4.30k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 4.30k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 4.30k] ------------------ 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.30k| } else { 754| 4.30k| auto new_parent = node_t::make_inner_e(e); 755| 4.30k| IMMER_TRY { ------------------ | | 49| 4.30k|#define IMMER_TRY try ------------------ 756| 4.30k| new_parent->inner()[new_idx] = 757| 4.30k| idx == new_idx ------------------ | Branch (757:21): [True: 1.50k, False: 2.80k] ------------------ 758| 4.30k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 4.30k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 4.30k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 4.30k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 4.30k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 4.30k| return new_parent; 765| 4.30k| } 766| 4.30k| 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.30k| } 771| 4.30k| } _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.40k| { 681| 7.40k| auto node = pos.node(); 682| 7.40k| auto level = pos.shift(); 683| 7.40k| auto idx = pos.count() - 1; 684| 7.40k| auto children = pos.size(idx); 685| 7.40k| auto new_idx = 686| 7.40k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 871, False: 6.53k] | Branch (686:47): [True: 611, False: 5.92k] ------------------ 687| 7.40k| auto new_child = static_cast(nullptr); 688| 7.40k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 7.40k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 7.40k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 668, False: 6.73k] ------------------ 691| 668| return nullptr; 692| 6.73k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 5.92k, False: 814] ------------------ 693| 5.92k| new_child = 694| 5.92k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 5.92k] ------------------ 695| 5.92k| : pos.last_oh_csh( 696| 5.92k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 5.92k| if (!new_child) { ------------------ | Branch (697:17): [True: 830, False: 5.09k] ------------------ 698| 830| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 362, False: 468] ------------------ 699| 362| new_child = node_t::make_path_e(e, level - B, tail); 700| 468| else 701| 468| return nullptr; 702| 830| } 703| 5.92k| } else 704| 814| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 6.26k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 6.26k] ------------------ 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| 6.26k| } else { 715| 6.26k| IMMER_TRY { ------------------ | | 49| 6.26k|#define IMMER_TRY try ------------------ 716| 6.26k| auto count = new_idx + 1; 717| 6.26k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 6.26k| auto relaxed = new_node->relaxed(); 719| 6.26k| new_node->inner()[new_idx] = new_child; 720| 6.26k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 6.26k| relaxed->d.count = count; 722| 6.26k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 6.26k, False: 0] ------------------ 723| 6.26k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 6.26k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 6.26k| return new_node; 726| 6.26k| } 727| 6.26k| 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| 6.26k| } 737| 6.26k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_: 741| 1.06k| { 742| 1.06k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.06k, False: 0] ------------------ 743| 1.06k| auto node = pos.node(); 744| 1.06k| auto idx = pos.index(pos.size() - 1); 745| 1.06k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.06k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 1.06k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 1.06k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 1.06k] ------------------ 748| 0| node->inner()[new_idx] = 749| 0| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 0, False: 0] ------------------ 750| | /* otherwise */ 751| 0| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 0| return node; 753| 1.06k| } else { 754| 1.06k| auto new_parent = node_t::make_inner_e(e); 755| 1.06k| IMMER_TRY { ------------------ | | 49| 1.06k|#define IMMER_TRY try ------------------ 756| 1.06k| new_parent->inner()[new_idx] = 757| 1.06k| idx == new_idx ------------------ | Branch (757:21): [True: 581, False: 482] ------------------ 758| 1.06k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.06k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.06k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.06k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 1.06k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 1.06k| return new_parent; 765| 1.06k| } 766| 1.06k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 1.06k| } 771| 1.06k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 192k| { 742| 192k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 192k, False: 0] ------------------ 743| 192k| auto node = pos.node(); 744| 192k| auto idx = pos.index(pos.size() - 1); 745| 192k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 192k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 192k, Folded] | Branch (746:36): [True: 191k, False: 649] ------------------ 747| 192k| if (mutate) { ------------------ | Branch (747:13): [True: 191k, False: 649] ------------------ 748| 191k| node->inner()[new_idx] = 749| 191k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 183k, False: 8.64k] ------------------ 750| | /* otherwise */ 751| 191k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 191k| return node; 753| 191k| } else { 754| 649| auto new_parent = node_t::make_inner_e(e); 755| 649| IMMER_TRY { ------------------ | | 49| 649|#define IMMER_TRY try ------------------ 756| 649| new_parent->inner()[new_idx] = 757| 649| idx == new_idx ------------------ | Branch (757:21): [True: 319, False: 330] ------------------ 758| 649| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 649| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 649| node_t::do_copy_inner(new_parent, node, new_idx); 762| 649| if (Mutating) ------------------ | Branch (762:21): [True: 649, Folded] ------------------ 763| 649| pos.visit(dec_visitor{}); 764| 649| return new_parent; 765| 649| } 766| 649| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 649| } 771| 192k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_: 580| 2.13k|{ 581| 2.13k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 2.13k|} _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| 108k| { 596| 108k| auto offset = pos.index(idx); 597| 108k| auto count = pos.count(); 598| 108k| auto node = pos.node(); 599| 108k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 80.5k, False: 27.6k] ------------------ 600| 80.5k| return pos.towards_oh( 601| 80.5k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 80.5k| } else { 603| 27.6k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 27.6k| IMMER_TRY { ------------------ | | 49| 27.6k|#define IMMER_TRY try ------------------ 605| 27.6k| auto& res = pos.towards_oh( 606| 27.6k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 27.6k| pos.visit(dec_visitor{}); 608| 27.6k| *location = new_node; 609| 27.6k| return res; 610| 27.6k| } 611| 27.6k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 27.6k| } 616| 108k| } _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.1k| { 653| 16.1k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 16.1k, False: 0] ------------------ 654| 16.1k| auto node = pos.node(); 655| 16.1k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.91k, False: 14.2k] ------------------ 656| 1.91k| return node->leaf()[pos.index(idx)]; 657| 14.2k| } else { 658| 14.2k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 14.2k| pos.visit(dec_visitor{}); 660| 14.2k| *location = new_node; 661| 14.2k| return new_node->leaf()[pos.index(idx)]; 662| 14.2k| } 663| 16.1k| } _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.68k| { 622| 4.68k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 4.68k, False: 0] ------------------ 623| 4.68k| auto offset = pos.index(idx); 624| 4.68k| auto count = pos.count(); 625| 4.68k| auto node = pos.node(); 626| 4.68k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 2.93k, False: 1.74k] ------------------ 627| 2.93k| return pos.towards_oh_ch( 628| 2.93k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 2.93k| } else { 630| 1.74k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.74k| IMMER_TRY { ------------------ | | 49| 1.74k|#define IMMER_TRY try ------------------ 632| 1.74k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.74k| idx, 634| 1.74k| offset, 635| 1.74k| count, 636| 1.74k| e, 637| 1.74k| &new_node->inner()[offset]); 638| 1.74k| pos.visit(dec_visitor{}); 639| 1.74k| *location = new_node; 640| 1.74k| return res; 641| 1.74k| } 642| 1.74k| 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.74k| } 647| 4.68k| } _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.72k| { 653| 2.72k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 2.72k, False: 0] ------------------ 654| 2.72k| auto node = pos.node(); 655| 2.72k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.08k, False: 1.63k] ------------------ 656| 1.08k| return node->leaf()[pos.index(idx)]; 657| 1.63k| } else { 658| 1.63k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 1.63k| pos.visit(dec_visitor{}); 660| 1.63k| *location = new_node; 661| 1.63k| return new_node->leaf()[pos.index(idx)]; 662| 1.63k| } 663| 2.72k| } _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.03k| { 622| 2.03k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.03k, False: 0] ------------------ 623| 2.03k| auto offset = pos.index(idx); 624| 2.03k| auto count = pos.count(); 625| 2.03k| auto node = pos.node(); 626| 2.03k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.01k, False: 1.01k] ------------------ 627| 1.01k| return pos.towards_oh_ch( 628| 1.01k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.01k| } else { 630| 1.01k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.01k| IMMER_TRY { ------------------ | | 49| 1.01k|#define IMMER_TRY try ------------------ 632| 1.01k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.01k| idx, 634| 1.01k| offset, 635| 1.01k| count, 636| 1.01k| e, 637| 1.01k| &new_node->inner()[offset]); 638| 1.01k| pos.visit(dec_visitor{}); 639| 1.01k| *location = new_node; 640| 1.01k| return res; 641| 1.01k| } 642| 1.01k| 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.01k| } 647| 2.03k| } _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.95k| { 653| 1.95k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 1.95k, False: 0] ------------------ 654| 1.95k| auto node = pos.node(); 655| 1.95k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.38k, False: 571] ------------------ 656| 1.38k| return node->leaf()[pos.index(idx)]; 657| 1.38k| } else { 658| 571| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 571| pos.visit(dec_visitor{}); 660| 571| *location = new_node; 661| 571| return new_node->leaf()[pos.index(idx)]; 662| 571| } 663| 1.95k| } _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.78k| { 622| 1.78k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 1.78k, False: 0] ------------------ 623| 1.78k| auto offset = pos.index(idx); 624| 1.78k| auto count = pos.count(); 625| 1.78k| auto node = pos.node(); 626| 1.78k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.30k, False: 481] ------------------ 627| 1.30k| return pos.towards_oh_ch( 628| 1.30k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.30k| } else { 630| 481| auto new_node = node_t::copy_inner_e(e, node, count); 631| 481| IMMER_TRY { ------------------ | | 49| 481|#define IMMER_TRY try ------------------ 632| 481| auto& res = pos.towards_oh_ch(this_t{}, 633| 481| idx, 634| 481| offset, 635| 481| count, 636| 481| e, 637| 481| &new_node->inner()[offset]); 638| 481| pos.visit(dec_visitor{}); 639| 481| *location = new_node; 640| 481| return res; 641| 481| } 642| 481| 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| 481| } 647| 1.78k| } _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| 35.8k| { 914| 35.8k| auto idx = pos.index(last); 915| 35.8k| auto node = pos.node(); 916| 35.8k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 35.8k, Folded] | Branch (916:35): [True: 27.2k, False: 8.56k] ------------------ 917| 35.8k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 35.8k, Folded] | Branch (917:25): [True: 23.0k, False: 12.7k] ------------------ 918| 23.0k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 19.2k, False: 3.86k] ------------------ 919| 23.0k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 23.0k| if (Mutating) ------------------ | Branch (920:17): [True: 23.0k, Folded] ------------------ 921| 23.0k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 23.0k| return res; 923| 23.0k| } else { 924| 12.7k| using std::get; 925| 12.7k| auto subs = 926| 12.7k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 8.04k, False: 4.69k] ------------------ 927| 12.7k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 12.7k| auto next = get<1>(subs); 929| 12.7k| auto ts = get<2>(subs); 930| 12.7k| auto tail = get<3>(subs); 931| 12.7k| IMMER_TRY { ------------------ | | 49| 12.7k|#define IMMER_TRY try ------------------ 932| 12.7k| if (next) { ------------------ | Branch (932:21): [True: 9.12k, False: 3.62k] ------------------ 933| 9.12k| if (mutate) { ------------------ | Branch (933:25): [True: 5.85k, False: 3.26k] ------------------ 934| 5.85k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 5.85k| pos.each_right(dec_visitor{}, idx + 1); 936| 5.85k| node->inner()[idx] = next; 937| 5.85k| nodr->d.sizes[idx] = last + 1 - ts; 938| 5.85k| nodr->d.count = idx + 1; 939| 5.85k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 5.85k, False: 0] ------------------ 940| 5.85k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 5.85k| } else { 942| 3.26k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 3.26k| auto newr = newn->relaxed(); 944| 3.26k| newn->inner()[idx] = next; 945| 3.26k| newr->d.sizes[idx] = last + 1 - ts; 946| 3.26k| newr->d.count = idx + 1; 947| 3.26k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 3.26k, False: 0] ------------------ 948| 3.26k| if (Mutating) ------------------ | Branch (948:29): [True: 3.26k, Folded] ------------------ 949| 3.26k| pos.visit(dec_visitor{}); 950| 3.26k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 3.26k| } 952| 9.12k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 3.62k] ------------------ 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.62k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 3.62k, Folded] | Branch (956:40): [True: 2.68k, False: 936] | Branch (956:52): [True: 1.98k, False: 701] ------------------ 957| 1.98k| auto newn = pos.node()->inner()[0]; 958| 1.98k| if (!mutate) ------------------ | Branch (958:25): [True: 965, False: 1.01k] ------------------ 959| 965| newn->inc(); 960| 1.98k| if (Mutating) ------------------ | Branch (960:25): [True: 1.98k, Folded] ------------------ 961| 1.98k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 1.98k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.98k| } else { 964| 1.63k| if (mutate) { ------------------ | Branch (964:25): [True: 1.17k, False: 465] ------------------ 965| 1.17k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.17k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.17k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.17k| } else { 969| 465| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 465| if (Mutating) ------------------ | Branch (970:29): [True: 465, Folded] ------------------ 971| 465| pos.visit(dec_visitor{}); 972| 465| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 465| } 974| 1.63k| } 975| 12.7k| } 976| 12.7k| 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.7k| } 987| 35.8k| } _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| 847| { 1060| 847| auto old_tail_size = pos.count(); 1061| 847| auto new_tail_size = pos.index(last) + 1; 1062| 847| auto node = pos.node(); 1063| 847| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 847, Folded] | Branch (1063:42): [True: 254, False: 593] ------------------ 1064| 847| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 213, False: 634] ------------------ 1065| 213| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 213] ------------------ 1066| 0| node->inc(); 1067| 213| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 634| } else if (mutate) { ------------------ | Branch (1068:20): [True: 243, False: 391] ------------------ 1069| 243| detail::destroy_n(node->leaf() + new_tail_size, 1070| 243| old_tail_size - new_tail_size); 1071| 243| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 391| } else { 1073| 391| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 391| if (Mutating) ------------------ | Branch (1074:17): [True: 391, Folded] ------------------ 1075| 391| pos.visit(dec_visitor{}); 1076| 391| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 391| } 1078| 847| } _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| 1.05k| { 1060| 1.05k| auto old_tail_size = pos.count(); 1061| 1.05k| auto new_tail_size = pos.index(last) + 1; 1062| 1.05k| auto node = pos.node(); 1063| 1.05k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.05k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.05k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 374, False: 685] ------------------ 1065| 374| if (!Mutating) ------------------ | Branch (1065:17): [True: 374, Folded] ------------------ 1066| 374| node->inc(); 1067| 374| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 685| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 685] ------------------ 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| 685| } else { 1073| 685| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 685| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 685] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 685| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 685| } 1078| 1.05k| } _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| 13.1k| { 914| 13.1k| auto idx = pos.index(last); 915| 13.1k| auto node = pos.node(); 916| 13.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 13.1k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 13.1k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 13.1k, Folded] | Branch (917:25): [True: 11.6k, False: 1.56k] ------------------ 918| 11.6k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 11.6k] ------------------ 919| 11.6k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 11.6k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 11.6k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 11.6k| return res; 923| 11.6k| } else { 924| 1.56k| using std::get; 925| 1.56k| auto subs = 926| 1.56k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 1.56k] ------------------ 927| 1.56k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 1.56k| auto next = get<1>(subs); 929| 1.56k| auto ts = get<2>(subs); 930| 1.56k| auto tail = get<3>(subs); 931| 1.56k| IMMER_TRY { ------------------ | | 49| 1.56k|#define IMMER_TRY try ------------------ 932| 1.56k| if (next) { ------------------ | Branch (932:21): [True: 578, False: 983] ------------------ 933| 578| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 578] ------------------ 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| 578| } else { 942| 578| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 578| auto newr = newn->relaxed(); 944| 578| newn->inner()[idx] = next; 945| 578| newr->d.sizes[idx] = last + 1 - ts; 946| 578| newr->d.count = idx + 1; 947| 578| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 578, False: 0] ------------------ 948| 578| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 578] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 578| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 578| } 952| 983| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 983] ------------------ 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| 983| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 983, Folded] | Branch (956:40): [True: 628, False: 355] | Branch (956:52): [True: 309, False: 319] ------------------ 957| 309| auto newn = pos.node()->inner()[0]; 958| 309| if (!mutate) ------------------ | Branch (958:25): [True: 309, False: 0] ------------------ 959| 309| newn->inc(); 960| 309| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 309] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 309| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 674| } else { 964| 674| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 674] ------------------ 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| 674| } else { 969| 674| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 674| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 674] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 674| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 674| } 974| 674| } 975| 1.56k| } 976| 1.56k| 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.56k| } 987| 13.1k| } _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.24k| { 992| 1.24k| auto idx = pos.index(last); 993| 1.24k| auto node = pos.node(); 994| 1.24k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.24k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.24k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.24k, Folded] | Branch (995:25): [True: 325, False: 921] ------------------ 996| 325| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 325] ------------------ 997| 325| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 325| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 325] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 325| return res; 1001| 921| } else { 1002| 921| using std::get; 1003| 921| auto subs = 1004| 921| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 921] ------------------ 1005| 921| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 921| auto next = get<1>(subs); 1007| 921| auto ts = get<2>(subs); 1008| 921| auto tail = get<3>(subs); 1009| 921| IMMER_TRY { ------------------ | | 49| 921|#define IMMER_TRY try ------------------ 1010| 921| if (next) { ------------------ | Branch (1010:21): [True: 264, False: 657] ------------------ 1011| 264| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 264] ------------------ 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| 264| } else { 1016| 264| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 264| newn->inner()[idx] = next; 1018| 264| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 264] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 264| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 264| } 1022| 657| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 657] ------------------ 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| 657| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 657, Folded] | Branch (1026:40): [True: 401, False: 256] | Branch (1026:52): [True: 196, False: 205] ------------------ 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| 461| } else { 1034| 461| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 461] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 461| } else { 1038| 461| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 461| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 461] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 461| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 461| } 1043| 461| } 1044| 921| } 1045| 921| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 921| } 1055| 1.24k| } _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.88k| { 1060| 1.88k| auto old_tail_size = pos.count(); 1061| 1.88k| auto new_tail_size = pos.index(last) + 1; 1062| 1.88k| auto node = pos.node(); 1063| 1.88k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.88k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.88k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.19k, False: 693] ------------------ 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: 693] ------------------ 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| 693| } else { 1073| 693| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 693| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 693] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 693| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 693| } 1078| 1.88k| } _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.75k| { 992| 1.75k| auto idx = pos.index(last); 993| 1.75k| auto node = pos.node(); 994| 1.75k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.75k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.75k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.75k, Folded] | Branch (995:25): [True: 575, False: 1.18k] ------------------ 996| 575| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 575] ------------------ 997| 575| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 575| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 575] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 575| return res; 1001| 1.18k| } else { 1002| 1.18k| using std::get; 1003| 1.18k| auto subs = 1004| 1.18k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.18k] ------------------ 1005| 1.18k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.18k| auto next = get<1>(subs); 1007| 1.18k| auto ts = get<2>(subs); 1008| 1.18k| auto tail = get<3>(subs); 1009| 1.18k| IMMER_TRY { ------------------ | | 49| 1.18k|#define IMMER_TRY try ------------------ 1010| 1.18k| if (next) { ------------------ | Branch (1010:21): [True: 268, False: 912] ------------------ 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| 912| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 912] ------------------ 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| 912| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 912, Folded] | Branch (1026:40): [True: 406, False: 506] | Branch (1026:52): [True: 209, False: 197] ------------------ 1027| 209| auto newn = pos.node()->inner()[0]; 1028| 209| if (!mutate) ------------------ | Branch (1028:25): [True: 209, False: 0] ------------------ 1029| 209| newn->inc(); 1030| 209| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 209] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 209| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 703| } else { 1034| 703| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 703] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 703| } else { 1038| 703| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 703| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 703] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 703| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 703| } 1043| 703| } 1044| 1.18k| } 1045| 1.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| 1.18k| } 1055| 1.75k| } _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.36k| { 1060| 3.36k| auto old_tail_size = pos.count(); 1061| 3.36k| auto new_tail_size = pos.index(last) + 1; 1062| 3.36k| auto node = pos.node(); 1063| 3.36k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 3.36k, Folded] | Branch (1063:42): [True: 287, False: 3.07k] ------------------ 1064| 3.36k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.73k, False: 1.63k] ------------------ 1065| 1.73k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.73k] ------------------ 1066| 0| node->inc(); 1067| 1.73k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.73k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 283, False: 1.35k] ------------------ 1069| 283| detail::destroy_n(node->leaf() + new_tail_size, 1070| 283| old_tail_size - new_tail_size); 1071| 283| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.35k| } else { 1073| 1.35k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.35k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.35k, Folded] ------------------ 1075| 1.35k| pos.visit(dec_visitor{}); 1076| 1.35k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.35k| } 1078| 3.36k| } _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.76k| { 992| 3.76k| auto idx = pos.index(last); 993| 3.76k| auto node = pos.node(); 994| 3.76k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.76k, Folded] | Branch (994:35): [True: 1.51k, False: 2.24k] ------------------ 995| 3.76k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.76k] | 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.76k| } else { 1002| 3.76k| using std::get; 1003| 3.76k| auto subs = 1004| 3.76k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 1.51k, False: 2.24k] ------------------ 1005| 3.76k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.76k| auto next = get<1>(subs); 1007| 3.76k| auto ts = get<2>(subs); 1008| 3.76k| auto tail = get<3>(subs); 1009| 3.76k| IMMER_TRY { ------------------ | | 49| 3.76k|#define IMMER_TRY try ------------------ 1010| 3.76k| if (next) { ------------------ | Branch (1010:21): [True: 959, False: 2.80k] ------------------ 1011| 959| if (mutate) { ------------------ | Branch (1011:25): [True: 426, False: 533] ------------------ 1012| 426| node->inner()[idx] = next; 1013| 426| pos.each_right(dec_visitor{}, idx + 1); 1014| 426| 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.80k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 995, False: 1.80k] ------------------ 1023| 995| if (Mutating) ------------------ | Branch (1023:25): [True: 995, Folded] ------------------ 1024| 995| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 995| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.80k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.80k] | 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.80k| } else { 1034| 1.80k| if (mutate) { ------------------ | Branch (1034:25): [True: 343, False: 1.46k] ------------------ 1035| 343| pos.each_right(dec_visitor{}, idx + 1); 1036| 343| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.46k| } else { 1038| 1.46k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.46k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.46k, Folded] ------------------ 1040| 1.46k| pos.visit(dec_visitor{}); 1041| 1.46k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.46k| } 1043| 1.80k| } 1044| 3.76k| } 1045| 3.76k| 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.76k| } 1055| 3.76k| } _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.57k| { 879| 3.57k| using node_t = node_type; 880| 3.57k| auto node = p.node(); 881| 3.57k| if (node->dec()) { ------------------ | Branch (881:13): [True: 2.18k, False: 1.38k] ------------------ 882| 2.18k| p.each_right(dec_t{}, idx); 883| 2.18k| node_t::delete_inner(node, p.count()); 884| 2.18k| } 885| 3.57k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 10.1k| { 1060| 10.1k| auto old_tail_size = pos.count(); 1061| 10.1k| auto new_tail_size = pos.index(last) + 1; 1062| 10.1k| auto node = pos.node(); 1063| 10.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 10.1k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 10.1k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 4.37k, False: 5.73k] ------------------ 1065| 4.37k| if (!Mutating) ------------------ | Branch (1065:17): [True: 4.37k, Folded] ------------------ 1066| 4.37k| node->inc(); 1067| 4.37k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 5.73k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 5.73k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 5.73k| } else { 1073| 5.73k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 5.73k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 5.73k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 5.73k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 5.73k| } 1078| 10.1k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 4.97k| { 992| 4.97k| auto idx = pos.index(last); 993| 4.97k| auto node = pos.node(); 994| 4.97k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 4.97k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 4.97k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.97k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 4.97k| } else { 1002| 4.97k| using std::get; 1003| 4.97k| auto subs = 1004| 4.97k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 4.97k] ------------------ 1005| 4.97k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.97k| auto next = get<1>(subs); 1007| 4.97k| auto ts = get<2>(subs); 1008| 4.97k| auto tail = get<3>(subs); 1009| 4.97k| IMMER_TRY { ------------------ | | 49| 4.97k|#define IMMER_TRY try ------------------ 1010| 4.97k| if (next) { ------------------ | Branch (1010:21): [True: 706, False: 4.26k] ------------------ 1011| 706| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 706] ------------------ 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| 706| } else { 1016| 706| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 706| newn->inner()[idx] = next; 1018| 706| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 706] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 706| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 706| } 1022| 4.26k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 913, False: 3.35k] ------------------ 1023| 913| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 913] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 913| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.35k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 3.35k] | 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.35k| } else { 1034| 3.35k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 3.35k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 3.35k| } else { 1038| 3.35k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 3.35k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 3.35k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 3.35k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 3.35k| } 1043| 3.35k| } 1044| 4.97k| } 1045| 4.97k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 4.97k| } 1055| 4.97k| } _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| 410| { 1060| 410| auto old_tail_size = pos.count(); 1061| 410| auto new_tail_size = pos.index(last) + 1; 1062| 410| auto node = pos.node(); 1063| 410| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 410] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 410| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 194, False: 216] ------------------ 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| 216| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 216] ------------------ 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| 216| } else { 1073| 216| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 216| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 216] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 216| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 216| } 1078| 410| } _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.46k| { 1060| 1.46k| auto old_tail_size = pos.count(); 1061| 1.46k| auto new_tail_size = pos.index(last) + 1; 1062| 1.46k| auto node = pos.node(); 1063| 1.46k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.46k, Folded] | Branch (1063:42): [True: 199, False: 1.26k] ------------------ 1064| 1.46k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 440, False: 1.02k] ------------------ 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.02k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 199, False: 823] ------------------ 1069| 199| detail::destroy_n(node->leaf() + new_tail_size, 1070| 199| old_tail_size - new_tail_size); 1071| 199| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 823| } else { 1073| 823| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 823| if (Mutating) ------------------ | Branch (1074:17): [True: 823, Folded] ------------------ 1075| 823| pos.visit(dec_visitor{}); 1076| 823| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 823| } 1078| 1.46k| } _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.71k| { 992| 3.71k| auto idx = pos.index(last); 993| 3.71k| auto node = pos.node(); 994| 3.71k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.71k, Folded] | Branch (994:35): [True: 2.68k, False: 1.02k] ------------------ 995| 3.71k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.71k] | 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.71k| } else { 1002| 3.71k| using std::get; 1003| 3.71k| auto subs = 1004| 3.71k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.68k, False: 1.02k] ------------------ 1005| 3.71k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.71k| auto next = get<1>(subs); 1007| 3.71k| auto ts = get<2>(subs); 1008| 3.71k| auto tail = get<3>(subs); 1009| 3.71k| IMMER_TRY { ------------------ | | 49| 3.71k|#define IMMER_TRY try ------------------ 1010| 3.71k| if (next) { ------------------ | Branch (1010:21): [True: 1.59k, False: 2.11k] ------------------ 1011| 1.59k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.13k, False: 461] ------------------ 1012| 1.13k| node->inner()[idx] = next; 1013| 1.13k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.13k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.13k| } else { 1016| 461| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 461| newn->inner()[idx] = next; 1018| 461| if (Mutating) ------------------ | Branch (1018:29): [True: 461, Folded] ------------------ 1019| 461| pos.visit(dec_visitor{}); 1020| 461| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 461| } 1022| 2.11k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.35k, False: 767] ------------------ 1023| 1.35k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.35k, Folded] ------------------ 1024| 1.35k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.35k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.35k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 767] | 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| 767| } else { 1034| 767| if (mutate) { ------------------ | Branch (1034:25): [True: 515, False: 252] ------------------ 1035| 515| pos.each_right(dec_visitor{}, idx + 1); 1036| 515| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 515| } else { 1038| 252| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 252| if (Mutating) ------------------ | Branch (1039:29): [True: 252, Folded] ------------------ 1040| 252| pos.visit(dec_visitor{}); 1041| 252| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 252| } 1043| 767| } 1044| 3.71k| } 1045| 3.71k| 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.71k| } 1055| 3.71k| } _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.35k| { 879| 1.35k| using node_t = node_type; 880| 1.35k| auto node = p.node(); 881| 1.35k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.03k, False: 316] ------------------ 882| 1.03k| p.each_right(dec_t{}, idx); 883| 1.03k| node_t::delete_inner(node, p.count()); 884| 1.03k| } 885| 1.35k| } _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.23k| { 1060| 2.23k| auto old_tail_size = pos.count(); 1061| 2.23k| auto new_tail_size = pos.index(last) + 1; 1062| 2.23k| auto node = pos.node(); 1063| 2.23k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.23k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.23k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 370, False: 1.86k] ------------------ 1065| 370| if (!Mutating) ------------------ | Branch (1065:17): [True: 370, Folded] ------------------ 1066| 370| node->inc(); 1067| 370| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.86k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 1.86k] ------------------ 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.86k| } else { 1073| 1.86k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.86k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 1.86k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 1.86k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.86k| } 1078| 2.23k| } _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.35k| { 992| 3.35k| auto idx = pos.index(last); 993| 3.35k| auto node = pos.node(); 994| 3.35k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.35k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.35k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.35k] | 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.35k| } else { 1002| 3.35k| using std::get; 1003| 3.35k| auto subs = 1004| 3.35k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.35k] ------------------ 1005| 3.35k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.35k| auto next = get<1>(subs); 1007| 3.35k| auto ts = get<2>(subs); 1008| 3.35k| auto tail = get<3>(subs); 1009| 3.35k| IMMER_TRY { ------------------ | | 49| 3.35k|#define IMMER_TRY try ------------------ 1010| 3.35k| if (next) { ------------------ | Branch (1010:21): [True: 778, False: 2.58k] ------------------ 1011| 778| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 778] ------------------ 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| 778| } else { 1016| 778| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 778| newn->inner()[idx] = next; 1018| 778| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 778] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 778| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 778| } 1022| 2.58k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 940, False: 1.64k] ------------------ 1023| 940| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 940] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 940| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.64k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.64k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 0] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.64k| } else { 1034| 1.64k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.64k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.64k| } else { 1038| 1.64k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.64k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.64k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.64k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.64k| } 1043| 1.64k| } 1044| 3.35k| } 1045| 3.35k| 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.35k| } 1055| 3.35k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 867| 25.5k| { 868| 25.5k| using node_t = node_type; 869| 25.5k| auto node = p.node(); 870| 25.5k| if (node->dec()) { ------------------ | Branch (870:13): [True: 20.4k, False: 5.12k] ------------------ 871| 20.4k| p.each_right(dec_t{}, idx); 872| 20.4k| node_t::delete_inner_r(node, p.count()); 873| 20.4k| } 874| 25.5k| } _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.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): [True: 1.87k, Folded] | Branch (1063:42): [True: 368, False: 1.50k] ------------------ 1064| 1.87k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 465, False: 1.40k] ------------------ 1065| 465| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 465] ------------------ 1066| 0| node->inc(); 1067| 465| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.40k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 334, False: 1.07k] ------------------ 1069| 334| detail::destroy_n(node->leaf() + new_tail_size, 1070| 334| old_tail_size - new_tail_size); 1071| 334| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.07k| } else { 1073| 1.07k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.07k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.07k, Folded] ------------------ 1075| 1.07k| pos.visit(dec_visitor{}); 1076| 1.07k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.07k| } 1078| 1.87k| } _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.79k| { 914| 2.79k| auto idx = pos.index(last); 915| 2.79k| auto node = pos.node(); 916| 2.79k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 2.79k, Folded] | Branch (916:35): [True: 1.41k, False: 1.37k] ------------------ 917| 2.79k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 2.79k] | 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.79k| } else { 924| 2.79k| using std::get; 925| 2.79k| auto subs = 926| 2.79k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 1.41k, False: 1.37k] ------------------ 927| 2.79k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 2.79k| auto next = get<1>(subs); 929| 2.79k| auto ts = get<2>(subs); 930| 2.79k| auto tail = get<3>(subs); 931| 2.79k| IMMER_TRY { ------------------ | | 49| 2.79k|#define IMMER_TRY try ------------------ 932| 2.79k| if (next) { ------------------ | Branch (932:21): [True: 835, False: 1.95k] ------------------ 933| 835| if (mutate) { ------------------ | Branch (933:25): [True: 366, False: 469] ------------------ 934| 366| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 366| pos.each_right(dec_visitor{}, idx + 1); 936| 366| node->inner()[idx] = next; 937| 366| nodr->d.sizes[idx] = last + 1 - ts; 938| 366| nodr->d.count = idx + 1; 939| 366| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 366, False: 0] ------------------ 940| 366| return std::make_tuple(pos.shift(), node, ts, tail); 941| 469| } else { 942| 469| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 469| auto newr = newn->relaxed(); 944| 469| newn->inner()[idx] = next; 945| 469| newr->d.sizes[idx] = last + 1 - ts; 946| 469| newr->d.count = idx + 1; 947| 469| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 469, False: 0] ------------------ 948| 469| if (Mutating) ------------------ | Branch (948:29): [True: 469, Folded] ------------------ 949| 469| pos.visit(dec_visitor{}); 950| 469| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 469| } 952| 1.95k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 539, False: 1.41k] ------------------ 953| 539| if (Mutating) ------------------ | Branch (953:25): [True: 539, Folded] ------------------ 954| 539| pos.visit(dec_right_visitor{}, count_t{1}); 955| 539| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.41k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.41k] | 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.41k| } else { 964| 1.41k| if (mutate) { ------------------ | Branch (964:25): [True: 806, False: 612] ------------------ 965| 806| pos.each_right(dec_visitor{}, idx + 1); 966| 806| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 806| return std::make_tuple(pos.shift(), node, ts, tail); 968| 806| } else { 969| 612| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 612| if (Mutating) ------------------ | Branch (970:29): [True: 612, Folded] ------------------ 971| 612| pos.visit(dec_visitor{}); 972| 612| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 612| } 974| 1.41k| } 975| 2.79k| } 976| 2.79k| 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.79k| } 987| 2.79k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 4.80k| { 992| 4.80k| auto idx = pos.index(last); 993| 4.80k| auto node = pos.node(); 994| 4.80k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.80k, Folded] | Branch (994:35): [True: 3.62k, False: 1.18k] ------------------ 995| 4.80k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.80k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 4.80k| } else { 1002| 4.80k| using std::get; 1003| 4.80k| auto subs = 1004| 4.80k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.62k, False: 1.18k] ------------------ 1005| 4.80k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.80k| auto next = get<1>(subs); 1007| 4.80k| auto ts = get<2>(subs); 1008| 4.80k| auto tail = get<3>(subs); 1009| 4.80k| IMMER_TRY { ------------------ | | 49| 4.80k|#define IMMER_TRY try ------------------ 1010| 4.80k| if (next) { ------------------ | Branch (1010:21): [True: 3.29k, False: 1.50k] ------------------ 1011| 3.29k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.73k, False: 560] ------------------ 1012| 2.73k| node->inner()[idx] = next; 1013| 2.73k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.73k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.73k| } else { 1016| 560| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 560| newn->inner()[idx] = next; 1018| 560| if (Mutating) ------------------ | Branch (1018:29): [True: 560, Folded] ------------------ 1019| 560| pos.visit(dec_visitor{}); 1020| 560| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 560| } 1022| 3.29k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 832, False: 671] ------------------ 1023| 832| if (Mutating) ------------------ | Branch (1023:25): [True: 832, Folded] ------------------ 1024| 832| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 832| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 832| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 671] | 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| 671| } else { 1034| 671| if (mutate) { ------------------ | Branch (1034:25): [True: 329, False: 342] ------------------ 1035| 329| pos.each_right(dec_visitor{}, idx + 1); 1036| 329| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 342| } else { 1038| 342| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 342| if (Mutating) ------------------ | Branch (1039:29): [True: 342, Folded] ------------------ 1040| 342| pos.visit(dec_visitor{}); 1041| 342| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 342| } 1043| 671| } 1044| 4.80k| } 1045| 4.80k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 4.80k| } 1055| 4.80k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 10.4k| { 879| 10.4k| using node_t = node_type; 880| 10.4k| auto node = p.node(); 881| 10.4k| if (node->dec()) { ------------------ | Branch (881:13): [True: 7.39k, False: 3.08k] ------------------ 882| 7.39k| p.each_right(dec_t{}, idx); 883| 7.39k| node_t::delete_inner(node, p.count()); 884| 7.39k| } 885| 10.4k| } _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.43k| { 1060| 4.43k| auto old_tail_size = pos.count(); 1061| 4.43k| auto new_tail_size = pos.index(last) + 1; 1062| 4.43k| auto node = pos.node(); 1063| 4.43k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 4.43k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 4.43k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 732, False: 3.70k] ------------------ 1065| 732| if (!Mutating) ------------------ | Branch (1065:17): [True: 732, Folded] ------------------ 1066| 732| node->inc(); 1067| 732| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 3.70k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 3.70k] ------------------ 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.70k| } else { 1073| 3.70k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 3.70k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 3.70k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 3.70k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 3.70k| } 1078| 4.43k| } _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.55k| { 914| 3.55k| auto idx = pos.index(last); 915| 3.55k| auto node = pos.node(); 916| 3.55k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 3.55k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 3.55k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 3.55k] | 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.55k| } else { 924| 3.55k| using std::get; 925| 3.55k| auto subs = 926| 3.55k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 3.55k] ------------------ 927| 3.55k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 3.55k| auto next = get<1>(subs); 929| 3.55k| auto ts = get<2>(subs); 930| 3.55k| auto tail = get<3>(subs); 931| 3.55k| IMMER_TRY { ------------------ | | 49| 3.55k|#define IMMER_TRY try ------------------ 932| 3.55k| if (next) { ------------------ | Branch (932:21): [True: 788, False: 2.77k] ------------------ 933| 788| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 788] ------------------ 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| 788| } else { 942| 788| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 788| auto newr = newn->relaxed(); 944| 788| newn->inner()[idx] = next; 945| 788| newr->d.sizes[idx] = last + 1 - ts; 946| 788| newr->d.count = idx + 1; 947| 788| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 788, False: 0] ------------------ 948| 788| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 788] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 788| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 788| } 952| 2.77k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 928, False: 1.84k] ------------------ 953| 928| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 928] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 928| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.84k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.84k] | 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.84k| } else { 964| 1.84k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 1.84k] ------------------ 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.84k| } else { 969| 1.84k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 1.84k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 1.84k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 1.84k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 1.84k| } 974| 1.84k| } 975| 3.55k| } 976| 3.55k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 3.55k| } 987| 3.55k| } _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.19k| { 992| 3.19k| auto idx = pos.index(last); 993| 3.19k| auto node = pos.node(); 994| 3.19k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.19k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.19k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.19k] | 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.19k| } else { 1002| 3.19k| using std::get; 1003| 3.19k| auto subs = 1004| 3.19k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.19k] ------------------ 1005| 3.19k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.19k| auto next = get<1>(subs); 1007| 3.19k| auto ts = get<2>(subs); 1008| 3.19k| auto tail = get<3>(subs); 1009| 3.19k| IMMER_TRY { ------------------ | | 49| 3.19k|#define IMMER_TRY try ------------------ 1010| 3.19k| if (next) { ------------------ | Branch (1010:21): [True: 2.05k, False: 1.13k] ------------------ 1011| 2.05k| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 2.05k] ------------------ 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.05k| } else { 1016| 2.05k| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 2.05k| newn->inner()[idx] = next; 1018| 2.05k| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 2.05k] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 2.05k| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 2.05k| } 1022| 2.05k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 724, False: 413] ------------------ 1023| 724| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 724] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 724| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 724| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 413] | 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| 413| } else { 1034| 413| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 413] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 413| } else { 1038| 413| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 413| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 413] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 413| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 413| } 1043| 413| } 1044| 3.19k| } 1045| 3.19k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.19k| } 1055| 3.19k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 12.7k| { 992| 12.7k| auto idx = pos.index(last); 993| 12.7k| auto node = pos.node(); 994| 12.7k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 12.7k, Folded] | Branch (994:35): [True: 8.77k, False: 3.99k] ------------------ 995| 12.7k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 12.7k, Folded] | Branch (995:25): [True: 7.34k, False: 5.42k] ------------------ 996| 7.34k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 5.07k, False: 2.27k] ------------------ 997| 7.34k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 7.34k| if (Mutating) ------------------ | Branch (998:17): [True: 7.34k, Folded] ------------------ 999| 7.34k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 7.34k| return res; 1001| 7.34k| } else { 1002| 5.42k| using std::get; 1003| 5.42k| auto subs = 1004| 5.42k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.69k, False: 1.72k] ------------------ 1005| 5.42k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.42k| auto next = get<1>(subs); 1007| 5.42k| auto ts = get<2>(subs); 1008| 5.42k| auto tail = get<3>(subs); 1009| 5.42k| IMMER_TRY { ------------------ | | 49| 5.42k|#define IMMER_TRY try ------------------ 1010| 5.42k| if (next) { ------------------ | Branch (1010:21): [True: 1.22k, False: 4.20k] ------------------ 1011| 1.22k| if (mutate) { ------------------ | Branch (1011:25): [True: 635, False: 585] ------------------ 1012| 635| node->inner()[idx] = next; 1013| 635| pos.each_right(dec_visitor{}, idx + 1); 1014| 635| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 635| } else { 1016| 585| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 585| newn->inner()[idx] = next; 1018| 585| if (Mutating) ------------------ | Branch (1018:29): [True: 585, Folded] ------------------ 1019| 585| pos.visit(dec_visitor{}); 1020| 585| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 585| } 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.62k, False: 577] | Branch (1026:52): [True: 2.29k, False: 1.32k] ------------------ 1027| 2.29k| auto newn = pos.node()->inner()[0]; 1028| 2.29k| if (!mutate) ------------------ | Branch (1028:25): [True: 535, False: 1.76k] ------------------ 1029| 535| 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: 605] ------------------ 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| 605| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 605| if (Mutating) ------------------ | Branch (1039:29): [True: 605, Folded] ------------------ 1040| 605| pos.visit(dec_visitor{}); 1041| 605| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 605| } 1043| 1.90k| } 1044| 5.42k| } 1045| 5.42k| 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.42k| } 1055| 12.7k| } _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.79k| { 1060| 1.79k| auto old_tail_size = pos.count(); 1061| 1.79k| auto new_tail_size = pos.index(last) + 1; 1062| 1.79k| auto node = pos.node(); 1063| 1.79k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.79k, Folded] | Branch (1063:42): [True: 665, False: 1.13k] ------------------ 1064| 1.79k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 265, False: 1.53k] ------------------ 1065| 265| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 265] ------------------ 1066| 0| node->inc(); 1067| 265| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.53k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 665, False: 868] ------------------ 1069| 665| detail::destroy_n(node->leaf() + new_tail_size, 1070| 665| old_tail_size - new_tail_size); 1071| 665| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 868| } else { 1073| 868| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 868| if (Mutating) ------------------ | Branch (1074:17): [True: 868, Folded] ------------------ 1075| 868| pos.visit(dec_visitor{}); 1076| 868| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 868| } 1078| 1.79k| } _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.71k| { 992| 3.71k| auto idx = pos.index(last); 993| 3.71k| auto node = pos.node(); 994| 3.71k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.71k, Folded] | Branch (994:35): [True: 1.96k, False: 1.75k] ------------------ 995| 3.71k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.71k, Folded] | Branch (995:25): [True: 2.06k, False: 1.65k] ------------------ 996| 2.06k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 1.18k, False: 882] ------------------ 997| 2.06k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 2.06k| if (Mutating) ------------------ | Branch (998:17): [True: 2.06k, Folded] ------------------ 999| 2.06k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 2.06k| return res; 1001| 2.06k| } else { 1002| 1.65k| using std::get; 1003| 1.65k| auto subs = 1004| 1.65k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 786, False: 870] ------------------ 1005| 1.65k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.65k| auto next = get<1>(subs); 1007| 1.65k| auto ts = get<2>(subs); 1008| 1.65k| auto tail = get<3>(subs); 1009| 1.65k| IMMER_TRY { ------------------ | | 49| 1.65k|#define IMMER_TRY try ------------------ 1010| 1.65k| if (next) { ------------------ | Branch (1010:21): [True: 462, False: 1.19k] ------------------ 1011| 462| if (mutate) { ------------------ | Branch (1011:25): [True: 197, False: 265] ------------------ 1012| 197| node->inner()[idx] = next; 1013| 197| pos.each_right(dec_visitor{}, idx + 1); 1014| 197| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 265| } else { 1016| 265| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 265| newn->inner()[idx] = next; 1018| 265| if (Mutating) ------------------ | Branch (1018:29): [True: 265, Folded] ------------------ 1019| 265| pos.visit(dec_visitor{}); 1020| 265| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 265| } 1022| 1.19k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.19k] ------------------ 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.19k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.19k, Folded] | Branch (1026:40): [True: 744, False: 450] | Branch (1026:52): [True: 521, False: 223] ------------------ 1027| 521| auto newn = pos.node()->inner()[0]; 1028| 521| if (!mutate) ------------------ | Branch (1028:25): [True: 258, False: 263] ------------------ 1029| 258| newn->inc(); 1030| 521| if (Mutating) ------------------ | Branch (1030:25): [True: 521, Folded] ------------------ 1031| 521| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 521| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 673| } else { 1034| 673| if (mutate) { ------------------ | Branch (1034:25): [True: 326, False: 347] ------------------ 1035| 326| pos.each_right(dec_visitor{}, idx + 1); 1036| 326| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 347| } else { 1038| 347| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 347| if (Mutating) ------------------ | Branch (1039:29): [True: 347, Folded] ------------------ 1040| 347| pos.visit(dec_visitor{}); 1041| 347| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 347| } 1043| 673| } 1044| 1.65k| } 1045| 1.65k| 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.65k| } 1055| 3.71k| } _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| 741| { 1060| 741| auto old_tail_size = pos.count(); 1061| 741| auto new_tail_size = pos.index(last) + 1; 1062| 741| auto node = pos.node(); 1063| 741| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 741, Folded] | Branch (1063:42): [True: 225, False: 516] ------------------ 1064| 741| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 196, False: 545] ------------------ 1065| 196| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 196] ------------------ 1066| 0| node->inc(); 1067| 196| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 545| } else if (mutate) { ------------------ | Branch (1068:20): [True: 224, False: 321] ------------------ 1069| 224| detail::destroy_n(node->leaf() + new_tail_size, 1070| 224| old_tail_size - new_tail_size); 1071| 224| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 321| } else { 1073| 321| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 321| if (Mutating) ------------------ | Branch (1074:17): [True: 321, Folded] ------------------ 1075| 321| pos.visit(dec_visitor{}); 1076| 321| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 321| } 1078| 741| } _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| 857| { 1378| 857| auto node = pos.node(); 1379| 857| auto idx = pos.index(first); 1380| 857| auto count = pos.count(); 1381| 857| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 857| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 596, False: 261] ------------------ 1384| 857| if (mutate) { ------------------ | Branch (1384:13): [True: 596, False: 261] ------------------ 1385| 596| auto data = node->leaf(); 1386| 596| auto newcount = count - idx; 1387| 596| std::move(data + idx, data + count, data); 1388| 596| detail::destroy_n(data + newcount, idx); 1389| 596| return std::make_tuple(0, node); 1390| 596| } else { 1391| 261| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 261| if (Mutating) ------------------ | Branch (1392:17): [True: 261, Folded] ------------------ 1393| 261| pos.visit(dec_visitor{}); 1394| 261| return std::make_tuple(0, newn); 1395| 261| } 1396| 857| } _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| 53.3k| { 1247| 53.3k| auto idx = pos.subindex(first); 1248| 53.3k| auto count = pos.count(); 1249| 53.3k| auto node = pos.node(); 1250| 53.3k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 53.3k, Folded] | Branch (1250:47): [True: 45.3k, False: 7.99k] ------------------ 1251| 53.3k| auto left_size = pos.size_before(idx); 1252| 53.3k| auto child_size = pos.size_sbh(idx, left_size); 1253| 53.3k| auto dropped_size = first; 1254| 53.3k| auto child_dropped_size = dropped_size - left_size; 1255| 53.3k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 53.3k, Folded] | Branch (1255:25): [True: 51.0k, False: 2.33k] | Branch (1255:45): [True: 4.99k, False: 46.0k] ------------------ 1256| 4.99k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 1.93k, False: 3.05k] ------------------ 1257| 4.99k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 4.99k| if (mutate) ------------------ | Branch (1258:17): [True: 1.93k, False: 3.05k] ------------------ 1259| 1.93k| pos.visit(dec_left_visitor{}, idx); 1260| 3.05k| else if (Mutating) ------------------ | Branch (1260:22): [True: 3.05k, Folded] ------------------ 1261| 3.05k| pos.visit(dec_visitor{}); 1262| 4.99k| return r; 1263| 48.3k| } else { 1264| 48.3k| using std::get; 1265| 48.3k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 43.4k, False: 4.94k] ------------------ 1266| 48.3k| : node_t::make_inner_r_e(e); 1267| 48.3k| auto newr = newn->relaxed(); 1268| 48.3k| auto newcount = count - idx; 1269| 48.3k| auto new_child_size = child_size - child_dropped_size; 1270| 48.3k| IMMER_TRY { ------------------ | | 49| 48.3k|#define IMMER_TRY try ------------------ 1271| 48.3k| auto subs = 1272| 48.3k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 43.4k, False: 4.94k] ------------------ 1273| 48.3k| : pos.towards_sub_oh( 1274| 4.94k| no_collapse_no_mut_t{}, first, idx, e); 1275| 48.3k| if (mutate) ------------------ | Branch (1275:21): [True: 43.4k, False: 4.94k] ------------------ 1276| 43.4k| pos.each_left(dec_visitor{}, idx); 1277| 48.3k| pos.copy_sizes( 1278| 48.3k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 48.3k| std::copy(node->inner() + idx + 1, 1280| 48.3k| node->inner() + count, 1281| 48.3k| newn->inner() + 1); 1282| 48.3k| newn->inner()[0] = get<1>(subs); 1283| 48.3k| newr->d.sizes[0] = new_child_size; 1284| 48.3k| newr->d.count = newcount; 1285| 48.3k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 48.3k, False: 0] ------------------ 1286| 48.3k| if (!mutate) { ------------------ | Branch (1286:21): [True: 4.94k, False: 43.4k] ------------------ 1287| 4.94k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 4.94k| if (Mutating) ------------------ | Branch (1288:25): [True: 4.94k, Folded] ------------------ 1289| 4.94k| pos.visit(dec_visitor{}); 1290| 4.94k| } 1291| 48.3k| return std::make_tuple(pos.shift(), newn); 1292| 48.3k| } 1293| 48.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| 48.3k| } 1299| 53.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.51k| { 1247| 2.51k| auto idx = pos.subindex(first); 1248| 2.51k| auto count = pos.count(); 1249| 2.51k| auto node = pos.node(); 1250| 2.51k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.51k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.51k| auto left_size = pos.size_before(idx); 1252| 2.51k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.51k| auto dropped_size = first; 1254| 2.51k| auto child_dropped_size = dropped_size - left_size; 1255| 2.51k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.51k, Folded] | Branch (1255:25): [True: 973, False: 1.54k] | Branch (1255:45): [True: 765, False: 208] ------------------ 1256| 765| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 765] ------------------ 1257| 765| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 765| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 765] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 765| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 765] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 765| return r; 1263| 1.75k| } else { 1264| 1.75k| using std::get; 1265| 1.75k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.75k] ------------------ 1266| 1.75k| : node_t::make_inner_r_e(e); 1267| 1.75k| auto newr = newn->relaxed(); 1268| 1.75k| auto newcount = count - idx; 1269| 1.75k| auto new_child_size = child_size - child_dropped_size; 1270| 1.75k| IMMER_TRY { ------------------ | | 49| 1.75k|#define IMMER_TRY try ------------------ 1271| 1.75k| auto subs = 1272| 1.75k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.75k] ------------------ 1273| 1.75k| : pos.towards_sub_oh( 1274| 1.75k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.75k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.75k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.75k| pos.copy_sizes( 1278| 1.75k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.75k| std::copy(node->inner() + idx + 1, 1280| 1.75k| node->inner() + count, 1281| 1.75k| newn->inner() + 1); 1282| 1.75k| newn->inner()[0] = get<1>(subs); 1283| 1.75k| newr->d.sizes[0] = new_child_size; 1284| 1.75k| newr->d.count = newcount; 1285| 1.75k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.75k, False: 0] ------------------ 1286| 1.75k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.75k, False: 0] ------------------ 1287| 1.75k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.75k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.75k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.75k| } 1291| 1.75k| return std::make_tuple(pos.shift(), newn); 1292| 1.75k| } 1293| 1.75k| 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.75k| } 1299| 2.51k| } _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.03k| { 1304| 2.03k| auto idx = pos.subindex(first); 1305| 2.03k| auto count = pos.count(); 1306| 2.03k| auto node = pos.node(); 1307| 2.03k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.03k] ------------------ 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.03k| auto left_size = pos.size_before(idx); 1313| 2.03k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.03k| auto dropped_size = first; 1315| 2.03k| auto child_dropped_size = dropped_size - left_size; 1316| 2.03k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.03k, Folded] | Branch (1316:25): [True: 760, False: 1.27k] | Branch (1316:45): [True: 513, False: 247] ------------------ 1317| 513| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 513] ------------------ 1318| 513| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 513| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 513] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 513| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 513] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 513| 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.03k| } _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| 627| { 1304| 627| auto idx = pos.subindex(first); 1305| 627| auto count = pos.count(); 1306| 627| auto node = pos.node(); 1307| 627| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 627] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 627| auto left_size = pos.size_before(idx); 1313| 627| auto child_size = pos.size_sbh(idx, left_size); 1314| 627| auto dropped_size = first; 1315| 627| auto child_dropped_size = dropped_size - left_size; 1316| 627| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 627, Folded] | Branch (1316:25): [True: 197, False: 430] | Branch (1316:45): [True: 0, False: 197] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 627| } else { 1325| 627| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 627| auto newcount = count - idx; 1330| 627| auto newn = 1331| 627| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 627] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 627| : node_t::make_inner_r_e(e); 1336| 627| auto newr = newn->relaxed(); 1337| 627| IMMER_TRY { ------------------ | | 49| 627|#define IMMER_TRY try ------------------ 1338| 627| auto subs = 1339| 627| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 627] ------------------ 1340| 627| : pos.towards_sub_oh( 1341| 627| no_collapse_no_mut_t{}, first, idx, e); 1342| 627| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 627] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 627| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 627| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 627, False: 0] ------------------ 1346| 627| pos.copy_sizes( 1347| 627| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 627| newr->d.count = newcount; 1349| 627| newn->inner()[0] = get<1>(subs); 1350| 627| std::copy(node->inner() + idx + 1, 1351| 627| node->inner() + count, 1352| 627| newn->inner() + 1); 1353| 627| if (!mutate) { ------------------ | Branch (1353:21): [True: 627, False: 0] ------------------ 1354| 627| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 627| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 627] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 627| } 1358| 627| return std::make_tuple(pos.shift(), newn); 1359| 627| } 1360| 627| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 627| } 1373| 627| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 8.17k| { 1378| 8.17k| auto node = pos.node(); 1379| 8.17k| auto idx = pos.index(first); 1380| 8.17k| auto count = pos.count(); 1381| 8.17k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 8.17k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 8.17k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 8.17k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 8.17k| } else { 1391| 8.17k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 8.17k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 8.17k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 8.17k| return std::make_tuple(0, newn); 1395| 8.17k| } 1396| 8.17k| } _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.90k| { 1304| 1.90k| auto idx = pos.subindex(first); 1305| 1.90k| auto count = pos.count(); 1306| 1.90k| auto node = pos.node(); 1307| 1.90k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.90k] ------------------ 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.90k| auto left_size = pos.size_before(idx); 1313| 1.90k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.90k| auto dropped_size = first; 1315| 1.90k| auto child_dropped_size = dropped_size - left_size; 1316| 1.90k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.90k] | 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.90k| } else { 1325| 1.90k| 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.90k| auto newcount = count - idx; 1330| 1.90k| auto newn = 1331| 1.90k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.90k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.90k| : node_t::make_inner_r_e(e); 1336| 1.90k| auto newr = newn->relaxed(); 1337| 1.90k| IMMER_TRY { ------------------ | | 49| 1.90k|#define IMMER_TRY try ------------------ 1338| 1.90k| auto subs = 1339| 1.90k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.90k] ------------------ 1340| 1.90k| : pos.towards_sub_oh( 1341| 1.90k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.90k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.90k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.90k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.90k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.90k, False: 0] ------------------ 1346| 1.90k| pos.copy_sizes( 1347| 1.90k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.90k| newr->d.count = newcount; 1349| 1.90k| newn->inner()[0] = get<1>(subs); 1350| 1.90k| std::copy(node->inner() + idx + 1, 1351| 1.90k| node->inner() + count, 1352| 1.90k| newn->inner() + 1); 1353| 1.90k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.90k, False: 0] ------------------ 1354| 1.90k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.90k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.90k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.90k| } 1358| 1.90k| return std::make_tuple(pos.shift(), newn); 1359| 1.90k| } 1360| 1.90k| 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.90k| } 1373| 1.90k| } _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.36k| { 1378| 4.36k| auto node = pos.node(); 1379| 4.36k| auto idx = pos.index(first); 1380| 4.36k| auto count = pos.count(); 1381| 4.36k| 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.36k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 1.84k, False: 2.51k] ------------------ 1384| 4.36k| if (mutate) { ------------------ | Branch (1384:13): [True: 1.84k, False: 2.51k] ------------------ 1385| 1.84k| auto data = node->leaf(); 1386| 1.84k| auto newcount = count - idx; 1387| 1.84k| std::move(data + idx, data + count, data); 1388| 1.84k| detail::destroy_n(data + newcount, idx); 1389| 1.84k| return std::make_tuple(0, node); 1390| 2.51k| } else { 1391| 2.51k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.51k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.51k, Folded] ------------------ 1393| 2.51k| pos.visit(dec_visitor{}); 1394| 2.51k| return std::make_tuple(0, newn); 1395| 2.51k| } 1396| 4.36k| } _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.54k| { 1304| 1.54k| auto idx = pos.subindex(first); 1305| 1.54k| auto count = pos.count(); 1306| 1.54k| auto node = pos.node(); 1307| 1.54k| 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.54k| auto left_size = pos.size_before(idx); 1313| 1.54k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.54k| auto dropped_size = first; 1315| 1.54k| auto child_dropped_size = dropped_size - left_size; 1316| 1.54k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.54k] | 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.54k| } else { 1325| 1.54k| 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.54k| auto newcount = count - idx; 1330| 1.54k| auto newn = 1331| 1.54k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.54k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.54k| : node_t::make_inner_r_e(e); 1336| 1.54k| auto newr = newn->relaxed(); 1337| 1.54k| IMMER_TRY { ------------------ | | 49| 1.54k|#define IMMER_TRY try ------------------ 1338| 1.54k| auto subs = 1339| 1.54k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.54k] ------------------ 1340| 1.54k| : pos.towards_sub_oh( 1341| 1.54k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.54k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.54k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.54k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.54k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.54k, False: 0] ------------------ 1346| 1.54k| pos.copy_sizes( 1347| 1.54k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.54k| newr->d.count = newcount; 1349| 1.54k| newn->inner()[0] = get<1>(subs); 1350| 1.54k| std::copy(node->inner() + idx + 1, 1351| 1.54k| node->inner() + count, 1352| 1.54k| newn->inner() + 1); 1353| 1.54k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.54k, False: 0] ------------------ 1354| 1.54k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.54k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.54k, Folded] ------------------ 1356| 1.54k| pos.visit(dec_visitor{}); 1357| 1.54k| } 1358| 1.54k| return std::make_tuple(pos.shift(), newn); 1359| 1.54k| } 1360| 1.54k| 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.54k| } 1373| 1.54k| } _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| 41.4k| { 1378| 41.4k| auto node = pos.node(); 1379| 41.4k| auto idx = pos.index(first); 1380| 41.4k| auto count = pos.count(); 1381| 41.4k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 41.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| 41.4k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 41.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| 41.4k| } else { 1391| 41.4k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 41.4k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 41.4k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 41.4k| return std::make_tuple(0, newn); 1395| 41.4k| } 1396| 41.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.74k| { 1304| 2.74k| auto idx = pos.subindex(first); 1305| 2.74k| auto count = pos.count(); 1306| 2.74k| auto node = pos.node(); 1307| 2.74k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.74k] ------------------ 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.74k| auto left_size = pos.size_before(idx); 1313| 2.74k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.74k| auto dropped_size = first; 1315| 2.74k| auto child_dropped_size = dropped_size - left_size; 1316| 2.74k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.74k] | 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.74k| } else { 1325| 2.74k| 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.74k| auto newcount = count - idx; 1330| 2.74k| auto newn = 1331| 2.74k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.74k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.74k| : node_t::make_inner_r_e(e); 1336| 2.74k| auto newr = newn->relaxed(); 1337| 2.74k| IMMER_TRY { ------------------ | | 49| 2.74k|#define IMMER_TRY try ------------------ 1338| 2.74k| auto subs = 1339| 2.74k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.74k] ------------------ 1340| 2.74k| : pos.towards_sub_oh( 1341| 2.74k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.74k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.74k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.74k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.74k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.74k, False: 0] ------------------ 1346| 2.74k| pos.copy_sizes( 1347| 2.74k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.74k| newr->d.count = newcount; 1349| 2.74k| newn->inner()[0] = get<1>(subs); 1350| 2.74k| std::copy(node->inner() + idx + 1, 1351| 2.74k| node->inner() + count, 1352| 2.74k| newn->inner() + 1); 1353| 2.74k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.74k, False: 0] ------------------ 1354| 2.74k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.74k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.74k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.74k| } 1358| 2.74k| return std::make_tuple(pos.shift(), newn); 1359| 2.74k| } 1360| 2.74k| 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.74k| } 1373| 2.74k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 1198| 1.93k| { 1199| 1.93k| using node_t = node_type; 1200| 1.93k| auto node = p.node(); 1201| 1.93k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 1.93k, False: 0] ------------------ 1202| 1.93k| p.each_left(dec_t{}, idx); 1203| 1.93k| node_t::delete_inner_r(node, p.count()); 1204| 1.93k| } 1205| 1.93k| } _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| 172k| { 1247| 172k| auto idx = pos.subindex(first); 1248| 172k| auto count = pos.count(); 1249| 172k| auto node = pos.node(); 1250| 172k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 172k, Folded] | Branch (1250:47): [True: 135k, False: 37.5k] ------------------ 1251| 172k| auto left_size = pos.size_before(idx); 1252| 172k| auto child_size = pos.size_sbh(idx, left_size); 1253| 172k| auto dropped_size = first; 1254| 172k| auto child_dropped_size = dropped_size - left_size; 1255| 172k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 172k] | 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| 172k| } else { 1264| 172k| using std::get; 1265| 172k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 135k, False: 37.5k] ------------------ 1266| 172k| : node_t::make_inner_r_e(e); 1267| 172k| auto newr = newn->relaxed(); 1268| 172k| auto newcount = count - idx; 1269| 172k| auto new_child_size = child_size - child_dropped_size; 1270| 172k| IMMER_TRY { ------------------ | | 49| 172k|#define IMMER_TRY try ------------------ 1271| 172k| auto subs = 1272| 172k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 135k, False: 37.5k] ------------------ 1273| 172k| : pos.towards_sub_oh( 1274| 37.5k| no_collapse_no_mut_t{}, first, idx, e); 1275| 172k| if (mutate) ------------------ | Branch (1275:21): [True: 135k, False: 37.5k] ------------------ 1276| 135k| pos.each_left(dec_visitor{}, idx); 1277| 172k| pos.copy_sizes( 1278| 172k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 172k| std::copy(node->inner() + idx + 1, 1280| 172k| node->inner() + count, 1281| 172k| newn->inner() + 1); 1282| 172k| newn->inner()[0] = get<1>(subs); 1283| 172k| newr->d.sizes[0] = new_child_size; 1284| 172k| newr->d.count = newcount; 1285| 172k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 172k, False: 0] ------------------ 1286| 172k| if (!mutate) { ------------------ | Branch (1286:21): [True: 37.5k, False: 135k] ------------------ 1287| 37.5k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 37.5k| if (Mutating) ------------------ | Branch (1288:25): [True: 37.5k, Folded] ------------------ 1289| 37.5k| pos.visit(dec_visitor{}); 1290| 37.5k| } 1291| 172k| return std::make_tuple(pos.shift(), newn); 1292| 172k| } 1293| 172k| 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| 172k| } 1299| 172k| } _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| 48.6k| { 1247| 48.6k| auto idx = pos.subindex(first); 1248| 48.6k| auto count = pos.count(); 1249| 48.6k| auto node = pos.node(); 1250| 48.6k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 48.6k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 48.6k| auto left_size = pos.size_before(idx); 1252| 48.6k| auto child_size = pos.size_sbh(idx, left_size); 1253| 48.6k| auto dropped_size = first; 1254| 48.6k| auto child_dropped_size = dropped_size - left_size; 1255| 48.6k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 48.6k] | 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| 48.6k| } else { 1264| 48.6k| using std::get; 1265| 48.6k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 48.6k] ------------------ 1266| 48.6k| : node_t::make_inner_r_e(e); 1267| 48.6k| auto newr = newn->relaxed(); 1268| 48.6k| auto newcount = count - idx; 1269| 48.6k| auto new_child_size = child_size - child_dropped_size; 1270| 48.6k| IMMER_TRY { ------------------ | | 49| 48.6k|#define IMMER_TRY try ------------------ 1271| 48.6k| auto subs = 1272| 48.6k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 48.6k] ------------------ 1273| 48.6k| : pos.towards_sub_oh( 1274| 48.6k| no_collapse_no_mut_t{}, first, idx, e); 1275| 48.6k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 48.6k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 48.6k| pos.copy_sizes( 1278| 48.6k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 48.6k| std::copy(node->inner() + idx + 1, 1280| 48.6k| node->inner() + count, 1281| 48.6k| newn->inner() + 1); 1282| 48.6k| newn->inner()[0] = get<1>(subs); 1283| 48.6k| newr->d.sizes[0] = new_child_size; 1284| 48.6k| newr->d.count = newcount; 1285| 48.6k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 48.6k, False: 0] ------------------ 1286| 48.6k| if (!mutate) { ------------------ | Branch (1286:21): [True: 48.6k, False: 0] ------------------ 1287| 48.6k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 48.6k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 48.6k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 48.6k| } 1291| 48.6k| return std::make_tuple(pos.shift(), newn); 1292| 48.6k| } 1293| 48.6k| 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| 48.6k| } 1299| 48.6k| } _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.58k| { 1304| 2.58k| auto idx = pos.subindex(first); 1305| 2.58k| auto count = pos.count(); 1306| 2.58k| auto node = pos.node(); 1307| 2.58k| 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.58k| auto left_size = pos.size_before(idx); 1313| 2.58k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.58k| auto dropped_size = first; 1315| 2.58k| auto child_dropped_size = dropped_size - left_size; 1316| 2.58k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.58k, Folded] | Branch (1316:25): [True: 1.74k, False: 840] | Branch (1316:45): [True: 847, False: 896] ------------------ 1317| 847| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 847] ------------------ 1318| 847| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 847| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 847] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 847| else if (Mutating) ------------------ | Branch (1321:22): [True: 847, Folded] ------------------ 1322| 847| pos.visit(dec_visitor{}); 1323| 847| return r; 1324| 1.73k| } else { 1325| 1.73k| 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.73k| auto newcount = count - idx; 1330| 1.73k| auto newn = 1331| 1.73k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.73k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.73k| : node_t::make_inner_r_e(e); 1336| 1.73k| auto newr = newn->relaxed(); 1337| 1.73k| IMMER_TRY { ------------------ | | 49| 1.73k|#define IMMER_TRY try ------------------ 1338| 1.73k| auto subs = 1339| 1.73k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.73k] ------------------ 1340| 1.73k| : pos.towards_sub_oh( 1341| 1.73k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.73k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.73k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.73k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.73k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.73k, False: 0] ------------------ 1346| 1.73k| pos.copy_sizes( 1347| 1.73k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.73k| newr->d.count = newcount; 1349| 1.73k| newn->inner()[0] = get<1>(subs); 1350| 1.73k| std::copy(node->inner() + idx + 1, 1351| 1.73k| node->inner() + count, 1352| 1.73k| newn->inner() + 1); 1353| 1.73k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.73k, False: 0] ------------------ 1354| 1.73k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.73k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.73k, Folded] ------------------ 1356| 1.73k| pos.visit(dec_visitor{}); 1357| 1.73k| } 1358| 1.73k| return std::make_tuple(pos.shift(), newn); 1359| 1.73k| } 1360| 1.73k| 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.73k| } 1373| 2.58k| } _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| 13.4k| { 350| 13.4k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 13.4k, False: 0] ------------------ 351| 13.4k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 12.4k, False: 1.00k] ------------------ 352| 13.4k| ? visit_maybe_relaxed_sub(rootl, 353| 12.4k| shiftl, 354| 12.4k| sizel, 355| 12.4k| this_t{}, 356| 12.4k| posr, 357| 12.4k| first, 358| 12.4k| size_t{}) 359| 13.4k| : posr.first_sub_inner( 360| 1.00k| rrb{}, first, rootl, shiftl, sizel); 361| 13.4k| } _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| 34.8k| { 383| 34.8k| auto nl = posl.node(); 384| 34.8k| auto nr = posr.node(); 385| 34.8k| if (nl == nr) ------------------ | Branch (385:13): [True: 11.6k, False: 23.1k] ------------------ 386| 11.6k| return true; 387| 23.1k| auto cl = posl.count(); 388| 23.1k| auto cr = posr.count(); 389| 23.1k| assert(cr > 0); ------------------ | Branch (389:9): [True: 23.1k, False: 0] ------------------ 390| 23.1k| auto sbr = size_t{}; 391| 23.1k| auto i = count_t{}; 392| 23.1k| auto j = count_t{}; 393| 124k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 111k, False: 13.1k] ------------------ 394| 111k| auto sbl = posl.size_before(i); 395| 197k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 178k, False: 19.7k] | Branch (395:34): [True: 86.4k, False: 91.6k] ------------------ 396| 86.4k| ; 397| 111k| auto res = 398| 111k| sbl == sbr ------------------ | Branch (398:17): [True: 55.6k, False: 55.6k] ------------------ 399| 111k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 111k| : posl.nth_sub(i, 401| 55.6k| for_each_chunk_p_visitor{}, 402| 55.6k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 111k| if (!res) ------------------ | Branch (403:17): [True: 10.0k, False: 101k] ------------------ 404| 10.0k| return false; 405| 111k| } 406| 13.1k| return true; 407| 23.1k| } _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| 25.8k| { 337| 25.8k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 25.8k| } _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.4k| { 428| 26.4k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 16.8k, False: 9.62k] ------------------ 429| 16.8k| return true; 430| 9.62k| auto cl = posl.count(); 431| 9.62k| auto cr = posr.count(); 432| 9.62k| auto mp = std::min(cl, cr); 433| 9.62k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 8.18k, False: 1.43k] ------------------ 434| 9.62k| posl.node()->leaf() + mp, 435| 9.62k| posr.node()->leaf()) && 436| 8.18k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 7.71k, False: 475] ------------------ 437| 8.18k| posl.node()->leaf() + posl.count(), 438| 8.18k| first + (idx + mp)); 439| 26.4k| } _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| 25.4k| { 330| 25.4k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 25.4k| } _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.32k| { 413| 4.32k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.32k| } _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.32k| { 383| 4.32k| auto nl = posl.node(); 384| 4.32k| auto nr = posr.node(); 385| 4.32k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.32k] ------------------ 386| 0| return true; 387| 4.32k| auto cl = posl.count(); 388| 4.32k| auto cr = posr.count(); 389| 4.32k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.32k, False: 0] ------------------ 390| 4.32k| auto sbr = size_t{}; 391| 4.32k| auto i = count_t{}; 392| 4.32k| auto j = count_t{}; 393| 15.0k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 13.0k, False: 1.93k] ------------------ 394| 13.0k| auto sbl = posl.size_before(i); 395| 21.9k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 18.2k, False: 3.69k] | Branch (395:34): [True: 8.84k, False: 9.38k] ------------------ 396| 8.84k| ; 397| 13.0k| auto res = 398| 13.0k| sbl == sbr ------------------ | Branch (398:17): [True: 8.12k, False: 4.96k] ------------------ 399| 13.0k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 13.0k| : posl.nth_sub(i, 401| 4.96k| for_each_chunk_p_visitor{}, 402| 4.96k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 13.0k| if (!res) ------------------ | Branch (403:17): [True: 2.38k, False: 10.6k] ------------------ 404| 2.38k| return false; 405| 13.0k| } 406| 1.93k| return true; 407| 4.32k| } _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.13k| { 337| 5.13k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 5.13k| } _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| 11.7k| { 428| 11.7k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 7.94k, False: 3.80k] ------------------ 429| 7.94k| return true; 430| 3.80k| auto cl = posl.count(); 431| 3.80k| auto cr = posr.count(); 432| 3.80k| auto mp = std::min(cl, cr); 433| 3.80k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 3.45k, False: 350] ------------------ 434| 3.80k| posl.node()->leaf() + mp, 435| 3.80k| posr.node()->leaf()) && 436| 3.45k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 3.13k, False: 321] ------------------ 437| 3.45k| posl.node()->leaf() + posl.count(), 438| 3.45k| first + (idx + mp)); 439| 11.7k| } _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.11k| { 330| 2.11k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.11k| } _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| 15.8k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 14.3k, False: 1.45k] ------------------ 394| 14.3k| auto sbl = posl.size_before(i); 395| 25.4k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 21.9k, False: 3.49k] | Branch (395:34): [True: 11.0k, False: 10.8k] ------------------ 396| 11.0k| ; 397| 14.3k| auto res = 398| 14.3k| sbl == sbr ------------------ | Branch (398:17): [True: 8.56k, False: 5.79k] ------------------ 399| 14.3k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 14.3k| : posl.nth_sub(i, 401| 5.79k| for_each_chunk_p_visitor{}, 402| 5.79k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 14.3k| if (!res) ------------------ | Branch (403:17): [True: 785, False: 13.5k] ------------------ 404| 785| return false; 405| 14.3k| } 406| 1.45k| 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.27k| { 337| 7.27k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 7.27k| } _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| 447| { 330| 447| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 447| } _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| 844| { 330| 844| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 844| } _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.71k| { 420| 1.71k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.71k, False: 0] ------------------ 421| 1.71k| ? this_t::visit_regular(posl, posr.node()) 422| 1.71k| : this_t::visit_regular(posr, posl.node()); 423| 1.71k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 12.4k| { 444| 12.4k| auto node = pos.node(); 445| 12.4k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 8.77k, False: 3.69k] | Branch (445:33): [True: 2.14k, False: 1.54k] ------------------ 446| 12.4k| } _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| 24.3k| { 451| 24.3k| auto node = pos.node(); 452| 24.3k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 18.6k, False: 5.68k] | Branch (452:33): [True: 3.20k, False: 2.48k] ------------------ 453| 5.68k| node->leaf() + pos.count(), 454| 5.68k| other->leaf()); 455| 24.3k| } _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| 11.8k| { 444| 11.8k| auto node = pos.node(); 445| 11.8k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 6.42k, False: 5.41k] | Branch (445:33): [True: 2.29k, False: 3.11k] ------------------ 446| 11.8k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 3.03k| { 451| 3.03k| auto node = pos.node(); 452| 3.03k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.51k, False: 1.51k] | Branch (452:33): [True: 497, False: 1.02k] ------------------ 453| 1.51k| node->leaf() + pos.count(), 454| 1.51k| other->leaf()); 455| 3.03k| } _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.16k| { 444| 3.16k| auto node = pos.node(); 445| 3.16k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 285, False: 2.87k] | Branch (445:33): [True: 1.54k, False: 1.32k] ------------------ 446| 3.16k| } _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| 180k| { 113| 180k| auto data = as_const(pos.node()->leaf()); 114| 180k| return fn(data, data + pos.count()); 115| 180k| } _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.13M| return [iter](auto f, auto e) mutable { 368| 1.13M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 80.0k, False: 1.05M] ------------------ 369| 80.0k| iter += e - f; 370| 80.0k| return true; 371| 80.0k| } 372| 8.96M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 7.91M, False: 1.05M] ------------------ 373| 7.91M| if (*f != *iter) ------------------ | Branch (373:21): [True: 5.00k, False: 7.90M] ------------------ 374| 5.00k| return false; 375| 1.05M| return true; 376| 1.05M| }; _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.39M| { 54| 4.39M| return pos.towards(this_t{}, idx); 55| 4.39M| } _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| 993k| { 60| 993k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 993k| } _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| 212k| { 54| 212k| return pos.towards(this_t{}, idx); 55| 212k| } _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| 195k| { 60| 195k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 195k| } _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| 220k| { 54| 220k| return pos.towards(this_t{}, idx); 55| 220k| } _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| 17.0k| { 60| 17.0k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 17.0k| } _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| 26.0k| { 54| 26.0k| return pos.towards(this_t{}, idx); 55| 26.0k| } _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| 15.2k| { 107| 15.2k| return pos.each_pred(this_t{}, fn); 108| 15.2k| } _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| 869| { 330| 869| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 869| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSM_OT1_m: 419| 9.68k| { 420| 9.68k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 9.68k, False: 0] ------------------ 421| 9.68k| ? this_t::visit_regular(posl, posr.node()) 422| 9.68k| : this_t::visit_regular(posr, posl.node()); 423| 9.68k| } _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| 944k| { 113| 944k| auto data = as_const(pos.node()->leaf()); 114| 944k| return fn(data, data + pos.count()); 115| 944k| } _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| 12.9k| { 107| 12.9k| return pos.each_pred(this_t{}, fn); 108| 12.9k| } _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| 11.1k| { 113| 11.1k| auto data = as_const(pos.node()->leaf()); 114| 11.1k| return fn(data, data + pos.count()); 115| 11.1k| } _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| 3.36k| { 107| 3.36k| return pos.each_pred(this_t{}, fn); 108| 3.36k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 4.95k| { 330| 4.95k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 4.95k| } _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.82k| { 383| 3.82k| auto nl = posl.node(); 384| 3.82k| auto nr = posr.node(); 385| 3.82k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 3.82k] ------------------ 386| 0| return true; 387| 3.82k| auto cl = posl.count(); 388| 3.82k| auto cr = posr.count(); 389| 3.82k| assert(cr > 0); ------------------ | Branch (389:9): [True: 3.82k, False: 0] ------------------ 390| 3.82k| auto sbr = size_t{}; 391| 3.82k| auto i = count_t{}; 392| 3.82k| auto j = count_t{}; 393| 16.6k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 14.7k, False: 1.86k] ------------------ 394| 14.7k| auto sbl = posl.size_before(i); 395| 24.1k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 21.0k, False: 3.16k] | Branch (395:34): [True: 9.44k, False: 11.5k] ------------------ 396| 9.44k| ; 397| 14.7k| auto res = 398| 14.7k| sbl == sbr ------------------ | Branch (398:17): [True: 8.38k, False: 6.36k] ------------------ 399| 14.7k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 14.7k| : posl.nth_sub(i, 401| 6.36k| for_each_chunk_p_visitor{}, 402| 6.36k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 14.7k| if (!res) ------------------ | Branch (403:17): [True: 1.96k, False: 12.7k] ------------------ 404| 1.96k| return false; 405| 14.7k| } 406| 1.86k| return true; 407| 3.82k| } _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| 10.8k| { 337| 10.8k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 10.8k| } _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| 10.8k| { 428| 10.8k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 7.91k, False: 2.95k] ------------------ 429| 7.91k| 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.56k, False: 388] ------------------ 434| 2.95k| posl.node()->leaf() + mp, 435| 2.95k| posr.node()->leaf()) && 436| 2.56k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.56k, False: 0] ------------------ 437| 2.56k| posl.node()->leaf() + posl.count(), 438| 2.56k| first + (idx + mp)); 439| 10.8k| } _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| 3.81k| { 330| 3.81k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 3.81k| } _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.65k| { 383| 1.65k| auto nl = posl.node(); 384| 1.65k| auto nr = posr.node(); 385| 1.65k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.65k] ------------------ 386| 0| return true; 387| 1.65k| auto cl = posl.count(); 388| 1.65k| auto cr = posr.count(); 389| 1.65k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.65k, False: 0] ------------------ 390| 1.65k| auto sbr = size_t{}; 391| 1.65k| auto i = count_t{}; 392| 1.65k| auto j = count_t{}; 393| 12.3k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 11.2k, False: 1.10k] ------------------ 394| 11.2k| auto sbl = posl.size_before(i); 395| 20.4k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 19.5k, False: 839] | Branch (395:34): [True: 9.15k, False: 10.4k] ------------------ 396| 9.15k| ; 397| 11.2k| auto res = 398| 11.2k| sbl == sbr ------------------ | Branch (398:17): [True: 6.85k, False: 4.39k] ------------------ 399| 11.2k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 11.2k| : posl.nth_sub(i, 401| 4.39k| for_each_chunk_p_visitor{}, 402| 4.39k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 11.2k| if (!res) ------------------ | Branch (403:17): [True: 546, False: 10.7k] ------------------ 404| 546| return false; 405| 11.2k| } 406| 1.10k| return true; 407| 1.65k| } _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.15k| { 420| 2.15k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 2.15k, False: 0] ------------------ 421| 2.15k| ? this_t::visit_regular(posl, posr.node()) 422| 2.15k| : this_t::visit_regular(posr, posl.node()); 423| 2.15k| } _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| 142k| { 107| 142k| return pos.each_pred(this_t{}, fn); 108| 142k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 366| 77.2k| { 367| 77.2k| return [iter](auto f, auto e) mutable { 368| 77.2k| if (f == &*iter) { 369| 77.2k| iter += e - f; 370| 77.2k| return true; 371| 77.2k| } 372| 77.2k| for (; f != e; ++f, ++iter) 373| 77.2k| if (*f != *iter) 374| 77.2k| return false; 375| 77.2k| return true; 376| 77.2k| }; 377| 77.2k| } _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.26k| { 350| 1.26k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 1.26k, False: 0] ------------------ 351| 1.26k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 1.00k, False: 261] ------------------ 352| 1.26k| ? visit_maybe_relaxed_sub(rootl, 353| 1.00k| shiftl, 354| 1.00k| sizel, 355| 1.00k| this_t{}, 356| 1.00k| posr, 357| 1.00k| first, 358| 1.00k| size_t{}) 359| 1.26k| : posr.first_sub_inner( 360| 261| rrb{}, first, rootl, shiftl, sizel); 361| 1.26k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 8.55k| { 350| 8.55k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 8.55k, False: 0] ------------------ 351| 8.55k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 8.55k, False: 0] ------------------ 352| 8.55k| ? visit_maybe_relaxed_sub(rootl, 353| 8.55k| shiftl, 354| 8.55k| sizel, 355| 8.55k| this_t{}, 356| 8.55k| posr, 357| 8.55k| first, 358| 8.55k| size_t{}) 359| 8.55k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 8.55k| } _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.91k| { 451| 6.91k| auto node = pos.node(); 452| 6.91k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.81k, False: 5.10k] | Branch (452:33): [True: 2.05k, False: 3.05k] ------------------ 453| 5.10k| node->leaf() + pos.count(), 454| 5.10k| other->leaf()); 455| 6.91k| } _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| 179M|{ 1839| 179M| assert(node); ------------------ | Branch (1839:5): [True: 179M, False: 0] ------------------ 1840| 179M| auto relaxed = node->relaxed(); 1841| 179M| if (relaxed) { ------------------ | Branch (1841:9): [True: 163M, False: 15.3M] ------------------ 1842| 163M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 163M, False: 0] ------------------ 1843| 163M| return make_relaxed_pos(node, shift, relaxed) 1844| 163M| .visit(v, std::forward(args)...); 1845| 163M| } else { 1846| 15.3M| return make_regular_sub_pos(node, shift, size) 1847| 15.3M| .visit(v, std::forward(args)...); 1848| 15.3M| } 1849| 179M|} _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| 460M|{ 1829| 460M| assert(node); ------------------ | Branch (1829:5): [True: 460M, False: 0] ------------------ 1830| 460M| assert(relaxed); ------------------ | Branch (1830:5): [True: 460M, False: 0] ------------------ 1831| 460M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 460M, False: 0] ------------------ 1832| 460M| return {node, shift, relaxed}; 1833| 460M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 186M| { 1814| 186M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 186M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1431| 311M| 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| 37.2M| { 1477| 37.2M| each_left(v, relaxed_->d.count, args...); 1478| 37.2M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 37.4M| { 1624| 37.4M| auto p = node_->inner(); 1625| 37.4M| auto s = size_t{}; 1626| 37.4M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 8.32M, False: 29.0M] ------------------ 1627| 68.0M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 59.7M, False: 8.32M] ------------------ 1628| 59.7M| IMMER_PREFETCH(p + i + 1); 1629| 59.7M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 59.7M| .visit(v, args...); 1631| 59.7M| s = relaxed_->d.sizes[i]; 1632| 59.7M| assert(s); ------------------ | Branch (1632:17): [True: 59.7M, False: 0] ------------------ 1633| 59.7M| } 1634| 29.0M| } else { 1635| 29.0M| auto ss = shift_ - B; 1636| 206M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 177M, False: 29.0M] ------------------ 1637| 177M| visit_maybe_relaxed_sub( 1638| 177M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 177M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 177M, False: 0] ------------------ 1641| 177M| } 1642| 29.0M| } 1643| 37.4M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1430| 284M| 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| 27.4M|{ 1045| 27.4M| assert(node); ------------------ | Branch (1045:5): [True: 27.4M, False: 0] ------------------ 1046| 27.4M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 27.4M, False: 0] ------------------ 1047| 27.4M| assert(size > 0); ------------------ | Branch (1047:5): [True: 27.4M, False: 0] ------------------ 1048| 27.4M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 27.4M, False: 0] ------------------ 1049| 27.4M| return {node, shift, size}; 1050| 27.4M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1036| 15.3M| { 1037| 15.3M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 15.3M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 785| 27.0M| node_t* node() const { return node_; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 825| 425k| { 826| 425k| return each_regular(*this, v, args...); 827| 425k| } _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| 425k|{ 344| 425k| constexpr auto B = bits; 345| 425k| constexpr auto BL = bits_leaf; 346| 425k| auto n = p.node()->inner(); 347| 425k| auto last = p.count() - 1; 348| 425k| auto e = n + last; 349| 425k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 94.1k, False: 331k] ------------------ 350| 240k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 146k, False: 94.1k] ------------------ 351| 146k| IMMER_PREFETCH(n + 1); 352| 146k| make_full_leaf_pos(*n).visit(v, args...); 353| 146k| } 354| 94.1k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 331k| } else { 356| 331k| auto ss = p.shift() - B; 357| 1.23M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 903k, False: 331k] ------------------ 358| 903k| make_full_pos(*n, ss).visit(v, args...); 359| 331k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 331k| } 361| 425k|} _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.2M|{ 215| 15.2M| assert(node); ------------------ | Branch (215:5): [True: 15.2M, False: 0] ------------------ 216| 15.2M| return {node}; 217| 15.2M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 1.69M| { 208| 1.69M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.69M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 199| 8.96M| 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| 14.1M| 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.74M| 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| 390k| { 113| 390k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 390k| } _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.43M| 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.29M|{ 1413| 4.29M| assert(node); ------------------ | Branch (1413:5): [True: 4.29M, False: 0] ------------------ 1414| 4.29M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 4.29M, False: 0] ------------------ 1415| 4.29M| return {node, shift}; 1416| 4.29M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 2.74M| { 1406| 2.74M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.74M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1159| 3.43M| 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| 98.1k| { 1186| 98.1k| auto p = node_->inner(); 1187| 98.1k| auto e = p + branches; 1188| 98.1k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 85.6k, False: 12.4k] ------------------ 1189| 771k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 685k, False: 85.6k] ------------------ 1190| 685k| IMMER_PREFETCH(p + 1); 1191| 685k| make_full_leaf_pos(*p).visit(v, args...); 1192| 685k| } 1193| 85.6k| } else { 1194| 12.4k| auto ss = shift_ - B; 1195| 112k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 99.7k, False: 12.4k] ------------------ 1196| 99.7k| make_full_pos(*p, ss).visit(v, args...); 1197| 12.4k| } 1198| 98.1k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1158| 1.37M| 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.87M|{ 691| 2.87M| assert(node); ------------------ | Branch (691:5): [True: 2.87M, False: 0] ------------------ 692| 2.87M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 2.87M, False: 0] ------------------ 693| 2.87M| assert(size > 0); ------------------ | Branch (693:5): [True: 2.87M, False: 0] ------------------ 694| 2.87M| return {node, shift, size}; 695| 2.87M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 887k| { 337| 887k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 887k| } _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| 837k| { 244| 837k| return each_regular(*this, v, args...); 245| 837k| } _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| 837k|{ 344| 837k| constexpr auto B = bits; 345| 837k| constexpr auto BL = bits_leaf; 346| 837k| auto n = p.node()->inner(); 347| 837k| auto last = p.count() - 1; 348| 837k| auto e = n + last; 349| 837k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 291k, False: 546k] ------------------ 350| 1.13M| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 840k, False: 291k] ------------------ 351| 840k| IMMER_PREFETCH(n + 1); 352| 840k| make_full_leaf_pos(*n).visit(v, args...); 353| 840k| } 354| 291k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 546k| } else { 356| 546k| auto ss = p.shift() - B; 357| 2.27M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 1.73M, False: 546k] ------------------ 358| 1.73M| make_full_pos(*n, ss).visit(v, args...); 359| 546k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 546k| } 361| 837k|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 233| 4.70M| 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.97M| 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.06M| 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.03M| 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| 21.0M| 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| 25.1M| 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.47M|{ 65| 1.47M| return {node}; 66| 1.47M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 1.47M| { 58| 1.47M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 1.47M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 41| 1.47M| 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.0M|{ 152| 86.0M| assert(node); ------------------ | Branch (152:5): [True: 86.0M, False: 0] ------------------ 153| 86.0M| assert(count <= branches); ------------------ | Branch (153:5): [True: 86.0M, False: 0] ------------------ 154| 86.0M| return {node, count}; 155| 86.0M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 65.3M| { 145| 65.3M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 65.3M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 136| 77.8M| 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| 21.7M| count_t count() const { return count_; } _ZN5immer6detail4rbts19make_empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_14empty_leaf_posIT_EEPSE_: 88| 1.34M|{ 89| 1.34M| assert(node); ------------------ | Branch (89:5): [True: 1.34M, False: 0] ------------------ 90| 1.34M| return {node}; 91| 1.34M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 1.34M| { 82| 1.34M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 1.34M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 75| 1.34M| 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.25k| 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| 233k| { 1814| 233k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 233k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1433| 28.9M| 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.8M| { 1444| 13.8M| return size_sbh(offset, size_before(offset)); 1445| 13.8M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1448| 14.2M| { 1449| 14.2M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 14.2M, False: 0] ------------------ 1450| 14.2M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 14.2M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 1438| 51.0M| { 1439| 51.0M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 33.5M, False: 17.5M] ------------------ 1440| 51.0M| } _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| 218k| { 1738| 218k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 218k, False: 0] ------------------ 1739| 218k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 218k, False: 0] ------------------ 1740| 218k| auto child = node_->inner()[offset_hint]; 1741| 218k| auto is_leaf = shift_ == BL; 1742| 218k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 218k] ------------------ 1743| 218k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 218k| : visit_maybe_relaxed_sub( 1745| 218k| child, shift_ - B, child_size_hint, v, args...); 1746| 218k| } _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| 218k|{ 1839| 218k| assert(node); ------------------ | Branch (1839:5): [True: 218k, False: 0] ------------------ 1840| 218k| auto relaxed = node->relaxed(); 1841| 218k| if (relaxed) { ------------------ | Branch (1841:9): [True: 176k, False: 42.6k] ------------------ 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| 42.6k| return make_regular_sub_pos(node, shift, size) 1847| 42.6k| .visit(v, std::forward(args)...); 1848| 42.6k| } 1849| 218k|} _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| 42.6k| { 1037| 42.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 42.6k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 788| 2.01M| 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| 296k| { 953| 296k| return last_oh_regular(*this, v, offset_hint, args...); 954| 296k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_: 677| 296k|{ 678| 296k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 296k, False: 0] ------------------ 679| 296k| constexpr auto B = bits; 680| 296k| constexpr auto BL = bits_leaf; 681| 296k| auto child = p.node()->inner()[offset_hint]; 682| 296k| auto is_leaf = p.shift() == BL; 683| 296k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 296k] ------------------ 684| 296k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 296k| .visit(v, args...); 686| 296k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 336| 797k| { 337| 797k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 797k| } _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| 501k| { 331| 501k| return last_oh_regular(*this, v, offset_hint, args...); 332| 501k| } _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| 501k|{ 678| 501k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 501k, False: 0] ------------------ 679| 501k| constexpr auto B = bits; 680| 501k| constexpr auto BL = bits_leaf; 681| 501k| auto child = p.node()->inner()[offset_hint]; 682| 501k| auto is_leaf = p.shift() == BL; 683| 501k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 501k] ------------------ 684| 501k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 501k| .visit(v, args...); 686| 501k|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1432| 123M| 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| 285k| { 1037| 285k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 285k| } 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| 58.3k| { 145| 58.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 58.3k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 139| 1.18M| count_t index(size_t idx) const { return idx & mask; } flex-vector-bo.cpp:_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSJ_E_EEEDcPSJ_jmT0_DpOT1_: 1838| 241k|{ 1839| 241k| assert(node); ------------------ | Branch (1839:5): [True: 241k, False: 0] ------------------ 1840| 241k| auto relaxed = node->relaxed(); 1841| 241k| if (relaxed) { ------------------ | Branch (1841:9): [True: 190k, False: 50.8k] ------------------ 1842| 190k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 190k, False: 0] ------------------ 1843| 190k| return make_relaxed_pos(node, shift, relaxed) 1844| 190k| .visit(v, std::forward(args)...); 1845| 190k| } else { 1846| 50.8k| return make_regular_sub_pos(node, shift, size) 1847| 50.8k| .visit(v, std::forward(args)...); 1848| 50.8k| } 1849| 241k|} 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| 190k| { 1814| 190k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 190k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 1454| 15.5M| { 1455| 15.5M| auto offset = idx >> shift_; 1456| 22.0M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 6.54M, False: 15.5M] ------------------ 1457| 6.54M| ++offset; 1458| 15.5M| return offset; 1459| 15.5M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7relaxedEv: 1435| 190k| 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| 190k| { 1687| 190k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 190k, False: 0] ------------------ 1688| 190k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 25.4k, False: 165k] ------------------ 1689| 190k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 190k| } 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| 190k| { 1699| 190k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 190k| } 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| 190k| { 1718| 190k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 190k, False: 0] ------------------ 1719| 190k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 25.4k, False: 165k] | Branch (1719:9): [True: 190k, False: 0] ------------------ 1720| 190k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 190k| auto child = node_->inner()[offset_hint]; 1722| 190k| auto is_leaf = shift_ == BL; 1723| 190k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 190k| auto next_idx = idx - left_size_hint; 1725| 190k| return is_leaf ------------------ | Branch (1725:16): [True: 42.4k, False: 148k] ------------------ 1726| 190k| ? make_leaf_sub_pos(child, next_size) 1727| 42.4k| .visit(v, next_idx, args...) 1728| 190k| : visit_maybe_relaxed_sub( 1729| 148k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 190k| } 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| 42.4k| { 145| 42.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 42.4k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1036| 50.8k| { 1037| 50.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 50.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| 50.8k| { 939| 50.8k| return towards_oh_ch_regular( 940| 50.8k| *this, v, idx, offset_hint, count(), args...); 941| 50.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| 50.8k|{ 633| 50.8k| constexpr auto B = bits; 634| 50.8k| constexpr auto BL = bits_leaf; 635| 50.8k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 50.8k, False: 0] ------------------ 636| 50.8k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 50.8k, False: 0] ------------------ 637| 50.8k| auto is_leaf = p.shift() == BL; 638| 50.8k| auto child = p.node()->inner()[offset_hint]; 639| 50.8k| auto is_full = offset_hint + 1 != count_hint; 640| 50.8k| return is_full ------------------ | Branch (640:12): [True: 15.4k, False: 35.3k] ------------------ 641| 50.8k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 7.49k, False: 8.00k] ------------------ 642| 15.4k| : make_full_pos(child, p.shift() - B) 643| 8.00k| .visit(v, idx, args...)) 644| 50.8k| : (is_leaf ------------------ | Branch (644:19): [True: 31.7k, False: 3.68k] ------------------ 645| 35.3k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 35.3k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.68k| .visit(v, idx, args...)); 648| 50.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| 17.7k| { 208| 17.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 17.7k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 202| 259k| 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.4k| { 1406| 13.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 13.4k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 1162| 525k| 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.4k| { 1330| 13.4k| return towards_oh(v, idx, offset_hint, args...); 1331| 13.4k| } 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.4k| { 1337| 13.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 13.4k, False: 0] ------------------ 1338| 13.4k| auto is_leaf = shift_ == BL; 1339| 13.4k| auto child = node_->inner()[offset_hint]; 1340| 13.4k| return is_leaf ------------------ | Branch (1340:16): [True: 9.32k, False: 4.12k] ------------------ 1341| 13.4k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 13.4k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 13.4k| } 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| 33.1k| { 113| 33.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 33.1k| } 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| 3.99k| { 337| 3.99k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.99k| } 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| 3.99k| { 317| 3.99k| return towards_oh_ch_regular( 318| 3.99k| *this, v, idx, offset_hint, count(), args...); 319| 3.99k| } 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| 3.99k|{ 633| 3.99k| constexpr auto B = bits; 634| 3.99k| constexpr auto BL = bits_leaf; 635| 3.99k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.99k, False: 0] ------------------ 636| 3.99k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.99k, False: 0] ------------------ 637| 3.99k| auto is_leaf = p.shift() == BL; 638| 3.99k| auto child = p.node()->inner()[offset_hint]; 639| 3.99k| auto is_full = offset_hint + 1 != count_hint; 640| 3.99k| return is_full ------------------ | Branch (640:12): [True: 2.27k, False: 1.71k] ------------------ 641| 3.99k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 963, False: 1.31k] ------------------ 642| 2.27k| : make_full_pos(child, p.shift() - B) 643| 1.31k| .visit(v, idx, args...)) 644| 3.99k| : (is_leaf ------------------ | Branch (644:19): [True: 1.40k, False: 311] ------------------ 645| 1.71k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.71k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 311| .visit(v, idx, args...)); 648| 3.99k|} _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| 44.1k|{ 1839| 44.1k| assert(node); ------------------ | Branch (1839:5): [True: 44.1k, False: 0] ------------------ 1840| 44.1k| auto relaxed = node->relaxed(); 1841| 44.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 35.7k, False: 8.37k] ------------------ 1842| 35.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 35.7k, False: 0] ------------------ 1843| 35.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 35.7k| .visit(v, std::forward(args)...); 1845| 35.7k| } else { 1846| 8.37k| return make_regular_sub_pos(node, shift, size) 1847| 8.37k| .visit(v, std::forward(args)...); 1848| 8.37k| } 1849| 44.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| 35.7k| { 1814| 35.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 35.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| 28.1k| { 1687| 28.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 28.1k, False: 0] ------------------ 1688| 28.1k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 28.1k] ------------------ 1689| 28.1k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 28.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1698| 28.1k| { 1699| 28.1k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 28.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 28.1k| { 1718| 28.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 28.1k, False: 0] ------------------ 1719| 28.1k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 28.1k] | Branch (1719:9): [True: 28.1k, False: 0] ------------------ 1720| 28.1k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 28.1k| auto child = node_->inner()[offset_hint]; 1722| 28.1k| auto is_leaf = shift_ == BL; 1723| 28.1k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 28.1k| auto next_idx = idx - left_size_hint; 1725| 28.1k| return is_leaf ------------------ | Branch (1725:16): [True: 1.72k, False: 26.4k] ------------------ 1726| 28.1k| ? make_leaf_sub_pos(child, next_size) 1727| 1.72k| .visit(v, next_idx, args...) 1728| 28.1k| : visit_maybe_relaxed_sub( 1729| 26.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 28.1k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 144| 1.72k| { 145| 1.72k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.72k| } _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| 11.1k| { 1687| 11.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 11.1k, False: 0] ------------------ 1688| 11.1k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.59k, False: 1.51k] ------------------ 1689| 11.1k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 11.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1698| 11.1k| { 1699| 11.1k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 11.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 11.1k| { 1718| 11.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 11.1k, False: 0] ------------------ 1719| 11.1k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.59k, False: 1.51k] | Branch (1719:9): [True: 11.1k, False: 0] ------------------ 1720| 11.1k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 11.1k| auto child = node_->inner()[offset_hint]; 1722| 11.1k| auto is_leaf = shift_ == BL; 1723| 11.1k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 11.1k| auto next_idx = idx - left_size_hint; 1725| 11.1k| return is_leaf ------------------ | Branch (1725:16): [True: 4.36k, False: 6.74k] ------------------ 1726| 11.1k| ? make_leaf_sub_pos(child, next_size) 1727| 4.36k| .visit(v, next_idx, args...) 1728| 11.1k| : visit_maybe_relaxed_sub( 1729| 6.74k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 11.1k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 4.36k| { 145| 4.36k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.36k| } _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.74k|{ 1839| 6.74k| assert(node); ------------------ | Branch (1839:5): [True: 6.74k, False: 0] ------------------ 1840| 6.74k| auto relaxed = node->relaxed(); 1841| 6.74k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.51k, False: 3.23k] ------------------ 1842| 3.51k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.51k, False: 0] ------------------ 1843| 3.51k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.51k| .visit(v, std::forward(args)...); 1845| 3.51k| } else { 1846| 3.23k| return make_regular_sub_pos(node, shift, size) 1847| 3.23k| .visit(v, std::forward(args)...); 1848| 3.23k| } 1849| 6.74k|} _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.51k| { 1814| 3.51k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.51k| } _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.23k| { 1037| 3.23k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.23k| } _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| 6.01k| { 928| 6.01k| return towards_oh_ch_regular( 929| 6.01k| *this, v, idx, offset_hint, count(), args...); 930| 6.01k| } _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| 6.01k|{ 633| 6.01k| constexpr auto B = bits; 634| 6.01k| constexpr auto BL = bits_leaf; 635| 6.01k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.01k, False: 0] ------------------ 636| 6.01k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.01k, False: 0] ------------------ 637| 6.01k| auto is_leaf = p.shift() == BL; 638| 6.01k| auto child = p.node()->inner()[offset_hint]; 639| 6.01k| auto is_full = offset_hint + 1 != count_hint; 640| 6.01k| return is_full ------------------ | Branch (640:12): [True: 2.01k, False: 4.00k] ------------------ 641| 6.01k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.10k, False: 907] ------------------ 642| 2.01k| : make_full_pos(child, p.shift() - B) 643| 907| .visit(v, idx, args...)) 644| 6.01k| : (is_leaf ------------------ | Branch (644:19): [True: 1.45k, False: 2.55k] ------------------ 645| 4.00k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.00k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.55k| .visit(v, idx, args...)); 648| 6.01k|} _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.30k| { 208| 6.30k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.30k| } _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.32k| { 1406| 2.32k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.32k| } _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.31k| { 1337| 5.31k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 5.31k, False: 0] ------------------ 1338| 5.31k| auto is_leaf = shift_ == BL; 1339| 5.31k| auto child = node_->inner()[offset_hint]; 1340| 5.31k| return is_leaf ------------------ | Branch (1340:16): [True: 4.43k, False: 886] ------------------ 1341| 5.31k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 5.31k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 5.31k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1161| 53.4k| 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.71k| { 113| 2.71k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.71k| } _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.11k| { 337| 3.11k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.11k| } _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.11k| { 306| 3.11k| return towards_oh_ch_regular( 307| 3.11k| *this, v, idx, offset_hint, count(), args...); 308| 3.11k| } _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.11k|{ 633| 3.11k| constexpr auto B = bits; 634| 3.11k| constexpr auto BL = bits_leaf; 635| 3.11k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.11k, False: 0] ------------------ 636| 3.11k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.11k, False: 0] ------------------ 637| 3.11k| auto is_leaf = p.shift() == BL; 638| 3.11k| auto child = p.node()->inner()[offset_hint]; 639| 3.11k| auto is_full = offset_hint + 1 != count_hint; 640| 3.11k| return is_full ------------------ | Branch (640:12): [True: 1.29k, False: 1.81k] ------------------ 641| 3.11k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 765, False: 531] ------------------ 642| 1.29k| : make_full_pos(child, p.shift() - B) 643| 531| .visit(v, idx, args...)) 644| 3.11k| : (is_leaf ------------------ | Branch (644:19): [True: 1.25k, False: 562] ------------------ 645| 1.81k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.81k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 562| .visit(v, idx, args...)); 648| 3.11k|} _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.37k| { 1037| 8.37k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.37k| } _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.58k| { 928| 5.58k| return towards_oh_ch_regular( 929| 5.58k| *this, v, idx, offset_hint, count(), args...); 930| 5.58k| } _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.58k|{ 633| 5.58k| constexpr auto B = bits; 634| 5.58k| constexpr auto BL = bits_leaf; 635| 5.58k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.58k, False: 0] ------------------ 636| 5.58k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.58k, False: 0] ------------------ 637| 5.58k| auto is_leaf = p.shift() == BL; 638| 5.58k| auto child = p.node()->inner()[offset_hint]; 639| 5.58k| auto is_full = offset_hint + 1 != count_hint; 640| 5.58k| return is_full ------------------ | Branch (640:12): [True: 4.82k, False: 760] ------------------ 641| 5.58k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.06k, False: 3.75k] ------------------ 642| 4.82k| : make_full_pos(child, p.shift() - B) 643| 3.75k| .visit(v, idx, args...)) 644| 5.58k| : (is_leaf ------------------ | Branch (644:19): [True: 760, False: 0] ------------------ 645| 760| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 760| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.58k|} _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.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_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1405| 5.36k| { 1406| 5.36k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.36k| } _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.36k| { 1337| 2.36k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.36k, False: 0] ------------------ 1338| 2.36k| auto is_leaf = shift_ == BL; 1339| 2.36k| auto child = node_->inner()[offset_hint]; 1340| 2.36k| return is_leaf ------------------ | Branch (1340:16): [True: 761, False: 1.60k] ------------------ 1341| 2.36k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.36k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.36k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 760| { 113| 760| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 760| } _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.5k|{ 1839| 32.5k| assert(node); ------------------ | Branch (1839:5): [True: 32.5k, False: 0] ------------------ 1840| 32.5k| auto relaxed = node->relaxed(); 1841| 32.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 23.9k, False: 8.58k] ------------------ 1842| 23.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 23.9k, False: 0] ------------------ 1843| 23.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 23.9k| .visit(v, std::forward(args)...); 1845| 23.9k| } else { 1846| 8.58k| return make_regular_sub_pos(node, shift, size) 1847| 8.58k| .visit(v, std::forward(args)...); 1848| 8.58k| } 1849| 32.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 23.9k| { 1814| 23.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 23.9k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1434| 4.79M| 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.04k| { 1706| 4.04k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.04k, False: 0] ------------------ 1707| 4.04k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.73k, False: 307] ------------------ 1708| 4.04k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.04k| } _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.04k| { 1718| 4.04k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.04k, False: 0] ------------------ 1719| 4.04k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.73k, False: 307] | Branch (1719:9): [True: 4.04k, False: 0] ------------------ 1720| 4.04k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.04k| auto child = node_->inner()[offset_hint]; 1722| 4.04k| auto is_leaf = shift_ == BL; 1723| 4.04k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.04k| auto next_idx = idx - left_size_hint; 1725| 4.04k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.04k] ------------------ 1726| 4.04k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.04k| : visit_maybe_relaxed_sub( 1729| 4.04k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.04k| } _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| 113k| { 1706| 113k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 113k, False: 0] ------------------ 1707| 113k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 33.3k, False: 80.1k] ------------------ 1708| 113k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 113k| } _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| 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: 33.3k, False: 80.1k] | 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: 18.3k, False: 95.1k] ------------------ 1726| 113k| ? make_leaf_sub_pos(child, next_size) 1727| 18.3k| .visit(v, next_idx, args...) 1728| 113k| : visit_maybe_relaxed_sub( 1729| 95.1k| 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_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 18.3k| { 145| 18.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 18.3k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 95.1k|{ 1839| 95.1k| assert(node); ------------------ | Branch (1839:5): [True: 95.1k, False: 0] ------------------ 1840| 95.1k| auto relaxed = node->relaxed(); 1841| 95.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 93.6k, False: 1.53k] ------------------ 1842| 93.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 93.6k, False: 0] ------------------ 1843| 93.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 93.6k| .visit(v, std::forward(args)...); 1845| 93.6k| } else { 1846| 1.53k| return make_regular_sub_pos(node, shift, size) 1847| 1.53k| .visit(v, std::forward(args)...); 1848| 1.53k| } 1849| 95.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 93.6k| { 1814| 93.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 93.6k| } _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.53k| { 1037| 1.53k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.53k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 791| 2.07M| { 792| 2.07M| return size_t{offset} << shift_; 793| 2.07M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 803| 20.8k| { 804| 20.8k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 20.8k, False: 0] ------------------ 805| 20.8k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 8.35k, False: 12.5k] ------------------ 806| 20.8k| : size_t{1} << shift_; 807| 20.8k| } _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.37k| { 947| 9.37k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 9.37k| } _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.37k|{ 654| 9.37k| constexpr auto B = bits; 655| 9.37k| constexpr auto BL = bits_leaf; 656| 9.37k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 9.37k, False: 0] ------------------ 657| 9.37k| auto is_leaf = p.shift() == BL; 658| 9.37k| auto child = p.node()->inner()[offset_hint]; 659| 9.37k| auto lsize = offset_hint << p.shift(); 660| 9.37k| auto size = p.this_size(); 661| 9.37k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 9.37k| return is_full ------------------ | Branch (662:12): [True: 9.37k, False: 0] ------------------ 663| 9.37k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.81k, False: 4.56k] ------------------ 664| 9.37k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 9.37k| : make_full_pos(child, p.shift() - B) 666| 4.56k| .visit(v, idx - lsize, args...)) 667| 9.37k| : (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.37k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9this_sizeEv: 794| 20.8k| size_t this_size() const { return size_; } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 207| 10.1k| { 208| 10.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.1k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 1405| 7.25k| { 1406| 7.25k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 7.25k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1163| 10.5k| 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| 44.4k| { 1171| 44.4k| return size_t{offset} << shift_; 1172| 44.4k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1166| 10.5k| { 1167| 10.5k| return size_t{1} << shift_; 1168| 10.5k| } _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.99k| { 1349| 7.99k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 7.99k, False: 0] ------------------ 1350| 7.99k| auto is_leaf = shift_ == BL; 1351| 7.99k| auto child = node_->inner()[offset_hint]; 1352| 7.99k| auto lsize = size_t{offset_hint} << shift_; 1353| 7.99k| return is_leaf ------------------ | Branch (1353:16): [True: 5.31k, False: 2.68k] ------------------ 1354| 7.99k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 7.99k| : make_full_pos(child, shift_ - B) 1356| 2.68k| .visit(v, idx - lsize, args...); 1357| 7.99k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1175| 10.5k| { 1176| 10.5k| auto e = sizes + n; 1177| 60.1k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 49.6k, False: 10.5k] ------------------ 1178| 49.6k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 49.6k, False: 0] ------------------ 1180| 49.6k| } 1181| 10.5k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1160| 619k| 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.98M| { 811| 3.98M| if (n) { ------------------ | Branch (811:13): [True: 3.98M, False: 4.38k] ------------------ 812| 3.98M| auto last = offset + n - 1; 813| 3.98M| auto e = sizes + n - 1; 814| 15.9M| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 11.9M, False: 3.98M] ------------------ 815| 11.9M| init = *sizes = init + (size_t{1} << shift_); 816| 11.9M| assert(init); ------------------ | Branch (816:17): [True: 11.9M, False: 0] ------------------ 817| 11.9M| } 818| 3.98M| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 3.98M, False: 0] ------------------ 820| 3.98M| } 821| 3.98M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEj: 797| 4.00M| { 798| 4.00M| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 2.00M, False: 2.00M] ------------------ 799| 4.00M| : size_t{1} << shift_; 800| 4.00M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1462| 22.1M| { 1463| 22.1M| auto e = sizes + n; 1464| 22.1M| auto prev = size_before(offset); 1465| 22.1M| auto these = relaxed_->d.sizes + offset; 1466| 102M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 80.2M, False: 22.1M] ------------------ 1467| 80.2M| auto this_size = *these; 1468| 80.2M| init = *sizes = init + (this_size - prev); 1469| 80.2M| assert(init); ------------------ | Branch (1469:13): [True: 80.2M, False: 0] ------------------ 1470| 80.2M| prev = this_size; 1471| 80.2M| } 1472| 22.1M| } _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.58k| { 1037| 8.58k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.58k| } _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.60k| { 947| 2.60k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.60k| } _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.60k|{ 654| 2.60k| constexpr auto B = bits; 655| 2.60k| constexpr auto BL = bits_leaf; 656| 2.60k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.60k, False: 0] ------------------ 657| 2.60k| auto is_leaf = p.shift() == BL; 658| 2.60k| auto child = p.node()->inner()[offset_hint]; 659| 2.60k| auto lsize = offset_hint << p.shift(); 660| 2.60k| auto size = p.this_size(); 661| 2.60k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.60k| return is_full ------------------ | Branch (662:12): [True: 744, False: 1.85k] ------------------ 663| 2.60k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 744] ------------------ 664| 744| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 744| : make_full_pos(child, p.shift() - B) 666| 744| .visit(v, idx - lsize, args...)) 667| 2.60k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.85k] ------------------ 668| 1.85k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.85k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.85k| .visit(v, idx - lsize, args...)); 672| 2.60k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1405| 744| { 1406| 744| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 744| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1036| 1.85k| { 1037| 1.85k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.85k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaPT_j: 766| 7.25k|{ 767| 7.25k| assert(leaf); ------------------ | Branch (767:5): [True: 7.25k, False: 0] ------------------ 768| 7.25k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 7.25k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 7.25k, False: 0] ------------------ 769| 7.25k| assert(count > 0); ------------------ | Branch (769:5): [True: 7.25k, False: 0] ------------------ 770| 7.25k| return singleton_regular_sub_pos{leaf, count}; 771| 7.25k|} _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.25k| { 760| 7.25k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 7.25k| } _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.25k|{ 1839| 7.25k| assert(node); ------------------ | Branch (1839:5): [True: 7.25k, False: 0] ------------------ 1840| 7.25k| auto relaxed = node->relaxed(); 1841| 7.25k| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.00k, False: 2.25k] ------------------ 1842| 5.00k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.00k, False: 0] ------------------ 1843| 5.00k| return make_relaxed_pos(node, shift, relaxed) 1844| 5.00k| .visit(v, std::forward(args)...); 1845| 5.00k| } else { 1846| 2.25k| return make_regular_sub_pos(node, shift, size) 1847| 2.25k| .visit(v, std::forward(args)...); 1848| 2.25k| } 1849| 7.25k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1813| 5.00k| { 1814| 5.00k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.00k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 735| 25.7k| 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.25k| { 745| 7.25k| } _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.34M| { 145| 8.34M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.34M| } _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| 122M| { 1814| 122M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 122M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 707| 3.59M| { 708| 3.59M| } _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.25k| { 745| 7.25k| } _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.34M| { 145| 8.34M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.34M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 137| 8.34M| 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| 122M| { 1814| 122M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 122M| } _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.59M| { 708| 3.59M| } _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.5k| { 1763| 17.5k| auto child = node_->inner()[0]; 1764| 17.5k| auto child_size = relaxed_->d.sizes[0]; 1765| 17.5k| auto is_leaf = shift_ == BL; 1766| 17.5k| assert(child_size); ------------------ | Branch (1766:9): [True: 17.5k, False: 0] ------------------ 1767| 17.5k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 17.5k] ------------------ 1768| 17.5k| : visit_maybe_relaxed_sub( 1769| 17.5k| child, shift_ - B, child_size, v, args...); 1770| 17.5k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 76| 7.25k| 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.21M| 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.5k|{ 1839| 17.5k| assert(node); ------------------ | Branch (1839:5): [True: 17.5k, False: 0] ------------------ 1840| 17.5k| auto relaxed = node->relaxed(); 1841| 17.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 17.2k, False: 300] ------------------ 1842| 17.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 17.2k, False: 0] ------------------ 1843| 17.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 17.2k| .visit(v, std::forward(args)...); 1845| 17.2k| } else { 1846| 300| return make_regular_sub_pos(node, shift, size) 1847| 300| .visit(v, std::forward(args)...); 1848| 300| } 1849| 17.5k|} _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| 17.2k| { 1814| 17.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 17.2k| } _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| 300| { 1037| 300| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 300| } _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| 658| { 971| 658| auto is_leaf = shift_ == BL; 972| 658| auto child = node_->inner()[0]; 973| 658| auto is_full = size_ >= (size_t{1} << shift_); 974| 658| return is_full ------------------ | Branch (974:16): [True: 658, False: 0] ------------------ 975| 658| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 658] ------------------ 976| 658| ? make_full_leaf_pos(child).visit(v, args...) 977| 658| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 658| : (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| 658| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 201| 442k| 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| 906| { 1406| 906| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 906| } _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| 248| { 1362| 248| auto is_leaf = shift_ == BL; 1363| 248| auto child = node_->inner()[0]; 1364| 248| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 248] ------------------ 1365| 248| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 248| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 711| 69.7k| { 712| 69.7k| } _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| 22.8k| { 1305| 22.8k| each_i(v, 1, branches, args...); 1306| 22.8k| } _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| 22.8k| { 1264| 22.8k| auto p = node_->inner() + i; 1265| 22.8k| auto e = node_->inner() + n; 1266| 22.8k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 16.6k, False: 6.18k] ------------------ 1267| 133k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 116k, False: 16.6k] ------------------ 1268| 116k| IMMER_PREFETCH(p + 1); 1269| 116k| make_full_leaf_pos(*p).visit(v, args...); 1270| 116k| } 1271| 16.6k| } else { 1272| 6.18k| auto ss = shift_ - B; 1273| 49.4k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 43.3k, False: 6.18k] ------------------ 1274| 43.3k| make_full_pos(*p, ss).visit(v, args...); 1275| 6.18k| } 1276| 22.8k| } _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.31M| { 208| 6.31M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.31M| } _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| 611k| { 1406| 611k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 611k| } _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| 69.7k| { 712| 69.7k| } _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| 22.8k| { 1305| 22.8k| each_i(v, 1, branches, args...); 1306| 22.8k| } _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| 22.8k| { 1264| 22.8k| auto p = node_->inner() + i; 1265| 22.8k| auto e = node_->inner() + n; 1266| 22.8k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 16.6k, False: 6.18k] ------------------ 1267| 133k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 116k, False: 16.6k] ------------------ 1268| 116k| IMMER_PREFETCH(p + 1); 1269| 116k| make_full_leaf_pos(*p).visit(v, args...); 1270| 116k| } 1271| 16.6k| } else { 1272| 6.18k| auto ss = shift_ - B; 1273| 49.4k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 43.3k, False: 6.18k] ------------------ 1274| 43.3k| make_full_pos(*p, ss).visit(v, args...); 1275| 6.18k| } 1276| 22.8k| } _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.31M| { 208| 6.31M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.31M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 200| 6.31M| 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| 611k| { 1406| 611k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 611k| } _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| 658| { 754| 658| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 658| } _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| 658| { 145| 658| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 658| } _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| 658| { 1371| 658| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 658, False: 0] ------------------ 1372| 658| auto child = node_->inner()[0]; 1373| 658| return make_full_leaf_pos(child).visit(v, args...); 1374| 658| } _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.55k| { 208| 2.55k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.55k| } _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| 442k| { 907| 442k| if (count() > 1) ------------------ | Branch (907:13): [True: 432k, False: 9.75k] ------------------ 908| 432k| each_right_sub_(v, 1, args...); 909| 442k| } _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| 432k| { 880| 432k| auto last = count() - 1; 881| 432k| auto lsize = size_ - (last << shift_); 882| 432k| auto n = node()->inner() + i; 883| 432k| auto e = node()->inner() + last; 884| 432k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 415k, False: 16.6k] ------------------ 885| 2.90M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.48M, False: 415k] ------------------ 886| 2.48M| IMMER_PREFETCH(n + 1); 887| 2.48M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.48M| } 889| 415k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 415k| } else { 891| 16.6k| auto ss = shift_ - B; 892| 79.4k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 62.7k, False: 16.6k] ------------------ 893| 62.7k| make_full_pos(*n, ss).visit(v, args...); 894| 16.6k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 16.6k| } 896| 432k| } _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.46M| { 1037| 4.46M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.46M| } _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| 442k| { 907| 442k| if (count() > 1) ------------------ | Branch (907:13): [True: 432k, False: 9.75k] ------------------ 908| 432k| each_right_sub_(v, 1, args...); 909| 442k| } _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| 432k| { 880| 432k| auto last = count() - 1; 881| 432k| auto lsize = size_ - (last << shift_); 882| 432k| auto n = node()->inner() + i; 883| 432k| auto e = node()->inner() + last; 884| 432k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 415k, False: 16.6k] ------------------ 885| 2.90M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.48M, False: 415k] ------------------ 886| 2.48M| IMMER_PREFETCH(n + 1); 887| 2.48M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.48M| } 889| 415k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 415k| } else { 891| 16.6k| auto ss = shift_ - B; 892| 79.4k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 62.7k, False: 16.6k] ------------------ 893| 62.7k| make_full_pos(*n, ss).visit(v, args...); 894| 16.6k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 16.6k| } 896| 432k| } _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.46M| { 1037| 4.46M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.46M| } _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.89k| { 754| 1.89k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 1.89k| } _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.89k| { 145| 1.89k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.89k| } _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.89k| { 987| 1.89k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 1.89k, False: 0] ------------------ 988| 1.89k| auto child = node_->inner()[0]; 989| 1.89k| auto is_full = size_ >= branches; 990| 1.89k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 1.89k, False: 0] ------------------ 991| 1.89k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 1.89k| } _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.70k| { 145| 4.70k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.70k| } _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.3M| { 1648| 10.3M| each_right(v, 1, std::forward(args)...); 1649| 10.3M| } _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.3M| { 1654| 10.3M| assert(start > 0); ------------------ | Branch (1654:9): [True: 10.3M, False: 0] ------------------ 1655| 10.3M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 10.3M, False: 0] ------------------ 1656| 10.3M| auto s = relaxed_->d.sizes[start - 1]; 1657| 10.3M| auto p = node_->inner(); 1658| 10.3M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 722k, False: 9.67M] ------------------ 1659| 3.63M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 2.91M, False: 722k] ------------------ 1660| 2.91M| IMMER_PREFETCH(p + i + 1); 1661| 2.91M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 2.91M| .visit(v, args...); 1663| 2.91M| s = relaxed_->d.sizes[i]; 1664| 2.91M| assert(s); ------------------ | Branch (1664:17): [True: 2.91M, False: 0] ------------------ 1665| 2.91M| } 1666| 9.67M| } else { 1667| 9.67M| auto ss = shift_ - B; 1668| 70.3M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 60.7M, False: 9.67M] ------------------ 1669| 60.7M| visit_maybe_relaxed_sub( 1670| 60.7M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 60.7M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 60.7M, False: 0] ------------------ 1673| 60.7M| } 1674| 9.67M| } 1675| 10.3M| } _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| 104M|{ 1839| 104M| assert(node); ------------------ | Branch (1839:5): [True: 104M, False: 0] ------------------ 1840| 104M| auto relaxed = node->relaxed(); 1841| 104M| if (relaxed) { ------------------ | Branch (1841:9): [True: 99.7M, False: 4.44M] ------------------ 1842| 99.7M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 99.7M, False: 0] ------------------ 1843| 99.7M| return make_relaxed_pos(node, shift, relaxed) 1844| 99.7M| .visit(v, std::forward(args)...); 1845| 99.7M| } else { 1846| 4.44M| return make_regular_sub_pos(node, shift, size) 1847| 4.44M| .visit(v, std::forward(args)...); 1848| 4.44M| } 1849| 104M|} _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.3M| { 1648| 10.3M| each_right(v, 1, std::forward(args)...); 1649| 10.3M| } _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.3M| { 1654| 10.3M| assert(start > 0); ------------------ | Branch (1654:9): [True: 10.3M, False: 0] ------------------ 1655| 10.3M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 10.3M, False: 0] ------------------ 1656| 10.3M| auto s = relaxed_->d.sizes[start - 1]; 1657| 10.3M| auto p = node_->inner(); 1658| 10.3M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 722k, False: 9.67M] ------------------ 1659| 3.63M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 2.91M, False: 722k] ------------------ 1660| 2.91M| IMMER_PREFETCH(p + i + 1); 1661| 2.91M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 2.91M| .visit(v, args...); 1663| 2.91M| s = relaxed_->d.sizes[i]; 1664| 2.91M| assert(s); ------------------ | Branch (1664:17): [True: 2.91M, False: 0] ------------------ 1665| 2.91M| } 1666| 9.67M| } else { 1667| 9.67M| auto ss = shift_ - B; 1668| 70.3M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 60.7M, False: 9.67M] ------------------ 1669| 60.7M| visit_maybe_relaxed_sub( 1670| 60.7M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 60.7M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 60.7M, False: 0] ------------------ 1673| 60.7M| } 1674| 9.67M| } 1675| 10.3M| } _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| 104M|{ 1839| 104M| assert(node); ------------------ | Branch (1839:5): [True: 104M, False: 0] ------------------ 1840| 104M| auto relaxed = node->relaxed(); 1841| 104M| if (relaxed) { ------------------ | Branch (1841:9): [True: 99.7M, False: 4.44M] ------------------ 1842| 99.7M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 99.7M, False: 0] ------------------ 1843| 99.7M| return make_relaxed_pos(node, shift, relaxed) 1844| 99.7M| .visit(v, std::forward(args)...); 1845| 99.7M| } else { 1846| 4.44M| return make_regular_sub_pos(node, shift, size) 1847| 4.44M| .visit(v, std::forward(args)...); 1848| 4.44M| } 1849| 104M|} _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.70k| { 754| 4.70k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 4.70k| } _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.70k| { 145| 4.70k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.70k| } _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.70k| { 1775| 4.70k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 4.70k, False: 0] ------------------ 1776| 4.70k| auto child = node_->inner()[0]; 1777| 4.70k| auto child_size = relaxed_->d.sizes[0]; 1778| 4.70k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 4.70k| } _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.25k| { 1037| 2.25k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.25k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcPT_jmT0_DpOT1_: 1838| 1.15M|{ 1839| 1.15M| assert(node); ------------------ | Branch (1839:5): [True: 1.15M, False: 0] ------------------ 1840| 1.15M| auto relaxed = node->relaxed(); 1841| 1.15M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.14M, False: 16.5k] ------------------ 1842| 1.14M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.14M, False: 0] ------------------ 1843| 1.14M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.14M| .visit(v, std::forward(args)...); 1845| 1.14M| } else { 1846| 16.5k| return make_regular_sub_pos(node, shift, size) 1847| 16.5k| .visit(v, std::forward(args)...); 1848| 16.5k| } 1849| 1.15M|} _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.14M| { 1814| 1.14M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.14M| } _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.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.13M, False: 7.52k] ------------------ 1842| 1.13M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.13M, False: 0] ------------------ 1843| 1.13M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.13M| .visit(v, std::forward(args)...); 1845| 1.13M| } else { 1846| 7.52k| return make_regular_sub_pos(node, shift, size) 1847| 7.52k| .visit(v, std::forward(args)...); 1848| 7.52k| } 1849| 1.14M|} _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.13M| { 1814| 1.13M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.13M| } _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.58M| { 1751| 3.58M| auto offset = relaxed_->d.count - 1; 1752| 3.58M| auto child = node_->inner()[offset]; 1753| 3.58M| auto child_size = size(offset); 1754| 3.58M| auto is_leaf = shift_ == BL; 1755| 3.58M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 3.58M] ------------------ 1756| 3.58M| : visit_maybe_relaxed_sub( 1757| 3.58M| child, shift_ - B, child_size, v, args...); 1758| 3.58M| } _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.58M|{ 1839| 3.58M| assert(node); ------------------ | Branch (1839:5): [True: 3.58M, False: 0] ------------------ 1840| 3.58M| auto relaxed = node->relaxed(); 1841| 3.58M| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.57M, False: 2.35k] ------------------ 1842| 3.57M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.57M, False: 0] ------------------ 1843| 3.57M| return make_relaxed_pos(node, shift, relaxed) 1844| 3.57M| .visit(v, std::forward(args)...); 1845| 3.57M| } else { 1846| 2.35k| return make_regular_sub_pos(node, shift, size) 1847| 2.35k| .visit(v, std::forward(args)...); 1848| 2.35k| } 1849| 3.58M|} _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.57M| { 1814| 3.57M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.57M| } _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.87k| { 1037| 4.87k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.87k| } _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.51k| { 959| 2.51k| auto offset = count() - 1; 960| 2.51k| auto child = node_->inner()[offset]; 961| 2.51k| auto is_leaf = shift_ == BL; 962| 2.51k| auto lsize = size_ - (size_t{offset} << shift_); 963| 2.51k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 2.51k] ------------------ 964| 2.51k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 2.51k| .visit(v, args...); 966| 2.51k| } _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.61M| { 914| 1.61M| each_left(v, count() - 1, args...); 915| 1.61M| } _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.61M| { 874| 1.61M| return each_left_regular(*this, v, last, args...); 875| 1.61M| } _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.61M|{ 576| 1.61M| constexpr auto B = bits; 577| 1.61M| constexpr auto BL = bits_leaf; 578| 1.61M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.61M, False: 0] ------------------ 579| 1.61M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 897k, False: 721k] ------------------ 580| 897k| auto n = p.node()->inner(); 581| 897k| auto e = n + last; 582| 4.61M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.71M, False: 897k] ------------------ 583| 3.71M| IMMER_PREFETCH(n + 1); 584| 3.71M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.71M| } 586| 897k| } else { 587| 721k| auto n = p.node()->inner(); 588| 721k| auto e = n + last; 589| 721k| auto ss = p.shift() - B; 590| 1.22M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 505k, False: 721k] ------------------ 591| 505k| make_full_pos(*n, ss).visit(v, args...); 592| 721k| } 593| 1.61M|} _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.61M| { 914| 1.61M| each_left(v, count() - 1, args...); 915| 1.61M| } _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.61M| { 874| 1.61M| return each_left_regular(*this, v, last, args...); 875| 1.61M| } _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.61M|{ 576| 1.61M| constexpr auto B = bits; 577| 1.61M| constexpr auto BL = bits_leaf; 578| 1.61M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.61M, False: 0] ------------------ 579| 1.61M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 897k, False: 721k] ------------------ 580| 897k| auto n = p.node()->inner(); 581| 897k| auto e = n + last; 582| 4.61M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.71M, False: 897k] ------------------ 583| 3.71M| IMMER_PREFETCH(n + 1); 584| 3.71M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.71M| } 586| 897k| } else { 587| 721k| auto n = p.node()->inner(); 588| 721k| auto e = n + last; 589| 721k| auto ss = p.shift() - B; 590| 1.22M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 505k, False: 721k] ------------------ 591| 505k| make_full_pos(*n, ss).visit(v, args...); 592| 721k| } 593| 1.61M|} _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.58M| { 1763| 1.58M| auto child = node_->inner()[0]; 1764| 1.58M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.58M| auto is_leaf = shift_ == BL; 1766| 1.58M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.58M, False: 0] ------------------ 1767| 1.58M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.58M] ------------------ 1768| 1.58M| : visit_maybe_relaxed_sub( 1769| 1.58M| child, shift_ - B, child_size, v, args...); 1770| 1.58M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 106| 1.15M| 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.58M|{ 1839| 1.58M| assert(node); ------------------ | Branch (1839:5): [True: 1.58M, False: 0] ------------------ 1840| 1.58M| auto relaxed = node->relaxed(); 1841| 1.58M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.16M, False: 421k] ------------------ 1842| 1.16M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.16M, False: 0] ------------------ 1843| 1.16M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.16M| .visit(v, std::forward(args)...); 1845| 1.16M| } else { 1846| 421k| return make_regular_sub_pos(node, shift, size) 1847| 421k| .visit(v, std::forward(args)...); 1848| 421k| } 1849| 1.58M|} _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.16M| { 1814| 1.16M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.16M| } _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| 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_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 958| 881| { 959| 881| auto offset = count() - 1; 960| 881| auto child = node_->inner()[offset]; 961| 881| auto is_leaf = shift_ == BL; 962| 881| auto lsize = size_ - (size_t{offset} << shift_); 963| 881| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 881] ------------------ 964| 881| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 881| .visit(v, args...); 966| 881| } _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.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_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 14.9k| { 971| 14.9k| auto is_leaf = shift_ == BL; 972| 14.9k| auto child = node_->inner()[0]; 973| 14.9k| auto is_full = size_ >= (size_t{1} << shift_); 974| 14.9k| return is_full ------------------ | Branch (974:16): [True: 14.9k, False: 0] ------------------ 975| 14.9k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 14.9k] ------------------ 976| 14.9k| ? make_full_leaf_pos(child).visit(v, args...) 977| 14.9k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 14.9k| : (is_leaf ------------------ | Branch (978:23): [True: 0, False: 0] ------------------ 979| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 980| 0| : make_regular_sub_pos(child, shift_ - B, size_) 981| 0| .visit(v, args...)); 982| 14.9k| } _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| 20.4k| { 1406| 20.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 20.4k| } _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| 5.49k| { 1362| 5.49k| auto is_leaf = shift_ == BL; 1363| 5.49k| auto child = node_->inner()[0]; 1364| 5.49k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 5.49k] ------------------ 1365| 5.49k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 5.49k| } _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| 20.2k| { 959| 20.2k| auto offset = count() - 1; 960| 20.2k| auto child = node_->inner()[offset]; 961| 20.2k| auto is_leaf = shift_ == BL; 962| 20.2k| auto lsize = size_ - (size_t{offset} << shift_); 963| 20.2k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 15.1k, False: 5.06k] ------------------ 964| 20.2k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 5.06k| .visit(v, args...); 966| 20.2k| } _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| 16.0k| { 145| 16.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 16.0k| } _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| 16.0k| { 1371| 16.0k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 16.0k, False: 0] ------------------ 1372| 16.0k| auto child = node_->inner()[0]; 1373| 16.0k| return make_full_leaf_pos(child).visit(v, args...); 1374| 16.0k| } _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| 439k| { 208| 439k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 439k| } _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| 5.27k| { 1037| 5.27k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.27k| } _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| 431k| { 959| 431k| auto offset = count() - 1; 960| 431k| auto child = node_->inner()[offset]; 961| 431k| auto is_leaf = shift_ == BL; 962| 431k| auto lsize = size_ - (size_t{offset} << shift_); 963| 431k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 420k, False: 10.5k] ------------------ 964| 431k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 10.5k| .visit(v, args...); 966| 431k| } _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| 423k| { 145| 423k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 423k| } _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| 423k| { 987| 423k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 423k, False: 0] ------------------ 988| 423k| auto child = node_->inner()[0]; 989| 423k| auto is_full = size_ >= branches; 990| 423k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 423k, False: 0] ------------------ 991| 423k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 423k| } _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| 717k| { 145| 717k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 717k| } _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| 14.4k| { 1037| 14.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 14.4k| } _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.16M| { 959| 1.16M| auto offset = count() - 1; 960| 1.16M| auto child = node_->inner()[offset]; 961| 1.16M| auto is_leaf = shift_ == BL; 962| 1.16M| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.16M| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 461k, False: 702k] ------------------ 964| 1.16M| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 702k| .visit(v, args...); 966| 1.16M| } _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| 717k| { 145| 717k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 717k| } _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| 717k| { 1775| 717k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 717k, False: 0] ------------------ 1776| 717k| auto child = node_->inner()[0]; 1777| 717k| auto child_size = relaxed_->d.sizes[0]; 1778| 717k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 717k| } _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.57M| { 1037| 1.57M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.57M| } _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.7M| { 1618| 12.7M| each_left(v, relaxed_->d.count - 1, args...); 1619| 12.7M| } _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.7M| { 1624| 12.7M| auto p = node_->inner(); 1625| 12.7M| auto s = size_t{}; 1626| 12.7M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 259k, False: 12.5M] ------------------ 1627| 1.79M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 1.53M, False: 259k] ------------------ 1628| 1.53M| IMMER_PREFETCH(p + i + 1); 1629| 1.53M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 1.53M| .visit(v, args...); 1631| 1.53M| s = relaxed_->d.sizes[i]; 1632| 1.53M| assert(s); ------------------ | Branch (1632:17): [True: 1.53M, False: 0] ------------------ 1633| 1.53M| } 1634| 12.5M| } else { 1635| 12.5M| auto ss = shift_ - B; 1636| 56.0M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 43.5M, False: 12.5M] ------------------ 1637| 43.5M| visit_maybe_relaxed_sub( 1638| 43.5M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 43.5M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 43.5M, False: 0] ------------------ 1641| 43.5M| } 1642| 12.5M| } 1643| 12.7M| } _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.7M| { 1618| 12.7M| each_left(v, relaxed_->d.count - 1, args...); 1619| 12.7M| } _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.7M| { 1624| 12.7M| auto p = node_->inner(); 1625| 12.7M| auto s = size_t{}; 1626| 12.7M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 259k, False: 12.5M] ------------------ 1627| 1.79M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 1.53M, False: 259k] ------------------ 1628| 1.53M| IMMER_PREFETCH(p + i + 1); 1629| 1.53M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 1.53M| .visit(v, args...); 1631| 1.53M| s = relaxed_->d.sizes[i]; 1632| 1.53M| assert(s); ------------------ | Branch (1632:17): [True: 1.53M, False: 0] ------------------ 1633| 1.53M| } 1634| 12.5M| } else { 1635| 12.5M| auto ss = shift_ - B; 1636| 56.0M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 43.5M, False: 12.5M] ------------------ 1637| 43.5M| visit_maybe_relaxed_sub( 1638| 43.5M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 43.5M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 43.5M, False: 0] ------------------ 1641| 43.5M| } 1642| 12.5M| } 1643| 12.7M| } _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| 8.07M| { 1763| 8.07M| auto child = node_->inner()[0]; 1764| 8.07M| auto child_size = relaxed_->d.sizes[0]; 1765| 8.07M| auto is_leaf = shift_ == BL; 1766| 8.07M| assert(child_size); ------------------ | Branch (1766:9): [True: 8.07M, False: 0] ------------------ 1767| 8.07M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 8.07M] ------------------ 1768| 8.07M| : visit_maybe_relaxed_sub( 1769| 8.07M| child, shift_ - B, child_size, v, args...); 1770| 8.07M| } _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| 8.07M|{ 1839| 8.07M| assert(node); ------------------ | Branch (1839:5): [True: 8.07M, False: 0] ------------------ 1840| 8.07M| auto relaxed = node->relaxed(); 1841| 8.07M| if (relaxed) { ------------------ | Branch (1841:9): [True: 8.07M, False: 768] ------------------ 1842| 8.07M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 8.07M, False: 0] ------------------ 1843| 8.07M| return make_relaxed_pos(node, shift, relaxed) 1844| 8.07M| .visit(v, std::forward(args)...); 1845| 8.07M| } else { 1846| 768| return make_regular_sub_pos(node, shift, size) 1847| 768| .visit(v, std::forward(args)...); 1848| 768| } 1849| 8.07M|} _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| 8.07M| { 1814| 8.07M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 8.07M| } _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| 768| { 1037| 768| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 768| } _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| 11.0k| { 1751| 11.0k| auto offset = relaxed_->d.count - 1; 1752| 11.0k| auto child = node_->inner()[offset]; 1753| 11.0k| auto child_size = size(offset); 1754| 11.0k| auto is_leaf = shift_ == BL; 1755| 11.0k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 11.0k] ------------------ 1756| 11.0k| : visit_maybe_relaxed_sub( 1757| 11.0k| child, shift_ - B, child_size, v, args...); 1758| 11.0k| } _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| 11.0k|{ 1839| 11.0k| assert(node); ------------------ | Branch (1839:5): [True: 11.0k, False: 0] ------------------ 1840| 11.0k| auto relaxed = node->relaxed(); 1841| 11.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.6k, False: 407] ------------------ 1842| 10.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 10.6k, False: 0] ------------------ 1843| 10.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 10.6k| .visit(v, std::forward(args)...); 1845| 10.6k| } else { 1846| 407| return make_regular_sub_pos(node, shift, size) 1847| 407| .visit(v, std::forward(args)...); 1848| 407| } 1849| 11.0k|} _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| 10.6k| { 1814| 10.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 10.6k| } _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.06k| { 971| 1.06k| auto is_leaf = shift_ == BL; 972| 1.06k| auto child = node_->inner()[0]; 973| 1.06k| auto is_full = size_ >= (size_t{1} << shift_); 974| 1.06k| return is_full ------------------ | Branch (974:16): [True: 1.06k, False: 0] ------------------ 975| 1.06k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 1.06k] ------------------ 976| 1.06k| ? make_full_leaf_pos(child).visit(v, args...) 977| 1.06k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 1.06k| : (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.06k| } _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.50k| { 1406| 1.50k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.50k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 448| { 1362| 448| auto is_leaf = shift_ == BL; 1363| 448| auto child = node_->inner()[0]; 1364| 448| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 448] ------------------ 1365| 448| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 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_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1750| 1.31k| { 1751| 1.31k| auto offset = relaxed_->d.count - 1; 1752| 1.31k| auto child = node_->inner()[offset]; 1753| 1.31k| auto child_size = size(offset); 1754| 1.31k| auto is_leaf = shift_ == BL; 1755| 1.31k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 855, False: 458] ------------------ 1756| 1.31k| : visit_maybe_relaxed_sub( 1757| 458| child, shift_ - B, child_size, v, args...); 1758| 1.31k| } _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| 458|{ 1839| 458| assert(node); ------------------ | Branch (1839:5): [True: 458, False: 0] ------------------ 1840| 458| auto relaxed = node->relaxed(); 1841| 458| if (relaxed) { ------------------ | Branch (1841:9): [True: 252, False: 206] ------------------ 1842| 252| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 252, False: 0] ------------------ 1843| 252| return make_relaxed_pos(node, shift, relaxed) 1844| 252| .visit(v, std::forward(args)...); 1845| 252| } else { 1846| 206| return make_regular_sub_pos(node, shift, size) 1847| 206| .visit(v, std::forward(args)...); 1848| 206| } 1849| 458|} _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| 252| { 1814| 252| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 252| } _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| 7.29k| { 1751| 7.29k| auto offset = relaxed_->d.count - 1; 1752| 7.29k| auto child = node_->inner()[offset]; 1753| 7.29k| auto child_size = size(offset); 1754| 7.29k| auto is_leaf = shift_ == BL; 1755| 7.29k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 2.88k, False: 4.40k] ------------------ 1756| 7.29k| : visit_maybe_relaxed_sub( 1757| 4.40k| child, shift_ - B, child_size, v, args...); 1758| 7.29k| } _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.40k|{ 1839| 4.40k| assert(node); ------------------ | Branch (1839:5): [True: 4.40k, False: 0] ------------------ 1840| 4.40k| auto relaxed = node->relaxed(); 1841| 4.40k| if (relaxed) { ------------------ | Branch (1841:9): [True: 465, False: 3.94k] ------------------ 1842| 465| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 465, False: 0] ------------------ 1843| 465| return make_relaxed_pos(node, shift, relaxed) 1844| 465| .visit(v, std::forward(args)...); 1845| 3.94k| } else { 1846| 3.94k| return make_regular_sub_pos(node, shift, size) 1847| 3.94k| .visit(v, std::forward(args)...); 1848| 3.94k| } 1849| 4.40k|} _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| 465| { 1814| 465| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 465| } _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| 9.16M| { 1751| 9.16M| auto offset = relaxed_->d.count - 1; 1752| 9.16M| auto child = node_->inner()[offset]; 1753| 9.16M| auto child_size = size(offset); 1754| 9.16M| auto is_leaf = shift_ == BL; 1755| 9.16M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 255k, False: 8.90M] ------------------ 1756| 9.16M| : visit_maybe_relaxed_sub( 1757| 8.90M| child, shift_ - B, child_size, v, args...); 1758| 9.16M| } _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.90M|{ 1839| 8.90M| assert(node); ------------------ | Branch (1839:5): [True: 8.90M, False: 0] ------------------ 1840| 8.90M| auto relaxed = node->relaxed(); 1841| 8.90M| if (relaxed) { ------------------ | Branch (1841:9): [True: 8.03M, False: 874k] ------------------ 1842| 8.03M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 8.03M, False: 0] ------------------ 1843| 8.03M| return make_relaxed_pos(node, shift, relaxed) 1844| 8.03M| .visit(v, std::forward(args)...); 1845| 8.03M| } else { 1846| 874k| return make_regular_sub_pos(node, shift, size) 1847| 874k| .visit(v, std::forward(args)...); 1848| 874k| } 1849| 8.90M|} _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| 8.03M| { 1814| 8.03M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 8.03M| } _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| 7.52k| { 1037| 7.52k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.52k| } _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.5k| { 1037| 16.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 16.5k| } _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.5k|{ 1839| 16.5k| assert(node); ------------------ | Branch (1839:5): [True: 16.5k, False: 0] ------------------ 1840| 16.5k| auto relaxed = node->relaxed(); 1841| 16.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.79k, False: 9.72k] ------------------ 1842| 6.79k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.79k, False: 0] ------------------ 1843| 6.79k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.79k| .visit(v, std::forward(args)...); 1845| 9.72k| } else { 1846| 9.72k| return make_regular_sub_pos(node, shift, size) 1847| 9.72k| .visit(v, std::forward(args)...); 1848| 9.72k| } 1849| 16.5k|} _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.79k| { 1814| 6.79k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.79k| } _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.72k| { 1037| 9.72k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 9.72k| } _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| 219k| { 1814| 219k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 219k| } _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| 213k| { 1738| 213k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 213k, False: 0] ------------------ 1739| 213k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 213k, False: 0] ------------------ 1740| 213k| auto child = node_->inner()[offset_hint]; 1741| 213k| auto is_leaf = shift_ == BL; 1742| 213k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 213k] ------------------ 1743| 213k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 213k| : visit_maybe_relaxed_sub( 1745| 213k| child, shift_ - B, child_size_hint, v, args...); 1746| 213k| } _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| 213k|{ 1839| 213k| assert(node); ------------------ | Branch (1839:5): [True: 213k, False: 0] ------------------ 1840| 213k| auto relaxed = node->relaxed(); 1841| 213k| if (relaxed) { ------------------ | Branch (1841:9): [True: 38.8k, False: 174k] ------------------ 1842| 38.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 38.8k, False: 0] ------------------ 1843| 38.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 38.8k| .visit(v, std::forward(args)...); 1845| 174k| } else { 1846| 174k| return make_regular_sub_pos(node, shift, size) 1847| 174k| .visit(v, std::forward(args)...); 1848| 174k| } 1849| 213k|} _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| 174k| { 1037| 174k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 174k| } _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| 354k| { 953| 354k| return last_oh_regular(*this, v, offset_hint, args...); 954| 354k| } _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| 354k|{ 678| 354k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 354k, False: 0] ------------------ 679| 354k| constexpr auto B = bits; 680| 354k| constexpr auto BL = bits_leaf; 681| 354k| auto child = p.node()->inner()[offset_hint]; 682| 354k| auto is_leaf = p.shift() == BL; 683| 354k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 354k] ------------------ 684| 354k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 354k| .visit(v, args...); 686| 354k|} _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.14M| { 337| 1.14M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.14M| } _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| 785k| { 331| 785k| return last_oh_regular(*this, v, offset_hint, args...); 332| 785k| } _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| 785k|{ 678| 785k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 785k, False: 0] ------------------ 679| 785k| constexpr auto B = bits; 680| 785k| constexpr auto BL = bits_leaf; 681| 785k| auto child = p.node()->inner()[offset_hint]; 682| 785k| auto is_leaf = p.shift() == BL; 683| 785k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 785k] ------------------ 684| 785k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 785k| .visit(v, args...); 686| 785k|} _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.68k| { 331| 2.68k| return last_oh_regular(*this, v, offset_hint, args...); 332| 2.68k| } _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.68k|{ 678| 2.68k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 2.68k, False: 0] ------------------ 679| 2.68k| constexpr auto B = bits; 680| 2.68k| constexpr auto BL = bits_leaf; 681| 2.68k| auto child = p.node()->inner()[offset_hint]; 682| 2.68k| auto is_leaf = p.shift() == BL; 683| 2.68k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 2.68k] ------------------ 684| 2.68k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 2.68k| .visit(v, args...); 686| 2.68k|} _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.30k| { 337| 4.30k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.30k| } _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.62k| { 953| 1.62k| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.62k| } _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.62k|{ 678| 1.62k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.62k, False: 0] ------------------ 679| 1.62k| constexpr auto B = bits; 680| 1.62k| constexpr auto BL = bits_leaf; 681| 1.62k| auto child = p.node()->inner()[offset_hint]; 682| 1.62k| auto is_leaf = p.shift() == BL; 683| 1.62k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.62k] ------------------ 684| 1.62k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.62k| .visit(v, args...); 686| 1.62k|} _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.46k| { 1738| 8.46k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 8.46k, False: 0] ------------------ 1739| 8.46k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 8.46k, False: 0] ------------------ 1740| 8.46k| auto child = node_->inner()[offset_hint]; 1741| 8.46k| auto is_leaf = shift_ == BL; 1742| 8.46k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 8.46k] ------------------ 1743| 8.46k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 8.46k| : visit_maybe_relaxed_sub( 1745| 8.46k| child, shift_ - B, child_size_hint, v, args...); 1746| 8.46k| } _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.46k|{ 1839| 8.46k| assert(node); ------------------ | Branch (1839:5): [True: 8.46k, False: 0] ------------------ 1840| 8.46k| auto relaxed = node->relaxed(); 1841| 8.46k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.40k, False: 1.06k] ------------------ 1842| 7.40k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.40k, False: 0] ------------------ 1843| 7.40k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.40k| .visit(v, std::forward(args)...); 1845| 7.40k| } else { 1846| 1.06k| return make_regular_sub_pos(node, shift, size) 1847| 1.06k| .visit(v, std::forward(args)...); 1848| 1.06k| } 1849| 8.46k|} _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.40k| { 1814| 7.40k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.40k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1036| 1.06k| { 1037| 1.06k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.06k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 1036| 192k| { 1037| 192k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 192k| } _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| 20.8k|{ 1839| 20.8k| assert(node); ------------------ | Branch (1839:5): [True: 20.8k, False: 0] ------------------ 1840| 20.8k| auto relaxed = node->relaxed(); 1841| 20.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 18.0k, False: 2.82k] ------------------ 1842| 18.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 18.0k, False: 0] ------------------ 1843| 18.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 18.0k| .visit(v, std::forward(args)...); 1845| 18.0k| } else { 1846| 2.82k| return make_regular_sub_pos(node, shift, size) 1847| 2.82k| .visit(v, std::forward(args)...); 1848| 2.82k| } 1849| 20.8k|} _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.0k| { 1814| 18.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 18.0k| } _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| 108k| { 1687| 108k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 108k, False: 0] ------------------ 1688| 108k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 22.4k, False: 85.6k] ------------------ 1689| 108k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 108k| } _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| 108k| { 1699| 108k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 108k| } _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| 108k| { 1718| 108k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 108k, False: 0] ------------------ 1719| 108k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 22.4k, False: 85.6k] | Branch (1719:9): [True: 108k, False: 0] ------------------ 1720| 108k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 108k| auto child = node_->inner()[offset_hint]; 1722| 108k| auto is_leaf = shift_ == BL; 1723| 108k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 108k| auto next_idx = idx - left_size_hint; 1725| 108k| return is_leaf ------------------ | Branch (1725:16): [True: 16.1k, False: 91.9k] ------------------ 1726| 108k| ? make_leaf_sub_pos(child, next_size) 1727| 16.1k| .visit(v, next_idx, args...) 1728| 108k| : visit_maybe_relaxed_sub( 1729| 91.9k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 108k| } _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.1k| { 145| 16.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 16.1k| } _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| 91.9k|{ 1839| 91.9k| assert(node); ------------------ | Branch (1839:5): [True: 91.9k, False: 0] ------------------ 1840| 91.9k| auto relaxed = node->relaxed(); 1841| 91.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 90.1k, False: 1.85k] ------------------ 1842| 90.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 90.1k, False: 0] ------------------ 1843| 90.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 90.1k| .visit(v, std::forward(args)...); 1845| 90.1k| } else { 1846| 1.85k| return make_regular_sub_pos(node, shift, size) 1847| 1.85k| .visit(v, std::forward(args)...); 1848| 1.85k| } 1849| 91.9k|} _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| 90.1k| { 1814| 90.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 90.1k| } _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.85k| { 1037| 1.85k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.85k| } _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.68k| { 939| 4.68k| return towards_oh_ch_regular( 940| 4.68k| *this, v, idx, offset_hint, count(), args...); 941| 4.68k| } _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.68k|{ 633| 4.68k| constexpr auto B = bits; 634| 4.68k| constexpr auto BL = bits_leaf; 635| 4.68k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.68k, False: 0] ------------------ 636| 4.68k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.68k, False: 0] ------------------ 637| 4.68k| auto is_leaf = p.shift() == BL; 638| 4.68k| auto child = p.node()->inner()[offset_hint]; 639| 4.68k| auto is_full = offset_hint + 1 != count_hint; 640| 4.68k| return is_full ------------------ | Branch (640:12): [True: 2.04k, False: 2.63k] ------------------ 641| 4.68k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 966, False: 1.08k] ------------------ 642| 2.04k| : make_full_pos(child, p.shift() - B) 643| 1.08k| .visit(v, idx, args...)) 644| 4.68k| : (is_leaf ------------------ | Branch (644:19): [True: 1.34k, False: 1.28k] ------------------ 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.28k| .visit(v, idx, args...)); 648| 4.68k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 207| 2.72k| { 208| 2.72k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.72k| } _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.03k| { 1406| 2.03k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.03k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 1329| 2.03k| { 1330| 2.03k| return towards_oh(v, idx, offset_hint, args...); 1331| 2.03k| } _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.03k| { 1337| 2.03k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.03k, False: 0] ------------------ 1338| 2.03k| auto is_leaf = shift_ == BL; 1339| 2.03k| auto child = node_->inner()[offset_hint]; 1340| 2.03k| return is_leaf ------------------ | Branch (1340:16): [True: 1.36k, False: 667] ------------------ 1341| 2.03k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.03k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.03k| } _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.95k| { 113| 1.95k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.95k| } _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.78k| { 337| 1.78k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.78k| } _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.78k| { 317| 1.78k| return towards_oh_ch_regular( 318| 1.78k| *this, v, idx, offset_hint, count(), args...); 319| 1.78k| } _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.78k|{ 633| 1.78k| constexpr auto B = bits; 634| 1.78k| constexpr auto BL = bits_leaf; 635| 1.78k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 1.78k, False: 0] ------------------ 636| 1.78k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 1.78k, False: 0] ------------------ 637| 1.78k| auto is_leaf = p.shift() == BL; 638| 1.78k| auto child = p.node()->inner()[offset_hint]; 639| 1.78k| auto is_full = offset_hint + 1 != count_hint; 640| 1.78k| return is_full ------------------ | Branch (640:12): [True: 674, False: 1.11k] ------------------ 641| 1.78k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 394, False: 280] ------------------ 642| 674| : make_full_pos(child, p.shift() - B) 643| 280| .visit(v, idx, args...)) 644| 1.78k| : (is_leaf ------------------ | Branch (644:19): [True: 608, False: 505] ------------------ 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| 505| .visit(v, idx, args...)); 648| 1.78k|} _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.82k| { 1037| 2.82k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.82k| } _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| 48.5k|{ 1839| 48.5k| assert(node); ------------------ | Branch (1839:5): [True: 48.5k, False: 0] ------------------ 1840| 48.5k| auto relaxed = node->relaxed(); 1841| 48.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 35.8k, False: 12.7k] ------------------ 1842| 35.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 35.8k, False: 0] ------------------ 1843| 35.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 35.8k| .visit(v, std::forward(args)...); 1845| 35.8k| } else { 1846| 12.7k| return make_regular_sub_pos(node, shift, size) 1847| 12.7k| .visit(v, std::forward(args)...); 1848| 12.7k| } 1849| 48.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 35.8k| { 1814| 35.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 35.8k| } _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| 19.2k| { 1687| 19.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 19.2k, False: 0] ------------------ 1688| 19.2k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 19.2k] ------------------ 1689| 19.2k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 19.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_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 19.2k| { 1699| 19.2k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 19.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_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 19.2k| { 1718| 19.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 19.2k, False: 0] ------------------ 1719| 19.2k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 19.2k] | Branch (1719:9): [True: 19.2k, False: 0] ------------------ 1720| 19.2k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 19.2k| auto child = node_->inner()[offset_hint]; 1722| 19.2k| auto is_leaf = shift_ == BL; 1723| 19.2k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 19.2k| auto next_idx = idx - left_size_hint; 1725| 19.2k| return is_leaf ------------------ | Branch (1725:16): [True: 847, False: 18.3k] ------------------ 1726| 19.2k| ? make_leaf_sub_pos(child, next_size) 1727| 847| .visit(v, next_idx, args...) 1728| 19.2k| : visit_maybe_relaxed_sub( 1729| 18.3k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 19.2k| } _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| 847| { 145| 847| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 847| } _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| 15.4k| { 1687| 15.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 15.4k, False: 0] ------------------ 1688| 15.4k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 15.4k] ------------------ 1689| 15.4k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 15.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 15.4k| { 1699| 15.4k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 15.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 15.4k| { 1718| 15.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 15.4k, False: 0] ------------------ 1719| 15.4k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 15.4k] | Branch (1719:9): [True: 15.4k, False: 0] ------------------ 1720| 15.4k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 15.4k| auto child = node_->inner()[offset_hint]; 1722| 15.4k| auto is_leaf = shift_ == BL; 1723| 15.4k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 15.4k| auto next_idx = idx - left_size_hint; 1725| 15.4k| return is_leaf ------------------ | Branch (1725:16): [True: 1.05k, False: 14.4k] ------------------ 1726| 15.4k| ? make_leaf_sub_pos(child, next_size) 1727| 1.05k| .visit(v, next_idx, args...) 1728| 15.4k| : visit_maybe_relaxed_sub( 1729| 14.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 15.4k| } _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| 1.05k| { 145| 1.05k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.05k| } _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| 14.4k|{ 1839| 14.4k| assert(node); ------------------ | Branch (1839:5): [True: 14.4k, False: 0] ------------------ 1840| 14.4k| auto relaxed = node->relaxed(); 1841| 14.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 13.1k, False: 1.24k] ------------------ 1842| 13.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 13.1k, False: 0] ------------------ 1843| 13.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 13.1k| .visit(v, std::forward(args)...); 1845| 13.1k| } else { 1846| 1.24k| return make_regular_sub_pos(node, shift, size) 1847| 1.24k| .visit(v, std::forward(args)...); 1848| 1.24k| } 1849| 14.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| 13.1k| { 1814| 13.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 13.1k| } _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.24k| { 1037| 1.24k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.24k| } _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.59k| { 928| 2.59k| return towards_oh_ch_regular( 929| 2.59k| *this, v, idx, offset_hint, count(), args...); 930| 2.59k| } _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.59k|{ 633| 2.59k| constexpr auto B = bits; 634| 2.59k| constexpr auto BL = bits_leaf; 635| 2.59k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.59k, False: 0] ------------------ 636| 2.59k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.59k, False: 0] ------------------ 637| 2.59k| auto is_leaf = p.shift() == BL; 638| 2.59k| auto child = p.node()->inner()[offset_hint]; 639| 2.59k| auto is_full = offset_hint + 1 != count_hint; 640| 2.59k| return is_full ------------------ | Branch (640:12): [True: 2.18k, False: 410] ------------------ 641| 2.59k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 720, False: 1.46k] ------------------ 642| 2.18k| : make_full_pos(child, p.shift() - B) 643| 1.46k| .visit(v, idx, args...)) 644| 2.59k| : (is_leaf ------------------ | Branch (644:19): [True: 410, False: 0] ------------------ 645| 410| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 410| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.59k|} _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.88k| { 208| 1.88k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.88k| } _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.75k| { 1406| 1.75k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.75k| } _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.45k| { 1337| 1.45k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.45k, False: 0] ------------------ 1338| 1.45k| auto is_leaf = shift_ == BL; 1339| 1.45k| auto child = node_->inner()[offset_hint]; 1340| 1.45k| return is_leaf ------------------ | Branch (1340:16): [True: 1.16k, False: 288] ------------------ 1341| 1.45k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.45k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.45k| } _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.30k| { 1337| 2.30k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.30k, False: 0] ------------------ 1338| 2.30k| auto is_leaf = shift_ == BL; 1339| 2.30k| auto child = node_->inner()[offset_hint]; 1340| 2.30k| return is_leaf ------------------ | Branch (1340:16): [True: 1.41k, False: 891] ------------------ 1341| 2.30k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.30k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.30k| } _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.36k| { 208| 3.36k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.36k| } _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.76k| { 1406| 3.76k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.76k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 3.57k| { 1406| 3.57k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.57k| } _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.26k| { 1337| 9.26k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 9.26k, False: 0] ------------------ 1338| 9.26k| auto is_leaf = shift_ == BL; 1339| 9.26k| auto child = node_->inner()[offset_hint]; 1340| 9.26k| return is_leaf ------------------ | Branch (1340:16): [True: 7.00k, False: 2.26k] ------------------ 1341| 9.26k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 9.26k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 9.26k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 10.1k| { 208| 10.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.1k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 4.97k| { 1406| 4.97k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.97k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 3.48k| { 1311| 3.48k| each_i(v, start, branches, args...); 1312| 3.48k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 3.48k| { 1264| 3.48k| auto p = node_->inner() + i; 1265| 3.48k| auto e = node_->inner() + n; 1266| 3.48k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 2.09k, False: 1.38k] ------------------ 1267| 13.9k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 11.8k, False: 2.09k] ------------------ 1268| 11.8k| IMMER_PREFETCH(p + 1); 1269| 11.8k| make_full_leaf_pos(*p).visit(v, args...); 1270| 11.8k| } 1271| 2.09k| } else { 1272| 1.38k| auto ss = shift_ - B; 1273| 10.6k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 9.24k, False: 1.38k] ------------------ 1274| 9.24k| make_full_pos(*p, ss).visit(v, args...); 1275| 1.38k| } 1276| 3.48k| } _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| 410| { 113| 410| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 410| } _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.68k| { 306| 2.68k| return towards_oh_ch_regular( 307| 2.68k| *this, v, idx, offset_hint, count(), args...); 308| 2.68k| } _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.68k|{ 633| 2.68k| constexpr auto B = bits; 634| 2.68k| constexpr auto BL = bits_leaf; 635| 2.68k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.68k, False: 0] ------------------ 636| 2.68k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.68k, False: 0] ------------------ 637| 2.68k| auto is_leaf = p.shift() == BL; 638| 2.68k| auto child = p.node()->inner()[offset_hint]; 639| 2.68k| auto is_full = offset_hint + 1 != count_hint; 640| 2.68k| return is_full ------------------ | Branch (640:12): [True: 1.76k, False: 922] ------------------ 641| 2.68k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 829, False: 934] ------------------ 642| 1.76k| : make_full_pos(child, p.shift() - B) 643| 934| .visit(v, idx, args...)) 644| 2.68k| : (is_leaf ------------------ | Branch (644:19): [True: 568, False: 354] ------------------ 645| 922| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 922| : make_regular_pos(child, p.shift() - B, p.size()) 647| 354| .visit(v, idx, args...)); 648| 2.68k|} _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.46k| { 113| 1.46k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.46k| } _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.71k| { 337| 3.71k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.71k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 1.35k| { 337| 1.35k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.35k| } _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.38k| { 306| 4.38k| return towards_oh_ch_regular( 307| 4.38k| *this, v, idx, offset_hint, count(), args...); 308| 4.38k| } _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.38k|{ 633| 4.38k| constexpr auto B = bits; 634| 4.38k| constexpr auto BL = bits_leaf; 635| 4.38k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.38k, False: 0] ------------------ 636| 4.38k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.38k, False: 0] ------------------ 637| 4.38k| auto is_leaf = p.shift() == BL; 638| 4.38k| auto child = p.node()->inner()[offset_hint]; 639| 4.38k| auto is_full = offset_hint + 1 != count_hint; 640| 4.38k| return is_full ------------------ | Branch (640:12): [True: 2.28k, False: 2.10k] ------------------ 641| 4.38k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.46k, False: 822] ------------------ 642| 2.28k| : make_full_pos(child, p.shift() - B) 643| 822| .visit(v, idx, args...)) 644| 4.38k| : (is_leaf ------------------ | Branch (644:19): [True: 1.36k, False: 734] ------------------ 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| 734| .visit(v, idx, args...)); 648| 4.38k|} _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.23k| { 113| 2.23k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.23k| } _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.35k| { 337| 3.35k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.35k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 2.68k| { 286| 2.68k| return each_right_regular(*this, v, start, args...); 287| 2.68k| } _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.68k|{ 598| 2.68k| constexpr auto B = bits; 599| 2.68k| constexpr auto BL = bits_leaf; 600| | 601| 2.68k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 1.39k, False: 1.28k] ------------------ 602| 1.39k| auto n = p.node()->inner() + start; 603| 1.39k| auto last = p.count() - 1; 604| 1.39k| auto e = p.node()->inner() + last; 605| 1.39k| if (n <= e) { ------------------ | Branch (605:13): [True: 829, False: 568] ------------------ 606| 2.97k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 2.14k, False: 829] ------------------ 607| 2.14k| IMMER_PREFETCH(n + 1); 608| 2.14k| make_full_leaf_pos(*n).visit(v, args...); 609| 2.14k| } 610| 829| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 829| } 612| 1.39k| } else { 613| 1.28k| auto n = p.node()->inner() + start; 614| 1.28k| auto last = p.count() - 1; 615| 1.28k| auto e = p.node()->inner() + last; 616| 1.28k| auto ss = p.shift() - B; 617| 1.28k| if (n <= e) { ------------------ | Branch (617:13): [True: 934, False: 354] ------------------ 618| 1.99k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.06k, False: 934] ------------------ 619| 1.06k| make_full_pos(*n, ss).visit(v, args...); 620| 934| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 934| } 622| 1.28k| } 623| 2.68k|} _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.31k| { 928| 7.31k| return towards_oh_ch_regular( 929| 7.31k| *this, v, idx, offset_hint, count(), args...); 930| 7.31k| } _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.31k|{ 633| 7.31k| constexpr auto B = bits; 634| 7.31k| constexpr auto BL = bits_leaf; 635| 7.31k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.31k, False: 0] ------------------ 636| 7.31k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.31k, False: 0] ------------------ 637| 7.31k| auto is_leaf = p.shift() == BL; 638| 7.31k| auto child = p.node()->inner()[offset_hint]; 639| 7.31k| auto is_full = offset_hint + 1 != count_hint; 640| 7.31k| return is_full ------------------ | Branch (640:12): [True: 3.06k, False: 4.25k] ------------------ 641| 7.31k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.12k, False: 1.93k] ------------------ 642| 3.06k| : make_full_pos(child, p.shift() - B) 643| 1.93k| .visit(v, idx, args...)) 644| 7.31k| : (is_leaf ------------------ | Branch (644:19): [True: 894, False: 3.36k] ------------------ 645| 4.25k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.25k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.36k| .visit(v, idx, args...)); 648| 7.31k|} _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.01k| { 928| 7.01k| return towards_oh_ch_regular( 929| 7.01k| *this, v, idx, offset_hint, count(), args...); 930| 7.01k| } _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.01k|{ 633| 7.01k| constexpr auto B = bits; 634| 7.01k| constexpr auto BL = bits_leaf; 635| 7.01k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.01k, False: 0] ------------------ 636| 7.01k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.01k, False: 0] ------------------ 637| 7.01k| auto is_leaf = p.shift() == BL; 638| 7.01k| auto child = p.node()->inner()[offset_hint]; 639| 7.01k| auto is_full = offset_hint + 1 != count_hint; 640| 7.01k| return is_full ------------------ | Branch (640:12): [True: 3.52k, False: 3.49k] ------------------ 641| 7.01k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.64k, False: 1.88k] ------------------ 642| 3.52k| : make_full_pos(child, p.shift() - B) 643| 1.88k| .visit(v, idx, args...)) 644| 7.01k| : (is_leaf ------------------ | Branch (644:19): [True: 867, False: 2.62k] ------------------ 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.62k| .visit(v, idx, args...)); 648| 7.01k|} _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.3k| { 868| 12.3k| return each_right_regular(*this, v, start, args...); 869| 12.3k| } _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.3k|{ 598| 12.3k| constexpr auto B = bits; 599| 12.3k| constexpr auto BL = bits_leaf; 600| | 601| 12.3k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 3.87k, False: 8.51k] ------------------ 602| 3.87k| auto n = p.node()->inner() + start; 603| 3.87k| auto last = p.count() - 1; 604| 3.87k| auto e = p.node()->inner() + last; 605| 3.87k| if (n <= e) { ------------------ | Branch (605:13): [True: 2.24k, False: 1.63k] ------------------ 606| 4.89k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 2.65k, False: 2.24k] ------------------ 607| 2.65k| IMMER_PREFETCH(n + 1); 608| 2.65k| make_full_leaf_pos(*n).visit(v, args...); 609| 2.65k| } 610| 2.24k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 2.24k| } 612| 8.51k| } else { 613| 8.51k| auto n = p.node()->inner() + start; 614| 8.51k| auto last = p.count() - 1; 615| 8.51k| auto e = p.node()->inner() + last; 616| 8.51k| auto ss = p.shift() - B; 617| 8.51k| if (n <= e) { ------------------ | Branch (617:13): [True: 5.15k, False: 3.36k] ------------------ 618| 6.27k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.11k, False: 5.15k] ------------------ 619| 1.11k| make_full_pos(*n, ss).visit(v, args...); 620| 5.15k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 5.15k| } 622| 8.51k| } 623| 12.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 25.5k| { 1814| 25.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 25.5k| } _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.46k| { 1687| 9.46k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 9.46k, False: 0] ------------------ 1688| 9.46k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.05k, False: 408] ------------------ 1689| 9.46k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 9.46k| } _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.46k| { 1699| 9.46k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 9.46k| } _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.46k| { 1718| 9.46k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 9.46k, False: 0] ------------------ 1719| 9.46k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.05k, False: 408] | Branch (1719:9): [True: 9.46k, False: 0] ------------------ 1720| 9.46k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 9.46k| auto child = node_->inner()[offset_hint]; 1722| 9.46k| auto is_leaf = shift_ == BL; 1723| 9.46k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 9.46k| auto next_idx = idx - left_size_hint; 1725| 9.46k| return is_leaf ------------------ | Branch (1725:16): [True: 1.87k, False: 7.59k] ------------------ 1726| 9.46k| ? make_leaf_sub_pos(child, next_size) 1727| 1.87k| .visit(v, next_idx, args...) 1728| 9.46k| : visit_maybe_relaxed_sub( 1729| 7.59k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 9.46k| } _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.87k| { 145| 1.87k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.87k| } _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.59k|{ 1839| 7.59k| assert(node); ------------------ | Branch (1839:5): [True: 7.59k, False: 0] ------------------ 1840| 7.59k| auto relaxed = node->relaxed(); 1841| 7.59k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.79k, False: 4.80k] ------------------ 1842| 2.79k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.79k, False: 0] ------------------ 1843| 2.79k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.79k| .visit(v, std::forward(args)...); 1845| 4.80k| } else { 1846| 4.80k| return make_regular_sub_pos(node, shift, size) 1847| 4.80k| .visit(v, std::forward(args)...); 1848| 4.80k| } 1849| 7.59k|} _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.79k| { 1814| 2.79k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.79k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 4.80k| { 1037| 4.80k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.80k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1036| 10.4k| { 1037| 10.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 11.1k| { 1687| 11.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 11.1k, False: 0] ------------------ 1688| 11.1k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.35k, False: 1.83k] ------------------ 1689| 11.1k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 11.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 11.1k| { 1699| 11.1k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 11.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 11.1k| { 1718| 11.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 11.1k, False: 0] ------------------ 1719| 11.1k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.35k, False: 1.83k] | Branch (1719:9): [True: 11.1k, False: 0] ------------------ 1720| 11.1k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 11.1k| auto child = node_->inner()[offset_hint]; 1722| 11.1k| auto is_leaf = shift_ == BL; 1723| 11.1k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 11.1k| auto next_idx = idx - left_size_hint; 1725| 11.1k| return is_leaf ------------------ | Branch (1725:16): [True: 4.43k, False: 6.75k] ------------------ 1726| 11.1k| ? make_leaf_sub_pos(child, next_size) 1727| 4.43k| .visit(v, next_idx, args...) 1728| 11.1k| : visit_maybe_relaxed_sub( 1729| 6.75k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 11.1k| } _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.43k| { 145| 4.43k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.43k| } _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.75k|{ 1839| 6.75k| assert(node); ------------------ | Branch (1839:5): [True: 6.75k, False: 0] ------------------ 1840| 6.75k| auto relaxed = node->relaxed(); 1841| 6.75k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.55k, False: 3.19k] ------------------ 1842| 3.55k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.55k, False: 0] ------------------ 1843| 3.55k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.55k| .visit(v, std::forward(args)...); 1845| 3.55k| } else { 1846| 3.19k| return make_regular_sub_pos(node, shift, size) 1847| 3.19k| .visit(v, std::forward(args)...); 1848| 3.19k| } 1849| 6.75k|} _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.55k| { 1814| 3.55k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.55k| } _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.19k| { 1037| 3.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.19k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 28.6k| { 1654| 28.6k| assert(start > 0); ------------------ | Branch (1654:9): [True: 28.6k, False: 0] ------------------ 1655| 28.6k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 28.6k, False: 0] ------------------ 1656| 28.6k| auto s = relaxed_->d.sizes[start - 1]; 1657| 28.6k| auto p = node_->inner(); 1658| 28.6k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 2.71k, False: 25.9k] ------------------ 1659| 8.41k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 5.69k, False: 2.71k] ------------------ 1660| 5.69k| IMMER_PREFETCH(p + i + 1); 1661| 5.69k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 5.69k| .visit(v, args...); 1663| 5.69k| s = relaxed_->d.sizes[i]; 1664| 5.69k| assert(s); ------------------ | Branch (1664:17): [True: 5.69k, False: 0] ------------------ 1665| 5.69k| } 1666| 25.9k| } else { 1667| 25.9k| auto ss = shift_ - B; 1668| 149k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 123k, False: 25.9k] ------------------ 1669| 123k| visit_maybe_relaxed_sub( 1670| 123k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 123k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 123k, False: 0] ------------------ 1673| 123k| } 1674| 25.9k| } 1675| 28.6k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 12.7k| { 1037| 12.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 12.7k| } _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.07k| { 928| 5.07k| return towards_oh_ch_regular( 929| 5.07k| *this, v, idx, offset_hint, count(), args...); 930| 5.07k| } _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.07k|{ 633| 5.07k| constexpr auto B = bits; 634| 5.07k| constexpr auto BL = bits_leaf; 635| 5.07k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.07k, False: 0] ------------------ 636| 5.07k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.07k, False: 0] ------------------ 637| 5.07k| auto is_leaf = p.shift() == BL; 638| 5.07k| auto child = p.node()->inner()[offset_hint]; 639| 5.07k| auto is_full = offset_hint + 1 != count_hint; 640| 5.07k| return is_full ------------------ | Branch (640:12): [True: 4.33k, False: 741] ------------------ 641| 5.07k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.11k, False: 3.22k] ------------------ 642| 4.33k| : make_full_pos(child, p.shift() - B) 643| 3.22k| .visit(v, idx, args...)) 644| 5.07k| : (is_leaf ------------------ | Branch (644:19): [True: 741, False: 0] ------------------ 645| 741| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 741| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.07k|} _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.79k| { 208| 1.79k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.79k| } _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.71k| { 1406| 3.71k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.71k| } _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.18k| { 1337| 1.18k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.18k, False: 0] ------------------ 1338| 1.18k| auto is_leaf = shift_ == BL; 1339| 1.18k| auto child = node_->inner()[offset_hint]; 1340| 1.18k| return is_leaf ------------------ | Branch (1340:16): [True: 683, False: 497] ------------------ 1341| 1.18k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.18k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.18k| } _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| 741| { 113| 741| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 741| } _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| 857| { 145| 857| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 857| } _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| 55.9k|{ 1839| 55.9k| assert(node); ------------------ | Branch (1839:5): [True: 55.9k, False: 0] ------------------ 1840| 55.9k| auto relaxed = node->relaxed(); 1841| 55.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 53.3k, False: 2.58k] ------------------ 1842| 53.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 53.3k, False: 0] ------------------ 1843| 53.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 53.3k| .visit(v, std::forward(args)...); 1845| 53.3k| } else { 1846| 2.58k| return make_regular_sub_pos(node, shift, size) 1847| 2.58k| .visit(v, std::forward(args)...); 1848| 2.58k| } 1849| 55.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 53.3k| { 1814| 53.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 53.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| 1.93k| { 1706| 1.93k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 1.93k, False: 0] ------------------ 1707| 1.93k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 1.50k, False: 436] ------------------ 1708| 1.93k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 1.93k| } _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| 1.93k| { 1718| 1.93k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 1.93k, False: 0] ------------------ 1719| 1.93k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 1.50k, False: 436] | Branch (1719:9): [True: 1.93k, False: 0] ------------------ 1720| 1.93k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 1.93k| auto child = node_->inner()[offset_hint]; 1722| 1.93k| auto is_leaf = shift_ == BL; 1723| 1.93k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 1.93k| auto next_idx = idx - left_size_hint; 1725| 1.93k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 1.93k] ------------------ 1726| 1.93k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 1.93k| : visit_maybe_relaxed_sub( 1729| 1.93k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 1.93k| } _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.81k| { 1706| 3.81k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.81k, False: 0] ------------------ 1707| 3.81k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.30k, False: 514] ------------------ 1708| 3.81k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.81k| } _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.81k| { 1718| 3.81k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.81k, False: 0] ------------------ 1719| 3.81k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.30k, False: 514] | Branch (1719:9): [True: 3.81k, False: 0] ------------------ 1720| 3.81k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.81k| auto child = node_->inner()[offset_hint]; 1722| 3.81k| auto is_leaf = shift_ == BL; 1723| 3.81k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.81k| auto next_idx = idx - left_size_hint; 1725| 3.81k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.81k] ------------------ 1726| 3.81k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.81k| : visit_maybe_relaxed_sub( 1729| 3.81k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.81k| } _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.81k|{ 1839| 3.81k| assert(node); ------------------ | Branch (1839:5): [True: 3.81k, False: 0] ------------------ 1840| 3.81k| auto relaxed = node->relaxed(); 1841| 3.81k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.51k, False: 1.29k] ------------------ 1842| 2.51k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.51k, False: 0] ------------------ 1843| 2.51k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.51k| .visit(v, std::forward(args)...); 1845| 2.51k| } else { 1846| 1.29k| return make_regular_sub_pos(node, shift, size) 1847| 1.29k| .visit(v, std::forward(args)...); 1848| 1.29k| } 1849| 3.81k|} _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.51k| { 1814| 2.51k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.51k| } _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.29k| { 1037| 1.29k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.29k| } _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.36k| { 947| 1.36k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 1.36k| } _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.36k|{ 654| 1.36k| constexpr auto B = bits; 655| 1.36k| constexpr auto BL = bits_leaf; 656| 1.36k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 1.36k, False: 0] ------------------ 657| 1.36k| auto is_leaf = p.shift() == BL; 658| 1.36k| auto child = p.node()->inner()[offset_hint]; 659| 1.36k| auto lsize = offset_hint << p.shift(); 660| 1.36k| auto size = p.this_size(); 661| 1.36k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 1.36k| return is_full ------------------ | Branch (662:12): [True: 627, False: 733] ------------------ 663| 1.36k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 627] ------------------ 664| 627| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 627| : make_full_pos(child, p.shift() - B) 666| 627| .visit(v, idx - lsize, args...)) 667| 1.36k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 733] ------------------ 668| 733| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 733| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 733| .visit(v, idx - lsize, args...)); 672| 1.36k|} _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| 627| { 1406| 627| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 627| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 2.52k| { 1349| 2.52k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 2.52k, False: 0] ------------------ 1350| 2.52k| auto is_leaf = shift_ == BL; 1351| 2.52k| auto child = node_->inner()[offset_hint]; 1352| 2.52k| auto lsize = size_t{offset_hint} << shift_; 1353| 2.52k| return is_leaf ------------------ | Branch (1353:16): [True: 1.91k, False: 608] ------------------ 1354| 2.52k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 2.52k| : make_full_pos(child, shift_ - B) 1356| 608| .visit(v, idx - lsize, args...); 1357| 2.52k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 8.17k| { 208| 8.17k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 8.17k| } _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.90k| { 1406| 1.90k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.90k| } _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| 733| { 1037| 733| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 733| } _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.54k| { 947| 7.54k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 7.54k| } _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.54k|{ 654| 7.54k| constexpr auto B = bits; 655| 7.54k| constexpr auto BL = bits_leaf; 656| 7.54k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 7.54k, False: 0] ------------------ 657| 7.54k| auto is_leaf = p.shift() == BL; 658| 7.54k| auto child = p.node()->inner()[offset_hint]; 659| 7.54k| auto lsize = offset_hint << p.shift(); 660| 7.54k| auto size = p.this_size(); 661| 7.54k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 7.54k| return is_full ------------------ | Branch (662:12): [True: 7.54k, False: 0] ------------------ 663| 7.54k| ? (is_leaf ------------------ | Branch (663:19): [True: 6.25k, False: 1.29k] ------------------ 664| 7.54k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 7.54k| : make_full_pos(child, p.shift() - B) 666| 1.29k| .visit(v, idx - lsize, args...)) 667| 7.54k| : (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.54k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 1.93k| { 1814| 1.93k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.93k| } _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| 178k| { 1706| 178k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 178k, False: 0] ------------------ 1707| 178k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 41.2k, False: 137k] ------------------ 1708| 178k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 178k| } _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| 178k| { 1718| 178k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 178k, False: 0] ------------------ 1719| 178k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 41.2k, False: 137k] | Branch (1719:9): [True: 178k, False: 0] ------------------ 1720| 178k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 178k| auto child = node_->inner()[offset_hint]; 1722| 178k| auto is_leaf = shift_ == BL; 1723| 178k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 178k| auto next_idx = idx - left_size_hint; 1725| 178k| return is_leaf ------------------ | Branch (1725:16): [True: 4.36k, False: 174k] ------------------ 1726| 178k| ? make_leaf_sub_pos(child, next_size) 1727| 4.36k| .visit(v, next_idx, args...) 1728| 178k| : visit_maybe_relaxed_sub( 1729| 174k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 178k| } _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.36k| { 145| 4.36k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.36k| } _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| 174k|{ 1839| 174k| assert(node); ------------------ | Branch (1839:5): [True: 174k, False: 0] ------------------ 1840| 174k| auto relaxed = node->relaxed(); 1841| 174k| if (relaxed) { ------------------ | Branch (1841:9): [True: 172k, False: 1.54k] ------------------ 1842| 172k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 172k, False: 0] ------------------ 1843| 172k| return make_relaxed_pos(node, shift, relaxed) 1844| 172k| .visit(v, std::forward(args)...); 1845| 172k| } else { 1846| 1.54k| return make_regular_sub_pos(node, shift, size) 1847| 1.54k| .visit(v, std::forward(args)...); 1848| 1.54k| } 1849| 174k|} _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| 172k| { 1814| 172k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 172k| } _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.54k| { 1037| 1.54k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.54k| } _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| 92.8k| { 1706| 92.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 92.8k, False: 0] ------------------ 1707| 92.8k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 55.6k, False: 37.2k] ------------------ 1708| 92.8k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 92.8k| } _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| 92.8k| { 1718| 92.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 92.8k, False: 0] ------------------ 1719| 92.8k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 55.6k, False: 37.2k] | Branch (1719:9): [True: 92.8k, False: 0] ------------------ 1720| 92.8k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 92.8k| auto child = node_->inner()[offset_hint]; 1722| 92.8k| auto is_leaf = shift_ == BL; 1723| 92.8k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 92.8k| auto next_idx = idx - left_size_hint; 1725| 92.8k| return is_leaf ------------------ | Branch (1725:16): [True: 41.4k, False: 51.4k] ------------------ 1726| 92.8k| ? make_leaf_sub_pos(child, next_size) 1727| 41.4k| .visit(v, next_idx, args...) 1728| 92.8k| : visit_maybe_relaxed_sub( 1729| 51.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 92.8k| } _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| 41.4k| { 145| 41.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 41.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| 51.4k|{ 1839| 51.4k| assert(node); ------------------ | Branch (1839:5): [True: 51.4k, False: 0] ------------------ 1840| 51.4k| auto relaxed = node->relaxed(); 1841| 51.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 48.6k, False: 2.74k] ------------------ 1842| 48.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 48.6k, False: 0] ------------------ 1843| 48.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 48.6k| .visit(v, std::forward(args)...); 1845| 48.6k| } else { 1846| 2.74k| return make_regular_sub_pos(node, shift, size) 1847| 2.74k| .visit(v, std::forward(args)...); 1848| 2.74k| } 1849| 51.4k|} _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| 48.6k| { 1814| 48.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 48.6k| } _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.74k| { 1037| 2.74k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.74k| } _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.58k| { 1037| 2.58k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.58k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcPT_jmT0_DpOT1_: 1838| 21.9k|{ 1839| 21.9k| assert(node); ------------------ | Branch (1839:5): [True: 21.9k, False: 0] ------------------ 1840| 21.9k| auto relaxed = node->relaxed(); 1841| 21.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 13.4k, False: 8.55k] ------------------ 1842| 13.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 13.4k, False: 0] ------------------ 1843| 13.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 13.4k| .visit(v, std::forward(args)...); 1845| 13.4k| } else { 1846| 8.55k| return make_regular_sub_pos(node, shift, size) 1847| 8.55k| .visit(v, std::forward(args)...); 1848| 8.55k| } 1849| 21.9k|} _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| 13.4k| { 1814| 13.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 13.4k| } _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| 13.4k|{ 1839| 13.4k| assert(node); ------------------ | Branch (1839:5): [True: 13.4k, False: 0] ------------------ 1840| 13.4k| auto relaxed = node->relaxed(); 1841| 13.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.2k, False: 3.12k] ------------------ 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| 3.12k| return make_regular_sub_pos(node, shift, size) 1847| 3.12k| .visit(v, std::forward(args)...); 1848| 3.12k| } 1849| 13.4k|} _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| 10.2k| { 1814| 10.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 10.2k| } _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.6k| { 1794| 55.6k| auto child = node_->inner()[offset]; 1795| 55.6k| auto child_size = size(offset); 1796| 55.6k| auto is_leaf = shift_ == BL; 1797| 55.6k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 25.2k, False: 30.4k] ------------------ 1798| 55.6k| : visit_maybe_relaxed_sub( 1799| 30.4k| child, shift_ - B, child_size, v, args...); 1800| 55.6k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 25.8k| { 145| 25.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 25.8k| } _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| 25.8k| { 1805| 25.8k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 25.8k, False: 0] ------------------ 1806| 25.8k| auto child = node_->inner()[offset]; 1807| 25.8k| auto child_size = size(offset); 1808| 25.8k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 25.8k| } _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.4k| { 145| 26.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 26.4k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 30.4k|{ 1839| 30.4k| assert(node); ------------------ | Branch (1839:5): [True: 30.4k, False: 0] ------------------ 1840| 30.4k| auto relaxed = node->relaxed(); 1841| 30.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 25.4k, False: 4.95k] ------------------ 1842| 25.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 25.4k, False: 0] ------------------ 1843| 25.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 25.4k| .visit(v, std::forward(args)...); 1845| 25.4k| } else { 1846| 4.95k| return make_regular_sub_pos(node, shift, size) 1847| 4.95k| .visit(v, std::forward(args)...); 1848| 4.95k| } 1849| 30.4k|} _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| 25.4k| { 1814| 25.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 25.4k| } _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| 25.4k| { 1794| 25.4k| auto child = node_->inner()[offset]; 1795| 25.4k| auto child_size = size(offset); 1796| 25.4k| auto is_leaf = shift_ == BL; 1797| 25.4k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 25.4k] ------------------ 1798| 25.4k| : visit_maybe_relaxed_sub( 1799| 25.4k| child, shift_ - B, child_size, v, args...); 1800| 25.4k| } _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| 25.4k|{ 1839| 25.4k| assert(node); ------------------ | Branch (1839:5): [True: 25.4k, False: 0] ------------------ 1840| 25.4k| auto relaxed = node->relaxed(); 1841| 25.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 24.5k, False: 875] ------------------ 1842| 24.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 24.5k, False: 0] ------------------ 1843| 24.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 24.5k| .visit(v, std::forward(args)...); 1845| 24.5k| } else { 1846| 875| return make_regular_sub_pos(node, shift, size) 1847| 875| .visit(v, std::forward(args)...); 1848| 875| } 1849| 25.4k|} _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.5k| { 1814| 24.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 24.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 1.19k| { 1037| 1.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.19k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 8.12k| { 1794| 8.12k| auto child = node_->inner()[offset]; 1795| 8.12k| auto child_size = size(offset); 1796| 8.12k| auto is_leaf = shift_ == BL; 1797| 8.12k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 5.13k, False: 2.98k] ------------------ 1798| 8.12k| : visit_maybe_relaxed_sub( 1799| 2.98k| child, shift_ - B, child_size, v, args...); 1800| 8.12k| } _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.13k| { 145| 5.13k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.13k| } _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.13k| { 1026| 5.13k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 5.13k, False: 0] ------------------ 1027| 5.13k| auto child = node_->inner()[idx]; 1028| 5.13k| auto lsize = size(idx); 1029| 5.13k| auto is_full = idx + 1 < count(); 1030| 5.13k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 4.47k, False: 663] ------------------ 1031| 5.13k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 5.13k| } _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| 11.7k| { 208| 11.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 11.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_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.98k|{ 1839| 2.98k| assert(node); ------------------ | Branch (1839:5): [True: 2.98k, False: 0] ------------------ 1840| 2.98k| auto relaxed = node->relaxed(); 1841| 2.98k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.11k, False: 869] ------------------ 1842| 2.11k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.11k, False: 0] ------------------ 1843| 2.11k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.11k| .visit(v, std::forward(args)...); 1845| 2.11k| } else { 1846| 869| return make_regular_sub_pos(node, shift, size) 1847| 869| .visit(v, std::forward(args)...); 1848| 869| } 1849| 2.98k|} _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.11k| { 1814| 2.11k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.11k| } _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.11k| { 1008| 2.11k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.11k, False: 0] ------------------ 1009| 2.11k| auto is_leaf = shift_ == BL; 1010| 2.11k| auto child = node_->inner()[idx]; 1011| 2.11k| auto lsize = size(idx); 1012| 2.11k| auto is_full = idx + 1 < count(); 1013| 2.11k| return is_full ------------------ | Branch (1013:16): [True: 1.79k, False: 324] ------------------ 1014| 2.11k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.79k] ------------------ 1015| 1.79k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.79k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.11k| : (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.11k| } _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.56k| { 1794| 8.56k| auto child = node_->inner()[offset]; 1795| 8.56k| auto child_size = size(offset); 1796| 8.56k| auto is_leaf = shift_ == BL; 1797| 8.56k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 7.27k, False: 1.29k] ------------------ 1798| 8.56k| : visit_maybe_relaxed_sub( 1799| 1.29k| child, shift_ - B, child_size, v, args...); 1800| 8.56k| } _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.27k| { 145| 7.27k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.27k| } _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.27k| { 1397| 7.27k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 7.27k, False: 0] ------------------ 1398| 7.27k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 7.27k, False: 0] ------------------ 1399| 7.27k| auto child = node_->inner()[idx]; 1400| 7.27k| return make_full_leaf_pos(child).visit(v, args...); 1401| 7.27k| } _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.29k|{ 1839| 1.29k| assert(node); ------------------ | Branch (1839:5): [True: 1.29k, False: 0] ------------------ 1840| 1.29k| auto relaxed = node->relaxed(); 1841| 1.29k| if (relaxed) { ------------------ | Branch (1841:9): [True: 447, False: 844] ------------------ 1842| 447| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 447, False: 0] ------------------ 1843| 447| return make_relaxed_pos(node, shift, relaxed) 1844| 447| .visit(v, std::forward(args)...); 1845| 844| } else { 1846| 844| return make_regular_sub_pos(node, shift, size) 1847| 844| .visit(v, std::forward(args)...); 1848| 844| } 1849| 1.29k|} _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| 447| { 1814| 447| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 447| } _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| 447| { 1387| 447| assert(idx < count()); ------------------ | Branch (1387:9): [True: 447, False: 0] ------------------ 1388| 447| auto is_leaf = shift_ == BL; 1389| 447| auto child = node_->inner()[idx]; 1390| 447| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 447] ------------------ 1391| 447| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 447| } _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| 844| { 1037| 844| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 844| } _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| 844| { 1387| 844| assert(idx < count()); ------------------ | Branch (1387:9): [True: 844, False: 0] ------------------ 1388| 844| auto is_leaf = shift_ == BL; 1389| 844| auto child = node_->inner()[idx]; 1390| 844| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 844] ------------------ 1391| 844| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 844| } _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.71k| { 1406| 1.71k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.71k| } _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.69k| { 1223| 3.69k| auto p = node_->inner(); 1224| 3.69k| auto p2 = other->inner(); 1225| 3.69k| auto e = p + branches; 1226| 3.69k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 2.77k, False: 917] ------------------ 1227| 18.5k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 16.9k, False: 1.53k] ------------------ 1228| 16.9k| IMMER_PREFETCH(p + 1); 1229| 16.9k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 1.24k, False: 15.7k] ------------------ 1230| 1.24k| return false; 1231| 16.9k| } 1232| 2.77k| } else { 1233| 917| auto ss = shift_ - B; 1234| 6.38k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 5.77k, False: 611] ------------------ 1235| 5.77k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 306, False: 5.47k] ------------------ 1236| 306| return false; 1237| 917| } 1238| 2.14k| return true; 1239| 3.69k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 24.3k| { 208| 24.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 24.3k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 10.7k| { 1406| 10.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 10.7k| } _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.41k| { 838| 5.41k| return each_pred_zip_regular(*this, v, other, args...); 839| 5.41k| } _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.41k|{ 393| 5.41k| constexpr auto B = bits; 394| 5.41k| constexpr auto BL = bits_leaf; 395| | 396| 5.41k| auto n = p.node()->inner(); 397| 5.41k| auto n2 = other->inner(); 398| 5.41k| auto last = p.count() - 1; 399| 5.41k| auto e = n + last; 400| 5.41k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.27k, False: 3.14k] ------------------ 401| 6.16k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 4.89k, False: 1.26k] ------------------ 402| 4.89k| IMMER_PREFETCH(n + 1); 403| 4.89k| IMMER_PREFETCH(n2 + 1); 404| 4.89k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 1.00k, False: 3.89k] ------------------ 405| 1.00k| return false; 406| 4.89k| } 407| 1.26k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 3.14k| } else { 409| 3.14k| auto ss = p.shift() - B; 410| 6.45k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 3.97k, False: 2.48k] ------------------ 411| 3.97k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 660, False: 3.31k] ------------------ 412| 660| return false; 413| 2.48k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 3.14k| } 415| 5.41k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 3.03k| { 113| 3.03k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 3.03k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 3.16k| { 337| 3.16k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.16k| } _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: 2.00k, False: 877] ------------------ 401| 4.20k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 2.43k, False: 1.76k] ------------------ 402| 2.43k| IMMER_PREFETCH(n + 1); 403| 2.43k| IMMER_PREFETCH(n2 + 1); 404| 2.43k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 234, False: 2.20k] ------------------ 405| 234| return false; 406| 2.43k| } 407| 1.76k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 2.00k| } else { 409| 877| auto ss = p.shift() - B; 410| 1.68k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 1.00k, False: 682] ------------------ 411| 1.00k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 195, False: 808] ------------------ 412| 195| return false; 413| 682| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 877| } 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| 5.79k| { 1387| 5.79k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 5.79k, False: 0] ------------------ 1388| 5.79k| auto is_leaf = shift_ == BL; 1389| 5.79k| auto child = node_->inner()[idx]; 1390| 5.79k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 5.04k, False: 744] ------------------ 1391| 5.79k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 5.79k| } _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| 180k| { 208| 180k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 180k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_18region_for_visitorIiEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 4.61M|{ 1839| 4.61M| assert(node); ------------------ | Branch (1839:5): [True: 4.61M, False: 0] ------------------ 1840| 4.61M| auto relaxed = node->relaxed(); 1841| 4.61M| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.39M, False: 212k] ------------------ 1842| 4.39M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.39M, False: 0] ------------------ 1843| 4.39M| return make_relaxed_pos(node, shift, relaxed) 1844| 4.39M| .visit(v, std::forward(args)...); 1845| 4.39M| } else { 1846| 212k| return make_regular_sub_pos(node, shift, size) 1847| 212k| .visit(v, std::forward(args)...); 1848| 212k| } 1849| 4.61M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 4.39M| { 1814| 4.39M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.39M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 4.39M| { 1680| 4.39M| return towards_oh(v, idx, subindex(idx), args...); 1681| 4.39M| } _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.39M| { 1687| 4.39M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 4.39M, False: 0] ------------------ 1688| 4.39M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 3.05M, False: 1.34M] ------------------ 1689| 4.39M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 4.39M| } _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.39M| { 1699| 4.39M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 4.39M| } _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.39M| { 1718| 4.39M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.39M, False: 0] ------------------ 1719| 4.39M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.05M, False: 1.34M] | Branch (1719:9): [True: 4.39M, False: 0] ------------------ 1720| 4.39M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.39M| auto child = node_->inner()[offset_hint]; 1722| 4.39M| auto is_leaf = shift_ == BL; 1723| 4.39M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.39M| auto next_idx = idx - left_size_hint; 1725| 4.39M| return is_leaf ------------------ | Branch (1725:16): [True: 993k, False: 3.40M] ------------------ 1726| 4.39M| ? make_leaf_sub_pos(child, next_size) 1727| 993k| .visit(v, next_idx, args...) 1728| 4.39M| : visit_maybe_relaxed_sub( 1729| 3.40M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.39M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 144| 993k| { 145| 993k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 993k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 212k| { 1037| 212k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 212k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 212k| { 920| 212k| return towards_oh_ch_regular( 921| 212k| *this, v, idx, index(idx), count(), args...); 922| 212k| } _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| 212k|{ 633| 212k| constexpr auto B = bits; 634| 212k| constexpr auto BL = bits_leaf; 635| 212k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 212k, False: 0] ------------------ 636| 212k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 212k, False: 0] ------------------ 637| 212k| auto is_leaf = p.shift() == BL; 638| 212k| auto child = p.node()->inner()[offset_hint]; 639| 212k| auto is_full = offset_hint + 1 != count_hint; 640| 212k| return is_full ------------------ | Branch (640:12): [True: 176k, False: 36.6k] ------------------ 641| 212k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 69.8k, False: 106k] ------------------ 642| 176k| : make_full_pos(child, p.shift() - B) 643| 106k| .visit(v, idx, args...)) 644| 212k| : (is_leaf ------------------ | Branch (644:19): [True: 13.3k, False: 23.3k] ------------------ 645| 36.6k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 36.6k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 23.3k| .visit(v, idx, args...)); 648| 212k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 195k| { 208| 195k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 195k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 220k| { 1406| 220k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 220k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 220k| { 1323| 220k| return towards_oh(v, idx, index(idx), args...); 1324| 220k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 220k| { 1337| 220k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 220k, False: 0] ------------------ 1338| 220k| auto is_leaf = shift_ == BL; 1339| 220k| auto child = node_->inner()[offset_hint]; 1340| 220k| return is_leaf ------------------ | Branch (1340:16): [True: 119k, False: 100k] ------------------ 1341| 220k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 220k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 220k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 17.0k| { 113| 17.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 17.0k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 26.0k| { 337| 26.0k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 26.0k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 26.0k| { 298| 26.0k| return towards_oh_ch_regular( 299| 26.0k| *this, v, idx, index(idx), count(), args...); 300| 26.0k| } _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| 26.0k|{ 633| 26.0k| constexpr auto B = bits; 634| 26.0k| constexpr auto BL = bits_leaf; 635| 26.0k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 26.0k, False: 0] ------------------ 636| 26.0k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 26.0k, False: 0] ------------------ 637| 26.0k| auto is_leaf = p.shift() == BL; 638| 26.0k| auto child = p.node()->inner()[offset_hint]; 639| 26.0k| auto is_full = offset_hint + 1 != count_hint; 640| 26.0k| return is_full ------------------ | Branch (640:12): [True: 19.6k, False: 6.43k] ------------------ 641| 26.0k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 6.37k, False: 13.2k] ------------------ 642| 19.6k| : make_full_pos(child, p.shift() - B) 643| 13.2k| .visit(v, idx, args...)) 644| 26.0k| : (is_leaf ------------------ | Branch (644:19): [True: 3.74k, False: 2.68k] ------------------ 645| 6.43k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 6.43k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.68k| .visit(v, idx, args...)); 648| 26.0k|} _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| 15.2k| { 1406| 15.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 15.2k| } _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| 15.2k| { 1203| 15.2k| auto p = node_->inner(); 1204| 15.2k| auto e = p + branches; 1205| 15.2k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 14.1k, False: 1.12k] ------------------ 1206| 122k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 109k, False: 13.2k] ------------------ 1207| 109k| IMMER_PREFETCH(p + 1); 1208| 109k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 895, False: 108k] ------------------ 1209| 895| return false; 1210| 109k| } 1211| 14.1k| } else { 1212| 1.12k| auto ss = shift_ - B; 1213| 9.35k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 8.46k, False: 891] ------------------ 1214| 8.46k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 230, False: 8.23k] ------------------ 1215| 230| return false; 1216| 1.12k| } 1217| 14.1k| return true; 1218| 15.2k| } _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| 869| { 1037| 869| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 869| } _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| 869| { 1008| 869| assert(idx < count()); ------------------ | Branch (1008:9): [True: 869, False: 0] ------------------ 1009| 869| auto is_leaf = shift_ == BL; 1010| 869| auto child = node_->inner()[idx]; 1011| 869| auto lsize = size(idx); 1012| 869| auto is_full = idx + 1 < count(); 1013| 869| return is_full ------------------ | Branch (1013:16): [True: 869, False: 0] ------------------ 1014| 869| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 869] ------------------ 1015| 869| ? make_full_leaf_pos(child).visit(v, args...) 1016| 869| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 869| : (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| 869| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 3.82k| { 1037| 3.82k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.82k| } _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| 4.96k| { 1008| 4.96k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 4.96k, False: 0] ------------------ 1009| 4.96k| auto is_leaf = shift_ == BL; 1010| 4.96k| auto child = node_->inner()[idx]; 1011| 4.96k| auto lsize = size(idx); 1012| 4.96k| auto is_full = idx + 1 < count(); 1013| 4.96k| return is_full ------------------ | Branch (1013:16): [True: 3.01k, False: 1.94k] ------------------ 1014| 4.96k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.54k, False: 467] ------------------ 1015| 3.01k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 3.01k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.96k| : (is_leaf ------------------ | Branch (1017:23): [True: 1.12k, False: 826] ------------------ 1018| 1.94k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 1.94k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 826| .visit(v, args...)); 1021| 4.96k| } _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| 944k| { 145| 944k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 944k| } _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| 12.9k| { 1037| 12.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 12.9k| } _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| 12.9k| { 832| 12.9k| return each_pred_regular(*this, v, args...); 833| 12.9k| } _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| 12.9k|{ 366| 12.9k| constexpr auto B = bits; 367| 12.9k| constexpr auto BL = bits_leaf; 368| 12.9k| auto n = p.node()->inner(); 369| 12.9k| auto last = p.count() - 1; 370| 12.9k| auto e = n + last; 371| 12.9k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 10.0k, False: 2.91k] ------------------ 372| 69.0k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 59.8k, False: 9.12k] ------------------ 373| 59.8k| IMMER_PREFETCH(n + 1); 374| 59.8k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 931, False: 58.9k] ------------------ 375| 931| return false; 376| 59.8k| } 377| 9.12k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 10.0k| } else { 379| 2.91k| auto ss = p.shift() - B; 380| 7.02k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 4.57k, False: 2.45k] ------------------ 381| 4.57k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 458, False: 4.11k] ------------------ 382| 458| return false; 383| 2.45k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 2.91k| } 385| 12.9k|} _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| 11.1k| { 113| 11.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 11.1k| } _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| 3.36k| { 337| 3.36k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.36k| } _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| 3.36k| { 250| 3.36k| return each_pred_regular(*this, v, args...); 251| 3.36k| } _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| 3.36k|{ 366| 3.36k| constexpr auto B = bits; 367| 3.36k| constexpr auto BL = bits_leaf; 368| 3.36k| auto n = p.node()->inner(); 369| 3.36k| auto last = p.count() - 1; 370| 3.36k| auto e = n + last; 371| 3.36k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 2.23k, False: 1.13k] ------------------ 372| 6.00k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 4.00k, False: 2.00k] ------------------ 373| 4.00k| IMMER_PREFETCH(n + 1); 374| 4.00k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 230, False: 3.77k] ------------------ 375| 230| return false; 376| 4.00k| } 377| 2.00k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 2.23k| } else { 379| 1.13k| auto ss = p.shift() - B; 380| 1.93k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 1.02k, False: 912] ------------------ 381| 1.02k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 222, False: 802] ------------------ 382| 222| return false; 383| 912| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 1.13k| } 385| 3.36k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 4.95k| { 1037| 4.95k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.95k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 4.95k| { 1794| 4.95k| auto child = node_->inner()[offset]; 1795| 4.95k| auto child_size = size(offset); 1796| 4.95k| auto is_leaf = shift_ == BL; 1797| 4.95k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 4.95k] ------------------ 1798| 4.95k| : visit_maybe_relaxed_sub( 1799| 4.95k| child, shift_ - B, child_size, v, args...); 1800| 4.95k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 4.95k|{ 1839| 4.95k| assert(node); ------------------ | Branch (1839:5): [True: 4.95k, False: 0] ------------------ 1840| 4.95k| auto relaxed = node->relaxed(); 1841| 4.95k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.12k, False: 3.82k] ------------------ 1842| 1.12k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.12k, False: 0] ------------------ 1843| 1.12k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.12k| .visit(v, std::forward(args)...); 1845| 3.82k| } else { 1846| 3.82k| return make_regular_sub_pos(node, shift, size) 1847| 3.82k| .visit(v, std::forward(args)...); 1848| 3.82k| } 1849| 4.95k|} _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.12k| { 1814| 1.12k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.12k| } _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.38k| { 1008| 8.38k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 8.38k, False: 0] ------------------ 1009| 8.38k| auto is_leaf = shift_ == BL; 1010| 8.38k| auto child = node_->inner()[idx]; 1011| 8.38k| auto lsize = size(idx); 1012| 8.38k| auto is_full = idx + 1 < count(); 1013| 8.38k| return is_full ------------------ | Branch (1013:16): [True: 7.82k, False: 557] ------------------ 1014| 8.38k| ? (is_leaf ------------------ | Branch (1014:23): [True: 5.12k, False: 2.70k] ------------------ 1015| 7.82k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 7.82k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 8.38k| : (is_leaf ------------------ | Branch (1017:23): [True: 557, False: 0] ------------------ 1018| 557| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 557| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 8.38k| } _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| 10.8k| { 208| 10.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.8k| } _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| 10.8k| { 1805| 10.8k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 10.8k, False: 0] ------------------ 1806| 10.8k| auto child = node_->inner()[offset]; 1807| 10.8k| auto child_size = size(offset); 1808| 10.8k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 10.8k| } _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| 10.8k| { 145| 10.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 10.8k| } _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| 3.81k| { 1406| 3.81k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.81k| } _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| 3.81k| { 1794| 3.81k| auto child = node_->inner()[offset]; 1795| 3.81k| auto child_size = size(offset); 1796| 3.81k| auto is_leaf = shift_ == BL; 1797| 3.81k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 3.81k] ------------------ 1798| 3.81k| : visit_maybe_relaxed_sub( 1799| 3.81k| child, shift_ - B, child_size, v, args...); 1800| 3.81k| } _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| 3.81k|{ 1839| 3.81k| assert(node); ------------------ | Branch (1839:5): [True: 3.81k, False: 0] ------------------ 1840| 3.81k| auto relaxed = node->relaxed(); 1841| 3.81k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.65k, False: 2.15k] ------------------ 1842| 1.65k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.65k, False: 0] ------------------ 1843| 1.65k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.65k| .visit(v, std::forward(args)...); 1845| 2.15k| } else { 1846| 2.15k| return make_regular_sub_pos(node, shift, size) 1847| 2.15k| .visit(v, std::forward(args)...); 1848| 2.15k| } 1849| 3.81k|} _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.65k| { 1814| 1.65k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.65k| } _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| 6.85k| { 1387| 6.85k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 6.85k, False: 0] ------------------ 1388| 6.85k| auto is_leaf = shift_ == BL; 1389| 6.85k| auto child = node_->inner()[idx]; 1390| 6.85k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 5.74k, False: 1.10k] ------------------ 1391| 6.85k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 6.85k| } _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.15k| { 1037| 2.15k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.15k| } _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| 66.4k| { 1794| 66.4k| auto child = node_->inner()[offset]; 1795| 66.4k| auto child_size = size(offset); 1796| 66.4k| auto is_leaf = shift_ == BL; 1797| 66.4k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 31.0k, False: 35.3k] ------------------ 1798| 66.4k| : visit_maybe_relaxed_sub( 1799| 35.3k| child, shift_ - B, child_size, v, args...); 1800| 66.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| 154k|{ 1839| 154k| assert(node); ------------------ | Branch (1839:5): [True: 154k, False: 0] ------------------ 1840| 154k| auto relaxed = node->relaxed(); 1841| 154k| if (relaxed) { ------------------ | Branch (1841:9): [True: 142k, False: 12.1k] ------------------ 1842| 142k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 142k, False: 0] ------------------ 1843| 142k| return make_relaxed_pos(node, shift, relaxed) 1844| 142k| .visit(v, std::forward(args)...); 1845| 142k| } else { 1846| 12.1k| return make_regular_sub_pos(node, shift, size) 1847| 12.1k| .visit(v, std::forward(args)...); 1848| 12.1k| } 1849| 154k|} _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| 142k| { 1814| 142k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 142k| } _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| 142k| { 1483| 142k| auto p = node_->inner(); 1484| 142k| auto s = size_t{}; 1485| 142k| auto n = count(); 1486| 142k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 125k, False: 17.1k] ------------------ 1487| 1.03M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 912k, False: 124k] ------------------ 1488| 912k| IMMER_PREFETCH(p + i + 1); 1489| 912k| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 1.22k, False: 910k] ------------------ 1490| 912k| .visit(v, args...)) 1491| 1.22k| return false; 1492| 910k| s = relaxed_->d.sizes[i]; 1493| 910k| } 1494| 125k| } else { 1495| 17.1k| auto ss = shift_ - B; 1496| 135k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 119k, False: 16.4k] ------------------ 1497| 119k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 665, False: 118k] ------------------ 1498| 119k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 665| return false; 1500| 118k| s = relaxed_->d.sizes[i]; 1501| 118k| } 1502| 17.1k| } 1503| 140k| return true; 1504| 142k| } _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.26k| { 1784| 1.26k| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 1.26k, False: 0] ------------------ 1785| 1.26k| auto child = node_->inner()[0]; 1786| 1.26k| auto child_size = relaxed_->d.sizes[0]; 1787| 1.26k| return visit_maybe_relaxed_sub( 1788| 1.26k| child, shift_ - B, child_size, v, args...); 1789| 1.26k| } _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.26k|{ 1839| 1.26k| assert(node); ------------------ | Branch (1839:5): [True: 1.26k, False: 0] ------------------ 1840| 1.26k| auto relaxed = node->relaxed(); 1841| 1.26k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.26k, False: 0] ------------------ 1842| 1.26k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.26k, False: 0] ------------------ 1843| 1.26k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.26k| .visit(v, std::forward(args)...); 1845| 1.26k| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 1.26k|} _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.26k| { 1814| 1.26k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.26k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcPT_jmT0_DpOT1_: 1838| 8.55k|{ 1839| 8.55k| assert(node); ------------------ | Branch (1839:5): [True: 8.55k, False: 0] ------------------ 1840| 8.55k| auto relaxed = node->relaxed(); 1841| 8.55k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.69k, False: 5.86k] ------------------ 1842| 2.69k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.69k, False: 0] ------------------ 1843| 2.69k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.69k| .visit(v, std::forward(args)...); 1845| 5.86k| } else { 1846| 5.86k| return make_regular_sub_pos(node, shift, size) 1847| 5.86k| .visit(v, std::forward(args)...); 1848| 5.86k| } 1849| 8.55k|} _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.69k| { 1814| 2.69k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.69k| } _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| 5.86k| { 1037| 5.86k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.86k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcT_DpOT0_: 1036| 8.55k| { 1037| 8.55k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.55k| } _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.91k| { 145| 6.91k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.91k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 114| 1.34M| : size{0} 115| 1.34M| , shift{BL} 116| 1.34M| , root{empty_root()} 117| 1.34M| , tail{empty_tail()} 118| 1.34M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 1.34M, False: 0] ------------------ 120| 1.34M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_rootEv: 61| 1.35M| { 62| 1.35M| static const auto empty_ = [] { 63| 1.35M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1.35M| static std::aligned_storage_t 65| 1.35M| storage; 66| 1.35M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1.35M| }(); 68| 1.35M| return empty_->inc(); 69| 1.35M| } _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.34M| { 73| 1.34M| static const auto empty_ = [] { 74| 1.34M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1.34M| static std::aligned_storage_t 76| 1.34M| storage; 77| 1.34M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1.34M| }(); 79| 1.34M| return empty_->inc(); 80| 1.34M| } _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.39M| { 1373| 3.39M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 3.39M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.39M] | | ------------------ | | 33| 3.39M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 3.39M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 3.39M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.39M] | | ------------------ | | 33| 3.39M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 3.39M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 3.39M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.39M] | | ------------------ | | 33| 3.39M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 3.39M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 3.39M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.39M] | | ------------------ | | 33| 3.39M| 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.39M| return true; 1382| 3.39M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11tail_offsetEv: 197| 18.6M| { 198| 18.6M| auto r = root->relaxed(); 199| 18.6M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 7.32M, False: 11.3M] | Branch (199:9): [True: 11.3M, False: 0] | Branch (199:9): [True: 18.6M, False: 0] ------------------ 200| 18.6M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 11.3M, False: 7.32M] ------------------ 201| 18.6M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 3.27M, False: 4.05M] ------------------ 202| | /* otherwise */ 203| 7.32M| : 0; 204| 18.6M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9tail_sizeEv: 194| 3.79M| 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.39M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3decEv: 192| 3.39M| 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.39M| { 209| 3.39M| auto tail_off = tail_offset(); 210| 3.39M| auto tail_size = size - tail_off; 211| | 212| 3.39M| if (tail_off) ------------------ | Branch (212:13): [True: 1.92M, False: 1.47M] ------------------ 213| 1.92M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 1.47M| else 215| 1.47M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 3.39M| if (tail_size) ------------------ | Branch (217:13): [True: 2.05M, False: 1.34M] ------------------ 218| 2.05M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 1.34M| else 220| 1.34M| make_empty_leaf_pos(tail).visit(v, args...); 221| 3.39M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 500| 352k| { 501| 352k| auto ts = tail_size(); 502| 352k| if (ts < branches) { ------------------ | Branch (502:13): [True: 298k, False: 53.8k] ------------------ 503| 298k| auto new_tail = 504| 298k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 298k| return {size + 1, shift, root->inc(), new_tail}; 506| 298k| } else { 507| 53.8k| using std::get; 508| 53.8k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 53.8k| auto tail_off = tail_offset(); 510| 53.8k| IMMER_TRY { ------------------ | | 49| 53.8k|#define IMMER_TRY try ------------------ 511| 53.8k| auto new_root = 512| 53.8k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 53.8k| tail->inc(); 514| 53.8k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 53.8k| } 516| 53.8k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 53.8k| } 521| 352k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2EmjPNS1_4nodeIiSA_Lj3ELj3EEESE_: 127| 2.05M| : size{sz} 128| 2.05M| , shift{sh} 129| 2.05M| , root{r} 130| 2.05M| , tail{t} 131| 2.05M| { 132| 2.05M|#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.05M| try { 137| 2.05M| check_tree(); 138| 2.05M| } 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.05M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_tailEPNS1_4nodeIiSA_Lj3ELj3EEEjmSE_j: 369| 360k| { 370| 360k| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 57.7k, False: 302k] ------------------ 371| 57.7k| auto new_root = 372| 57.7k| make_relaxed_pos(root, shift, r) 373| 57.7k| .visit(push_tail_visitor{}, tail, tail_size); 374| 57.7k| if (new_root) ------------------ | Branch (374:17): [True: 55.8k, False: 1.91k] ------------------ 375| 55.8k| return std::make_tuple(shift, new_root); 376| 1.91k| else { 377| 1.91k| auto new_root = node_t::make_inner_r_n(2); 378| 1.91k| IMMER_TRY { ------------------ | | 49| 1.91k|#define IMMER_TRY try ------------------ 379| 1.91k| auto new_path = node_t::make_path(shift, tail); 380| 1.91k| new_root->inner()[0] = root->inc(); 381| 1.91k| new_root->inner()[1] = new_path; 382| 1.91k| new_root->relaxed()->d.sizes[0] = size; 383| 1.91k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 1.91k| assert(size); ------------------ | Branch (384:21): [True: 1.91k, False: 0] ------------------ 385| 1.91k| assert(tail_size); ------------------ | Branch (385:21): [True: 1.91k, False: 0] ------------------ 386| 1.91k| new_root->relaxed()->d.count = 2u; 387| 1.91k| } 388| 1.91k| IMMER_CATCH (...) { 389| 0| node_t::delete_inner_r(new_root, 2); 390| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 391| 0| } 392| 1.91k| return std::make_tuple(shift + B, new_root); 393| 1.91k| } 394| 302k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 3.82k, False: 298k] ------------------ 395| 3.82k| auto new_root = node_t::make_inner_n(2); 396| 3.82k| IMMER_TRY { ------------------ | | 49| 3.82k|#define IMMER_TRY try ------------------ 397| 3.82k| auto new_path = node_t::make_path(shift, tail); 398| 3.82k| new_root->inner()[0] = root->inc(); 399| 3.82k| new_root->inner()[1] = new_path; 400| 3.82k| } 401| 3.82k| IMMER_CATCH (...) { 402| 0| node_t::delete_inner(new_root, 2); 403| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 404| 0| } 405| 3.82k| return std::make_tuple(shift + B, new_root); 406| 298k| } else if (size) { ------------------ | Branch (406:20): [True: 285k, False: 13.2k] ------------------ 407| 285k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 285k| .visit(push_tail_visitor{}, tail); 409| 285k| return std::make_tuple(shift, new_root); 410| 285k| } else { 411| 13.2k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 13.2k| } 413| 360k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2EOSB_: 157| 1.24M| : rrbtree{} 158| 1.24M| { 159| 1.24M| swap(*this, other); 160| 1.24M| } _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.39M| { 171| 3.39M| swap(*this, other); 172| 3.39M| return *this; 173| 3.39M| } 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| 151k| { 581| 151k| auto tail_off = tail_offset(); 582| 151k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 58.3k, False: 93.3k] ------------------ 583| 58.3k| auto tail_size = size - tail_off; 584| 58.3k| auto new_tail = 585| 58.3k| make_leaf_sub_pos(tail, tail_size) 586| 58.3k| .visit(update_visitor{}, idx - tail_off, fn); 587| 58.3k| return {size, shift, root->inc(), new_tail}; 588| 93.3k| } else { 589| 93.3k| auto new_root = visit_maybe_relaxed_sub( 590| 93.3k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 93.3k| return {size, shift, new_root, tail->inc()}; 592| 93.3k| } 593| 151k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 647| 24.3k| { 648| 24.3k| auto tail_off = tail_offset(); 649| 24.3k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 3.94k, False: 20.4k] ------------------ 650| 3.94k| return {}; 651| 20.4k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 1.06k, False: 19.3k] ------------------ 652| 1.06k| return *this; 653| 19.3k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 1.65k, False: 17.6k] ------------------ 654| 1.65k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 1.65k| 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.3k, False: 4.31k] ------------------ 665| 13.3k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 13.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 13.3k, False: 0] ------------------ 666| 13.3k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 13.3k, False: 0] ------------------ 667| 13.3k| return {new_size, new_shift, new_root, new_tail}; 668| 13.3k| } else { 669| 4.31k| return {new_size, BL, empty_root(), new_tail}; 670| 4.31k| } 671| 17.6k| } 672| 24.3k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKSB_: 151| 8.85k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 8.85k| { 153| 8.85k| inc(); 154| 8.85k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 187| 8.85k| { 188| 8.85k| root->inc(); 189| 8.85k| tail->inc(); 190| 8.85k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 711| 36.7k| { 712| 36.7k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.52k, False: 34.1k] ------------------ 713| 2.52k| return *this; 714| 34.1k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 1.89k, False: 32.3k] ------------------ 715| 1.89k| return {}; 716| 32.3k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 2.06k, False: 30.2k] ------------------ 717| 2.06k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 30.2k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 1.76k, False: 28.4k] ------------------ 719| 1.76k| auto tail_off = tail_offset(); 720| 1.76k| auto new_tail = 721| 1.76k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 1.76k| return {size - elems, BL, empty_root(), new_tail}; 723| 28.4k| } else { 724| 28.4k| using std::get; 725| 28.4k| auto v = slice_left_visitor(); 726| 28.4k| auto r = 727| 28.4k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 28.4k| auto new_root = get<1>(r); 729| 28.4k| auto new_shift = get<0>(r); 730| 28.4k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 28.4k| } 732| 36.7k| } _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| 655k| { 736| 655k| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 655k, False: 0] ------------------ 737| 655k| using std::get; 738| 655k| if (size == 0) ------------------ | Branch (738:13): [True: 1.38k, False: 654k] ------------------ 739| 1.38k| return r; 740| 654k| else if (r.size == 0) ------------------ | Branch (740:18): [True: 1.06k, False: 653k] ------------------ 741| 1.06k| return *this; 742| 653k| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 324k, False: 328k] ------------------ 743| | // just concat the tail, similar to push_back 744| 324k| auto tail_offst = tail_offset(); 745| 324k| auto tail_size = size - tail_offst; 746| 324k| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 65.0k, False: 259k] ------------------ 747| 65.0k| auto new_root = 748| 65.0k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 65.0k| tail->inc(); 750| 65.0k| return {size + r.size, 751| 65.0k| get<0>(new_root), 752| 65.0k| get<1>(new_root), 753| 65.0k| r.tail->inc()}; 754| 259k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 19.0k, False: 240k] ------------------ 755| 19.0k| auto new_tail = 756| 19.0k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 19.0k| return {size + r.size, shift, root->inc(), new_tail}; 758| 240k| } else { 759| 240k| auto remaining = branches - tail_size; 760| 240k| auto add_tail = 761| 240k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 240k| IMMER_TRY { ------------------ | | 49| 240k|#define IMMER_TRY try ------------------ 763| 240k| auto new_tail = 764| 240k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 240k| IMMER_TRY { ------------------ | | 49| 240k|#define IMMER_TRY try ------------------ 766| 240k| auto new_root = push_tail( 767| 240k| root, shift, tail_offst, add_tail, branches); 768| 240k| return {size + r.size, 769| 240k| get<0>(new_root), 770| 240k| get<1>(new_root), 771| 240k| new_tail}; 772| 240k| } 773| 240k| 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| 240k| } 778| 240k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 240k| } 783| 328k| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 2.75k, False: 325k] ------------------ 784| 2.75k| auto tail_offst = tail_offset(); 785| 2.75k| auto tail_size = size - tail_offst; 786| 2.75k| auto concated = 787| 2.75k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 2.75k| auto new_shift = concated.shift(); 789| 2.75k| auto new_root = concated.node(); 790| 2.75k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 2.75k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 2.75k, False: 0] ------------------ 791| 2.75k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 2.75k, False: 0] ------------------ 792| 2.75k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 325k| } else { 794| 325k| auto tail_offst = tail_offset(); 795| 325k| auto tail_size = size - tail_offst; 796| 325k| auto concated = concat_trees(root, 797| 325k| shift, 798| 325k| tail_offst, 799| 325k| tail, 800| 325k| tail_size, 801| 325k| r.root, 802| 325k| r.shift, 803| 325k| r.tail_offset()); 804| 325k| auto new_shift = concated.shift(); 805| 325k| auto new_root = concated.node(); 806| 325k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 325k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 325k, False: 0] ------------------ 807| 325k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 325k, False: 0] ------------------ 808| 325k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 325k| } 810| 655k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 40.2k| { 479| 40.2k| auto ts = tail_size(); 480| 40.2k| if (ts < branches) { ------------------ | Branch (480:13): [True: 30.5k, False: 9.72k] ------------------ 481| 30.5k| ensure_mutable_tail(e, ts); 482| 30.5k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 30.5k| } else { 484| 9.72k| using std::get; 485| 9.72k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 9.72k| auto tail_off = tail_offset(); 487| 9.72k| IMMER_TRY { ------------------ | | 49| 9.72k|#define IMMER_TRY try ------------------ 488| 9.72k| push_tail_mut(e, tail_off, tail, ts); 489| 9.72k| tail = new_tail; 490| 9.72k| } 491| 9.72k| 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.72k| } 496| 40.2k| ++size; 497| 40.2k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 359k| { 470| 359k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 9.30k, False: 350k] ------------------ 471| 9.30k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 9.30k| dec_leaf(tail, n); 473| 9.30k| tail = new_tail; 474| 9.30k| } 475| 359k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj3ELj3EEEj: 417| 377k| { 418| 377k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 180k, False: 196k] ------------------ 419| 180k| auto new_root = 420| 180k| make_relaxed_pos(root, shift, r) 421| 180k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 180k| if (new_root) { ------------------ | Branch (422:17): [True: 179k, False: 730] ------------------ 423| 179k| root = new_root; 424| 179k| } else { 425| 730| auto new_root = node_t::make_inner_r_e(e); 426| 730| IMMER_TRY { ------------------ | | 49| 730|#define IMMER_TRY try ------------------ 427| 730| auto new_path = node_t::make_path_e(e, shift, tail); 428| 730| new_root->inner()[0] = root; 429| 730| new_root->inner()[1] = new_path; 430| 730| new_root->relaxed()->d.sizes[0] = tail_off; 431| 730| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 730| assert(tail_off); ------------------ | Branch (432:21): [True: 730, False: 0] ------------------ 433| 730| assert(tail_size); ------------------ | Branch (433:21): [True: 730, False: 0] ------------------ 434| 730| new_root->relaxed()->d.count = 2u; 435| 730| root = new_root; 436| 730| shift += B; 437| 730| } 438| 730| 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| 730| } 443| 196k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 1.92k, False: 194k] ------------------ 444| 1.92k| auto new_root = node_t::make_inner_e(e); 445| 1.92k| IMMER_TRY { ------------------ | | 49| 1.92k|#define IMMER_TRY try ------------------ 446| 1.92k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 1.92k| new_root->inner()[0] = root; 448| 1.92k| new_root->inner()[1] = new_path; 449| 1.92k| root = new_root; 450| 1.92k| shift += B; 451| 1.92k| } 452| 1.92k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 194k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 192k, False: 2.13k] ------------------ 457| 192k| auto new_root = 458| 192k| make_regular_sub_pos(root, shift, tail_off) 459| 192k| .visit(push_tail_mut_visitor{}, e, tail); 460| 192k| root = new_root; 461| 192k| } else { 462| 2.13k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 2.13k| dec_empty_regular(root); 464| 2.13k| root = new_root; 465| 2.13k| } 466| 377k| } 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| 32.1k| { 574| 32.1k| auto& elem = get_mut(e, idx); 575| 32.1k| elem = std::forward(fn)(std::move(elem)); 576| 32.1k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 32.1k| { 540| 32.1k| auto tail_off = tail_offset(); 541| 32.1k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 11.2k, False: 20.8k] ------------------ 542| 11.2k| ensure_mutable_tail(e, size - tail_off); 543| 11.2k| return tail->leaf()[(idx - tail_off) & mask]; 544| 20.8k| } else { 545| 20.8k| return visit_maybe_relaxed_sub(root, 546| 20.8k| shift, 547| 20.8k| tail_off, 548| 20.8k| get_mut_visitor{}, 549| 20.8k| idx, 550| 20.8k| e, 551| 20.8k| &root); 552| 20.8k| } 553| 32.1k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 32.1k| { 607| 32.1k| auto tail_off = tail_offset(); 608| 32.1k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 758, False: 31.4k] ------------------ 609| 758| *this = {}; 610| 31.4k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 578, False: 30.8k] ------------------ 611| 578| return; 612| 30.8k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 603, False: 30.2k] ------------------ 613| 603| auto ts = size - tail_off; 614| 603| auto newts = new_size - tail_off; 615| 603| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 354, False: 249] ------------------ 616| 354| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 354| } else { 618| 249| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 249| dec_leaf(tail, ts); 620| 249| tail = new_tail; 621| 249| } 622| 603| size = new_size; 623| 603| return; 624| 30.2k| } else { 625| 30.2k| using std::get; 626| 30.2k| auto l = new_size - 1; 627| 30.2k| auto v = slice_right_mut_visitor(); 628| 30.2k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 30.2k| auto new_shift = get<0>(r); 630| 30.2k| auto new_root = get<1>(r); 631| 30.2k| auto new_tail = get<3>(r); 632| 30.2k| if (new_root) { ------------------ | Branch (632:17): [True: 23.4k, False: 6.74k] ------------------ 633| 23.4k| root = new_root; 634| 23.4k| shift = new_shift; 635| 23.4k| } else { 636| 6.74k| root = empty_root(); 637| 6.74k| shift = BL; 638| 6.74k| } 639| 30.2k| dec_leaf(tail, size - tail_off); 640| 30.2k| size = new_size; 641| 30.2k| tail = new_tail; 642| 30.2k| return; 643| 30.2k| } 644| 32.1k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 61.3k| { 676| 61.3k| using std::get; 677| 61.3k| auto tail_off = tail_offset(); 678| 61.3k| if (elems == 0) { ------------------ | Branch (678:13): [True: 5.97k, False: 55.3k] ------------------ 679| 5.97k| return; 680| 55.3k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 270, False: 55.0k] ------------------ 681| 270| *this = {}; 682| 55.0k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 204, False: 54.8k] ------------------ 683| 204| dec_inner(root, shift, tail_off); 684| 204| shift = BL; 685| 204| root = empty_root(); 686| 204| size -= elems; 687| 204| return; 688| 54.8k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 857, False: 53.9k] ------------------ 689| 857| auto v = slice_left_mut_visitor(); 690| 857| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 857| .visit(v, elems - tail_off, e)); 692| 857| if (tail_off) { ------------------ | Branch (692:17): [True: 218, False: 639] ------------------ 693| 218| dec_inner(root, shift, tail_off); 694| 218| shift = BL; 695| 218| root = empty_root(); 696| 218| } 697| 857| size -= elems; 698| 857| return; 699| 53.9k| } else { 700| 53.9k| auto v = slice_left_mut_visitor(); 701| 53.9k| auto r = 702| 53.9k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 53.9k| shift = get<0>(r); 704| 53.9k| root = get<1>(r); 705| 53.9k| size -= elems; 706| 53.9k| return; 707| 53.9k| } 708| 61.3k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editERKSB_: 816| 222k| { 817| 222k| assert(&l != &r); ------------------ | Branch (817:9): [True: 222k, False: 0] ------------------ 818| 222k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 222k, False: 0] ------------------ 819| 222k| using std::get; 820| 222k| if (l.size == 0) ------------------ | Branch (820:13): [True: 461, False: 221k] ------------------ 821| 461| l = r; 822| 221k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 599, False: 221k] ------------------ 823| 599| return; 824| 221k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 69.9k, False: 151k] ------------------ 825| | // just concat the tail, similar to push_back 826| 69.9k| auto tail_offst = l.tail_offset(); 827| 69.9k| auto tail_size = l.size - tail_offst; 828| 69.9k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 12.0k, False: 57.9k] ------------------ 829| 12.0k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 12.0k| l.tail = r.tail->inc(); 831| 12.0k| l.size += r.size; 832| 12.0k| return; 833| 57.9k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 725, False: 57.2k] ------------------ 834| 725| l.ensure_mutable_tail(el, tail_size); 835| 725| detail::uninitialized_copy(r.tail->leaf(), 836| 725| r.tail->leaf() + r.size, 837| 725| l.tail->leaf() + tail_size); 838| 725| l.size += r.size; 839| 725| return; 840| 57.2k| } else { 841| 57.2k| auto remaining = branches - tail_size; 842| 57.2k| l.ensure_mutable_tail(el, tail_size); 843| 57.2k| detail::uninitialized_copy(r.tail->leaf(), 844| 57.2k| r.tail->leaf() + remaining, 845| 57.2k| l.tail->leaf() + tail_size); 846| 57.2k| IMMER_TRY { ------------------ | | 49| 57.2k|#define IMMER_TRY try ------------------ 847| 57.2k| auto new_tail = 848| 57.2k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 57.2k| IMMER_TRY { ------------------ | | 49| 57.2k|#define IMMER_TRY try ------------------ 850| 57.2k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 57.2k| l.tail = new_tail; 852| 57.2k| l.size += r.size; 853| 57.2k| return; 854| 57.2k| } 855| 57.2k| IMMER_CATCH (...) { 856| 0| node_t::delete_leaf(new_tail, r.size - remaining); 857| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 858| 0| } 859| 57.2k| } 860| 57.2k| IMMER_CATCH (...) { 861| 0| detail::destroy_n(r.tail->leaf() + tail_size, remaining); 862| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 863| 0| } 864| 57.2k| } 865| 151k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 441, False: 150k] ------------------ 866| 441| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 441] ------------------ 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| 441| } else { 886| 441| auto tail_offst = l.tail_offset(); 887| 441| auto tail_size = l.size - tail_offst; 888| 441| auto concated = concat_trees( 889| 441| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 441| l = {l.size + r.size, 891| 441| concated.shift(), 892| 441| concated.node(), 893| 441| r.tail->inc()}; 894| 441| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 441, False: 0] ------------------ 895| 441| return; 896| 441| } 897| 150k| } else { 898| 150k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 150k] ------------------ 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| 150k| } else { 923| 150k| auto tail_offst = l.tail_offset(); 924| 150k| auto tail_size = l.size - tail_offst; 925| 150k| auto concated = concat_trees(l.root, 926| 150k| l.shift, 927| 150k| tail_offst, 928| 150k| l.tail, 929| 150k| tail_size, 930| 150k| r.root, 931| 150k| r.shift, 932| 150k| r.tail_offset()); 933| 150k| l = {l.size + r.size, 934| 150k| concated.shift(), 935| 150k| concated.node(), 936| 150k| r.tail->inc()}; 937| 150k| } 938| 150k| } 939| 222k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEaSERKSB_: 163| 2.80k| { 164| 2.80k| auto next{other}; 165| 2.80k| swap(*this, next); 166| 2.80k| return *this; 167| 2.80k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERSB_NS9_5applyIS6_E4type4editE: 942| 4.06k| { 943| 4.06k| assert(&l != &r); ------------------ | Branch (943:9): [True: 4.06k, False: 0] ------------------ 944| 4.06k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 4.06k, False: 0] ------------------ 945| 4.06k| using std::get; 946| 4.06k| if (r.size == 0) ------------------ | Branch (946:13): [True: 248, False: 3.81k] ------------------ 947| 248| r = std::move(l); 948| 3.81k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 200, False: 3.61k] ------------------ 949| 200| return; 950| 3.61k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 1.37k, False: 2.23k] ------------------ 951| | // just concat the tail, similar to push_back 952| 1.37k| auto tail_offst = l.tail_offset(); 953| 1.37k| auto tail_size = l.size - tail_offst; 954| 1.37k| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 354, False: 1.02k] ------------------ 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| 354| auto res = 959| 354| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 354| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 354| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 354| return; 965| 1.02k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 485, False: 540] ------------------ 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| 485| auto new_tail = 974| 485| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 485| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 485| return; 977| 540| } else { 978| | // like the immutable version 979| 540| auto remaining = branches - tail_size; 980| 540| auto add_tail = node_t::copy_leaf_e( 981| 540| er, l.tail, tail_size, r.tail, remaining); 982| 540| IMMER_TRY { ------------------ | | 49| 540|#define IMMER_TRY try ------------------ 983| 540| auto new_tail = 984| 540| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 540| IMMER_TRY { ------------------ | | 49| 540|#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| 540| auto new_root = l.push_tail(l.root, 990| 540| l.shift, 991| 540| tail_offst, 992| 540| add_tail, 993| 540| branches); 994| 540| r = {l.size + r.size, 995| 540| get<0>(new_root), 996| 540| get<1>(new_root), 997| 540| new_tail}; 998| 540| return; 999| 540| } 1000| 540| 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| 540| } 1005| 540| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 540| } 1010| 2.23k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 609, False: 1.62k] ------------------ 1011| 609| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 609] ------------------ 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| 609| } else { 1030| 609| auto tail_offst = l.tail_offset(); 1031| 609| auto tail_size = l.size - tail_offst; 1032| 609| auto concated = concat_trees( 1033| 609| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 609| r = {l.size + r.size, 1035| 609| concated.shift(), 1036| 609| concated.node(), 1037| 609| r.tail->inc()}; 1038| 609| return; 1039| 609| } 1040| 1.62k| } else { 1041| 1.62k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.62k] ------------------ 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.62k| } else { 1064| 1.62k| auto tail_offst = l.tail_offset(); 1065| 1.62k| auto tail_size = l.size - tail_offst; 1066| 1.62k| auto concated = concat_trees(l.root, 1067| 1.62k| l.shift, 1068| 1.62k| tail_offst, 1069| 1.62k| l.tail, 1070| 1.62k| tail_size, 1071| 1.62k| r.root, 1072| 1.62k| r.shift, 1073| 1.62k| r.tail_offset()); 1074| 1.62k| r = {l.size + r.size, 1075| 1.62k| concated.shift(), 1076| 1.62k| concated.node(), 1077| 1.62k| r.tail->inc()}; 1078| 1.62k| return; 1079| 1.62k| } 1080| 1.62k| } 1081| 4.06k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 988k| { 1085| 988k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 988k, False: 0] ------------------ 1086| 988k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 988k, False: 0] ------------------ 1087| 988k| using std::get; 1088| 988k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 2.09k, False: 986k] ------------------ 1089| 2.09k| l = r; 1090| 986k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 2.19k, False: 984k] ------------------ 1091| 2.19k| return; 1092| 984k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 301k, False: 683k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 301k| auto tail_offst = l.tail_offset(); 1095| 301k| auto tail_size = l.size - tail_offst; 1096| 301k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 41.8k, False: 259k] ------------------ 1097| 41.8k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 41.8k| l.tail = r.tail->inc(); 1099| 41.8k| l.size += r.size; 1100| 41.8k| return; 1101| 259k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 3.22k, False: 256k] ------------------ 1102| 3.22k| l.ensure_mutable_tail(el, tail_size); 1103| 3.22k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 1.68k, False: 1.54k] ------------------ 1104| 1.68k| detail::uninitialized_move(r.tail->leaf(), 1105| 1.68k| r.tail->leaf() + r.size, 1106| 1.68k| l.tail->leaf() + tail_size); 1107| 1.54k| else 1108| 1.54k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.54k| r.tail->leaf() + r.size, 1110| 1.54k| l.tail->leaf() + tail_size); 1111| 3.22k| l.size += r.size; 1112| 3.22k| return; 1113| 256k| } else { 1114| 256k| auto remaining = branches - tail_size; 1115| 256k| l.ensure_mutable_tail(el, tail_size); 1116| 256k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 107k, False: 148k] ------------------ 1117| 107k| detail::uninitialized_move(r.tail->leaf(), 1118| 107k| r.tail->leaf() + remaining, 1119| 107k| l.tail->leaf() + tail_size); 1120| 148k| else 1121| 148k| detail::uninitialized_copy(r.tail->leaf(), 1122| 148k| r.tail->leaf() + remaining, 1123| 148k| l.tail->leaf() + tail_size); 1124| 256k| IMMER_TRY { ------------------ | | 49| 256k|#define IMMER_TRY try ------------------ 1125| 256k| auto new_tail = 1126| 256k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 256k| IMMER_TRY { ------------------ | | 49| 256k|#define IMMER_TRY try ------------------ 1128| 256k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 256k| l.tail = new_tail; 1130| 256k| l.size += r.size; 1131| 256k| return; 1132| 256k| } 1133| 256k| 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| 256k| } 1138| 256k| 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| 256k| } 1143| 683k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.44k, False: 679k] ------------------ 1144| 3.44k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.44k] ------------------ 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.44k| } else { 1165| 3.44k| auto tail_offst = l.tail_offset(); 1166| 3.44k| auto tail_size = l.size - tail_offst; 1167| 3.44k| auto concated = concat_trees( 1168| 3.44k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.44k| l = {l.size + r.size, 1170| 3.44k| concated.shift(), 1171| 3.44k| concated.node(), 1172| 3.44k| r.tail->inc()}; 1173| 3.44k| return; 1174| 3.44k| } 1175| 679k| } else { 1176| 679k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 679k] ------------------ 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| 679k| } else { 1200| 679k| auto tail_offst = l.tail_offset(); 1201| 679k| auto tail_size = l.size - tail_offst; 1202| 679k| auto concated = concat_trees(l.root, 1203| 679k| l.shift, 1204| 679k| tail_offst, 1205| 679k| l.tail, 1206| 679k| tail_size, 1207| 679k| r.root, 1208| 679k| r.shift, 1209| 679k| r.tail_offset()); 1210| 679k| l = {l.size + r.size, 1211| 679k| concated.shift(), 1212| 679k| concated.node(), 1213| 679k| r.tail->inc()}; 1214| 679k| return; 1215| 679k| } 1216| 679k| } 1217| 988k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6equalsERKSB_: 315| 79.6k| { 316| 79.6k| using iter_t = rrbtree_iterator; 317| 79.6k| if (size != other.size) ------------------ | Branch (317:13): [True: 56.3k, False: 23.2k] ------------------ 318| 56.3k| return false; 319| 23.2k| if (size == 0) ------------------ | Branch (319:13): [True: 197, False: 23.1k] ------------------ 320| 197| return true; 321| 23.1k| auto tail_off = tail_offset(); 322| 23.1k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 23.1k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 22.1k, False: 948] | Branch (324:29): [True: 21.9k, False: 196] ------------------ 325| | // other.shift != shift is a theoretical possibility for 326| | // relaxed trees that sadly we haven't managed to exercise 327| | // in tests yet... 328| 21.9k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 21.2k, False: 676] ------------------ 329| 21.2k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 11.2k, False: 10.0k] ------------------ 330| 21.2k| other.shift, 331| 21.2k| tail_off_other, 332| 21.2k| equals_visitor::rrb{}, 333| 21.2k| iter_t{other}, 334| 21.2k| root, 335| 21.2k| shift, 336| 21.2k| tail_off)) 337| 11.2k| return false; 338| 21.2k| } else { 339| 676| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 268, False: 408] ------------------ 340| 676| shift, 341| 676| tail_off, 342| 676| equals_visitor::rrb{}, 343| 676| iter_t{*this}, 344| 676| other.root, 345| 676| other.shift, 346| 676| tail_off_other)) 347| 268| return false; 348| 676| } 349| 21.9k| } 350| 11.6k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 6.91k, False: 4.70k] ------------------ 351| 11.6k| ? make_leaf_sub_pos(tail, tail_size()) 352| 6.91k| .visit(equals_visitor{}, other.tail) 353| 11.6k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 2.09k, False: 2.61k] ------------------ 354| 4.70k| ? std::equal(tail->leaf(), 355| 2.09k| tail->leaf() + (size - tail_off), 356| 2.09k| other.tail->leaf() + 357| 2.09k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 4.70k| : std::equal(tail->leaf(), 360| 2.61k| tail->leaf() + (size - tail_off), 361| 2.61k| iter_t{other} + tail_off); 362| 23.1k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10region_forEm: 524| 1.21M| { 525| 1.21M| using std::get; 526| 1.21M| auto tail_off = tail_offset(); 527| 1.21M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 4.44k, False: 1.20M] ------------------ 528| 4.44k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.20M| } else { 530| 1.20M| auto subs = visit_maybe_relaxed_sub( 531| 1.20M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.20M| auto first = idx - get<1>(subs); 533| 1.20M| auto end = first + get<2>(subs); 534| 1.20M| return std::make_tuple(get<0>(subs), first, end); 535| 1.20M| } 536| 1.21M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11dereferenceEv: 90| 9.08M| { 91| 9.08M| using std::get; 92| 9.08M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 84.9k, False: 8.99M] | Branch (92:35): [True: 1.12M, False: 7.87M] ------------------ 93| 1.21M| curr_ = v_->region_for(i_); 94| 9.08M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 9.08M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7advanceEl: 74| 174k| { 75| 174k| using std::get; 76| 174k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 331, False: 173k] | Branch (76:9): [True: 173k, False: 0] | Branch (76:9): [True: 174k, False: 0] ------------------ 77| 174k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 174k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 174k, False: 0] ------------------ 78| 174k| i_ += n; 79| 174k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9incrementEv: 60| 7.93M| { 61| 7.93M| using std::get; 62| 7.93M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 7.93M, False: 0] ------------------ 63| 7.93M| ++i_; 64| 7.93M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKNS1_7rrbtreeIiSA_Lj3ELj3EEE: 39| 24.5k| : v_{&v} 40| 24.5k| , i_{0} 41| 24.5k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 24.5k| { 43| 24.5k| } _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| 23.9k| { 32| 23.9k| return Deriv::visit_inner(std::forward(args)...); 33| 23.9k| } _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| 93.6k| { 32| 93.6k| return Deriv::visit_inner(std::forward(args)...); 33| 93.6k| } _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.53k| { 38| 1.53k| return Deriv::visit_inner(std::forward(args)...); 39| 1.53k| } _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.25k| { 38| 7.25k| return Deriv::visit_inner(std::forward(args)...); 39| 7.25k| } _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.58k| { 38| 8.58k| return Deriv::visit_inner(std::forward(args)...); 39| 8.58k| } _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| 744| { 38| 744| return Deriv::visit_inner(std::forward(args)...); 39| 744| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EEEE13visit_regularIJRNS1_15regular_sub_posISD_EEmEEEDcDpOT_: 37| 1.85k| { 38| 1.85k| return Deriv::visit_inner(std::forward(args)...); 39| 1.85k| } _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.25k| { 38| 7.25k| return Deriv::visit_inner(std::forward(args)...); 39| 7.25k| } _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.25k| { 44| 7.25k| return Deriv::visit_node(std::forward(args)...); 45| 7.25k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 31| 5.00k| { 32| 5.00k| return Deriv::visit_inner(std::forward(args)...); 33| 5.00k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 43| 5.00k| { 44| 5.00k| return Deriv::visit_node(std::forward(args)...); 45| 5.00k| } _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.34M| { 50| 8.34M| return Deriv::visit_node(std::forward(args)...); 51| 8.34M| } _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| 122M| { 32| 122M| return Deriv::visit_inner(std::forward(args)...); 33| 122M| } _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| 122M| { 44| 122M| return Deriv::visit_node(std::forward(args)...); 45| 122M| } _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| 122M| { 32| 122M| return Deriv::visit_inner(std::forward(args)...); 33| 122M| } _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| 17.2k| { 32| 17.2k| return Deriv::visit_inner(std::forward(args)...); 33| 17.2k| } _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| 300| { 38| 300| return Deriv::visit_inner(std::forward(args)...); 39| 300| } _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| 906| { 38| 906| return Deriv::visit_inner(std::forward(args)...); 39| 906| } _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.31M| { 50| 6.31M| return Deriv::visit_node(std::forward(args)...); 51| 6.31M| } _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| 611k| { 38| 611k| return Deriv::visit_inner(std::forward(args)...); 39| 611k| } _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| 611k| { 44| 611k| return Deriv::visit_node(std::forward(args)...); 45| 611k| } _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| 611k| { 38| 611k| return Deriv::visit_inner(std::forward(args)...); 39| 611k| } _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.46M| { 38| 4.46M| return Deriv::visit_inner(std::forward(args)...); 39| 4.46M| } _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.46M| { 44| 4.46M| return Deriv::visit_node(std::forward(args)...); 45| 4.46M| } _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.46M| { 38| 4.46M| return Deriv::visit_inner(std::forward(args)...); 39| 4.46M| } _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.25k| { 38| 2.25k| return Deriv::visit_inner(std::forward(args)...); 39| 2.25k| } _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.25k| { 44| 2.25k| return Deriv::visit_node(std::forward(args)...); 45| 2.25k| } _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.14M| { 32| 1.14M| return Deriv::visit_inner(std::forward(args)...); 33| 1.14M| } _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.14M| { 44| 1.14M| return Deriv::visit_node(std::forward(args)...); 45| 1.14M| } _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.13M| { 32| 1.13M| return Deriv::visit_inner(std::forward(args)...); 33| 1.13M| } _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.13M| { 44| 1.13M| return Deriv::visit_node(std::forward(args)...); 45| 1.13M| } _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.57M| { 32| 3.57M| return Deriv::visit_inner(std::forward(args)...); 33| 3.57M| } _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.87k| { 38| 4.87k| return Deriv::visit_inner(std::forward(args)...); 39| 4.87k| } _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.16M| { 32| 1.16M| return Deriv::visit_inner(std::forward(args)...); 33| 1.16M| } _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| 421k| { 38| 421k| return Deriv::visit_inner(std::forward(args)...); 39| 421k| } _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.28k| { 38| 1.28k| return Deriv::visit_inner(std::forward(args)...); 39| 1.28k| } _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| 20.4k| { 38| 20.4k| return Deriv::visit_inner(std::forward(args)...); 39| 20.4k| } _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| 5.27k| { 38| 5.27k| return Deriv::visit_inner(std::forward(args)...); 39| 5.27k| } _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| 14.4k| { 38| 14.4k| return Deriv::visit_inner(std::forward(args)...); 39| 14.4k| } _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.57M| { 38| 1.57M| return Deriv::visit_inner(std::forward(args)...); 39| 1.57M| } _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| 8.07M| { 32| 8.07M| return Deriv::visit_inner(std::forward(args)...); 33| 8.07M| } _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| 768| { 38| 768| return Deriv::visit_inner(std::forward(args)...); 39| 768| } _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| 10.6k| { 32| 10.6k| return Deriv::visit_inner(std::forward(args)...); 33| 10.6k| } _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.50k| { 38| 1.50k| return Deriv::visit_inner(std::forward(args)...); 39| 1.50k| } _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| 252| { 32| 252| return Deriv::visit_inner(std::forward(args)...); 33| 252| } _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| 465| { 32| 465| return Deriv::visit_inner(std::forward(args)...); 33| 465| } _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| 8.03M| { 32| 8.03M| return Deriv::visit_inner(std::forward(args)...); 33| 8.03M| } _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| 7.52k| { 38| 7.52k| return Deriv::visit_inner(std::forward(args)...); 39| 7.52k| } _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| 7.52k| { 44| 7.52k| return Deriv::visit_node(std::forward(args)...); 45| 7.52k| } _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.5k| { 38| 16.5k| return Deriv::visit_inner(std::forward(args)...); 39| 16.5k| } _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.5k| { 44| 16.5k| return Deriv::visit_node(std::forward(args)...); 45| 16.5k| } _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.79k| { 32| 6.79k| return Deriv::visit_inner(std::forward(args)...); 33| 6.79k| } _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.79k| { 44| 6.79k| return Deriv::visit_node(std::forward(args)...); 45| 6.79k| } _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.72k| { 38| 9.72k| return Deriv::visit_inner(std::forward(args)...); 39| 9.72k| } _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.72k| { 44| 9.72k| return Deriv::visit_node(std::forward(args)...); 45| 9.72k| } _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| 13.4k| { 32| 13.4k| return Deriv::visit_inner(std::forward(args)...); 33| 13.4k| } _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| 13.4k| { 44| 13.4k| return Deriv::visit_node(std::forward(args)...); 45| 13.4k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 25.4k| { 32| 25.4k| return Deriv::visit_inner(std::forward(args)...); 33| 25.4k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_15regular_sub_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 2.11k| { 32| 2.11k| return Deriv::visit_inner(std::forward(args)...); 33| 2.11k| } _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| 447| { 32| 447| return Deriv::visit_inner(std::forward(args)...); 33| 447| } _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| 844| { 38| 844| return Deriv::visit_inner(std::forward(args)...); 39| 844| } _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.39M| { 32| 4.39M| return Deriv::visit_inner(std::forward(args)...); 33| 4.39M| } _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| 212k| { 38| 212k| return Deriv::visit_inner(std::forward(args)...); 39| 212k| } _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| 220k| { 38| 220k| return Deriv::visit_inner(std::forward(args)...); 39| 220k| } _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| 26.0k| { 38| 26.0k| return Deriv::visit_inner(std::forward(args)...); 39| 26.0k| } _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| 15.2k| { 38| 15.2k| return Deriv::visit_inner(std::forward(args)...); 39| 15.2k| } _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| 869| { 38| 869| return Deriv::visit_inner(std::forward(args)...); 39| 869| } _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| 12.9k| { 38| 12.9k| return Deriv::visit_inner(std::forward(args)...); 39| 12.9k| } _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| 3.36k| { 38| 3.36k| return Deriv::visit_inner(std::forward(args)...); 39| 3.36k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 4.95k| { 38| 4.95k| return Deriv::visit_inner(std::forward(args)...); 39| 4.95k| } _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| 3.81k| { 38| 3.81k| return Deriv::visit_inner(std::forward(args)...); 39| 3.81k| } _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| 142k| { 32| 142k| return Deriv::visit_inner(std::forward(args)...); 33| 142k| } _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.26k| { 32| 1.26k| return Deriv::visit_inner(std::forward(args)...); 33| 1.26k| } _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.26k| { 44| 1.26k| return Deriv::visit_node(std::forward(args)...); 45| 1.26k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 37| 8.55k| { 38| 8.55k| return Deriv::visit_inner(std::forward(args)...); 39| 8.55k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 43| 8.55k| { 44| 8.55k| return Deriv::visit_node(std::forward(args)...); 45| 8.55k| } _ZN5immer6detail15auto_const_castINS_22unsafe_refcount_policyEEERT_RKS3_: 143| 514M|{ 144| 514M| return const_cast(x); 145| 514M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 318M| { 114| 318M| check_base(); 115| 318M| auto* base = static_cast(this); 116| 318M| return reinterpret_cast(base + 1); 117| 318M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 318M| { 135| 318M| static_assert(std::is_standard_layout::value && 136| 318M| !std::is_empty::value, 137| 318M| "Please add 'true' if the derived class is emtpy"); 138| 318M| } _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| 37.2M|{ 335| 37.2M|} _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.2M| { 76| 11.2M| check_base(); 77| 11.2M| return reinterpret_cast(this); 78| 11.2M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6leaf_tEiLb1EE10check_baseEv: 94| 11.2M| { 95| | // is_standard_layout requires that only one class in the hierarchy 96| | // contains non-static data members. Since this class contains one 97| | // member, the static_assert will only hold when the derived class is 98| | // empty. 99| 11.2M| static_assert(std::is_standard_layout::value, 100| 11.2M| "Please remove 'true' if the derived class is non emtpy"); 101| 11.2M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 2.16M|{ 237| 2.16M| return std::copy(first, last, out); 238| 2.16M|} _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| 190k|{ 340| 190k| return std::forward(f1)(empty_t{}); 341| 190k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 53.4M|{ 324| 53.4M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 2.54M, False: 50.8M] ------------------ 325| 53.4M|} _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| 223k|{ 340| 223k| return std::forward(f1)(empty_t{}); 341| 223k|} _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| 148k|{ 335| 148k|} _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| 27.6k|{ 340| 27.6k| return std::forward(f1)(empty_t{}); 341| 27.6k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 354|{ 189| 354| return first + n; 190| 354|} _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| 178k|{ 340| 178k| return std::forward(f1)(empty_t{}); 341| 178k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 109k|{ 211| 109k| return std::copy(first, last, out); 212| 109k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.13M|{ 30| 1.13M| return x; 31| 1.13M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 15.5k|{ 261| 15.5k| auto ptr = Heap::allocate(sizeof(T)); 262| 15.5k| IMMER_TRY { ------------------ | | 49| 15.5k|#define IMMER_TRY try ------------------ 263| 15.5k| return new (ptr) T(std::forward(args)...); 264| 15.5k| } 265| 15.5k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 15.5k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 96| 86.1k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 246| 352k| { 247| 352k| return impl_.push_back(std::move(value)); 248| 352k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj3ELj3EEE: 536| 1.22M| : impl_(std::move(impl)) 537| 1.22M| { 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.22M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4sizeEv: 181| 4.22M| 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| 151k| { 324| 151k| return impl_.update(index, std::forward(fn)); 325| 151k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 350| 24.3k| { 351| 24.3k| return impl_.take(elems); 352| 24.3k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 376| 36.7k| { 377| 36.7k| return impl_.drop(elems); 378| 36.7k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8max_sizeEv: 90| 1.88M| 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| 655k| { 404| 655k| return l.impl_.concat(r.impl_); 405| 655k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 251| 40.2k| { 252| 40.2k| return push_back_move(move_t{}, std::move(value)); 253| 40.2k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 40.2k| { 548| 40.2k| impl_.push_back_mut({}, std::move(value)); 549| 40.2k| return std::move(*this); 550| 40.2k| } flex-vector-bo.cpp:_ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEDcmOSE_: 329| 32.1k| { 330| 32.1k| return update_move(move_t{}, index, std::forward(fn)); 331| 32.1k| } 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| 32.1k| { 569| 32.1k| impl_.update_mut({}, index, std::forward(fn)); 570| 32.1k| return std::move(*this); 571| 32.1k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 355| 32.1k| { 356| 32.1k| return take_move(move_t{}, elems); 357| 32.1k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 32.1k| { 580| 32.1k| impl_.take_mut({}, elems); 581| 32.1k| return std::move(*this); 582| 32.1k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 381| 61.3k| { 382| 61.3k| return drop_move(move_t{}, elems); 383| 61.3k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 61.3k| { 590| 61.3k| impl_.drop_mut({}, elems); 591| 61.3k| return std::move(*this); 592| 61.3k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERKS9_: 409| 222k| { 410| 222k| return concat_move(move_t{}, std::move(l), r); 411| 222k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 222k| { 601| 222k| concat_mut_l(l.impl_, {}, r.impl_); 602| 222k| return std::move(l); 603| 222k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEOS9_: 415| 4.06k| { 416| 4.06k| return concat_move(move_t{}, l, std::move(r)); 417| 4.06k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 4.06k| { 607| 4.06k| concat_mut_r(l.impl_, r.impl_, {}); 608| 4.06k| return std::move(r); 609| 4.06k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESA_: 421| 988k| { 422| 988k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 988k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 988k| { 613| 988k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 988k| return std::move(l); 615| 988k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEeqERKS9_: 222| 79.6k| { 223| 79.6k| return impl_.equals(other.impl_); 224| 79.6k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5eraseEm: 480| 6.84k| { 481| 6.84k| return take(pos) + drop(pos + 1); 482| 6.84k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6insertEmi: 442| 15.5k| { 443| 15.5k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 15.5k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 40.2M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 40.2M| { 28| 40.2M| return ::operator new(size); 29| 40.2M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 15.5k| { 50| 15.5k| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 15.5k| new (p) std::size_t{size}; 52| 15.5k| return ((char*) p) + extra_size; 53| 15.5k| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 15.5k| { 58| 15.5k| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 15.5k| assert(*p == size); ------------------ | Branch (59:9): [True: 15.5k, False: 0] ------------------ 60| 15.5k| Base::deallocate(size + extra_size, p, tags...); 61| 15.5k| } _ZN5immer15refcount_policyC2Ev: 28| 15.5k| : refcount{1} {}; _ZN5immer15refcount_policy3decEv: 36| 15.5k| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer22unsafe_refcount_policyC2Ev: 27| 40.2M| : refcount{1} {}; _ZN5immer22unsafe_refcount_policy3incEv: 33| 235M| void inc() { ++refcount; } _ZN5immer22unsafe_refcount_policy3decEv: 34| 275M| bool dec() { return --refcount == 0; } _ZN5immer22unsafe_refcount_policy6uniqueEv: 35| 2.79M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee5ownedEv: 36| 40.2M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee10can_mutateENS6_4editE: 35| 290k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeaSENS6_4editE: 34| 657k| ownee& operator=(edit) { return *this; };