LLVMFuzzerTestOneInput: 24| 10.3k|{ 25| 10.3k| constexpr auto var_count = 8; 26| 10.3k| constexpr auto bits = 3; 27| | 28| 10.3k| using vector_t = immer::flex_vector; 29| 10.3k| using size_t = std::uint8_t; 30| | 31| 10.3k| auto vars = std::array{}; 32| | 33| 10.3k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 34| 10.3k| auto is_valid_var_neq = [](auto other) { 35| 10.3k| return [=](auto idx) { 36| 10.3k| return idx >= 0 && idx < var_count && idx != other; 37| 10.3k| }; 38| 10.3k| }; 39| 10.3k| auto is_valid_index = [](auto& v) { 40| 10.3k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 10.3k| }; 42| 10.3k| auto is_valid_size = [](auto& v) { 43| 10.3k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 10.3k| }; 45| 10.3k| auto can_concat = [](auto&& v1, auto&& v2) { 46| 10.3k| return v1.size() + v2.size() < vector_t::max_size(); 47| 10.3k| }; 48| 10.3k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 10.3k| return v.size() < (1 << 15); 51| 10.3k| }; 52| 10.3k| return fuzzer_input{data, size}.run([&](auto& in) { 53| 10.3k| enum ops 54| 10.3k| { 55| 10.3k| op_push_back, 56| 10.3k| op_update, 57| 10.3k| op_take, 58| 10.3k| op_drop, 59| 10.3k| op_concat, 60| 10.3k| op_push_back_move, 61| 10.3k| op_update_move, 62| 10.3k| op_take_move, 63| 10.3k| op_drop_move, 64| 10.3k| op_concat_move_l, 65| 10.3k| op_concat_move_r, 66| 10.3k| op_concat_move_lr, 67| 10.3k| op_insert, 68| 10.3k| op_erase, 69| 10.3k| op_compare, 70| 10.3k| }; 71| 10.3k| auto src = read(in, is_valid_var); 72| 10.3k| auto dst = read(in, is_valid_var); 73| 10.3k| switch (read(in)) { 74| 10.3k| case op_push_back: { 75| 10.3k| vars[dst] = vars[src].push_back(42); 76| 10.3k| break; 77| 10.3k| } 78| 10.3k| case op_update: { 79| 10.3k| auto idx = read(in, is_valid_index(vars[src])); 80| 10.3k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 10.3k| break; 82| 10.3k| } 83| 10.3k| case op_take: { 84| 10.3k| auto idx = read(in, is_valid_size(vars[src])); 85| 10.3k| vars[dst] = vars[src].take(idx); 86| 10.3k| break; 87| 10.3k| } 88| 10.3k| case op_drop: { 89| 10.3k| auto idx = read(in, is_valid_size(vars[src])); 90| 10.3k| vars[dst] = vars[src].drop(idx); 91| 10.3k| break; 92| 10.3k| } 93| 10.3k| case op_concat: { 94| 10.3k| auto src2 = read(in, is_valid_var); 95| 10.3k| if (can_concat(vars[src], vars[src2])) 96| 10.3k| vars[dst] = vars[src] + vars[src2]; 97| 10.3k| break; 98| 10.3k| } 99| 10.3k| case op_push_back_move: { 100| 10.3k| vars[dst] = std::move(vars[src]).push_back(21); 101| 10.3k| break; 102| 10.3k| } 103| 10.3k| case op_update_move: { 104| 10.3k| auto idx = read(in, is_valid_index(vars[src])); 105| 10.3k| vars[dst] = 106| 10.3k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 10.3k| break; 108| 10.3k| } 109| 10.3k| case op_take_move: { 110| 10.3k| auto idx = read(in, is_valid_size(vars[src])); 111| 10.3k| vars[dst] = std::move(vars[src]).take(idx); 112| 10.3k| break; 113| 10.3k| } 114| 10.3k| case op_drop_move: { 115| 10.3k| auto idx = read(in, is_valid_size(vars[src])); 116| 10.3k| vars[dst] = std::move(vars[src]).drop(idx); 117| 10.3k| break; 118| 10.3k| } 119| 10.3k| case op_concat_move_l: { 120| 10.3k| auto src2 = read(in, is_valid_var_neq(src)); 121| 10.3k| if (can_concat(vars[src], vars[src2])) 122| 10.3k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 10.3k| break; 124| 10.3k| } 125| 10.3k| case op_concat_move_r: { 126| 10.3k| auto src2 = read(in, is_valid_var_neq(src)); 127| 10.3k| if (can_concat(vars[src], vars[src2])) 128| 10.3k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 10.3k| break; 130| 10.3k| } 131| 10.3k| case op_concat_move_lr: { 132| 10.3k| auto src2 = read(in, is_valid_var_neq(src)); 133| 10.3k| if (can_concat(vars[src], vars[src2])) 134| 10.3k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 10.3k| break; 136| 10.3k| } 137| 10.3k| case op_compare: { 138| 10.3k| using std::swap; 139| 10.3k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 140| 10.3k| swap(vars[src], vars[dst]); 141| 10.3k| break; 142| 10.3k| } 143| 10.3k| case op_erase: { 144| 10.3k| auto idx = read(in, is_valid_index(vars[src])); 145| 10.3k| vars[dst] = vars[src].erase(idx); 146| 10.3k| break; 147| 10.3k| } 148| 10.3k| case op_insert: { 149| 10.3k| auto idx = read(in, is_valid_size(vars[src])); 150| 10.3k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 10.3k| break; 152| 10.3k| } 153| 10.3k| default: 154| 10.3k| break; 155| 10.3k| }; 156| 10.3k| return true; 157| 10.3k| }); 158| 10.3k|} flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 52| 2.55M| return fuzzer_input{data, size}.run([&](auto& in) { 53| 2.55M| enum ops 54| 2.55M| { 55| 2.55M| op_push_back, 56| 2.55M| op_update, 57| 2.55M| op_take, 58| 2.55M| op_drop, 59| 2.55M| op_concat, 60| 2.55M| op_push_back_move, 61| 2.55M| op_update_move, 62| 2.55M| op_take_move, 63| 2.55M| op_drop_move, 64| 2.55M| op_concat_move_l, 65| 2.55M| op_concat_move_r, 66| 2.55M| op_concat_move_lr, 67| 2.55M| op_insert, 68| 2.55M| op_erase, 69| 2.55M| op_compare, 70| 2.55M| }; 71| 2.55M| auto src = read(in, is_valid_var); 72| 2.55M| auto dst = read(in, is_valid_var); 73| 2.55M| switch (read(in)) { 74| 322k| case op_push_back: { ------------------ | Branch (74:9): [True: 322k, False: 2.23M] ------------------ 75| 322k| vars[dst] = vars[src].push_back(42); 76| 322k| break; 77| 0| } 78| 160k| case op_update: { ------------------ | Branch (78:9): [True: 160k, False: 2.39M] ------------------ 79| 160k| auto idx = read(in, is_valid_index(vars[src])); 80| 160k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 160k| break; 82| 0| } 83| 1.96k| case op_take: { ------------------ | Branch (83:9): [True: 1.96k, False: 2.55M] ------------------ 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| 13.2k| case op_drop: { ------------------ | Branch (88:9): [True: 13.2k, False: 2.53M] ------------------ 89| 13.2k| auto idx = read(in, is_valid_size(vars[src])); 90| 13.2k| vars[dst] = vars[src].drop(idx); 91| 13.2k| break; 92| 0| } 93| 644k| case op_concat: { ------------------ | Branch (93:9): [True: 644k, False: 1.90M] ------------------ 94| 644k| auto src2 = read(in, is_valid_var); 95| 644k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (95:17): [True: 619k, False: 25.2k] ------------------ 96| 619k| vars[dst] = vars[src] + vars[src2]; 97| 644k| break; 98| 0| } 99| 22.3k| case op_push_back_move: { ------------------ | Branch (99:9): [True: 22.3k, False: 2.53M] ------------------ 100| 22.3k| vars[dst] = std::move(vars[src]).push_back(21); 101| 22.3k| break; 102| 0| } 103| 31.8k| case op_update_move: { ------------------ | Branch (103:9): [True: 31.8k, False: 2.52M] ------------------ 104| 31.8k| auto idx = read(in, is_valid_index(vars[src])); 105| 31.8k| vars[dst] = 106| 31.8k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 31.8k| break; 108| 0| } 109| 31.3k| case op_take_move: { ------------------ | Branch (109:9): [True: 31.3k, False: 2.52M] ------------------ 110| 31.3k| auto idx = read(in, is_valid_size(vars[src])); 111| 31.3k| vars[dst] = std::move(vars[src]).take(idx); 112| 31.3k| break; 113| 0| } 114| 56.3k| case op_drop_move: { ------------------ | Branch (114:9): [True: 56.3k, False: 2.49M] ------------------ 115| 56.3k| auto idx = read(in, is_valid_size(vars[src])); 116| 56.3k| vars[dst] = std::move(vars[src]).drop(idx); 117| 56.3k| break; 118| 0| } 119| 216k| case op_concat_move_l: { ------------------ | Branch (119:9): [True: 216k, False: 2.33M] ------------------ 120| 216k| auto src2 = read(in, is_valid_var_neq(src)); 121| 216k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (121:17): [True: 211k, False: 4.34k] ------------------ 122| 211k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 216k| break; 124| 0| } 125| 4.10k| case op_concat_move_r: { ------------------ | Branch (125:9): [True: 4.10k, False: 2.54M] ------------------ 126| 4.10k| auto src2 = read(in, is_valid_var_neq(src)); 127| 4.10k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (127:17): [True: 3.67k, False: 430] ------------------ 128| 3.67k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 4.10k| break; 130| 0| } 131| 912k| case op_concat_move_lr: { ------------------ | Branch (131:9): [True: 912k, False: 1.64M] ------------------ 132| 912k| auto src2 = read(in, is_valid_var_neq(src)); 133| 912k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (133:17): [True: 900k, False: 11.9k] ------------------ 134| 900k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 912k| break; 136| 0| } 137| 83.2k| case op_compare: { ------------------ | Branch (137:9): [True: 83.2k, False: 2.46M] ------------------ 138| 83.2k| using std::swap; 139| 83.2k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (139:17): [True: 73.1k, False: 10.1k] | Branch (139:43): [True: 5.64k, False: 67.5k] ------------------ 140| 5.64k| swap(vars[src], vars[dst]); 141| 83.2k| break; 142| 0| } 143| 6.60k| case op_erase: { ------------------ | Branch (143:9): [True: 6.60k, False: 2.54M] ------------------ 144| 6.60k| auto idx = read(in, is_valid_index(vars[src])); 145| 6.60k| vars[dst] = vars[src].erase(idx); 146| 6.60k| break; 147| 0| } 148| 15.2k| case op_insert: { ------------------ | Branch (148:9): [True: 15.2k, False: 2.53M] ------------------ 149| 15.2k| auto idx = read(in, is_valid_size(vars[src])); 150| 15.2k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 15.2k| break; 152| 0| } 153| 19.8k| default: ------------------ | Branch (153:9): [True: 19.8k, False: 2.53M] ------------------ 154| 19.8k| break; 155| 2.55M| }; 156| 2.54M| return true; 157| 2.55M| }); flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 33| 6.09M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (33:48): [True: 5.93M, False: 166k] | Branch (33:60): [True: 5.73M, False: 199k] ------------------ 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| 227k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (40:39): [True: 227k, False: 0] | Branch (40:51): [True: 199k, False: 28.1k] ------------------ flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_: 39| 199k| auto is_valid_index = [](auto& v) { 40| 199k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 199k| }; flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 80| 160k| 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| 128k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (43:39): [True: 128k, False: 0] | Branch (43:51): [True: 117k, False: 10.8k] ------------------ flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_: 42| 118k| auto is_valid_size = [](auto& v) { 43| 118k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 118k| }; 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.77M| auto can_concat = [](auto&& v1, auto&& v2) { 46| 1.77M| return v1.size() + v2.size() < vector_t::max_size(); 47| 1.77M| }; flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 106| 31.8k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 35| 1.19M| return [=](auto idx) { 36| 1.19M| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (36:20): [True: 1.17M, False: 10.3k] | Branch (36:32): [True: 1.16M, False: 18.9k] | Branch (36:51): [True: 1.13M, False: 28.2k] ------------------ 37| 1.19M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 34| 1.13M| auto is_valid_var_neq = [](auto other) { 35| 1.13M| return [=](auto idx) { 36| 1.13M| return idx >= 0 && idx < var_count && idx != other; 37| 1.13M| }; 38| 1.13M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 48| 83.2k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 83.2k| return v.size() < (1 << 15); 51| 83.2k| }; flex-vector-bo.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 10.3k| { 51| 10.3k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 6, False: 10.3k] ------------------ 52| 6| return 0; 53| 10.3k| try { 54| 2.55M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.54M, False: 10.3k] ------------------ 55| 2.54M| continue; 56| 10.3k| } catch (const no_more_input&) { 57| 10.3k| }; 58| 10.3k| return 0; 59| 10.3k| } flex-vector-bo.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 5.74M|{ 71| 5.74M| auto x = read(fz); 72| 6.10M| while (!cond(x)) ------------------ | Branch (72:12): [True: 366k, False: 5.74M] ------------------ 73| 366k| x = read(fz); 74| 5.74M| return x; 75| 5.74M|} _Z4readIcERKT_R12fuzzer_input: 64| 9.84M|{ 65| 9.84M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 9.84M|} _ZN12fuzzer_input4nextEmm: 40| 10.1M| { 41| 10.1M| auto& p = const_cast(reinterpret_cast(data_)); 42| 10.1M| auto r = std::align(align, size, p, size_); 43| 10.1M| if (r == nullptr) ------------------ | Branch (43:13): [True: 10.3k, False: 10.1M] ------------------ 44| 10.3k| throw no_more_input{}; 45| 10.1M| return next(size); 46| 10.1M| } _ZN12fuzzer_input4nextEm: 30| 10.1M| { 31| 10.1M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 10.1M] ------------------ 32| 0| throw no_more_input{}; 33| 10.1M| auto r = data_; 34| 10.1M| data_ += size; 35| 10.1M| size_ -= size; 36| 10.1M| return r; 37| 10.1M| } 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| 199k|{ 71| 199k| auto x = read(fz); 72| 227k| while (!cond(x)) ------------------ | Branch (72:12): [True: 28.1k, False: 199k] ------------------ 73| 28.1k| x = read(fz); 74| 199k| return x; 75| 199k|} _Z4readIhERKT_R12fuzzer_input: 64| 356k|{ 65| 356k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 356k|} 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| 118k|{ 71| 118k| auto x = read(fz); 72| 128k| while (!cond(x)) ------------------ | Branch (72:12): [True: 10.8k, False: 118k] ------------------ 73| 10.8k| x = read(fz); 74| 118k| return x; 75| 118k|} flex-vector-bo.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 1.13M|{ 71| 1.13M| auto x = read(fz); 72| 1.19M| while (!cond(x)) ------------------ | Branch (72:12): [True: 57.5k, False: 1.13M] ------------------ 73| 57.5k| x = read(fz); 74| 1.13M| return x; 75| 1.13M|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 15.1k| : impl_{detail::make(std::forward(arg))} 86| 15.1k| { 87| 15.1k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 15.1k| : value(std::forward(args)...) 48| 15.1k| { 49| 15.1k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 15.1k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 15.1k| 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.1k| { 132| 15.1k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 15.1k, False: 0] | Branch (132:22): [True: 15.1k, False: 0] ------------------ 133| 15.1k| impl_->~holder(); 134| 15.1k| heap::deallocate(sizeof(holder), impl_); 135| 15.1k| } 136| 15.1k| } _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| 476M| { 171| 476M| return x.get_(type_t{}); 172| 476M| } _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| 476M| { 185| 476M| return n.get_(t); 186| 476M| } _ZNK5immer6detail3csl6memberINS_22unsafe_refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 476M| 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| 37.9M| { 166| 37.9M| return x.get_(type_t{}); 167| 37.9M| } _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| 37.9M| { 180| 37.9M| return n.get_(t); 181| 37.9M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 37.9M| 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| 277k| { 171| 277k| return x.get_(type_t{}); 172| 277k| } _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| 277k| { 185| 277k| return n.get_(t); 186| 277k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 277k| 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.66M| 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.66M| { 23| 9.66M| return x.dereference(); 24| 9.66M| } _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.75M| { 87| 9.75M| static_assert(std::is_base_of::value, 88| 9.75M| "must pass a derived thing"); 89| 9.75M| return *static_cast(this); 90| 9.75M| } _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| 166k| { 152| 166k| access_t::advance(derived(), n); 153| 166k| return derived(); 154| 166k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEElEEDcOT_T0_: 46| 166k| { 47| 166k| return x.advance(d); 48| 166k| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_E7derivedEv: 92| 17.2M| { 93| 17.2M| static_assert(std::is_base_of::value, 94| 17.2M| "must pass a derived thing"); 95| 17.2M| return *static_cast(this); 96| 17.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| 8.44M| { 120| 8.44M| access_t::increment(derived()); 121| 8.44M| return derived(); 122| 8.44M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDcOT_: 28| 8.44M| { 29| 8.44M| return x.increment(); 30| 8.44M| } _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| 91.7k| { 165| 91.7k| auto tmp = derived(); 166| 91.7k| return tmp += n; 167| 91.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17make_inner_n_intoEPvmj: 213| 1.22M| { 214| 1.22M| assert(n <= branches); ------------------ | Branch (214:9): [True: 1.22M, False: 0] ------------------ 215| 1.22M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 1.22M, False: 0] ------------------ 216| 1.22M| auto p = new (buffer) node_t; 217| 1.22M| p->impl.d.data.inner.relaxed = nullptr; 218| 1.22M|#if IMMER_TAGGED_NODE 219| 1.22M| p->impl.d.kind = node_t::kind_t::inner; 220| 1.22M|#endif 221| 1.22M| return p; 222| 1.22M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14sizeof_inner_nEj: 145| 39.3M| { 146| 39.3M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 39.3M, Folded] ------------------ 147| 39.3M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 956| 124M| { 957| 124M| refs(this).inc(); 958| 124M| return this; 959| 124M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4refsEPKSB_: 203| 476M| { 204| 476M| return auto_const_cast(get(x->impl)); 205| 476M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE16make_leaf_n_intoEPvmj: 330| 1.11M| { 331| 1.11M| assert(n <= branches); ------------------ | Branch (331:9): [True: 1.11M, False: 0] ------------------ 332| 1.11M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 1.11M, False: 0] ------------------ 333| 1.11M| auto p = new (buffer) node_t; 334| 1.11M|#if IMMER_TAGGED_NODE 335| 1.11M| p->impl.d.kind = node_t::kind_t::leaf; 336| 1.11M|#endif 337| 1.11M| return p; 338| 1.11M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13sizeof_leaf_nEj: 160| 4.86M| { 161| 4.86M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 4.86M, Folded] ------------------ 162| 4.86M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7relaxedEv: 172| 679M| { 173| 679M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 679M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 679M, False: 0] ------------------ 174| 679M| return impl.d.data.inner.relaxed; 175| 679M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4kindEv: 168| 1.03G| 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| 255M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5innerEv: 184| 295M| { 185| 295M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 295M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 295M, False: 0] ------------------ 186| 295M| return impl.d.data.inner.get_storage_ptr(); 187| 295M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14delete_inner_rEPSB_j: 832| 34.5M| { 833| 34.5M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 34.5M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 34.5M, False: 0] ------------------ 834| 34.5M| auto r = p->relaxed(); 835| 34.5M| assert(r); ------------------ | Branch (835:9): [True: 34.5M, False: 0] ------------------ 836| 34.5M| static_if([&](auto) { 837| 34.5M| if (node_t::refs(r).dec()) 838| 34.5M| heap::deallocate(node_t::ownee(r).owned() 839| 34.5M| ? node_t::max_sizeof_relaxed 840| 34.5M| : node_t::sizeof_relaxed_n(n), 841| 34.5M| r); 842| 34.5M| }); 843| 34.5M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 34.5M] ------------------ 844| 34.5M| : node_t::sizeof_inner_r_n(n), 845| 34.5M| p); 846| 34.5M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPSB_: 210| 37.9M| 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| 68.9M| { 151| 68.9M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 68.9M, Folded] ------------------ 152| 68.9M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11delete_leafEPSB_j: 861| 1.52M| { 862| 1.52M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 68| 1.52M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (862:9): [True: 1.52M, False: 0] ------------------ 863| 1.52M| detail::destroy_n(p->leaf(), n); 864| 1.52M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (864:26): [True: 0, False: 1.52M] ------------------ 865| 1.52M| : node_t::sizeof_leaf_n(n), 866| 1.52M| p); 867| 1.52M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4leafEv: 190| 10.9M| { 191| 10.9M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 10.9M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 10.9M, False: 0] ------------------ 192| 10.9M| return impl.d.data.leaf.get_storage_ptr(); 193| 10.9M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12delete_innerEPSB_j: 808| 1.31M| { 809| 1.31M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 1.31M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 1.31M, False: 0] ------------------ 810| 1.31M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 1.31M, False: 0] ------------------ 811| 1.31M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 1.31M] ------------------ 812| 1.31M| : node_t::sizeof_inner_n(n), 813| 1.31M| p); 814| 1.31M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 271k| { 795| 271k| auto dst = copy_leaf_n(n + 1, src, n); 796| 271k| IMMER_TRY { ------------------ | | 49| 271k|#define IMMER_TRY try ------------------ 797| 271k| new (dst->leaf() + n) T(std::forward(x)); 798| 271k| } 799| 271k| 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| 271k| return dst; 805| 271k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_nEjPSB_j: 696| 271k| { 697| 271k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 271k, False: 0] ------------------ 698| 271k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 271k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 271k, False: 0] ------------------ 699| 271k| auto dst = make_leaf_n(allocn); 700| 271k| IMMER_TRY { ------------------ | | 49| 271k|#define IMMER_TRY try ------------------ 701| 271k| detail::uninitialized_copy( 702| 271k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 271k| } 704| 271k| 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| 271k| return dst; 709| 271k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nEj: 341| 1.11M| { 342| 1.11M| assert(n <= branches); ------------------ | Branch (342:9): [True: 1.11M, False: 0] ------------------ 343| 1.11M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 1.11M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 1.11M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nIiEEPSB_jOT_: 470| 50.9k| { 471| 50.9k| assert(n >= 1); ------------------ | Branch (471:9): [True: 50.9k, False: 0] ------------------ 472| 50.9k| auto p = make_leaf_n(n); 473| 50.9k| IMMER_TRY { ------------------ | | 49| 50.9k|#define IMMER_TRY try ------------------ 474| 50.9k| new (p->leaf()) T(std::forward(x)); 475| 50.9k| } 476| 50.9k| 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| 50.9k| return p; 481| 50.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13do_copy_innerEPSB_SC_j: 558| 1.09M| { 559| 1.09M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 1.09M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 1.09M, False: 0] ------------------ 560| 1.09M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 1.09M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 1.09M, False: 0] ------------------ 561| 1.09M| auto p = src->inner(); 562| 1.09M| inc_nodes(p, n); 563| 1.09M| std::copy(p, p + n, dst->inner()); 564| 1.09M| return dst; 565| 1.09M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9inc_nodesEPPSB_j: 970| 26.0M| { 971| 120M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 94.2M, False: 26.0M] ------------------ 972| 94.2M| refs(*i).inc(); 973| 26.0M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14copy_inner_r_nEjPSB_j: 588| 218k| { 589| 218k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 218k, False: 0] ------------------ 590| 218k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 218k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 218k, False: 0] ------------------ 591| 218k| auto dst = make_inner_r_n(allocn); 592| 218k| return do_copy_inner_r(dst, src, n); 593| 218k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15do_copy_inner_rEPSB_SC_j: 610| 267k| { 611| 267k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 267k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 267k, False: 0] ------------------ 612| 267k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 267k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 267k, False: 0] ------------------ 613| 267k| auto src_r = src->relaxed(); 614| 267k| auto dst_r = dst->relaxed(); 615| 267k| inc_nodes(src->inner(), n); 616| 267k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 267k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 267k| dst_r->d.count = n; 619| 267k| return dst; 620| 267k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_nEj: 243| 34.4M| { 244| 34.4M| assert(n <= branches); ------------------ | Branch (244:9): [True: 34.4M, False: 0] ------------------ 245| 34.4M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 34.4M| auto mr = static_cast(nullptr); 247| 34.4M| if (embed_relaxed) { ------------------ | Branch (247:13): [True: 34.4M, Folded] ------------------ 248| 34.4M| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 34.4M| } 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| 34.4M| auto p = new (mp) node_t; 259| 34.4M| auto r = new (mr) relaxed_t; 260| 34.4M| r->d.count = 0; 261| 34.4M| p->impl.d.data.inner.relaxed = r; 262| 34.4M|#if IMMER_TAGGED_NODE 263| 34.4M| p->impl.d.kind = node_t::kind_t::inner; 264| 34.4M|#endif 265| 34.4M| return p; 266| 34.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9make_pathEjPSB_: 498| 411k| { 499| 411k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 411k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 411k, False: 0] ------------------ 500| 411k| if (shift == endshift) ------------------ | Branch (500:13): [True: 337k, False: 73.3k] ------------------ 501| 337k| return node; 502| 73.3k| else { 503| 73.3k| auto n = node_t::make_inner_n(1); 504| 73.3k| IMMER_TRY { ------------------ | | 49| 73.3k|#define IMMER_TRY try ------------------ 505| 73.3k| n->inner()[0] = make_path(shift - B, node); 506| 73.3k| } 507| 73.3k| IMMER_CATCH (...) { 508| 0| heap::deallocate(node_t::sizeof_inner_n(1), n); 509| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 510| 0| } 511| 73.3k| return n; 512| 73.3k| } 513| 411k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_nEj: 224| 1.22M| { 225| 1.22M| assert(n <= branches); ------------------ | Branch (225:9): [True: 1.22M, False: 0] ------------------ 226| 1.22M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 1.22M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 1.22M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_j: 666| 173k| { 667| 173k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 173k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 173k, False: 0] ------------------ 668| 173k| auto dst = make_leaf_n(n); 669| 173k| IMMER_TRY { ------------------ | | 49| 173k|#define IMMER_TRY try ------------------ 670| 173k| detail::uninitialized_copy( 671| 173k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 173k| } 673| 173k| 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| 173k| return dst; 678| 173k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_nEjPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeE: 269| 181k| { 270| 181k| return static_if( 271| 181k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 181k| [&](auto) { 273| 181k| auto p = 274| 181k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 181k| assert(r->d.count >= n); 276| 181k| node_t::refs(r).inc(); 277| 181k| p->impl.d.data.inner.relaxed = r; 278| 181k|#if IMMER_TAGGED_NODE 279| 181k| p->impl.d.kind = node_t::kind_t::inner; 280| 181k|#endif 281| 181k| return p; 282| 181k| }); 283| 181k| } _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| 181k| [&](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| 181k| { 653| 181k| if (embed_relaxed) ------------------ | Branch (653:13): [True: 181k, Folded] ------------------ 654| 181k| 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| 181k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE23do_copy_inner_replace_rEPSB_SC_jjSC_: 624| 181k| { 625| 181k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 181k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (625:9): [True: 181k, False: 0] ------------------ 626| 181k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 181k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (626:9): [True: 181k, False: 0] ------------------ 627| 181k| auto src_r = src->relaxed(); 628| 181k| auto dst_r = dst->relaxed(); 629| 181k| auto p = src->inner(); 630| 181k| inc_nodes(p, offset); 631| 181k| inc_nodes(p + offset + 1, n - offset - 1); 632| 181k| std::copy(src->inner(), src->inner() + n, dst->inner()); 633| 181k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 634| 181k| dst_r->d.count = n; 635| 181k| dst->inner()[offset] = child; 636| 181k| return dst; 637| 181k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 76.3k| { 570| 76.3k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 76.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 76.3k, False: 0] ------------------ 571| 76.3k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 76.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 76.3k, False: 0] ------------------ 572| 76.3k| auto p = src->inner(); 573| 76.3k| inc_nodes(p, offset); 574| 76.3k| inc_nodes(p + offset + 1, n - offset - 1); 575| 76.3k| std::copy(p, p + n, dst->inner()); 576| 76.3k| dst->inner()[offset] = child; 577| 76.3k| return dst; 578| 76.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_nEjPSB_j: 543| 10.3k| { 544| 10.3k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 10.3k, False: 0] ------------------ 545| 10.3k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 10.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 10.3k, False: 0] ------------------ 546| 10.3k| auto dst = make_inner_n(allocn); 547| 10.3k| return do_copy_inner(dst, src, n); 548| 10.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_rEPSB_j: 581| 3.79k| { 582| 3.79k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 3.79k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 3.79k, False: 0] ------------------ 583| 3.79k| auto dst = make_inner_r_n(n); 584| 3.79k| return do_copy_inner_r(dst, src, n); 585| 3.79k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13compute_shiftEv: 977| 3.61M| { 978| 3.61M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 324k, False: 3.28M] ------------------ 979| 324k| return endshift; 980| 3.28M| else 981| 3.28M| return B + inner()[0]->compute_shift(); 982| 3.61M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5checkEjm: 986| 324k| { 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| 324k| return true; 1023| 324k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jj: 778| 248k| { 779| 248k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 248k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 248k, False: 0] ------------------ 780| 248k| auto dst = make_leaf_n(last - idx); 781| 248k| IMMER_TRY { ------------------ | | 49| 248k|#define IMMER_TRY try ------------------ 782| 248k| detail::uninitialized_copy( 783| 248k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 248k| } 785| 248k| 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| 248k| return dst; 790| 248k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jSC_j: 712| 238k| { 713| 238k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 238k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 238k, False: 0] ------------------ 714| 238k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 238k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 238k, False: 0] ------------------ 715| 238k| auto dst = make_leaf_n(n1 + n2); 716| 238k| IMMER_TRY { ------------------ | | 49| 238k|#define IMMER_TRY try ------------------ 717| 238k| detail::uninitialized_copy( 718| 238k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 238k| } 720| 238k| 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| 238k| IMMER_TRY { ------------------ | | 49| 238k|#define IMMER_TRY try ------------------ 725| 238k| detail::uninitialized_copy( 726| 238k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 238k| } 728| 238k| 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| 238k| return dst; 734| 238k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 2.64M| { 871| 2.64M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 2.37M, False: 277k] | Branch (871:39): [True: 0, False: 277k] ------------------ 872| 2.64M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPKSB_: 207| 277k| { 208| 277k| return get(x->impl); 209| 277k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 41.8k| { 682| 41.8k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 41.8k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 41.8k, False: 0] ------------------ 683| 41.8k| auto dst = make_leaf_e(e); 684| 41.8k| IMMER_TRY { ------------------ | | 49| 41.8k|#define IMMER_TRY try ------------------ 685| 41.8k| detail::uninitialized_copy( 686| 41.8k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 41.8k| } 688| 41.8k| 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| 41.8k| return dst; 693| 41.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 406k| { 349| 406k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 406k| ownee(p) = e; 351| 406k|#if IMMER_TAGGED_NODE 352| 406k| p->impl.d.kind = node_t::kind_t::leaf; 353| 406k|#endif 354| 406k| return p; 355| 406k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 9.29k| { 486| 9.29k| auto p = make_leaf_e(e); 487| 9.29k| IMMER_TRY { ------------------ | | 49| 9.29k|#define IMMER_TRY try ------------------ 488| 9.29k| new (p->leaf()) T(std::forward(x)); 489| 9.29k| } 490| 9.29k| 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.29k| return p; 495| 9.29k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 188k| { 931| 188k| auto src_r = relaxed(); 932| 188k| return static_if( 933| 188k| [&](auto) { return src_r; }, 934| 188k| [&](auto) { 935| 188k| if (node_t::refs(src_r).unique() || 936| 188k| node_t::ownee(src_r).can_mutate(e)) 937| 188k| return src_r; 938| 188k| else { 939| 188k| auto dst_r = 940| 188k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 188k| if (src_r) { 942| 188k| std::copy( 943| 188k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 188k| if (node_t::refs(src_r).dec()) 945| 188k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 188k| src_r); 947| 188k| } 948| 188k| dst_r->d.count = n; 949| 188k| node_t::ownee(dst_r) = e; 950| 188k| return impl.d.data.inner.relaxed = dst_r; 951| 188k| } 952| 188k| }); 953| 188k| } _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| 188k| [&](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| 136k| { 287| 136k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 136k| auto mr = static_cast(nullptr); 289| 136k| if (embed_relaxed) { ------------------ | Branch (289:13): [True: 136k, Folded] ------------------ 290| 136k| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 136k| } 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| 136k| auto p = new (mp) node_t; 301| 136k| auto r = new (mr) relaxed_t; 302| 136k| ownee(p) = e; 303| 136k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 136k| r->d.count = 0; 305| 136k| p->impl.d.data.inner.relaxed = r; 306| 136k|#if IMMER_TAGGED_NODE 307| 136k| p->impl.d.kind = node_t::kind_t::inner; 308| 136k|#endif 309| 136k| return p; 310| 136k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_path_eENS9_5applyIS6_E4type4editEjPSB_: 516| 421k| { 517| 421k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 421k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 421k, False: 0] ------------------ 518| 421k| if (shift == endshift) ------------------ | Branch (518:13): [True: 365k, False: 56.2k] ------------------ 519| 365k| return node; 520| 56.2k| else { 521| 56.2k| auto n = node_t::make_inner_e(e); 522| 56.2k| IMMER_TRY { ------------------ | | 49| 56.2k|#define IMMER_TRY try ------------------ 523| 56.2k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 56.2k| } 525| 56.2k| 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| 56.2k| return n; 530| 56.2k| } 531| 421k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 85.7k| { 232| 85.7k| auto m = heap::allocate(max_sizeof_inner); 233| 85.7k| auto p = new (m) node_t; 234| 85.7k| ownee(p) = e; 235| 85.7k| p->impl.d.data.inner.relaxed = nullptr; 236| 85.7k|#if IMMER_TAGGED_NODE 237| 85.7k| p->impl.d.kind = node_t::kind_t::inner; 238| 85.7k|#endif 239| 85.7k| return p; 240| 85.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 18.7k| { 552| 18.7k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 18.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 18.7k, False: 0] ------------------ 553| 18.7k| auto dst = make_inner_e(e); 554| 18.7k| return do_copy_inner(dst, src, n); 555| 18.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 26.9k| { 604| 26.9k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 26.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 26.9k, False: 0] ------------------ 605| 26.9k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 26.9k| return do_copy_inner_sr(dst, src, n); 607| 26.9k| } _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| 26.9k| { 314| 26.9k| return static_if( 315| 26.9k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 26.9k| [&](auto) { 317| 26.9k| auto p = 318| 26.9k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 26.9k| node_t::refs(r).inc(); 320| 26.9k| p->impl.d.data.inner.relaxed = r; 321| 26.9k| node_t::ownee(p) = e; 322| 26.9k|#if IMMER_TAGGED_NODE 323| 26.9k| p->impl.d.kind = node_t::kind_t::inner; 324| 26.9k|#endif 325| 26.9k| return p; 326| 26.9k| }); 327| 26.9k| } _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| 26.9k| [&](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| 26.9k| { 641| 26.9k| if (embed_relaxed) ------------------ | Branch (641:13): [True: 26.9k, Folded] ------------------ 642| 26.9k| 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| 26.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 354k| { 764| 354k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 354k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 354k, False: 0] ------------------ 765| 354k| auto dst = make_leaf_e(e); 766| 354k| IMMER_TRY { ------------------ | | 49| 354k|#define IMMER_TRY try ------------------ 767| 354k| detail::uninitialized_copy( 768| 354k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 354k| } 770| 354k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 354k| return dst; 775| 354k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 164k| { 878| 164k| auto src_r = relaxed(); 879| 164k| return static_if( 880| 164k| [&](auto) { return src_r; }, 881| 164k| [&](auto) { 882| 164k| if (node_t::refs(src_r).unique() || 883| 164k| node_t::ownee(src_r).can_mutate(e)) 884| 164k| return src_r; 885| 164k| else { 886| 164k| auto dst_r = impl.d.data.inner.relaxed = 887| 164k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 164k| if (src_r) { 889| 164k| auto n = dst_r->d.count = src_r->d.count; 890| 164k| std::copy( 891| 164k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 164k| if (node_t::refs(src_r).dec()) 893| 164k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 164k| src_r); 895| 164k| } 896| 164k| node_t::ownee(dst_r) = e; 897| 164k| return dst_r; 898| 164k| } 899| 164k| }); 900| 164k| } _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| 164k| [&](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| 515| { 739| 515| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 515|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 515, False: 0] ------------------ 740| 515| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 515|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 515, False: 0] ------------------ 741| 515| auto dst = make_leaf_e(e); 742| 515| IMMER_TRY { ------------------ | | 49| 515|#define IMMER_TRY try ------------------ 743| 515| detail::uninitialized_copy( 744| 515| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 515| } 746| 515| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 515| IMMER_TRY { ------------------ | | 49| 515|#define IMMER_TRY try ------------------ 751| 515| detail::uninitialized_copy( 752| 515| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 515| } 754| 515| 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| 515| return dst; 760| 515| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 523| 173M| { 524| 173M| using node_t = node_type; 525| 173M| auto node = p.node(); 526| 173M| if (node->dec()) { ------------------ | Branch (526:13): [True: 34.5M, False: 138M] ------------------ 527| 34.5M| p.each(this_t{}); 528| 34.5M| node_t::delete_inner_r(node, p.count()); 529| 34.5M| } 530| 173M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 13.4M| { 535| 13.4M| using node_t = node_type; 536| 13.4M| auto node = p.node(); 537| 13.4M| if (node->dec()) { ------------------ | Branch (537:13): [True: 410k, False: 13.0M] ------------------ 538| 410k| p.each(this_t{}); 539| 410k| node_t::delete_inner(node, p.count()); 540| 410k| } 541| 13.4M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.58M| { 546| 1.58M| using node_t = node_type; 547| 1.58M| auto node = p.node(); 548| 1.58M| if (node->dec()) { ------------------ | Branch (548:13): [True: 541k, False: 1.04M] ------------------ 549| 541k| node_t::delete_leaf(node, p.count()); 550| 541k| } 551| 1.58M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 378k| { 546| 378k| using node_t = node_type; 547| 378k| auto node = p.node(); 548| 378k| if (node->dec()) { ------------------ | Branch (548:13): [True: 61.1k, False: 317k] ------------------ 549| 61.1k| node_t::delete_leaf(node, p.count()); 550| 61.1k| } 551| 378k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 2.56M| { 535| 2.56M| using node_t = node_type; 536| 2.56M| auto node = p.node(); 537| 2.56M| if (node->dec()) { ------------------ | Branch (537:13): [True: 93.3k, False: 2.47M] ------------------ 538| 93.3k| p.each(this_t{}); 539| 93.3k| node_t::delete_inner(node, p.count()); 540| 93.3k| } 541| 2.56M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 842k| { 535| 842k| using node_t = node_type; 536| 842k| auto node = p.node(); 537| 842k| if (node->dec()) { ------------------ | Branch (537:13): [True: 796k, False: 45.5k] ------------------ 538| 796k| p.each(this_t{}); 539| 796k| node_t::delete_inner(node, p.count()); 540| 796k| } 541| 842k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 1.41M| { 535| 1.41M| using node_t = node_type; 536| 1.41M| auto node = p.node(); 537| 1.41M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 1.41M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 1.41M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 61.0M| { 546| 61.0M| using node_t = node_type; 547| 61.0M| auto node = p.node(); 548| 61.0M| if (node->dec()) { ------------------ | Branch (548:13): [True: 918k, False: 60.0M] ------------------ 549| 918k| node_t::delete_leaf(node, p.count()); 550| 918k| } 551| 61.0M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.28M| { 546| 1.28M| using node_t = node_type; 547| 1.28M| auto node = p.node(); 548| 1.28M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 1.28M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 1.28M| } _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| 222k| { 792| 222k| auto level = pos.shift(); 793| 222k| auto idx = pos.count() - 1; 794| 222k| auto children = pos.size(idx); 795| 222k| auto new_idx = 796| 222k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 14.5k, False: 207k] | Branch (796:47): [True: 645, False: 207k] ------------------ 797| 222k| auto new_child = static_cast(nullptr); 798| 222k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 5.15k, False: 217k] ------------------ 799| 5.15k| return nullptr; 800| 217k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 207k, False: 10.0k] ------------------ 801| 207k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 207k| if (!new_child) { ------------------ | Branch (802:17): [True: 6.67k, False: 200k] ------------------ 803| 6.67k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 3.15k, False: 3.52k] ------------------ 804| 3.15k| new_child = node_t::make_path(level - B, tail); 805| 3.52k| else 806| 3.52k| return nullptr; 807| 6.67k| } 808| 207k| } else 809| 10.0k| new_child = node_t::make_path(level - B, tail); 810| 213k| IMMER_TRY { ------------------ | | 49| 213k|#define IMMER_TRY try ------------------ 811| 213k| auto count = new_idx + 1; 812| 213k| auto new_parent = 813| 213k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 213k| auto new_relaxed = new_parent->relaxed(); 815| 213k| new_parent->inner()[new_idx] = new_child; 816| 213k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 213k| new_relaxed->d.count = count; 818| 213k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 213k, False: 0] ------------------ 819| 213k| return new_parent; 820| 213k| } 821| 213k| 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| 213k| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_SJ_DpOT0_: 834| 39.4k| { 835| 39.4k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 39.4k, False: 0] ------------------ 836| 39.4k| auto idx = pos.index(pos.size() - 1); 837| 39.4k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 39.4k| auto count = new_idx + 1; 839| 39.4k| auto new_parent = node_t::make_inner_n(count); 840| 39.4k| IMMER_TRY { ------------------ | | 49| 39.4k|#define IMMER_TRY try ------------------ 841| 39.4k| new_parent->inner()[new_idx] = 842| 39.4k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 29.3k, False: 10.1k] ------------------ 843| | /* otherwise */ 844| 39.4k| : node_t::make_path(pos.shift() - B, tail); 845| 39.4k| } 846| 39.4k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 39.4k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 39.4k| } _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| 756k| { 835| 756k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 756k, False: 0] ------------------ 836| 756k| auto idx = pos.index(pos.size() - 1); 837| 756k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 756k| auto count = new_idx + 1; 839| 756k| auto new_parent = node_t::make_inner_n(count); 840| 756k| IMMER_TRY { ------------------ | | 49| 756k|#define IMMER_TRY try ------------------ 841| 756k| new_parent->inner()[new_idx] = 842| 756k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 480k, False: 275k] ------------------ 843| | /* otherwise */ 844| 756k| : node_t::make_path(pos.shift() - B, tail); 845| 756k| } 846| 756k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 756k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 756k| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_jm: 562| 425|{ 563| 425| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 425|} _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| 266k| { 835| 266k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 266k, False: 0] ------------------ 836| 266k| auto idx = pos.index(pos.size() - 1); 837| 266k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 266k| auto count = new_idx + 1; 839| 266k| auto new_parent = node_t::make_inner_n(count); 840| 266k| IMMER_TRY { ------------------ | | 49| 266k|#define IMMER_TRY try ------------------ 841| 266k| new_parent->inner()[new_idx] = 842| 266k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 246k, False: 19.9k] ------------------ 843| | /* otherwise */ 844| 266k| : node_t::make_path(pos.shift() - B, tail); 845| 266k| } 846| 266k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 266k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 266k| } 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| 101k| { 503| 101k| auto offset = pos.index(idx); 504| 101k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 101k| IMMER_TRY { ------------------ | | 49| 101k|#define IMMER_TRY try ------------------ 506| 101k| node->leaf()[offset] = 507| 101k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 101k| return node; 509| 101k| } 510| 101k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 101k| } 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| 181k| { 467| 181k| auto offset = pos.index(idx); 468| 181k| auto count = pos.count(); 469| 181k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 181k| IMMER_TRY { ------------------ | | 49| 181k|#define IMMER_TRY try ------------------ 471| 181k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 181k| node_t::do_copy_inner_replace_sr( 473| 181k| node, pos.node(), count, offset, child); 474| 181k| return node; 475| 181k| } 476| 181k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 181k| } 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| 59.4k| { 485| 59.4k| auto offset = pos.index(idx); 486| 59.4k| auto count = pos.count(); 487| 59.4k| auto node = node_t::make_inner_n(count); 488| 59.4k| IMMER_TRY { ------------------ | | 49| 59.4k|#define IMMER_TRY try ------------------ 489| 59.4k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 59.4k| node_t::do_copy_inner_replace( 491| 59.4k| node, pos.node(), count, offset, child); 492| 59.4k| return node; 493| 59.4k| } 494| 59.4k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 59.4k| } 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| 11.8k| { 503| 11.8k| auto offset = pos.index(idx); 504| 11.8k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 11.8k| IMMER_TRY { ------------------ | | 49| 11.8k|#define IMMER_TRY try ------------------ 506| 11.8k| node->leaf()[offset] = 507| 11.8k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 11.8k| return node; 509| 11.8k| } 510| 11.8k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 11.8k| } 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| 12.7k| { 485| 12.7k| auto offset = pos.index(idx); 486| 12.7k| auto count = pos.count(); 487| 12.7k| auto node = node_t::make_inner_n(count); 488| 12.7k| IMMER_TRY { ------------------ | | 49| 12.7k|#define IMMER_TRY try ------------------ 489| 12.7k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 12.7k| node_t::do_copy_inner_replace( 491| 12.7k| node, pos.node(), count, offset, child); 492| 12.7k| return node; 493| 12.7k| } 494| 12.7k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 12.7k| } 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| 47.5k| { 503| 47.5k| auto offset = pos.index(idx); 504| 47.5k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 47.5k| IMMER_TRY { ------------------ | | 49| 47.5k|#define IMMER_TRY try ------------------ 506| 47.5k| node->leaf()[offset] = 507| 47.5k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 47.5k| return node; 509| 47.5k| } 510| 47.5k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 47.5k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_11regular_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 4.18k| { 485| 4.18k| auto offset = pos.index(idx); 486| 4.18k| auto count = pos.count(); 487| 4.18k| auto node = node_t::make_inner_n(count); 488| 4.18k| IMMER_TRY { ------------------ | | 49| 4.18k|#define IMMER_TRY try ------------------ 489| 4.18k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 4.18k| node_t::do_copy_inner_replace( 491| 4.18k| node, pos.node(), count, offset, child); 492| 4.18k| return node; 493| 4.18k| } 494| 4.18k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 4.18k| } _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.5k| { 1097| 35.5k| auto idx = pos.index(last); 1098| 35.5k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 35.5k, Folded] | Branch (1098:25): [True: 28.1k, False: 7.35k] ------------------ 1099| 28.1k| return pos.towards_oh(this_t{}, last, idx); 1100| 28.1k| } else { 1101| 7.35k| using std::get; 1102| 7.35k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 7.35k| auto next = get<1>(subs); 1104| 7.35k| auto ts = get<2>(subs); 1105| 7.35k| auto tail = get<3>(subs); 1106| 7.35k| IMMER_TRY { ------------------ | | 49| 7.35k|#define IMMER_TRY try ------------------ 1107| 7.35k| if (next) { ------------------ | Branch (1107:21): [True: 4.09k, False: 3.25k] ------------------ 1108| 4.09k| auto count = idx + 1; 1109| 4.09k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 4.09k| auto newr = newn->relaxed(); 1111| 4.09k| newn->inner()[idx] = next; 1112| 4.09k| newr->d.sizes[idx] = last + 1 - ts; 1113| 4.09k| newr->d.count = count; 1114| 4.09k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 4.09k, False: 0] ------------------ 1115| 4.09k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 4.09k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 3.25k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 3.25k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 3.25k, Folded] | Branch (1118:40): [True: 1.68k, False: 1.57k] | Branch (1118:52): [True: 1.07k, False: 605] ------------------ 1119| 1.07k| auto newn = pos.node()->inner()[0]; 1120| 1.07k| return std::make_tuple( 1121| 1.07k| pos.shift() - B, newn->inc(), ts, tail); 1122| 2.17k| } else { 1123| 2.17k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 2.17k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 2.17k| } 1126| 7.35k| } 1127| 7.35k| 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.35k| } 1138| 35.5k| } _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| 2.01k| { 1182| 2.01k| auto old_tail_size = pos.count(); 1183| 2.01k| auto new_tail_size = pos.index(last) + 1; 1184| 2.01k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 599, False: 1.41k] ------------------ 1185| 2.01k| ? pos.node()->inc() 1186| 2.01k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.01k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.01k| } _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.18k| { 1182| 4.18k| auto old_tail_size = pos.count(); 1183| 4.18k| auto new_tail_size = pos.index(last) + 1; 1184| 4.18k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.41k, False: 2.77k] ------------------ 1185| 4.18k| ? pos.node()->inc() 1186| 4.18k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 4.18k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 4.18k| } _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.55k| { 1097| 3.55k| auto idx = pos.index(last); 1098| 3.55k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 3.55k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 3.55k| } else { 1101| 3.55k| using std::get; 1102| 3.55k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 3.55k| auto next = get<1>(subs); 1104| 3.55k| auto ts = get<2>(subs); 1105| 3.55k| auto tail = get<3>(subs); 1106| 3.55k| IMMER_TRY { ------------------ | | 49| 3.55k|#define IMMER_TRY try ------------------ 1107| 3.55k| if (next) { ------------------ | Branch (1107:21): [True: 792, False: 2.76k] ------------------ 1108| 792| auto count = idx + 1; 1109| 792| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 792| auto newr = newn->relaxed(); 1111| 792| newn->inner()[idx] = next; 1112| 792| newr->d.sizes[idx] = last + 1 - ts; 1113| 792| newr->d.count = count; 1114| 792| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 792, False: 0] ------------------ 1115| 792| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 2.76k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 1.14k, False: 1.62k] ------------------ 1117| 1.14k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 1.62k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 1.62k] | 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.62k| } else { 1123| 1.62k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.62k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.62k| } 1126| 3.55k| } 1127| 3.55k| 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.55k| } 1138| 3.55k| } _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.16k| { 1143| 3.16k| auto idx = pos.index(last); 1144| 3.16k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.16k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 3.16k| } else { 1147| 3.16k| using std::get; 1148| 3.16k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.16k| auto next = get<1>(subs); 1150| 3.16k| auto ts = get<2>(subs); 1151| 3.16k| auto tail = get<3>(subs); 1152| 3.16k| IMMER_TRY { ------------------ | | 49| 3.16k|#define IMMER_TRY try ------------------ 1153| 3.16k| if (next) { ------------------ | Branch (1153:21): [True: 1.67k, False: 1.48k] ------------------ 1154| 1.67k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.67k| newn->inner()[idx] = next; 1156| 1.67k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.67k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 687, False: 797] ------------------ 1158| 687| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 797| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 797] | 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| 797| } else { 1164| 797| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 797| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 797| } 1167| 3.16k| } 1168| 3.16k| 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.16k| } 1177| 3.16k| } _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| 5.81k| { 1182| 5.81k| auto old_tail_size = pos.count(); 1183| 5.81k| auto new_tail_size = pos.index(last) + 1; 1184| 5.81k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.63k, False: 4.17k] ------------------ 1185| 5.81k| ? pos.node()->inc() 1186| 5.81k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 5.81k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 5.81k| } _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.24k| { 1143| 2.24k| auto idx = pos.index(last); 1144| 2.24k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.24k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.24k| } else { 1147| 2.24k| using std::get; 1148| 2.24k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.24k| auto next = get<1>(subs); 1150| 2.24k| auto ts = get<2>(subs); 1151| 2.24k| auto tail = get<3>(subs); 1152| 2.24k| IMMER_TRY { ------------------ | | 49| 2.24k|#define IMMER_TRY try ------------------ 1153| 2.24k| if (next) { ------------------ | Branch (1153:21): [True: 238, False: 2.00k] ------------------ 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.00k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 423, False: 1.58k] ------------------ 1158| 423| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.58k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.58k] | 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.58k| } else { 1164| 1.58k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.58k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.58k| } 1167| 2.24k| } 1168| 2.24k| 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.24k| } 1177| 2.24k| } _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.43k| { 1182| 2.43k| auto old_tail_size = pos.count(); 1183| 2.43k| auto new_tail_size = pos.index(last) + 1; 1184| 2.43k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.01k, False: 1.41k] ------------------ 1185| 2.43k| ? pos.node()->inc() 1186| 2.43k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.43k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.43k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.85k| { 1143| 2.85k| auto idx = pos.index(last); 1144| 2.85k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.85k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.85k| } else { 1147| 2.85k| using std::get; 1148| 2.85k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.85k| auto next = get<1>(subs); 1150| 2.85k| auto ts = get<2>(subs); 1151| 2.85k| auto tail = get<3>(subs); 1152| 2.85k| IMMER_TRY { ------------------ | | 49| 2.85k|#define IMMER_TRY try ------------------ 1153| 2.85k| if (next) { ------------------ | Branch (1153:21): [True: 819, False: 2.03k] ------------------ 1154| 819| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 819| newn->inner()[idx] = next; 1156| 819| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.03k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.00k, False: 1.03k] ------------------ 1158| 1.00k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.03k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.03k] | 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.03k| } else { 1164| 1.03k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.03k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.03k| } 1167| 2.85k| } 1168| 2.85k| 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.85k| } 1177| 2.85k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_j: 556| 38.7k|{ 557| 38.7k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 38.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| 7.77k| { 1143| 7.77k| auto idx = pos.index(last); 1144| 7.77k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 7.77k, Folded] | Branch (1144:25): [True: 5.48k, False: 2.28k] ------------------ 1145| 5.48k| return pos.towards_oh(this_t{}, last, idx); 1146| 5.48k| } else { 1147| 2.28k| using std::get; 1148| 2.28k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.28k| auto next = get<1>(subs); 1150| 2.28k| auto ts = get<2>(subs); 1151| 2.28k| auto tail = get<3>(subs); 1152| 2.28k| IMMER_TRY { ------------------ | | 49| 2.28k|#define IMMER_TRY try ------------------ 1153| 2.28k| if (next) { ------------------ | Branch (1153:21): [True: 584, False: 1.70k] ------------------ 1154| 584| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 584| newn->inner()[idx] = next; 1156| 584| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.70k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 1.70k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.70k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 1.70k, Folded] | Branch (1159:40): [True: 1.15k, False: 554] | Branch (1159:52): [True: 541, False: 609] ------------------ 1160| 541| auto newn = pos.node()->inner()[0]; 1161| 541| return std::make_tuple( 1162| 541| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.16k| } else { 1164| 1.16k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.16k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.16k| } 1167| 2.28k| } 1168| 2.28k| 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.28k| } 1177| 7.77k| } _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.85k| { 1182| 1.85k| auto old_tail_size = pos.count(); 1183| 1.85k| auto new_tail_size = pos.index(last) + 1; 1184| 1.85k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 730, False: 1.12k] ------------------ 1185| 1.85k| ? pos.node()->inc() 1186| 1.85k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.85k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.85k| } _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.04k| { 1143| 5.04k| auto idx = pos.index(last); 1144| 5.04k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 5.04k, Folded] | Branch (1144:25): [True: 2.24k, False: 2.80k] ------------------ 1145| 2.24k| return pos.towards_oh(this_t{}, last, idx); 1146| 2.80k| } else { 1147| 2.80k| using std::get; 1148| 2.80k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.80k| auto next = get<1>(subs); 1150| 2.80k| auto ts = get<2>(subs); 1151| 2.80k| auto tail = get<3>(subs); 1152| 2.80k| IMMER_TRY { ------------------ | | 49| 2.80k|#define IMMER_TRY try ------------------ 1153| 2.80k| if (next) { ------------------ | Branch (1153:21): [True: 352, False: 2.45k] ------------------ 1154| 352| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 352| newn->inner()[idx] = next; 1156| 352| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.45k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.45k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.45k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.45k, Folded] | Branch (1159:40): [True: 748, False: 1.70k] | Branch (1159:52): [True: 323, False: 425] ------------------ 1160| 323| auto newn = pos.node()->inner()[0]; 1161| 323| return std::make_tuple( 1162| 323| pos.shift() - B, newn->inc(), ts, tail); 1163| 2.12k| } else { 1164| 2.12k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 2.12k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 2.12k| } 1167| 2.80k| } 1168| 2.80k| 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.80k| } 1177| 5.04k| } _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| 830| { 1182| 830| auto old_tail_size = pos.count(); 1183| 830| auto new_tail_size = pos.index(last) + 1; 1184| 830| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 333, False: 497] ------------------ 1185| 830| ? pos.node()->inc() 1186| 830| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 830| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 830| } _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| 22.7k| { 1415| 22.7k| auto idx = pos.subindex(first); 1416| 22.7k| auto count = pos.count(); 1417| 22.7k| auto left_size = pos.size_before(idx); 1418| 22.7k| auto child_size = pos.size_sbh(idx, left_size); 1419| 22.7k| auto dropped_size = first; 1420| 22.7k| auto child_dropped_size = dropped_size - left_size; 1421| 22.7k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 22.7k, Folded] | Branch (1421:25): [True: 20.8k, False: 1.84k] | Branch (1421:45): [True: 3.99k, False: 16.8k] ------------------ 1422| 3.99k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 18.7k| } else { 1424| 18.7k| using std::get; 1425| 18.7k| auto n = pos.node(); 1426| 18.7k| auto newc = count - idx; 1427| 18.7k| auto newn = node_t::make_inner_r_n(newc); 1428| 18.7k| IMMER_TRY { ------------------ | | 49| 18.7k|#define IMMER_TRY try ------------------ 1429| 18.7k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 18.7k| auto newr = newn->relaxed(); 1431| 18.7k| newr->d.count = count - idx; 1432| 18.7k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 18.7k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 18.7k, False: 0] ------------------ 1434| 18.7k| pos.copy_sizes(idx + 1, 1435| 18.7k| newr->d.count - 1, 1436| 18.7k| newr->d.sizes[0], 1437| 18.7k| newr->d.sizes + 1); 1438| 18.7k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 18.7k, False: 0] ------------------ 1439| 18.7k| pos.size() - dropped_size); 1440| 18.7k| newn->inner()[0] = get<1>(subs); 1441| 18.7k| std::copy(n->inner() + idx + 1, 1442| 18.7k| n->inner() + count, 1443| 18.7k| newn->inner() + 1); 1444| 18.7k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 18.7k| return std::make_tuple(pos.shift(), newn); 1446| 18.7k| } 1447| 18.7k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 18.7k| } 1452| 22.7k| } _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| 17.5k| { 1457| 17.5k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 17.5k| return std::make_tuple(0, n); 1459| 17.5k| } _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| 87.5k| { 1415| 87.5k| auto idx = pos.subindex(first); 1416| 87.5k| auto count = pos.count(); 1417| 87.5k| auto left_size = pos.size_before(idx); 1418| 87.5k| auto child_size = pos.size_sbh(idx, left_size); 1419| 87.5k| auto dropped_size = first; 1420| 87.5k| auto child_dropped_size = dropped_size - left_size; 1421| 87.5k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 87.5k] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 87.5k| } else { 1424| 87.5k| using std::get; 1425| 87.5k| auto n = pos.node(); 1426| 87.5k| auto newc = count - idx; 1427| 87.5k| auto newn = node_t::make_inner_r_n(newc); 1428| 87.5k| IMMER_TRY { ------------------ | | 49| 87.5k|#define IMMER_TRY try ------------------ 1429| 87.5k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 87.5k| auto newr = newn->relaxed(); 1431| 87.5k| newr->d.count = count - idx; 1432| 87.5k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 87.5k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 87.5k, False: 0] ------------------ 1434| 87.5k| pos.copy_sizes(idx + 1, 1435| 87.5k| newr->d.count - 1, 1436| 87.5k| newr->d.sizes[0], 1437| 87.5k| newr->d.sizes + 1); 1438| 87.5k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 87.5k, False: 0] ------------------ 1439| 87.5k| pos.size() - dropped_size); 1440| 87.5k| newn->inner()[0] = get<1>(subs); 1441| 87.5k| std::copy(n->inner() + idx + 1, 1442| 87.5k| n->inner() + count, 1443| 87.5k| newn->inner() + 1); 1444| 87.5k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 87.5k| return std::make_tuple(pos.shift(), newn); 1446| 87.5k| } 1447| 87.5k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 87.5k| } 1452| 87.5k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 1.18k| { 1415| 1.18k| auto idx = pos.subindex(first); 1416| 1.18k| auto count = pos.count(); 1417| 1.18k| auto left_size = pos.size_before(idx); 1418| 1.18k| auto child_size = pos.size_sbh(idx, left_size); 1419| 1.18k| auto dropped_size = first; 1420| 1.18k| auto child_dropped_size = dropped_size - left_size; 1421| 1.18k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 1.18k] | 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.18k| } else { 1424| 1.18k| using std::get; 1425| 1.18k| auto n = pos.node(); 1426| 1.18k| auto newc = count - idx; 1427| 1.18k| auto newn = node_t::make_inner_r_n(newc); 1428| 1.18k| IMMER_TRY { ------------------ | | 49| 1.18k|#define IMMER_TRY try ------------------ 1429| 1.18k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 1.18k| auto newr = newn->relaxed(); 1431| 1.18k| newr->d.count = count - idx; 1432| 1.18k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 1.18k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 1.18k, False: 0] ------------------ 1434| 1.18k| pos.copy_sizes(idx + 1, 1435| 1.18k| newr->d.count - 1, 1436| 1.18k| newr->d.sizes[0], 1437| 1.18k| newr->d.sizes + 1); 1438| 1.18k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 1.18k, False: 0] ------------------ 1439| 1.18k| pos.size() - dropped_size); 1440| 1.18k| newn->inner()[0] = get<1>(subs); 1441| 1.18k| std::copy(n->inner() + idx + 1, 1442| 1.18k| n->inner() + count, 1443| 1.18k| newn->inner() + 1); 1444| 1.18k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 1.18k| return std::make_tuple(pos.shift(), newn); 1446| 1.18k| } 1447| 1.18k| 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.18k| } 1452| 1.18k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 9.48k| { 1457| 9.48k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 9.48k| return std::make_tuple(0, n); 1459| 9.48k| } _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| 6.86k| { 1415| 6.86k| auto idx = pos.subindex(first); 1416| 6.86k| auto count = pos.count(); 1417| 6.86k| auto left_size = pos.size_before(idx); 1418| 6.86k| auto child_size = pos.size_sbh(idx, left_size); 1419| 6.86k| auto dropped_size = first; 1420| 6.86k| auto child_dropped_size = dropped_size - left_size; 1421| 6.86k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 6.86k] | 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| 6.86k| } else { 1424| 6.86k| using std::get; 1425| 6.86k| auto n = pos.node(); 1426| 6.86k| auto newc = count - idx; 1427| 6.86k| auto newn = node_t::make_inner_r_n(newc); 1428| 6.86k| IMMER_TRY { ------------------ | | 49| 6.86k|#define IMMER_TRY try ------------------ 1429| 6.86k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 6.86k| auto newr = newn->relaxed(); 1431| 6.86k| newr->d.count = count - idx; 1432| 6.86k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 6.86k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 6.86k, False: 0] ------------------ 1434| 6.86k| pos.copy_sizes(idx + 1, 1435| 6.86k| newr->d.count - 1, 1436| 6.86k| newr->d.sizes[0], 1437| 6.86k| newr->d.sizes + 1); 1438| 6.86k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 6.86k, False: 0] ------------------ 1439| 6.86k| pos.size() - dropped_size); 1440| 6.86k| newn->inner()[0] = get<1>(subs); 1441| 6.86k| std::copy(n->inner() + idx + 1, 1442| 6.86k| n->inner() + count, 1443| 6.86k| newn->inner() + 1); 1444| 6.86k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 6.86k| return std::make_tuple(pos.shift(), newn); 1446| 6.86k| } 1447| 6.86k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 6.86k| } 1452| 6.86k| } _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.0k| { 1415| 10.0k| auto idx = pos.subindex(first); 1416| 10.0k| auto count = pos.count(); 1417| 10.0k| auto left_size = pos.size_before(idx); 1418| 10.0k| auto child_size = pos.size_sbh(idx, left_size); 1419| 10.0k| auto dropped_size = first; 1420| 10.0k| auto child_dropped_size = dropped_size - left_size; 1421| 10.0k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 10.0k, Folded] | Branch (1421:25): [True: 6.69k, False: 3.38k] | Branch (1421:45): [True: 2.48k, False: 4.20k] ------------------ 1422| 2.48k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 7.58k| } else { 1424| 7.58k| using std::get; 1425| 7.58k| auto n = pos.node(); 1426| 7.58k| auto newc = count - idx; 1427| 7.58k| auto newn = node_t::make_inner_r_n(newc); 1428| 7.58k| IMMER_TRY { ------------------ | | 49| 7.58k|#define IMMER_TRY try ------------------ 1429| 7.58k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 7.58k| auto newr = newn->relaxed(); 1431| 7.58k| newr->d.count = count - idx; 1432| 7.58k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 7.58k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 7.58k, False: 0] ------------------ 1434| 7.58k| pos.copy_sizes(idx + 1, 1435| 7.58k| newr->d.count - 1, 1436| 7.58k| newr->d.sizes[0], 1437| 7.58k| newr->d.sizes + 1); 1438| 7.58k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 7.58k, False: 0] ------------------ 1439| 7.58k| pos.size() - dropped_size); 1440| 7.58k| newn->inner()[0] = get<1>(subs); 1441| 7.58k| std::copy(n->inner() + idx + 1, 1442| 7.58k| n->inner() + count, 1443| 7.58k| newn->inner() + 1); 1444| 7.58k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 7.58k| return std::make_tuple(pos.shift(), newn); 1446| 7.58k| } 1447| 7.58k| 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.58k| } 1452| 10.0k| } _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| 715| { 1415| 715| auto idx = pos.subindex(first); 1416| 715| auto count = pos.count(); 1417| 715| auto left_size = pos.size_before(idx); 1418| 715| auto child_size = pos.size_sbh(idx, left_size); 1419| 715| auto dropped_size = first; 1420| 715| auto child_dropped_size = dropped_size - left_size; 1421| 715| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 715, Folded] | Branch (1421:25): [True: 283, False: 432] | Branch (1421:45): [True: 0, False: 283] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 715| } else { 1424| 715| using std::get; 1425| 715| auto n = pos.node(); 1426| 715| auto newc = count - idx; 1427| 715| auto newn = node_t::make_inner_r_n(newc); 1428| 715| IMMER_TRY { ------------------ | | 49| 715|#define IMMER_TRY try ------------------ 1429| 715| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 715| auto newr = newn->relaxed(); 1431| 715| newr->d.count = count - idx; 1432| 715| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 715| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 715, False: 0] ------------------ 1434| 715| pos.copy_sizes(idx + 1, 1435| 715| newr->d.count - 1, 1436| 715| newr->d.sizes[0], 1437| 715| newr->d.sizes + 1); 1438| 715| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 715, False: 0] ------------------ 1439| 715| pos.size() - dropped_size); 1440| 715| newn->inner()[0] = get<1>(subs); 1441| 715| std::copy(n->inner() + idx + 1, 1442| 715| n->inner() + count, 1443| 715| newn->inner() + 1); 1444| 715| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 715| return std::make_tuple(pos.shift(), newn); 1446| 715| } 1447| 715| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 715| } 1452| 715| } _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.40k|{ 2002| 7.40k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 7.40k| .visit(concat_trees_left_visitor{}, 2004| 7.40k| empty_leaf_pos{}, 2005| 7.40k| rroot, 2006| 7.40k| rshift, 2007| 7.40k| rsize) 2008| 7.40k| .realize(); 2009| 7.40k|} _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.40k| { 1972| 7.40k| return visit_maybe_relaxed_sub( 1973| 7.40k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 7.40k| } _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.14k| { 1959| 5.14k| return concat_inners(lpos, tpos, rpos); 1960| 5.14k| } _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| 23.0k|{ 1873| 23.0k| auto lshift = lpos.shift(); 1874| 23.0k| auto rshift = rpos.shift(); 1875| 23.0k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 23.0k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 23.0k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 18.2k, False: 4.84k] ------------------ 1879| 18.2k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 18.2k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 18.2k| } else { 1882| 4.84k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 4.84k, False: 0] ------------------ 1883| 4.84k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 4.84k] | Branch (1883:9): [True: 4.84k, False: 0] | Branch (1883:9): [True: 4.84k, False: 0] ------------------ 1884| 4.84k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 4.84k| return concat_rebalance(lpos, cpos, rpos); 1886| 4.84k| } 1887| 23.0k|} _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| 13.3M| { 1513| 13.3M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.08M, False: 12.2M] ------------------ 1514| 1.08M| auto s = size_t{}; 1515| 4.32M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.24M, False: 1.08M] ------------------ 1516| 3.24M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.24M| s = sizes_[i]; 1518| 3.24M| } 1519| 12.2M| } else { 1520| 33.2M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 20.9M, False: 12.2M] ------------------ 1521| 20.9M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 20.9M| .visit(v, args...); 1523| 12.2M| } 1524| 13.3M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 7.69M| { 1734| 7.69M| auto count = p.count(); 1735| 7.69M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 7.69M, False: 0] ------------------ 1736| 7.69M| plan.counts[plan.n++] = count; 1737| 7.69M| plan.total += count; 1738| 7.69M| } _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| 112M| { 1734| 112M| auto count = p.count(); 1735| 112M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 112M, False: 0] ------------------ 1736| 112M| plan.counts[plan.n++] = count; 1737| 112M| plan.total += count; 1738| 112M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE7shuffleEj: 1762| 13.3M| { 1763| | // gcc seems to not really understand this code... :( 1764| 13.3M|#if !defined(_MSC_VER) 1765| 13.3M|#pragma GCC diagnostic push 1766| 13.3M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 13.3M|#endif 1768| 13.3M| constexpr count_t rrb_extras = 2; 1769| 13.3M| constexpr count_t rrb_invariant = 1; 1770| 13.3M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 1.08M, False: 12.2M] ------------------ 1771| 13.3M| const auto branches = count_t{1} << bits; 1772| 13.3M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 13.3M| count_t i = 0; 1774| 16.5M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 3.17M, False: 13.3M] ------------------ 1775| | // skip ok nodes 1776| 7.12M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 3.94M, False: 3.17M] ------------------ 1777| 3.94M| i++; 1778| 3.17M| assert(i < n); ------------------ | Branch (1778:13): [True: 3.17M, False: 0] ------------------ 1779| | // short node, redistribute 1780| 3.17M| auto remaining = counts[i]; 1781| 12.3M| do { 1782| 12.3M| auto next = counts[i + 1]; 1783| 12.3M| auto count = std::min(remaining + next, branches); 1784| 12.3M| counts[i] = count; 1785| 12.3M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 12.3M, False: 0] ------------------ 1786| 12.3M| remaining += next - count; 1787| 12.3M| ++i; 1788| 12.3M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 9.16M, False: 3.17M] ------------------ 1789| | // remove node 1790| 3.17M| std::move(counts + i + 1, counts + n, counts + i); 1791| 3.17M| --n; 1792| 3.17M| --i; 1793| 3.17M| } 1794| 13.3M|#if !defined(_MSC_VER) 1795| 13.3M|#pragma GCC diagnostic pop 1796| 13.3M|#endif 1797| 13.3M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1478| 26.7M| auto shift() const { return shift_; } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPjj: 1577| 13.3M| : curr_{counts} 1578| 13.3M| , n_{n} 1579| 13.3M| , result_{ 1580| 13.3M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 13.3M| { 1582| 13.3M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_m: 1481| 13.3M| : shift_{s} 1482| 13.3M| , count_{1} 1483| 13.3M| , nodes_{n0} 1484| 13.3M| , sizes_{s0} 1485| 13.3M| { 1486| 13.3M| } _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| 13.3M| { 1513| 13.3M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.08M, False: 12.2M] ------------------ 1514| 1.08M| auto s = size_t{}; 1515| 4.32M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.24M, False: 1.08M] ------------------ 1516| 3.24M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.24M| s = sizes_[i]; 1518| 3.24M| } 1519| 12.2M| } else { 1520| 33.2M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 20.9M, False: 12.2M] ------------------ 1521| 20.9M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 20.9M| .visit(v, args...); 1523| 12.2M| } 1524| 13.3M| } _ZN5immer6detail4rbts21concat_merger_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1721| 7.69M| { 1722| 7.69M| merger.merge_leaf(p); 1723| 7.69M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_: 1614| 7.69M| { 1615| 7.69M| auto from = p.node(); 1616| 7.69M| auto from_size = p.size(); 1617| 7.69M| auto from_count = p.count(); 1618| 7.69M| assert(from_size); ------------------ | Branch (1618:9): [True: 7.69M, False: 0] ------------------ 1619| 7.69M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 7.55M, False: 133k] | Branch (1619:21): [True: 7.49M, False: 62.3k] ------------------ 1620| 7.49M| add_child(from, from_size); 1621| 7.49M| from->inc(); 1622| 7.49M| } else { 1623| 196k| auto from_offset = count_t{}; 1624| 196k| auto from_data = from->leaf(); 1625| 265k| do { 1626| 265k| if (!to_) { ------------------ | Branch (1626:21): [True: 131k, False: 133k] ------------------ 1627| 131k| to_ = node_t::make_leaf_n(*curr_); 1628| 131k| to_offset_ = 0; 1629| 131k| } 1630| 265k| auto data = to_->leaf(); 1631| 265k| auto to_copy = 1632| 265k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 265k| detail::uninitialized_copy(from_data + from_offset, 1634| 265k| from_data + from_offset + to_copy, 1635| 265k| data + to_offset_); 1636| 265k| to_offset_ += to_copy; 1637| 265k| from_offset += to_copy; 1638| 265k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 131k, False: 133k] ------------------ 1639| 131k| add_child(to_, to_offset_); 1640| 131k| to_ = nullptr; 1641| 131k| } 1642| 265k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 68.6k, False: 196k] ------------------ 1643| 196k| } 1644| 7.69M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9add_childEPSC_m: 1589| 128M| { 1590| 128M| assert(size); ------------------ | Branch (1590:9): [True: 128M, False: 0] ------------------ 1591| 128M| ++curr_; 1592| 128M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 128M| auto relaxed = parent->relaxed(); 1594| 128M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 8.75M, False: 119M] ------------------ 1595| 8.75M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 8.75M, False: 0] ------------------ 1596| 8.75M| n_ -= branches; 1597| 8.75M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 8.75M| relaxed = parent->relaxed(); 1599| 8.75M| result_.nodes_[result_.count_] = parent; 1600| 8.75M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 8.75M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 8.75M, False: 0] ------------------ 1602| 8.75M| ++result_.count_; 1603| 8.75M| } 1604| 128M| auto idx = relaxed->d.count++; 1605| 128M| result_.sizes_[result_.count_ - 1] += size; 1606| 128M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 128M, False: 0] ------------------ 1607| 128M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 106M, False: 22.1M] ------------------ 1608| 128M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 128M, False: 0] ------------------ 1609| 128M| parent->inner()[idx] = p; 1610| 128M| }; _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| 112M| { 1716| 112M| merger.merge_inner(p); 1717| 112M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 112M| { 1649| 112M| auto from = p.node(); 1650| 112M| auto from_size = p.size(); 1651| 112M| auto from_count = p.count(); 1652| 112M| assert(from_size); ------------------ | Branch (1652:9): [True: 112M, False: 0] ------------------ 1653| 112M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 102M, False: 10.3M] | Branch (1653:21): [True: 99.9M, False: 2.61M] ------------------ 1654| 99.9M| add_child(from, from_size); 1655| 99.9M| from->inc(); 1656| 99.9M| } else { 1657| 12.9M| auto from_offset = count_t{}; 1658| 12.9M| auto from_data = from->inner(); 1659| 20.2M| do { 1660| 20.2M| if (!to_) { ------------------ | Branch (1660:21): [True: 9.88M, False: 10.3M] ------------------ 1661| 9.88M| to_ = node_t::make_inner_r_n(*curr_); 1662| 9.88M| to_offset_ = 0; 1663| 9.88M| to_size_ = 0; 1664| 9.88M| } 1665| 20.2M| auto data = to_->inner(); 1666| 20.2M| auto to_copy = 1667| 20.2M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 20.2M| std::copy(from_data + from_offset, 1669| 20.2M| from_data + from_offset + to_copy, 1670| 20.2M| data + to_offset_); 1671| 20.2M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 20.2M| auto sizes = to_->relaxed()->d.sizes; 1673| 20.2M| p.copy_sizes( 1674| 20.2M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 20.2M| to_offset_ += to_copy; 1676| 20.2M| from_offset += to_copy; 1677| 20.2M| to_size_ = sizes[to_offset_ - 1]; 1678| 20.2M| assert(to_size_); ------------------ | Branch (1678:17): [True: 20.2M, False: 0] ------------------ 1679| 20.2M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 9.88M, False: 10.3M] ------------------ 1680| 9.88M| to_->relaxed()->d.count = to_offset_; 1681| 9.88M| add_child(to_, to_size_); 1682| 9.88M| to_ = nullptr; 1683| 9.88M| } 1684| 20.2M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 7.27M, False: 12.9M] ------------------ 1685| 12.9M| } 1686| 112M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6finishEv: 1689| 13.3M| { 1690| 13.3M| assert(!to_); ------------------ | Branch (1690:9): [True: 13.3M, False: 0] ------------------ 1691| 13.3M| return result_; 1692| 13.3M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8each_subINS1_11dec_visitorEJEEEvT_DpOT0_: 1512| 13.3M| { 1513| 13.3M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.08M, False: 12.2M] ------------------ 1514| 1.08M| auto s = size_t{}; 1515| 4.32M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.24M, False: 1.08M] ------------------ 1516| 3.24M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.24M| s = sizes_[i]; 1518| 3.24M| } 1519| 12.2M| } else { 1520| 33.2M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 20.9M, False: 12.2M] ------------------ 1521| 20.9M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 20.9M| .visit(v, args...); 1523| 12.2M| } 1524| 13.3M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_mSE_m: 1503| 1.07M| : shift_{s} 1504| 1.07M| , count_{3} 1505| 1.07M| , nodes_{n0, n1, n2} 1506| 1.07M| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 1.07M| { 1508| 1.07M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_m: 1489| 7.40k| : shift_{s} 1490| 7.40k| , count_{2} 1491| 7.40k| , nodes_{n0, n1} 1492| 7.40k| , sizes_{s0, s0 + s1} 1493| 7.40k| { 1494| 7.40k| } _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.9k| { 1918| 17.9k| return concat_inners(lpos, tpos, rpos); 1919| 17.9k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 297| { 1918| 297| return concat_inners(lpos, tpos, rpos); 1919| 297| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 2.56k|{ 1873| 2.56k| auto lshift = lpos.shift(); 1874| 2.56k| auto rshift = rpos.shift(); 1875| 2.56k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.56k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.56k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 664, False: 1.89k] ------------------ 1879| 664| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 664| 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.56k|} _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| 914| { 1918| 914| return concat_inners(lpos, tpos, rpos); 1919| 914| } _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| 914|{ 1873| 914| auto lshift = lpos.shift(); 1874| 914| auto rshift = rpos.shift(); 1875| 914| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 914] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 914| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 250, False: 664] ------------------ 1879| 250| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 250| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 664| } else { 1882| 664| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 664, False: 0] ------------------ 1883| 664| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 664] | Branch (1883:9): [True: 664, False: 0] | Branch (1883:9): [True: 664, False: 0] ------------------ 1884| 664| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 664| return concat_rebalance(lpos, cpos, rpos); 1886| 664| } 1887| 914|} _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| 653|{ 1824| 653| auto plan = concat_rebalance_plan{}; 1825| 653| plan.fill(lpos, cpos, rpos); 1826| 653| plan.shuffle(cpos.shift()); 1827| 653| IMMER_TRY { ------------------ | | 49| 653|#define IMMER_TRY try ------------------ 1828| 653| return plan.merge(lpos, cpos, rpos); 1829| 653| } 1830| 653| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 653|} _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| 653| { 1753| 653| assert(n == 0u); ------------------ | Branch (1753:9): [True: 653, False: 0] ------------------ 1754| 653| assert(total == 0u); ------------------ | Branch (1754:9): [True: 653, False: 0] ------------------ 1755| 653| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 653| lpos.each_left_sub(visitor_t{}, *this); 1757| 653| cpos.each_sub(visitor_t{}, *this); 1758| 653| rpos.each_right_sub(visitor_t{}, *this); 1759| 653| } _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.13M| { 1734| 6.13M| auto count = p.count(); 1735| 6.13M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 6.13M, False: 0] ------------------ 1736| 6.13M| plan.counts[plan.n++] = count; 1737| 6.13M| plan.total += count; 1738| 6.13M| } _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| 577k| { 1734| 577k| auto count = p.count(); 1735| 577k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 577k, False: 0] ------------------ 1736| 577k| plan.counts[plan.n++] = count; 1737| 577k| plan.total += count; 1738| 577k| } _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| 653| { 1803| 653| using node_t = node_type; 1804| 653| using merger_t = concat_merger; 1805| 653| using visitor_t = concat_merger_visitor; 1806| 653| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 653| IMMER_TRY { ------------------ | | 49| 653|#define IMMER_TRY try ------------------ 1808| 653| lpos.each_left_sub(visitor_t{}, merger); 1809| 653| cpos.each_sub(visitor_t{}, merger); 1810| 653| rpos.each_right_sub(visitor_t{}, merger); 1811| 653| cpos.each_sub(dec_visitor{}); 1812| 653| return merger.finish(); 1813| 653| } 1814| 653| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 653| } _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.13M| { 1722| 6.13M| merger.merge_leaf(p); 1723| 6.13M| } _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.13M| { 1615| 6.13M| auto from = p.node(); 1616| 6.13M| auto from_size = p.size(); 1617| 6.13M| auto from_count = p.count(); 1618| 6.13M| assert(from_size); ------------------ | Branch (1618:9): [True: 6.13M, False: 0] ------------------ 1619| 6.13M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 6.13M, False: 0] | Branch (1619:21): [True: 6.13M, False: 0] ------------------ 1620| 6.13M| add_child(from, from_size); 1621| 6.13M| from->inc(); 1622| 6.13M| } 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.13M| } _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| 577k| { 1716| 577k| merger.merge_inner(p); 1717| 577k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 577k| { 1649| 577k| auto from = p.node(); 1650| 577k| auto from_size = p.size(); 1651| 577k| auto from_count = p.count(); 1652| 577k| assert(from_size); ------------------ | Branch (1652:9): [True: 577k, False: 0] ------------------ 1653| 577k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 577k, False: 0] | Branch (1653:21): [True: 577k, False: 0] ------------------ 1654| 577k| add_child(from, from_size); 1655| 577k| from->inc(); 1656| 577k| } 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| 577k| } _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| 664| { 1945| 664| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 664| } _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.56k| { 1925| 2.56k| return concat_leafs(lpos, tpos, rpos); 1926| 2.56k| } _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.56k|{ 1839| 2.56k| static_assert(Node::bits >= 2, ""); 1840| 2.56k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 2.56k, False: 0] ------------------ 1841| 2.56k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 2.56k, False: 0] ------------------ 1842| 2.56k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 2.56k, False: 0] ------------------ 1843| 2.56k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 2.56k] ------------------ 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.56k| else 1854| 2.56k| return { 1855| 2.56k| Node::bits_leaf, 1856| 2.56k| lpos.node()->inc(), 1857| 2.56k| lpos.count(), 1858| 2.56k| rpos.node()->inc(), 1859| 2.56k| rpos.count(), 1860| 2.56k| }; 1861| 2.56k|} _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| 664|{ 1824| 664| auto plan = concat_rebalance_plan{}; 1825| 664| plan.fill(lpos, cpos, rpos); 1826| 664| plan.shuffle(cpos.shift()); 1827| 664| IMMER_TRY { ------------------ | | 49| 664|#define IMMER_TRY try ------------------ 1828| 664| return plan.merge(lpos, cpos, rpos); 1829| 664| } 1830| 664| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 664|} _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| 664| { 1753| 664| assert(n == 0u); ------------------ | Branch (1753:9): [True: 664, False: 0] ------------------ 1754| 664| assert(total == 0u); ------------------ | Branch (1754:9): [True: 664, False: 0] ------------------ 1755| 664| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 664| lpos.each_left_sub(visitor_t{}, *this); 1757| 664| cpos.each_sub(visitor_t{}, *this); 1758| 664| rpos.each_right_sub(visitor_t{}, *this); 1759| 664| } _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| 664| { 1803| 664| using node_t = node_type; 1804| 664| using merger_t = concat_merger; 1805| 664| using visitor_t = concat_merger_visitor; 1806| 664| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 664| IMMER_TRY { ------------------ | | 49| 664|#define IMMER_TRY try ------------------ 1808| 664| lpos.each_left_sub(visitor_t{}, merger); 1809| 664| cpos.each_sub(visitor_t{}, merger); 1810| 664| rpos.each_right_sub(visitor_t{}, merger); 1811| 664| cpos.each_sub(dec_visitor{}); 1812| 664| return merger.finish(); 1813| 664| } 1814| 664| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 664| } _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.71k|{ 1824| 1.71k| auto plan = concat_rebalance_plan{}; 1825| 1.71k| plan.fill(lpos, cpos, rpos); 1826| 1.71k| plan.shuffle(cpos.shift()); 1827| 1.71k| IMMER_TRY { ------------------ | | 49| 1.71k|#define IMMER_TRY try ------------------ 1828| 1.71k| return plan.merge(lpos, cpos, rpos); 1829| 1.71k| } 1830| 1.71k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.71k|} _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.71k| { 1753| 1.71k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.71k, False: 0] ------------------ 1754| 1.71k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.71k, False: 0] ------------------ 1755| 1.71k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.71k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.71k| cpos.each_sub(visitor_t{}, *this); 1758| 1.71k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.71k| } _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.12M| { 1734| 4.12M| auto count = p.count(); 1735| 4.12M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 4.12M, False: 0] ------------------ 1736| 4.12M| plan.counts[plan.n++] = count; 1737| 4.12M| plan.total += count; 1738| 4.12M| } _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.71k| { 1803| 1.71k| using node_t = node_type; 1804| 1.71k| using merger_t = concat_merger; 1805| 1.71k| using visitor_t = concat_merger_visitor; 1806| 1.71k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.71k| IMMER_TRY { ------------------ | | 49| 1.71k|#define IMMER_TRY try ------------------ 1808| 1.71k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.71k| cpos.each_sub(visitor_t{}, merger); 1810| 1.71k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.71k| cpos.each_sub(dec_visitor{}); 1812| 1.71k| return merger.finish(); 1813| 1.71k| } 1814| 1.71k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.71k| } _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.12M| { 1716| 4.12M| merger.merge_inner(p); 1717| 4.12M| } _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.12M| { 1649| 4.12M| auto from = p.node(); 1650| 4.12M| auto from_size = p.size(); 1651| 4.12M| auto from_count = p.count(); 1652| 4.12M| assert(from_size); ------------------ | Branch (1652:9): [True: 4.12M, False: 0] ------------------ 1653| 4.12M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 2.29M, False: 1.82M] | Branch (1653:21): [True: 2.29M, False: 0] ------------------ 1654| 2.29M| add_child(from, from_size); 1655| 2.29M| from->inc(); 1656| 2.29M| } else { 1657| 1.82M| auto from_offset = count_t{}; 1658| 1.82M| auto from_data = from->inner(); 1659| 3.64M| do { 1660| 3.64M| if (!to_) { ------------------ | Branch (1660:21): [True: 1.82M, False: 1.82M] ------------------ 1661| 1.82M| to_ = node_t::make_inner_r_n(*curr_); 1662| 1.82M| to_offset_ = 0; 1663| 1.82M| to_size_ = 0; 1664| 1.82M| } 1665| 3.64M| auto data = to_->inner(); 1666| 3.64M| auto to_copy = 1667| 3.64M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 3.64M| std::copy(from_data + from_offset, 1669| 3.64M| from_data + from_offset + to_copy, 1670| 3.64M| data + to_offset_); 1671| 3.64M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 3.64M| auto sizes = to_->relaxed()->d.sizes; 1673| 3.64M| p.copy_sizes( 1674| 3.64M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 3.64M| to_offset_ += to_copy; 1676| 3.64M| from_offset += to_copy; 1677| 3.64M| to_size_ = sizes[to_offset_ - 1]; 1678| 3.64M| assert(to_size_); ------------------ | Branch (1678:17): [True: 3.64M, False: 0] ------------------ 1679| 3.64M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 1.82M, False: 1.82M] ------------------ 1680| 1.82M| to_->relaxed()->d.count = to_offset_; 1681| 1.82M| add_child(to_, to_size_); 1682| 1.82M| to_ = nullptr; 1683| 1.82M| } 1684| 3.64M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.82M, False: 1.82M] ------------------ 1685| 1.82M| } 1686| 4.12M| } _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.84k| { 1925| 4.84k| return concat_leafs(lpos, tpos, rpos); 1926| 4.84k| } _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.84k|{ 1839| 4.84k| static_assert(Node::bits >= 2, ""); 1840| 4.84k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 4.84k, False: 0] ------------------ 1841| 4.84k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 4.84k, False: 0] ------------------ 1842| 4.84k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 4.84k, False: 0] ------------------ 1843| 4.84k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 4.84k] ------------------ 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.84k| else 1854| 4.84k| return { 1855| 4.84k| Node::bits_leaf, 1856| 4.84k| lpos.node()->inc(), 1857| 4.84k| lpos.count(), 1858| 4.84k| rpos.node()->inc(), 1859| 4.84k| rpos.count(), 1860| 4.84k| }; 1861| 4.84k|} _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| 70.2k|{ 1824| 70.2k| auto plan = concat_rebalance_plan{}; 1825| 70.2k| plan.fill(lpos, cpos, rpos); 1826| 70.2k| plan.shuffle(cpos.shift()); 1827| 70.2k| IMMER_TRY { ------------------ | | 49| 70.2k|#define IMMER_TRY try ------------------ 1828| 70.2k| return plan.merge(lpos, cpos, rpos); 1829| 70.2k| } 1830| 70.2k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 70.2k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISH_EEEEvOT_OT0_OT1_: 1752| 70.2k| { 1753| 70.2k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 70.2k, False: 0] ------------------ 1754| 70.2k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 70.2k, False: 0] ------------------ 1755| 70.2k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 70.2k| lpos.each_left_sub(visitor_t{}, *this); 1757| 70.2k| cpos.each_sub(visitor_t{}, *this); 1758| 70.2k| rpos.each_right_sub(visitor_t{}, *this); 1759| 70.2k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 70.2k| { 1803| 70.2k| using node_t = node_type; 1804| 70.2k| using merger_t = concat_merger; 1805| 70.2k| using visitor_t = concat_merger_visitor; 1806| 70.2k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 70.2k| IMMER_TRY { ------------------ | | 49| 70.2k|#define IMMER_TRY try ------------------ 1808| 70.2k| lpos.each_left_sub(visitor_t{}, merger); 1809| 70.2k| cpos.each_sub(visitor_t{}, merger); 1810| 70.2k| rpos.each_right_sub(visitor_t{}, merger); 1811| 70.2k| cpos.each_sub(dec_visitor{}); 1812| 70.2k| return merger.finish(); 1813| 70.2k| } 1814| 70.2k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 70.2k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 4.84k| { 1945| 4.84k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 4.84k| } _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.84k|{ 1824| 4.84k| auto plan = concat_rebalance_plan{}; 1825| 4.84k| plan.fill(lpos, cpos, rpos); 1826| 4.84k| plan.shuffle(cpos.shift()); 1827| 4.84k| IMMER_TRY { ------------------ | | 49| 4.84k|#define IMMER_TRY try ------------------ 1828| 4.84k| return plan.merge(lpos, cpos, rpos); 1829| 4.84k| } 1830| 4.84k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.84k|} _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.84k| { 1753| 4.84k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.84k, False: 0] ------------------ 1754| 4.84k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.84k, False: 0] ------------------ 1755| 4.84k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.84k| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.84k| cpos.each_sub(visitor_t{}, *this); 1758| 4.84k| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.84k| } _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.84k| { 1803| 4.84k| using node_t = node_type; 1804| 4.84k| using merger_t = concat_merger; 1805| 4.84k| using visitor_t = concat_merger_visitor; 1806| 4.84k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.84k| IMMER_TRY { ------------------ | | 49| 4.84k|#define IMMER_TRY try ------------------ 1808| 4.84k| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.84k| cpos.each_sub(visitor_t{}, merger); 1810| 4.84k| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.84k| cpos.each_sub(dec_visitor{}); 1812| 4.84k| return merger.finish(); 1813| 4.84k| } 1814| 4.84k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.84k| } _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.26k| { 1959| 2.26k| return concat_inners(lpos, tpos, rpos); 1960| 2.26k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7realizeEv: 1527| 1.08M| { 1528| 1.08M| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 47.0k, False: 1.03M] ------------------ 1529| 47.0k| IMMER_TRY { ------------------ | | 49| 47.0k|#define IMMER_TRY try ------------------ 1530| 47.0k| auto result = node_t::make_inner_r_n(count_); 1531| 47.0k| auto r = result->relaxed(); 1532| 47.0k| r->d.count = count_; 1533| 47.0k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 47.0k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 47.0k| return {result, shift_, r}; 1536| 47.0k| } 1537| 47.0k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 1.03M| } else { 1542| 1.03M| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 1.03M, False: 0] ------------------ 1543| 1.03M| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 1.03M| } 1545| 1.08M| } _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.07M|{ 1987| 1.07M| return visit_maybe_relaxed_sub(lroot, 1988| 1.07M| lshift, 1989| 1.07M| lsize, 1990| 1.07M| concat_trees_left_visitor{}, 1991| 1.07M| make_leaf_pos(ltail, ltcount), 1992| 1.07M| rroot, 1993| 1.07M| rshift, 1994| 1.07M| rsize) 1995| 1.07M| .realize(); 1996| 1.07M|} _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.05M| { 1972| 1.05M| return visit_maybe_relaxed_sub( 1973| 1.05M| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 1.05M| } _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.05M| { 1959| 1.05M| return concat_inners(lpos, tpos, rpos); 1960| 1.05M| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 11.8M|{ 1873| 11.8M| auto lshift = lpos.shift(); 1874| 11.8M| auto rshift = rpos.shift(); 1875| 11.8M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 3.32M, False: 8.52M] ------------------ 1876| 3.32M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 3.32M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 8.52M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 44.3k, False: 8.48M] ------------------ 1879| 44.3k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 44.3k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 8.48M| } else { 1882| 8.48M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 8.48M, False: 0] ------------------ 1883| 8.48M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 8.48M] | Branch (1883:9): [True: 8.48M, False: 0] | Branch (1883:9): [True: 8.48M, False: 0] ------------------ 1884| 8.48M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 8.48M| return concat_rebalance(lpos, cpos, rpos); 1886| 8.48M| } 1887| 11.8M|} _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.32M| { 1898| 3.32M| return concat_inners(lpos, tpos, rpos); 1899| 3.32M| } _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.41k| { 1898| 4.41k| return concat_inners(lpos, tpos, rpos); 1899| 4.41k| } _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.01M|{ 1873| 1.01M| auto lshift = lpos.shift(); 1874| 1.01M| auto rshift = rpos.shift(); 1875| 1.01M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.22k, False: 1.01M] ------------------ 1876| 2.22k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.22k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.01M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 7.66k, False: 1.00M] ------------------ 1879| 7.66k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 7.66k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.00M| } else { 1882| 1.00M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.00M, False: 0] ------------------ 1883| 1.00M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.00M] | Branch (1883:9): [True: 1.00M, False: 0] | Branch (1883:9): [True: 1.00M, False: 0] ------------------ 1884| 1.00M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.00M| return concat_rebalance(lpos, cpos, rpos); 1886| 1.00M| } 1887| 1.01M|} _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.06k|{ 1824| 3.06k| auto plan = concat_rebalance_plan{}; 1825| 3.06k| plan.fill(lpos, cpos, rpos); 1826| 3.06k| plan.shuffle(cpos.shift()); 1827| 3.06k| IMMER_TRY { ------------------ | | 49| 3.06k|#define IMMER_TRY try ------------------ 1828| 3.06k| return plan.merge(lpos, cpos, rpos); 1829| 3.06k| } 1830| 3.06k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.06k|} _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.06k| { 1753| 3.06k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.06k, False: 0] ------------------ 1754| 3.06k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.06k, False: 0] ------------------ 1755| 3.06k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.06k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.06k| cpos.each_sub(visitor_t{}, *this); 1758| 3.06k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.06k| } _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.06k| { 1803| 3.06k| using node_t = node_type; 1804| 3.06k| using merger_t = concat_merger; 1805| 3.06k| using visitor_t = concat_merger_visitor; 1806| 3.06k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.06k| IMMER_TRY { ------------------ | | 49| 3.06k|#define IMMER_TRY try ------------------ 1808| 3.06k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.06k| cpos.each_sub(visitor_t{}, merger); 1810| 3.06k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.06k| cpos.each_sub(dec_visitor{}); 1812| 3.06k| return merger.finish(); 1813| 3.06k| } 1814| 3.06k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.06k| } _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.00M| { 1918| 1.00M| return concat_inners(lpos, tpos, rpos); 1919| 1.00M| } _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| 411k| { 1918| 411k| return concat_inners(lpos, tpos, rpos); 1919| 411k| } _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| 422k|{ 1873| 422k| auto lshift = lpos.shift(); 1874| 422k| auto rshift = rpos.shift(); 1875| 422k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 843, False: 421k] ------------------ 1876| 843| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 843| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 421k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 451, False: 420k] ------------------ 1879| 451| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 451| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 420k| } else { 1882| 420k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 420k, False: 0] ------------------ 1883| 420k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 420k] | Branch (1883:9): [True: 420k, False: 0] | Branch (1883:9): [True: 420k, False: 0] ------------------ 1884| 420k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 420k| return concat_rebalance(lpos, cpos, rpos); 1886| 420k| } 1887| 422k|} _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.24k| { 1898| 1.24k| return concat_inners(lpos, tpos, rpos); 1899| 1.24k| } _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| 22.0k| { 1918| 22.0k| return concat_inners(lpos, tpos, rpos); 1919| 22.0k| } _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| 22.0k|{ 1873| 22.0k| auto lshift = lpos.shift(); 1874| 22.0k| auto rshift = rpos.shift(); 1875| 22.0k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 22.0k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 22.0k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 207, False: 21.8k] ------------------ 1879| 207| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 207| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 21.8k| } else { 1882| 21.8k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 21.8k, False: 0] ------------------ 1883| 21.8k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 21.8k] | Branch (1883:9): [True: 21.8k, False: 0] | Branch (1883:9): [True: 21.8k, False: 0] ------------------ 1884| 21.8k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 21.8k| return concat_rebalance(lpos, cpos, rpos); 1886| 21.8k| } 1887| 22.0k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 17.1k| { 1945| 17.1k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 17.1k| } _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| 430k| { 1925| 430k| return concat_leafs(lpos, tpos, rpos); 1926| 430k| } _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| 430k|{ 1839| 430k| static_assert(Node::bits >= 2, ""); 1840| 430k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 430k, False: 0] ------------------ 1841| 430k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 430k, False: 0] ------------------ 1842| 430k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 430k, False: 0] ------------------ 1843| 430k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 430k, False: 0] ------------------ 1844| 430k| return { 1845| 430k| Node::bits_leaf, 1846| 430k| lpos.node()->inc(), 1847| 430k| lpos.count(), 1848| 430k| tpos.node()->inc(), 1849| 430k| tpos.count(), 1850| 430k| rpos.node()->inc(), 1851| 430k| rpos.count(), 1852| 430k| }; 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| 430k|} _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.72k| { 1938| 5.72k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 5.72k| } _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| 21.8k|{ 1824| 21.8k| auto plan = concat_rebalance_plan{}; 1825| 21.8k| plan.fill(lpos, cpos, rpos); 1826| 21.8k| plan.shuffle(cpos.shift()); 1827| 21.8k| IMMER_TRY { ------------------ | | 49| 21.8k|#define IMMER_TRY try ------------------ 1828| 21.8k| return plan.merge(lpos, cpos, rpos); 1829| 21.8k| } 1830| 21.8k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 21.8k|} _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| 21.8k| { 1753| 21.8k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 21.8k, False: 0] ------------------ 1754| 21.8k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 21.8k, False: 0] ------------------ 1755| 21.8k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 21.8k| lpos.each_left_sub(visitor_t{}, *this); 1757| 21.8k| cpos.each_sub(visitor_t{}, *this); 1758| 21.8k| rpos.each_right_sub(visitor_t{}, *this); 1759| 21.8k| } _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| 21.8k| { 1803| 21.8k| using node_t = node_type; 1804| 21.8k| using merger_t = concat_merger; 1805| 21.8k| using visitor_t = concat_merger_visitor; 1806| 21.8k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 21.8k| IMMER_TRY { ------------------ | | 49| 21.8k|#define IMMER_TRY try ------------------ 1808| 21.8k| lpos.each_left_sub(visitor_t{}, merger); 1809| 21.8k| cpos.each_sub(visitor_t{}, merger); 1810| 21.8k| rpos.each_right_sub(visitor_t{}, merger); 1811| 21.8k| cpos.each_sub(dec_visitor{}); 1812| 21.8k| return merger.finish(); 1813| 21.8k| } 1814| 21.8k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 21.8k| } _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| 412k| { 1945| 412k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 412k| } _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| 645k| { 1925| 645k| return concat_leafs(lpos, tpos, rpos); 1926| 645k| } _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| 645k|{ 1839| 645k| static_assert(Node::bits >= 2, ""); 1840| 645k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 645k, False: 0] ------------------ 1841| 645k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 645k, False: 0] ------------------ 1842| 645k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 645k, False: 0] ------------------ 1843| 645k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 645k, False: 0] ------------------ 1844| 645k| return { 1845| 645k| Node::bits_leaf, 1846| 645k| lpos.node()->inc(), 1847| 645k| lpos.count(), 1848| 645k| tpos.node()->inc(), 1849| 645k| tpos.count(), 1850| 645k| rpos.node()->inc(), 1851| 645k| rpos.count(), 1852| 645k| }; 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| 645k|} _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| 15.7k| { 1938| 15.7k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 15.7k| } _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| 420k|{ 1824| 420k| auto plan = concat_rebalance_plan{}; 1825| 420k| plan.fill(lpos, cpos, rpos); 1826| 420k| plan.shuffle(cpos.shift()); 1827| 420k| IMMER_TRY { ------------------ | | 49| 420k|#define IMMER_TRY try ------------------ 1828| 420k| return plan.merge(lpos, cpos, rpos); 1829| 420k| } 1830| 420k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 420k|} _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| 420k| { 1753| 420k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 420k, False: 0] ------------------ 1754| 420k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 420k, False: 0] ------------------ 1755| 420k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 420k| lpos.each_left_sub(visitor_t{}, *this); 1757| 420k| cpos.each_sub(visitor_t{}, *this); 1758| 420k| rpos.each_right_sub(visitor_t{}, *this); 1759| 420k| } _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| 420k| { 1803| 420k| using node_t = node_type; 1804| 420k| using merger_t = concat_merger; 1805| 420k| using visitor_t = concat_merger_visitor; 1806| 420k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 420k| IMMER_TRY { ------------------ | | 49| 420k|#define IMMER_TRY try ------------------ 1808| 420k| lpos.each_left_sub(visitor_t{}, merger); 1809| 420k| cpos.each_sub(visitor_t{}, merger); 1810| 420k| rpos.each_right_sub(visitor_t{}, merger); 1811| 420k| cpos.each_sub(dec_visitor{}); 1812| 420k| return merger.finish(); 1813| 420k| } 1814| 420k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 420k| } _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| 645k| { 1945| 645k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 645k| } _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.40M| { 1938| 1.40M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.40M| } _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.00M|{ 1824| 1.00M| auto plan = concat_rebalance_plan{}; 1825| 1.00M| plan.fill(lpos, cpos, rpos); 1826| 1.00M| plan.shuffle(cpos.shift()); 1827| 1.00M| IMMER_TRY { ------------------ | | 49| 1.00M|#define IMMER_TRY try ------------------ 1828| 1.00M| return plan.merge(lpos, cpos, rpos); 1829| 1.00M| } 1830| 1.00M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.00M|} _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.00M| { 1753| 1.00M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.00M, False: 0] ------------------ 1754| 1.00M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.00M, False: 0] ------------------ 1755| 1.00M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.00M| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.00M| cpos.each_sub(visitor_t{}, *this); 1758| 1.00M| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.00M| } _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.00M| { 1803| 1.00M| using node_t = node_type; 1804| 1.00M| using merger_t = concat_merger; 1805| 1.00M| using visitor_t = concat_merger_visitor; 1806| 1.00M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.00M| IMMER_TRY { ------------------ | | 49| 1.00M|#define IMMER_TRY try ------------------ 1808| 1.00M| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.00M| cpos.each_sub(visitor_t{}, merger); 1810| 1.00M| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.00M| cpos.each_sub(dec_visitor{}); 1812| 1.00M| return merger.finish(); 1813| 1.00M| } 1814| 1.00M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.00M| } _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.33M|{ 1824| 3.33M| auto plan = concat_rebalance_plan{}; 1825| 3.33M| plan.fill(lpos, cpos, rpos); 1826| 3.33M| plan.shuffle(cpos.shift()); 1827| 3.33M| IMMER_TRY { ------------------ | | 49| 3.33M|#define IMMER_TRY try ------------------ 1828| 3.33M| return plan.merge(lpos, cpos, rpos); 1829| 3.33M| } 1830| 3.33M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.33M|} _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.33M| { 1753| 3.33M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.33M, False: 0] ------------------ 1754| 3.33M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.33M, False: 0] ------------------ 1755| 3.33M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.33M| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.33M| cpos.each_sub(visitor_t{}, *this); 1758| 3.33M| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.33M| } _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.33M| { 1803| 3.33M| using node_t = node_type; 1804| 3.33M| using merger_t = concat_merger; 1805| 3.33M| using visitor_t = concat_merger_visitor; 1806| 3.33M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.33M| IMMER_TRY { ------------------ | | 49| 3.33M|#define IMMER_TRY try ------------------ 1808| 3.33M| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.33M| cpos.each_sub(visitor_t{}, merger); 1810| 3.33M| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.33M| cpos.each_sub(dec_visitor{}); 1812| 3.33M| return merger.finish(); 1813| 3.33M| } 1814| 3.33M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.33M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 7.47M| { 1918| 7.47M| return concat_inners(lpos, tpos, rpos); 1919| 7.47M| } _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| 543| { 1918| 543| return concat_inners(lpos, tpos, rpos); 1919| 543| } _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| 23.2k|{ 1873| 23.2k| auto lshift = lpos.shift(); 1874| 23.2k| auto rshift = rpos.shift(); 1875| 23.2k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 14.4k, False: 8.75k] ------------------ 1876| 14.4k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 14.4k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 14.4k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 595, False: 8.15k] ------------------ 1879| 595| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 595| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 8.15k| } else { 1882| 8.15k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 8.15k, False: 0] ------------------ 1883| 8.15k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 8.15k] | Branch (1883:9): [True: 8.15k, False: 0] | Branch (1883:9): [True: 8.15k, False: 0] ------------------ 1884| 8.15k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 8.15k| return concat_rebalance(lpos, cpos, rpos); 1886| 8.15k| } 1887| 23.2k|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 14.0k| { 1898| 14.0k| return concat_inners(lpos, tpos, rpos); 1899| 14.0k| } _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.40k| { 1918| 1.40k| return concat_inners(lpos, tpos, rpos); 1919| 1.40k| } _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.40k|{ 1873| 1.40k| auto lshift = lpos.shift(); 1874| 1.40k| auto rshift = rpos.shift(); 1875| 1.40k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 1.40k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.40k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 196, False: 1.21k] ------------------ 1879| 196| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 196| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.21k| } else { 1882| 1.21k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.21k, False: 0] ------------------ 1883| 1.21k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.21k] | Branch (1883:9): [True: 1.21k, False: 0] | Branch (1883:9): [True: 1.21k, False: 0] ------------------ 1884| 1.21k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.21k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.21k| } 1887| 1.40k|} _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| 201| { 1938| 201| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 201| } _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.21k|{ 1824| 1.21k| auto plan = concat_rebalance_plan{}; 1825| 1.21k| plan.fill(lpos, cpos, rpos); 1826| 1.21k| plan.shuffle(cpos.shift()); 1827| 1.21k| IMMER_TRY { ------------------ | | 49| 1.21k|#define IMMER_TRY try ------------------ 1828| 1.21k| return plan.merge(lpos, cpos, rpos); 1829| 1.21k| } 1830| 1.21k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.21k|} _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.21k| { 1753| 1.21k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.21k, False: 0] ------------------ 1754| 1.21k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.21k, False: 0] ------------------ 1755| 1.21k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.21k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.21k| cpos.each_sub(visitor_t{}, *this); 1758| 1.21k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.21k| } _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.21k| { 1803| 1.21k| using node_t = node_type; 1804| 1.21k| using merger_t = concat_merger; 1805| 1.21k| using visitor_t = concat_merger_visitor; 1806| 1.21k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.21k| IMMER_TRY { ------------------ | | 49| 1.21k|#define IMMER_TRY try ------------------ 1808| 1.21k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.21k| cpos.each_sub(visitor_t{}, merger); 1810| 1.21k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.21k| cpos.each_sub(dec_visitor{}); 1812| 1.21k| return merger.finish(); 1813| 1.21k| } 1814| 1.21k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.21k| } _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| 416| { 1938| 416| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 416| } _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| 8.15k|{ 1824| 8.15k| auto plan = concat_rebalance_plan{}; 1825| 8.15k| plan.fill(lpos, cpos, rpos); 1826| 8.15k| plan.shuffle(cpos.shift()); 1827| 8.15k| IMMER_TRY { ------------------ | | 49| 8.15k|#define IMMER_TRY try ------------------ 1828| 8.15k| return plan.merge(lpos, cpos, rpos); 1829| 8.15k| } 1830| 8.15k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 8.15k|} _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| 8.15k| { 1753| 8.15k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 8.15k, False: 0] ------------------ 1754| 8.15k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 8.15k, False: 0] ------------------ 1755| 8.15k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 8.15k| lpos.each_left_sub(visitor_t{}, *this); 1757| 8.15k| cpos.each_sub(visitor_t{}, *this); 1758| 8.15k| rpos.each_right_sub(visitor_t{}, *this); 1759| 8.15k| } _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| 8.15k| { 1803| 8.15k| using node_t = node_type; 1804| 8.15k| using merger_t = concat_merger; 1805| 8.15k| using visitor_t = concat_merger_visitor; 1806| 8.15k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 8.15k| IMMER_TRY { ------------------ | | 49| 8.15k|#define IMMER_TRY try ------------------ 1808| 8.15k| lpos.each_left_sub(visitor_t{}, merger); 1809| 8.15k| cpos.each_sub(visitor_t{}, merger); 1810| 8.15k| rpos.each_right_sub(visitor_t{}, merger); 1811| 8.15k| cpos.each_sub(dec_visitor{}); 1812| 8.15k| return merger.finish(); 1813| 8.15k| } 1814| 8.15k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 8.15k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 7.43M| { 1938| 7.43M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 7.43M| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EEOT0_OT1_OT2_: 1823| 8.48M|{ 1824| 8.48M| auto plan = concat_rebalance_plan{}; 1825| 8.48M| plan.fill(lpos, cpos, rpos); 1826| 8.48M| plan.shuffle(cpos.shift()); 1827| 8.48M| IMMER_TRY { ------------------ | | 49| 8.48M|#define IMMER_TRY try ------------------ 1828| 8.48M| return plan.merge(lpos, cpos, rpos); 1829| 8.48M| } 1830| 8.48M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 8.48M|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EEvOT_OT0_OT1_: 1752| 8.48M| { 1753| 8.48M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 8.48M, False: 0] ------------------ 1754| 8.48M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 8.48M, False: 0] ------------------ 1755| 8.48M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 8.48M| lpos.each_left_sub(visitor_t{}, *this); 1757| 8.48M| cpos.each_sub(visitor_t{}, *this); 1758| 8.48M| rpos.each_right_sub(visitor_t{}, *this); 1759| 8.48M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSN_OT1_: 1802| 8.48M| { 1803| 8.48M| using node_t = node_type; 1804| 8.48M| using merger_t = concat_merger; 1805| 8.48M| using visitor_t = concat_merger_visitor; 1806| 8.48M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 8.48M| IMMER_TRY { ------------------ | | 49| 8.48M|#define IMMER_TRY try ------------------ 1808| 8.48M| lpos.each_left_sub(visitor_t{}, merger); 1809| 8.48M| cpos.each_sub(visitor_t{}, merger); 1810| 8.48M| rpos.each_right_sub(visitor_t{}, merger); 1811| 8.48M| cpos.each_sub(dec_visitor{}); 1812| 8.48M| return merger.finish(); 1813| 8.48M| } 1814| 8.48M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 8.48M| } _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| 8.60k| { 1959| 8.60k| return concat_inners(lpos, tpos, rpos); 1960| 8.60k| } _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| 15.5k| { 1972| 15.5k| return visit_maybe_relaxed_sub( 1973| 15.5k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 15.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.39k| { 1959| 6.39k| return concat_inners(lpos, tpos, rpos); 1960| 6.39k| } _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.13k| { 1959| 9.13k| return concat_inners(lpos, tpos, rpos); 1960| 9.13k| } _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| 184k| { 681| 184k| auto node = pos.node(); 682| 184k| auto level = pos.shift(); 683| 184k| auto idx = pos.count() - 1; 684| 184k| auto children = pos.size(idx); 685| 184k| auto new_idx = 686| 184k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 2.72k, False: 181k] | Branch (686:47): [True: 315, False: 181k] ------------------ 687| 184k| auto new_child = static_cast(nullptr); 688| 184k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 184k, Folded] | Branch (688:38): [True: 181k, False: 2.92k] ------------------ 689| | 690| 184k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 734, False: 183k] ------------------ 691| 734| return nullptr; 692| 183k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 181k, False: 2.30k] ------------------ 693| 181k| new_child = 694| 181k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 179k, False: 2.54k] ------------------ 695| 181k| : pos.last_oh_csh( 696| 2.54k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 181k| if (!new_child) { ------------------ | Branch (697:17): [True: 1.14k, False: 180k] ------------------ 698| 1.14k| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 319, False: 829] ------------------ 699| 319| new_child = node_t::make_path_e(e, level - B, tail); 700| 829| else 701| 829| return nullptr; 702| 1.14k| } 703| 181k| } else 704| 2.30k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 183k| if (mutate) { ------------------ | Branch (706:13): [True: 180k, False: 2.59k] ------------------ 707| 180k| auto count = new_idx + 1; 708| 180k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 180k| node->inner()[new_idx] = new_child; 710| 180k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 180k| relaxed->d.count = count; 712| 180k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 180k, False: 0] ------------------ 713| 180k| return node; 714| 180k| } else { 715| 2.59k| IMMER_TRY { ------------------ | | 49| 2.59k|#define IMMER_TRY try ------------------ 716| 2.59k| auto count = new_idx + 1; 717| 2.59k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 2.59k| auto relaxed = new_node->relaxed(); 719| 2.59k| new_node->inner()[new_idx] = new_child; 720| 2.59k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 2.59k| relaxed->d.count = count; 722| 2.59k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 2.59k, False: 0] ------------------ 723| 2.59k| if (Mutating) ------------------ | Branch (723:21): [True: 2.59k, Folded] ------------------ 724| 2.59k| pos.visit(dec_visitor{}); 725| 2.59k| return new_node; 726| 2.59k| } 727| 2.59k| IMMER_CATCH (...) { 728| 0| auto shift = pos.shift(); 729| 0| auto size = new_idx == idx ? children + ts : ts; ------------------ | Branch (729:30): [True: 0, False: 0] ------------------ 730| 0| if (shift > BL) { ------------------ | Branch (730:21): [True: 0, False: 0] ------------------ 731| 0| tail->inc(); 732| 0| dec_inner(new_child, shift - B, size); 733| 0| } 734| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 735| 0| } 736| 2.59k| } 737| 183k| } _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| 167k| { 742| 167k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 167k, False: 0] ------------------ 743| 167k| auto node = pos.node(); 744| 167k| auto idx = pos.index(pos.size() - 1); 745| 167k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 167k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 167k, Folded] | Branch (746:36): [True: 166k, False: 999] ------------------ 747| 167k| if (mutate) { ------------------ | Branch (747:13): [True: 166k, False: 999] ------------------ 748| 166k| node->inner()[new_idx] = 749| 166k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 164k, False: 2.74k] ------------------ 750| | /* otherwise */ 751| 166k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 166k| return node; 753| 166k| } else { 754| 999| auto new_parent = node_t::make_inner_e(e); 755| 999| IMMER_TRY { ------------------ | | 49| 999|#define IMMER_TRY try ------------------ 756| 999| new_parent->inner()[new_idx] = 757| 999| idx == new_idx ------------------ | Branch (757:21): [True: 683, False: 316] ------------------ 758| 999| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 999| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 999| node_t::do_copy_inner(new_parent, node, new_idx); 762| 999| if (Mutating) ------------------ | Branch (762:21): [True: 999, Folded] ------------------ 763| 999| pos.visit(dec_visitor{}); 764| 999| return new_parent; 765| 999| } 766| 999| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 999| } 771| 167k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 1.08M| { 742| 1.08M| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.08M, False: 0] ------------------ 743| 1.08M| auto node = pos.node(); 744| 1.08M| auto idx = pos.index(pos.size() - 1); 745| 1.08M| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.08M| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 1.08M, Folded] | Branch (746:36): [True: 1.07M, False: 1.73k] ------------------ 747| 1.08M| if (mutate) { ------------------ | Branch (747:13): [True: 1.07M, False: 1.73k] ------------------ 748| 1.07M| node->inner()[new_idx] = 749| 1.07M| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 738k, False: 341k] ------------------ 750| | /* otherwise */ 751| 1.07M| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 1.07M| return node; 753| 1.07M| } else { 754| 1.73k| auto new_parent = node_t::make_inner_e(e); 755| 1.73k| IMMER_TRY { ------------------ | | 49| 1.73k|#define IMMER_TRY try ------------------ 756| 1.73k| new_parent->inner()[new_idx] = 757| 1.73k| idx == new_idx ------------------ | Branch (757:21): [True: 1.03k, False: 703] ------------------ 758| 1.73k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.73k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.73k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.73k| if (Mutating) ------------------ | Branch (762:21): [True: 1.73k, Folded] ------------------ 763| 1.73k| pos.visit(dec_visitor{}); 764| 1.73k| return new_parent; 765| 1.73k| } 766| 1.73k| 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.73k| } 771| 1.08M| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 4.45k| { 742| 4.45k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 4.45k, False: 0] ------------------ 743| 4.45k| auto node = pos.node(); 744| 4.45k| auto idx = pos.index(pos.size() - 1); 745| 4.45k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 4.45k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 4.45k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 4.45k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 4.45k] ------------------ 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.45k| } else { 754| 4.45k| auto new_parent = node_t::make_inner_e(e); 755| 4.45k| IMMER_TRY { ------------------ | | 49| 4.45k|#define IMMER_TRY try ------------------ 756| 4.45k| new_parent->inner()[new_idx] = 757| 4.45k| idx == new_idx ------------------ | Branch (757:21): [True: 1.82k, False: 2.63k] ------------------ 758| 4.45k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 4.45k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 4.45k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 4.45k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 4.45k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 4.45k| return new_parent; 765| 4.45k| } 766| 4.45k| 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.45k| } 771| 4.45k| } _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.16k| { 681| 7.16k| auto node = pos.node(); 682| 7.16k| auto level = pos.shift(); 683| 7.16k| auto idx = pos.count() - 1; 684| 7.16k| auto children = pos.size(idx); 685| 7.16k| auto new_idx = 686| 7.16k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 837, False: 6.33k] | Branch (686:47): [True: 665, False: 5.66k] ------------------ 687| 7.16k| auto new_child = static_cast(nullptr); 688| 7.16k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 7.16k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 7.16k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 664, False: 6.50k] ------------------ 691| 664| return nullptr; 692| 6.50k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 5.66k, False: 838] ------------------ 693| 5.66k| new_child = 694| 5.66k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 5.66k] ------------------ 695| 5.66k| : pos.last_oh_csh( 696| 5.66k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 5.66k| if (!new_child) { ------------------ | Branch (697:17): [True: 828, False: 4.83k] ------------------ 698| 828| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 351, False: 477] ------------------ 699| 351| new_child = node_t::make_path_e(e, level - B, tail); 700| 477| else 701| 477| return nullptr; 702| 828| } 703| 5.66k| } else 704| 838| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 6.02k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 6.02k] ------------------ 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.02k| } else { 715| 6.02k| IMMER_TRY { ------------------ | | 49| 6.02k|#define IMMER_TRY try ------------------ 716| 6.02k| auto count = new_idx + 1; 717| 6.02k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 6.02k| auto relaxed = new_node->relaxed(); 719| 6.02k| new_node->inner()[new_idx] = new_child; 720| 6.02k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 6.02k| relaxed->d.count = count; 722| 6.02k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 6.02k, False: 0] ------------------ 723| 6.02k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 6.02k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 6.02k| return new_node; 726| 6.02k| } 727| 6.02k| 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.02k| } 737| 6.02k| } _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.04k| { 742| 1.04k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.04k, False: 0] ------------------ 743| 1.04k| auto node = pos.node(); 744| 1.04k| auto idx = pos.index(pos.size() - 1); 745| 1.04k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.04k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 1.04k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 1.04k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 1.04k] ------------------ 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.04k| } else { 754| 1.04k| auto new_parent = node_t::make_inner_e(e); 755| 1.04k| IMMER_TRY { ------------------ | | 49| 1.04k|#define IMMER_TRY try ------------------ 756| 1.04k| new_parent->inner()[new_idx] = 757| 1.04k| idx == new_idx ------------------ | Branch (757:21): [True: 602, False: 442] ------------------ 758| 1.04k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.04k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.04k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.04k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 1.04k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 1.04k| return new_parent; 765| 1.04k| } 766| 1.04k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 1.04k| } 771| 1.04k| } _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| 187k| { 742| 187k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 187k, False: 0] ------------------ 743| 187k| auto node = pos.node(); 744| 187k| auto idx = pos.index(pos.size() - 1); 745| 187k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 187k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 187k, Folded] | Branch (746:36): [True: 187k, False: 630] ------------------ 747| 187k| if (mutate) { ------------------ | Branch (747:13): [True: 187k, False: 630] ------------------ 748| 187k| node->inner()[new_idx] = 749| 187k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 178k, False: 8.54k] ------------------ 750| | /* otherwise */ 751| 187k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 187k| return node; 753| 187k| } else { 754| 630| auto new_parent = node_t::make_inner_e(e); 755| 630| IMMER_TRY { ------------------ | | 49| 630|#define IMMER_TRY try ------------------ 756| 630| new_parent->inner()[new_idx] = 757| 630| idx == new_idx ------------------ | Branch (757:21): [True: 311, False: 319] ------------------ 758| 630| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 630| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 630| node_t::do_copy_inner(new_parent, node, new_idx); 762| 630| if (Mutating) ------------------ | Branch (762:21): [True: 630, Folded] ------------------ 763| 630| pos.visit(dec_visitor{}); 764| 630| return new_parent; 765| 630| } 766| 630| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 630| } 771| 187k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_: 580| 2.34k|{ 581| 2.34k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 2.34k|} _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| 104k| { 596| 104k| auto offset = pos.index(idx); 597| 104k| auto count = pos.count(); 598| 104k| auto node = pos.node(); 599| 104k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 77.3k, False: 26.9k] ------------------ 600| 77.3k| return pos.towards_oh( 601| 77.3k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 77.3k| } else { 603| 26.9k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 26.9k| IMMER_TRY { ------------------ | | 49| 26.9k|#define IMMER_TRY try ------------------ 605| 26.9k| auto& res = pos.towards_oh( 606| 26.9k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 26.9k| pos.visit(dec_visitor{}); 608| 26.9k| *location = new_node; 609| 26.9k| return res; 610| 26.9k| } 611| 26.9k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 26.9k| } 616| 104k| } _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| 15.5k| { 653| 15.5k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 15.5k, False: 0] ------------------ 654| 15.5k| auto node = pos.node(); 655| 15.5k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 2.09k, False: 13.4k] ------------------ 656| 2.09k| return node->leaf()[pos.index(idx)]; 657| 13.4k| } else { 658| 13.4k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 13.4k| pos.visit(dec_visitor{}); 660| 13.4k| *location = new_node; 661| 13.4k| return new_node->leaf()[pos.index(idx)]; 662| 13.4k| } 663| 15.5k| } _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| 5.35k| { 622| 5.35k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 5.35k, False: 0] ------------------ 623| 5.35k| auto offset = pos.index(idx); 624| 5.35k| auto count = pos.count(); 625| 5.35k| auto node = pos.node(); 626| 5.35k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 3.89k, False: 1.46k] ------------------ 627| 3.89k| return pos.towards_oh_ch( 628| 3.89k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 3.89k| } else { 630| 1.46k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.46k| IMMER_TRY { ------------------ | | 49| 1.46k|#define IMMER_TRY try ------------------ 632| 1.46k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.46k| idx, 634| 1.46k| offset, 635| 1.46k| count, 636| 1.46k| e, 637| 1.46k| &new_node->inner()[offset]); 638| 1.46k| pos.visit(dec_visitor{}); 639| 1.46k| *location = new_node; 640| 1.46k| return res; 641| 1.46k| } 642| 1.46k| 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.46k| } 647| 5.35k| } _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.97k| { 653| 2.97k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 2.97k, False: 0] ------------------ 654| 2.97k| auto node = pos.node(); 655| 2.97k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.62k, False: 1.35k] ------------------ 656| 1.62k| return node->leaf()[pos.index(idx)]; 657| 1.62k| } else { 658| 1.35k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 1.35k| pos.visit(dec_visitor{}); 660| 1.35k| *location = new_node; 661| 1.35k| return new_node->leaf()[pos.index(idx)]; 662| 1.35k| } 663| 2.97k| } _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.04k| { 622| 2.04k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.04k, False: 0] ------------------ 623| 2.04k| auto offset = pos.index(idx); 624| 2.04k| auto count = pos.count(); 625| 2.04k| auto node = pos.node(); 626| 2.04k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.11k, False: 932] ------------------ 627| 1.11k| return pos.towards_oh_ch( 628| 1.11k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.11k| } else { 630| 932| auto new_node = node_t::copy_inner_e(e, node, count); 631| 932| IMMER_TRY { ------------------ | | 49| 932|#define IMMER_TRY try ------------------ 632| 932| auto& res = pos.towards_oh_ch(this_t{}, 633| 932| idx, 634| 932| offset, 635| 932| count, 636| 932| e, 637| 932| &new_node->inner()[offset]); 638| 932| pos.visit(dec_visitor{}); 639| 932| *location = new_node; 640| 932| return res; 641| 932| } 642| 932| 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| 932| } 647| 2.04k| } _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| 2.37k| { 653| 2.37k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 2.37k, False: 0] ------------------ 654| 2.37k| auto node = pos.node(); 655| 2.37k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.80k, False: 577] ------------------ 656| 1.80k| return node->leaf()[pos.index(idx)]; 657| 1.80k| } else { 658| 577| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 577| pos.visit(dec_visitor{}); 660| 577| *location = new_node; 661| 577| return new_node->leaf()[pos.index(idx)]; 662| 577| } 663| 2.37k| } _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.74k| { 622| 1.74k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 1.74k, False: 0] ------------------ 623| 1.74k| auto offset = pos.index(idx); 624| 1.74k| auto count = pos.count(); 625| 1.74k| auto node = pos.node(); 626| 1.74k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.41k, False: 327] ------------------ 627| 1.41k| return pos.towards_oh_ch( 628| 1.41k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.41k| } else { 630| 327| auto new_node = node_t::copy_inner_e(e, node, count); 631| 327| IMMER_TRY { ------------------ | | 49| 327|#define IMMER_TRY try ------------------ 632| 327| auto& res = pos.towards_oh_ch(this_t{}, 633| 327| idx, 634| 327| offset, 635| 327| count, 636| 327| e, 637| 327| &new_node->inner()[offset]); 638| 327| pos.visit(dec_visitor{}); 639| 327| *location = new_node; 640| 327| return res; 641| 327| } 642| 327| 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| 327| } 647| 1.74k| } _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| 34.7k| { 914| 34.7k| auto idx = pos.index(last); 915| 34.7k| auto node = pos.node(); 916| 34.7k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 34.7k, Folded] | Branch (916:35): [True: 26.0k, False: 8.62k] ------------------ 917| 34.7k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 34.7k, Folded] | Branch (917:25): [True: 22.2k, False: 12.4k] ------------------ 918| 22.2k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 18.4k, False: 3.80k] ------------------ 919| 22.2k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 22.2k| if (Mutating) ------------------ | Branch (920:17): [True: 22.2k, Folded] ------------------ 921| 22.2k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 22.2k| return res; 923| 22.2k| } else { 924| 12.4k| using std::get; 925| 12.4k| auto subs = 926| 12.4k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 7.63k, False: 4.82k] ------------------ 927| 12.4k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 12.4k| auto next = get<1>(subs); 929| 12.4k| auto ts = get<2>(subs); 930| 12.4k| auto tail = get<3>(subs); 931| 12.4k| IMMER_TRY { ------------------ | | 49| 12.4k|#define IMMER_TRY try ------------------ 932| 12.4k| if (next) { ------------------ | Branch (932:21): [True: 8.84k, False: 3.61k] ------------------ 933| 8.84k| if (mutate) { ------------------ | Branch (933:25): [True: 5.52k, False: 3.31k] ------------------ 934| 5.52k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 5.52k| pos.each_right(dec_visitor{}, idx + 1); 936| 5.52k| node->inner()[idx] = next; 937| 5.52k| nodr->d.sizes[idx] = last + 1 - ts; 938| 5.52k| nodr->d.count = idx + 1; 939| 5.52k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 5.52k, False: 0] ------------------ 940| 5.52k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 5.52k| } else { 942| 3.31k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 3.31k| auto newr = newn->relaxed(); 944| 3.31k| newn->inner()[idx] = next; 945| 3.31k| newr->d.sizes[idx] = last + 1 - ts; 946| 3.31k| newr->d.count = idx + 1; 947| 3.31k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 3.31k, False: 0] ------------------ 948| 3.31k| if (Mutating) ------------------ | Branch (948:29): [True: 3.31k, Folded] ------------------ 949| 3.31k| pos.visit(dec_visitor{}); 950| 3.31k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 3.31k| } 952| 8.84k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 3.61k] ------------------ 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.61k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 3.61k, Folded] | Branch (956:40): [True: 2.71k, False: 900] | Branch (956:52): [True: 2.03k, False: 685] ------------------ 957| 2.03k| auto newn = pos.node()->inner()[0]; 958| 2.03k| if (!mutate) ------------------ | Branch (958:25): [True: 1.00k, False: 1.03k] ------------------ 959| 1.00k| newn->inc(); 960| 2.03k| if (Mutating) ------------------ | Branch (960:25): [True: 2.03k, Folded] ------------------ 961| 2.03k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 2.03k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.03k| } else { 964| 1.58k| if (mutate) { ------------------ | Branch (964:25): [True: 1.07k, False: 508] ------------------ 965| 1.07k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.07k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.07k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.07k| } else { 969| 508| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 508| if (Mutating) ------------------ | Branch (970:29): [True: 508, Folded] ------------------ 971| 508| pos.visit(dec_visitor{}); 972| 508| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 508| } 974| 1.58k| } 975| 12.4k| } 976| 12.4k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 12.4k| } 987| 34.7k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 833| { 1060| 833| auto old_tail_size = pos.count(); 1061| 833| auto new_tail_size = pos.index(last) + 1; 1062| 833| auto node = pos.node(); 1063| 833| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 833, Folded] | Branch (1063:42): [True: 250, False: 583] ------------------ 1064| 833| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 215, False: 618] ------------------ 1065| 215| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 215] ------------------ 1066| 0| node->inc(); 1067| 215| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 618| } else if (mutate) { ------------------ | Branch (1068:20): [True: 241, False: 377] ------------------ 1069| 241| detail::destroy_n(node->leaf() + new_tail_size, 1070| 241| old_tail_size - new_tail_size); 1071| 241| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 377| } else { 1073| 377| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 377| if (Mutating) ------------------ | Branch (1074:17): [True: 377, Folded] ------------------ 1075| 377| pos.visit(dec_visitor{}); 1076| 377| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 377| } 1078| 833| } _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| 843| { 1060| 843| auto old_tail_size = pos.count(); 1061| 843| auto new_tail_size = pos.index(last) + 1; 1062| 843| auto node = pos.node(); 1063| 843| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 843] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 843| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 353, False: 490] ------------------ 1065| 353| if (!Mutating) ------------------ | Branch (1065:17): [True: 353, Folded] ------------------ 1066| 353| node->inc(); 1067| 353| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 490| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 490] ------------------ 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| 490| } else { 1073| 490| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 490| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 490] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 490| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 490| } 1078| 843| } _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| 12.4k| { 914| 12.4k| auto idx = pos.index(last); 915| 12.4k| auto node = pos.node(); 916| 12.4k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 12.4k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 12.4k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 12.4k, Folded] | Branch (917:25): [True: 10.7k, False: 1.65k] ------------------ 918| 10.7k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 10.7k] ------------------ 919| 10.7k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 10.7k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 10.7k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 10.7k| return res; 923| 10.7k| } else { 924| 1.65k| using std::get; 925| 1.65k| auto subs = 926| 1.65k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 1.65k] ------------------ 927| 1.65k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 1.65k| auto next = get<1>(subs); 929| 1.65k| auto ts = get<2>(subs); 930| 1.65k| auto tail = get<3>(subs); 931| 1.65k| IMMER_TRY { ------------------ | | 49| 1.65k|#define IMMER_TRY try ------------------ 932| 1.65k| if (next) { ------------------ | Branch (932:21): [True: 727, False: 930] ------------------ 933| 727| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 727] ------------------ 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| 727| } else { 942| 727| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 727| auto newr = newn->relaxed(); 944| 727| newn->inner()[idx] = next; 945| 727| newr->d.sizes[idx] = last + 1 - ts; 946| 727| newr->d.count = idx + 1; 947| 727| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 727, False: 0] ------------------ 948| 727| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 727] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 727| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 727| } 952| 930| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 930] ------------------ 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| 930| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 930, Folded] | Branch (956:40): [True: 614, False: 316] | Branch (956:52): [True: 294, False: 320] ------------------ 957| 294| auto newn = pos.node()->inner()[0]; 958| 294| if (!mutate) ------------------ | Branch (958:25): [True: 294, False: 0] ------------------ 959| 294| newn->inc(); 960| 294| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 294] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 294| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 636| } else { 964| 636| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 636] ------------------ 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| 636| } else { 969| 636| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 636| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 636] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 636| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 636| } 974| 636| } 975| 1.65k| } 976| 1.65k| 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.65k| } 987| 12.4k| } _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.30k| { 992| 1.30k| auto idx = pos.index(last); 993| 1.30k| auto node = pos.node(); 994| 1.30k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.30k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.30k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.30k, Folded] | Branch (995:25): [True: 384, False: 916] ------------------ 996| 384| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 384] ------------------ 997| 384| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 384| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 384] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 384| return res; 1001| 916| } else { 1002| 916| using std::get; 1003| 916| auto subs = 1004| 916| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 916] ------------------ 1005| 916| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 916| auto next = get<1>(subs); 1007| 916| auto ts = get<2>(subs); 1008| 916| auto tail = get<3>(subs); 1009| 916| IMMER_TRY { ------------------ | | 49| 916|#define IMMER_TRY try ------------------ 1010| 916| if (next) { ------------------ | Branch (1010:21): [True: 264, False: 652] ------------------ 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| 652| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 652] ------------------ 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| 652| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 652, Folded] | Branch (1026:40): [True: 396, False: 256] | Branch (1026:52): [True: 197, False: 199] ------------------ 1027| 197| auto newn = pos.node()->inner()[0]; 1028| 197| if (!mutate) ------------------ | Branch (1028:25): [True: 197, False: 0] ------------------ 1029| 197| newn->inc(); 1030| 197| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 197] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 197| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 455| } else { 1034| 455| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 455] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 455| } else { 1038| 455| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 455| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 455] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 455| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 455| } 1043| 455| } 1044| 916| } 1045| 916| 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| 916| } 1055| 1.30k| } _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.92k| { 1060| 1.92k| auto old_tail_size = pos.count(); 1061| 1.92k| auto new_tail_size = pos.index(last) + 1; 1062| 1.92k| auto node = pos.node(); 1063| 1.92k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.92k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.92k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.26k, False: 659] ------------------ 1065| 1.26k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.26k, Folded] ------------------ 1066| 1.26k| node->inc(); 1067| 1.26k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.26k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 659] ------------------ 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| 659| } else { 1073| 659| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 659| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 659] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 659| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 659| } 1078| 1.92k| } _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.60k| { 992| 1.60k| auto idx = pos.index(last); 993| 1.60k| auto node = pos.node(); 994| 1.60k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.60k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.60k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.60k, Folded] | Branch (995:25): [True: 559, False: 1.04k] ------------------ 996| 559| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 559] ------------------ 997| 559| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 559| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 559] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 559| return res; 1001| 1.04k| } else { 1002| 1.04k| using std::get; 1003| 1.04k| auto subs = 1004| 1.04k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.04k] ------------------ 1005| 1.04k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.04k| auto next = get<1>(subs); 1007| 1.04k| auto ts = get<2>(subs); 1008| 1.04k| auto tail = get<3>(subs); 1009| 1.04k| IMMER_TRY { ------------------ | | 49| 1.04k|#define IMMER_TRY try ------------------ 1010| 1.04k| if (next) { ------------------ | Branch (1010:21): [True: 270, False: 774] ------------------ 1011| 270| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 270] ------------------ 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| 270| } else { 1016| 270| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 270| newn->inner()[idx] = next; 1018| 270| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 270] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 270| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 270| } 1022| 774| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 774] ------------------ 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| 774| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 774, Folded] | Branch (1026:40): [True: 396, False: 378] | Branch (1026:52): [True: 200, False: 196] ------------------ 1027| 200| auto newn = pos.node()->inner()[0]; 1028| 200| if (!mutate) ------------------ | Branch (1028:25): [True: 200, False: 0] ------------------ 1029| 200| newn->inc(); 1030| 200| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 200] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 200| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 574| } else { 1034| 574| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 574] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 574| } else { 1038| 574| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 574| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 574] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 574| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 574| } 1043| 574| } 1044| 1.04k| } 1045| 1.04k| 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.04k| } 1055| 1.60k| } _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| 2.95k| { 1060| 2.95k| auto old_tail_size = pos.count(); 1061| 2.95k| auto new_tail_size = pos.index(last) + 1; 1062| 2.95k| auto node = pos.node(); 1063| 2.95k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 2.95k, Folded] | Branch (1063:42): [True: 289, False: 2.66k] ------------------ 1064| 2.95k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.52k, False: 1.42k] ------------------ 1065| 1.52k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.52k] ------------------ 1066| 0| node->inc(); 1067| 1.52k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.52k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 284, False: 1.13k] ------------------ 1069| 284| detail::destroy_n(node->leaf() + new_tail_size, 1070| 284| old_tail_size - new_tail_size); 1071| 284| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.13k| } else { 1073| 1.13k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.13k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.13k, Folded] ------------------ 1075| 1.13k| pos.visit(dec_visitor{}); 1076| 1.13k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.13k| } 1078| 2.95k| } _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.61k| { 992| 3.61k| auto idx = pos.index(last); 993| 3.61k| auto node = pos.node(); 994| 3.61k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.61k, Folded] | Branch (994:35): [True: 1.53k, False: 2.08k] ------------------ 995| 3.61k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.61k] | 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.61k| } else { 1002| 3.61k| using std::get; 1003| 3.61k| auto subs = 1004| 3.61k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 1.53k, False: 2.08k] ------------------ 1005| 3.61k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.61k| auto next = get<1>(subs); 1007| 3.61k| auto ts = get<2>(subs); 1008| 3.61k| auto tail = get<3>(subs); 1009| 3.61k| IMMER_TRY { ------------------ | | 49| 3.61k|#define IMMER_TRY try ------------------ 1010| 3.61k| if (next) { ------------------ | Branch (1010:21): [True: 953, False: 2.66k] ------------------ 1011| 953| if (mutate) { ------------------ | Branch (1011:25): [True: 426, False: 527] ------------------ 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| 527| } else { 1016| 527| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 527| newn->inner()[idx] = next; 1018| 527| if (Mutating) ------------------ | Branch (1018:29): [True: 527, Folded] ------------------ 1019| 527| pos.visit(dec_visitor{}); 1020| 527| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 527| } 1022| 2.66k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.01k, False: 1.64k] ------------------ 1023| 1.01k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.01k, Folded] ------------------ 1024| 1.01k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.01k| 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): [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.64k| } else { 1034| 1.64k| if (mutate) { ------------------ | Branch (1034:25): [True: 347, False: 1.30k] ------------------ 1035| 347| pos.each_right(dec_visitor{}, idx + 1); 1036| 347| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.30k| } else { 1038| 1.30k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.30k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.30k, Folded] ------------------ 1040| 1.30k| pos.visit(dec_visitor{}); 1041| 1.30k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.30k| } 1043| 1.64k| } 1044| 3.61k| } 1045| 3.61k| 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.61k| } 1055| 3.61k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 3.61k| { 879| 3.61k| using node_t = node_type; 880| 3.61k| auto node = p.node(); 881| 3.61k| if (node->dec()) { ------------------ | Branch (881:13): [True: 2.22k, False: 1.38k] ------------------ 882| 2.22k| p.each_right(dec_t{}, idx); 883| 2.22k| node_t::delete_inner(node, p.count()); 884| 2.22k| } 885| 3.61k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 9.83k| { 1060| 9.83k| auto old_tail_size = pos.count(); 1061| 9.83k| auto new_tail_size = pos.index(last) + 1; 1062| 9.83k| auto node = pos.node(); 1063| 9.83k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 9.83k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 9.83k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 4.37k, False: 5.46k] ------------------ 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.46k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 5.46k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 5.46k| } else { 1073| 5.46k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 5.46k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 5.46k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 5.46k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 5.46k| } 1078| 9.83k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 5.01k| { 992| 5.01k| auto idx = pos.index(last); 993| 5.01k| auto node = pos.node(); 994| 5.01k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 5.01k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 5.01k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 5.01k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 5.01k| } else { 1002| 5.01k| using std::get; 1003| 5.01k| auto subs = 1004| 5.01k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 5.01k] ------------------ 1005| 5.01k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.01k| auto next = get<1>(subs); 1007| 5.01k| auto ts = get<2>(subs); 1008| 5.01k| auto tail = get<3>(subs); 1009| 5.01k| IMMER_TRY { ------------------ | | 49| 5.01k|#define IMMER_TRY try ------------------ 1010| 5.01k| if (next) { ------------------ | Branch (1010:21): [True: 697, False: 4.32k] ------------------ 1011| 697| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 697] ------------------ 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| 697| } else { 1016| 697| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 697| newn->inner()[idx] = next; 1018| 697| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 697] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 697| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 697| } 1022| 4.32k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 875, False: 3.44k] ------------------ 1023| 875| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 875] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 875| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.44k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 3.44k] | 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.44k| } else { 1034| 3.44k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 3.44k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 3.44k| } else { 1038| 3.44k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 3.44k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 3.44k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 3.44k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 3.44k| } 1043| 3.44k| } 1044| 5.01k| } 1045| 5.01k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 5.01k| } 1055| 5.01k| } _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| 420| { 1060| 420| auto old_tail_size = pos.count(); 1061| 420| auto new_tail_size = pos.index(last) + 1; 1062| 420| auto node = pos.node(); 1063| 420| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 420] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 420| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 210, False: 210] ------------------ 1065| 210| if (!Mutating) ------------------ | Branch (1065:17): [True: 210, Folded] ------------------ 1066| 210| node->inc(); 1067| 210| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 210| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 210] ------------------ 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| 210| } else { 1073| 210| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 210| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 210] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 210| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 210| } 1078| 420| } _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.54k| { 1060| 1.54k| auto old_tail_size = pos.count(); 1061| 1.54k| auto new_tail_size = pos.index(last) + 1; 1062| 1.54k| auto node = pos.node(); 1063| 1.54k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.54k, Folded] | Branch (1063:42): [True: 199, False: 1.34k] ------------------ 1064| 1.54k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 445, False: 1.09k] ------------------ 1065| 445| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 445] ------------------ 1066| 0| node->inc(); 1067| 445| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.09k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 199, False: 898] ------------------ 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| 898| } else { 1073| 898| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 898| if (Mutating) ------------------ | Branch (1074:17): [True: 898, Folded] ------------------ 1075| 898| pos.visit(dec_visitor{}); 1076| 898| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 898| } 1078| 1.54k| } _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.27k| { 992| 3.27k| auto idx = pos.index(last); 993| 3.27k| auto node = pos.node(); 994| 3.27k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.27k, Folded] | Branch (994:35): [True: 2.36k, False: 912] ------------------ 995| 3.27k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.27k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.27k| } else { 1002| 3.27k| using std::get; 1003| 3.27k| auto subs = 1004| 3.27k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.36k, False: 912] ------------------ 1005| 3.27k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.27k| auto next = get<1>(subs); 1007| 3.27k| auto ts = get<2>(subs); 1008| 3.27k| auto tail = get<3>(subs); 1009| 3.27k| IMMER_TRY { ------------------ | | 49| 3.27k|#define IMMER_TRY try ------------------ 1010| 3.27k| if (next) { ------------------ | Branch (1010:21): [True: 1.44k, False: 1.82k] ------------------ 1011| 1.44k| if (mutate) { ------------------ | Branch (1011:25): [True: 987, False: 461] ------------------ 1012| 987| node->inner()[idx] = next; 1013| 987| pos.each_right(dec_visitor{}, idx + 1); 1014| 987| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 987| } 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| 1.82k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.05k, False: 773] ------------------ 1023| 1.05k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.05k, Folded] ------------------ 1024| 1.05k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.05k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.05k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 773] | 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| 773| } else { 1034| 773| if (mutate) { ------------------ | Branch (1034:25): [True: 523, False: 250] ------------------ 1035| 523| pos.each_right(dec_visitor{}, idx + 1); 1036| 523| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 523| } else { 1038| 250| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 250| if (Mutating) ------------------ | Branch (1039:29): [True: 250, Folded] ------------------ 1040| 250| pos.visit(dec_visitor{}); 1041| 250| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 250| } 1043| 773| } 1044| 3.27k| } 1045| 3.27k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.27k| } 1055| 3.27k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 1.05k| { 879| 1.05k| using node_t = node_type; 880| 1.05k| auto node = p.node(); 881| 1.05k| if (node->dec()) { ------------------ | Branch (881:13): [True: 854, False: 201] ------------------ 882| 854| p.each_right(dec_t{}, idx); 883| 854| node_t::delete_inner(node, p.count()); 884| 854| } 885| 1.05k| } _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.26k| { 1060| 2.26k| auto old_tail_size = pos.count(); 1061| 2.26k| auto new_tail_size = pos.index(last) + 1; 1062| 2.26k| auto node = pos.node(); 1063| 2.26k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.26k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.26k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 355, False: 1.90k] ------------------ 1065| 355| if (!Mutating) ------------------ | Branch (1065:17): [True: 355, Folded] ------------------ 1066| 355| node->inc(); 1067| 355| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.90k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 1.90k] ------------------ 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.90k| } else { 1073| 1.90k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.90k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 1.90k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 1.90k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.90k| } 1078| 2.26k| } _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.62k| { 992| 3.62k| auto idx = pos.index(last); 993| 3.62k| auto node = pos.node(); 994| 3.62k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.62k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.62k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.62k] | 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.62k| } else { 1002| 3.62k| using std::get; 1003| 3.62k| auto subs = 1004| 3.62k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.62k] ------------------ 1005| 3.62k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.62k| auto next = get<1>(subs); 1007| 3.62k| auto ts = get<2>(subs); 1008| 3.62k| auto tail = get<3>(subs); 1009| 3.62k| IMMER_TRY { ------------------ | | 49| 3.62k|#define IMMER_TRY try ------------------ 1010| 3.62k| if (next) { ------------------ | Branch (1010:21): [True: 903, False: 2.71k] ------------------ 1011| 903| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 903] ------------------ 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| 903| } else { 1016| 903| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 903| newn->inner()[idx] = next; 1018| 903| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 903] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 903| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 903| } 1022| 2.71k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.07k, False: 1.64k] ------------------ 1023| 1.07k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.07k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.07k| 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.62k| } 1045| 3.62k| 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.62k| } 1055| 3.62k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 867| 24.8k| { 868| 24.8k| using node_t = node_type; 869| 24.8k| auto node = p.node(); 870| 24.8k| if (node->dec()) { ------------------ | Branch (870:13): [True: 19.7k, False: 5.10k] ------------------ 871| 19.7k| p.each_right(dec_t{}, idx); 872| 19.7k| node_t::delete_inner_r(node, p.count()); 873| 19.7k| } 874| 24.8k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.83k| { 1060| 1.83k| auto old_tail_size = pos.count(); 1061| 1.83k| auto new_tail_size = pos.index(last) + 1; 1062| 1.83k| auto node = pos.node(); 1063| 1.83k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.83k, Folded] | Branch (1063:42): [True: 339, False: 1.49k] ------------------ 1064| 1.83k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 431, False: 1.40k] ------------------ 1065| 431| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 431] ------------------ 1066| 0| node->inc(); 1067| 431| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.40k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 309, False: 1.09k] ------------------ 1069| 309| detail::destroy_n(node->leaf() + new_tail_size, 1070| 309| old_tail_size - new_tail_size); 1071| 309| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.09k| } else { 1073| 1.09k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.09k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.09k, Folded] ------------------ 1075| 1.09k| pos.visit(dec_visitor{}); 1076| 1.09k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.09k| } 1078| 1.83k| } _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.80k| { 914| 2.80k| auto idx = pos.index(last); 915| 2.80k| auto node = pos.node(); 916| 2.80k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 2.80k, Folded] | Branch (916:35): [True: 1.41k, False: 1.38k] ------------------ 917| 2.80k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 2.80k] | 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.80k| } else { 924| 2.80k| using std::get; 925| 2.80k| auto subs = 926| 2.80k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 1.41k, False: 1.38k] ------------------ 927| 2.80k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 2.80k| auto next = get<1>(subs); 929| 2.80k| auto ts = get<2>(subs); 930| 2.80k| auto tail = get<3>(subs); 931| 2.80k| IMMER_TRY { ------------------ | | 49| 2.80k|#define IMMER_TRY try ------------------ 932| 2.80k| if (next) { ------------------ | Branch (932:21): [True: 862, False: 1.94k] ------------------ 933| 862| if (mutate) { ------------------ | Branch (933:25): [True: 381, False: 481] ------------------ 934| 381| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 381| pos.each_right(dec_visitor{}, idx + 1); 936| 381| node->inner()[idx] = next; 937| 381| nodr->d.sizes[idx] = last + 1 - ts; 938| 381| nodr->d.count = idx + 1; 939| 381| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 381, False: 0] ------------------ 940| 381| return std::make_tuple(pos.shift(), node, ts, tail); 941| 481| } else { 942| 481| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 481| auto newr = newn->relaxed(); 944| 481| newn->inner()[idx] = next; 945| 481| newr->d.sizes[idx] = last + 1 - ts; 946| 481| newr->d.count = idx + 1; 947| 481| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 481, False: 0] ------------------ 948| 481| if (Mutating) ------------------ | Branch (948:29): [True: 481, Folded] ------------------ 949| 481| pos.visit(dec_visitor{}); 950| 481| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 481| } 952| 1.94k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 549, False: 1.39k] ------------------ 953| 549| if (Mutating) ------------------ | Branch (953:25): [True: 549, Folded] ------------------ 954| 549| pos.visit(dec_right_visitor{}, count_t{1}); 955| 549| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.39k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.39k] | 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.39k| } else { 964| 1.39k| if (mutate) { ------------------ | Branch (964:25): [True: 786, False: 608] ------------------ 965| 786| pos.each_right(dec_visitor{}, idx + 1); 966| 786| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 786| return std::make_tuple(pos.shift(), node, ts, tail); 968| 786| } else { 969| 608| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 608| if (Mutating) ------------------ | Branch (970:29): [True: 608, Folded] ------------------ 971| 608| pos.visit(dec_visitor{}); 972| 608| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 608| } 974| 1.39k| } 975| 2.80k| } 976| 2.80k| 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.80k| } 987| 2.80k| } _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.41k| { 992| 4.41k| auto idx = pos.index(last); 993| 4.41k| auto node = pos.node(); 994| 4.41k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.41k, Folded] | Branch (994:35): [True: 3.24k, False: 1.17k] ------------------ 995| 4.41k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.41k] | 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.41k| } else { 1002| 4.41k| using std::get; 1003| 4.41k| auto subs = 1004| 4.41k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.24k, False: 1.17k] ------------------ 1005| 4.41k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.41k| auto next = get<1>(subs); 1007| 4.41k| auto ts = get<2>(subs); 1008| 4.41k| auto tail = get<3>(subs); 1009| 4.41k| IMMER_TRY { ------------------ | | 49| 4.41k|#define IMMER_TRY try ------------------ 1010| 4.41k| if (next) { ------------------ | Branch (1010:21): [True: 3.08k, False: 1.33k] ------------------ 1011| 3.08k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.53k, False: 542] ------------------ 1012| 2.53k| node->inner()[idx] = next; 1013| 2.53k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.53k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.53k| } else { 1016| 542| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 542| newn->inner()[idx] = next; 1018| 542| if (Mutating) ------------------ | Branch (1018:29): [True: 542, Folded] ------------------ 1019| 542| pos.visit(dec_visitor{}); 1020| 542| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 542| } 1022| 3.08k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 762, False: 572] ------------------ 1023| 762| if (Mutating) ------------------ | Branch (1023:25): [True: 762, Folded] ------------------ 1024| 762| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 762| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 762| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 572] | 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| 572| } else { 1034| 572| if (mutate) { ------------------ | Branch (1034:25): [True: 204, False: 368] ------------------ 1035| 204| pos.each_right(dec_visitor{}, idx + 1); 1036| 204| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 368| } else { 1038| 368| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 368| if (Mutating) ------------------ | Branch (1039:29): [True: 368, Folded] ------------------ 1040| 368| pos.visit(dec_visitor{}); 1041| 368| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 368| } 1043| 572| } 1044| 4.41k| } 1045| 4.41k| 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.41k| } 1055| 4.41k| } _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| 9.96k| { 879| 9.96k| using node_t = node_type; 880| 9.96k| auto node = p.node(); 881| 9.96k| if (node->dec()) { ------------------ | Branch (881:13): [True: 6.93k, False: 3.02k] ------------------ 882| 6.93k| p.each_right(dec_t{}, idx); 883| 6.93k| node_t::delete_inner(node, p.count()); 884| 6.93k| } 885| 9.96k| } _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.58k| { 1060| 4.58k| auto old_tail_size = pos.count(); 1061| 4.58k| auto new_tail_size = pos.index(last) + 1; 1062| 4.58k| auto node = pos.node(); 1063| 4.58k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 4.58k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 4.58k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 689, False: 3.89k] ------------------ 1065| 689| if (!Mutating) ------------------ | Branch (1065:17): [True: 689, Folded] ------------------ 1066| 689| node->inc(); 1067| 689| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 3.89k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 3.89k] ------------------ 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.89k| } else { 1073| 3.89k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 3.89k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 3.89k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 3.89k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 3.89k| } 1078| 4.58k| } _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.68k| { 914| 3.68k| auto idx = pos.index(last); 915| 3.68k| auto node = pos.node(); 916| 3.68k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 3.68k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 3.68k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 3.68k] | 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.68k| } else { 924| 3.68k| using std::get; 925| 3.68k| auto subs = 926| 3.68k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 3.68k] ------------------ 927| 3.68k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 3.68k| auto next = get<1>(subs); 929| 3.68k| auto ts = get<2>(subs); 930| 3.68k| auto tail = get<3>(subs); 931| 3.68k| IMMER_TRY { ------------------ | | 49| 3.68k|#define IMMER_TRY try ------------------ 932| 3.68k| if (next) { ------------------ | Branch (932:21): [True: 736, False: 2.95k] ------------------ 933| 736| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 736] ------------------ 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| 736| } else { 942| 736| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 736| auto newr = newn->relaxed(); 944| 736| newn->inner()[idx] = next; 945| 736| newr->d.sizes[idx] = last + 1 - ts; 946| 736| newr->d.count = idx + 1; 947| 736| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 736, False: 0] ------------------ 948| 736| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 736] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 736| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 736| } 952| 2.95k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 976, False: 1.97k] ------------------ 953| 976| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 976] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 976| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.97k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.97k] | 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.97k| } else { 964| 1.97k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 1.97k] ------------------ 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.97k| } else { 969| 1.97k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 1.97k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 1.97k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 1.97k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 1.97k| } 974| 1.97k| } 975| 3.68k| } 976| 3.68k| 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.68k| } 987| 3.68k| } _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.28k| { 992| 3.28k| auto idx = pos.index(last); 993| 3.28k| auto node = pos.node(); 994| 3.28k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.28k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.28k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.28k] | 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.28k| } else { 1002| 3.28k| using std::get; 1003| 3.28k| auto subs = 1004| 3.28k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.28k] ------------------ 1005| 3.28k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.28k| auto next = get<1>(subs); 1007| 3.28k| auto ts = get<2>(subs); 1008| 3.28k| auto tail = get<3>(subs); 1009| 3.28k| IMMER_TRY { ------------------ | | 49| 3.28k|#define IMMER_TRY try ------------------ 1010| 3.28k| if (next) { ------------------ | Branch (1010:21): [True: 2.13k, False: 1.14k] ------------------ 1011| 2.13k| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 2.13k] ------------------ 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.13k| } else { 1016| 2.13k| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 2.13k| newn->inner()[idx] = next; 1018| 2.13k| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 2.13k] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 2.13k| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 2.13k| } 1022| 2.13k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 736, False: 409] ------------------ 1023| 736| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 736] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 736| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 736| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 409] | 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| 409| } else { 1034| 409| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 409] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 409| } else { 1038| 409| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 409| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 409] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 409| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 409| } 1043| 409| } 1044| 3.28k| } 1045| 3.28k| 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.28k| } 1055| 3.28k| } _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.3k| { 992| 12.3k| auto idx = pos.index(last); 993| 12.3k| auto node = pos.node(); 994| 12.3k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 12.3k, Folded] | Branch (994:35): [True: 8.36k, False: 3.96k] ------------------ 995| 12.3k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 12.3k, Folded] | Branch (995:25): [True: 7.03k, False: 5.29k] ------------------ 996| 7.03k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 4.90k, False: 2.12k] ------------------ 997| 7.03k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 7.03k| if (Mutating) ------------------ | Branch (998:17): [True: 7.03k, Folded] ------------------ 999| 7.03k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 7.03k| return res; 1001| 7.03k| } else { 1002| 5.29k| using std::get; 1003| 5.29k| auto subs = 1004| 5.29k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.46k, False: 1.83k] ------------------ 1005| 5.29k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.29k| auto next = get<1>(subs); 1007| 5.29k| auto ts = get<2>(subs); 1008| 5.29k| auto tail = get<3>(subs); 1009| 5.29k| IMMER_TRY { ------------------ | | 49| 5.29k|#define IMMER_TRY try ------------------ 1010| 5.29k| if (next) { ------------------ | Branch (1010:21): [True: 1.29k, False: 3.99k] ------------------ 1011| 1.29k| if (mutate) { ------------------ | Branch (1011:25): [True: 672, False: 623] ------------------ 1012| 672| node->inner()[idx] = next; 1013| 672| pos.each_right(dec_visitor{}, idx + 1); 1014| 672| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 672| } else { 1016| 623| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 623| newn->inner()[idx] = next; 1018| 623| if (Mutating) ------------------ | Branch (1018:29): [True: 623, Folded] ------------------ 1019| 623| pos.visit(dec_visitor{}); 1020| 623| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 623| } 1022| 3.99k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 3.99k] ------------------ 1023| 0| if (Mutating) ------------------ | Branch (1023:25): [True: 0, Folded] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.99k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 3.99k, Folded] | Branch (1026:40): [True: 3.43k, False: 561] | Branch (1026:52): [True: 2.16k, False: 1.27k] ------------------ 1027| 2.16k| auto newn = pos.node()->inner()[0]; 1028| 2.16k| if (!mutate) ------------------ | Branch (1028:25): [True: 633, False: 1.53k] ------------------ 1029| 633| newn->inc(); 1030| 2.16k| if (Mutating) ------------------ | Branch (1030:25): [True: 2.16k, Folded] ------------------ 1031| 2.16k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 2.16k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 2.16k| } else { 1034| 1.83k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.25k, False: 577] ------------------ 1035| 1.25k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.25k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.25k| } else { 1038| 577| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 577| if (Mutating) ------------------ | Branch (1039:29): [True: 577, Folded] ------------------ 1040| 577| pos.visit(dec_visitor{}); 1041| 577| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 577| } 1043| 1.83k| } 1044| 5.29k| } 1045| 5.29k| 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.29k| } 1055| 12.3k| } _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.64k| { 1060| 1.64k| auto old_tail_size = pos.count(); 1061| 1.64k| auto new_tail_size = pos.index(last) + 1; 1062| 1.64k| auto node = pos.node(); 1063| 1.64k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.64k, Folded] | Branch (1063:42): [True: 671, False: 974] ------------------ 1064| 1.64k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 264, False: 1.38k] ------------------ 1065| 264| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 264] ------------------ 1066| 0| node->inc(); 1067| 264| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.38k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 671, False: 710] ------------------ 1069| 671| detail::destroy_n(node->leaf() + new_tail_size, 1070| 671| old_tail_size - new_tail_size); 1071| 671| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 710| } else { 1073| 710| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 710| if (Mutating) ------------------ | Branch (1074:17): [True: 710, Folded] ------------------ 1075| 710| pos.visit(dec_visitor{}); 1076| 710| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 710| } 1078| 1.64k| } _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.68k| { 992| 3.68k| auto idx = pos.index(last); 993| 3.68k| auto node = pos.node(); 994| 3.68k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.68k, Folded] | Branch (994:35): [True: 1.95k, False: 1.73k] ------------------ 995| 3.68k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.68k, Folded] | Branch (995:25): [True: 2.05k, False: 1.63k] ------------------ 996| 2.05k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 1.17k, False: 879] ------------------ 997| 2.05k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 2.05k| if (Mutating) ------------------ | Branch (998:17): [True: 2.05k, Folded] ------------------ 999| 2.05k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 2.05k| return res; 1001| 2.05k| } else { 1002| 1.63k| using std::get; 1003| 1.63k| auto subs = 1004| 1.63k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 782, False: 853] ------------------ 1005| 1.63k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.63k| auto next = get<1>(subs); 1007| 1.63k| auto ts = get<2>(subs); 1008| 1.63k| auto tail = get<3>(subs); 1009| 1.63k| IMMER_TRY { ------------------ | | 49| 1.63k|#define IMMER_TRY try ------------------ 1010| 1.63k| if (next) { ------------------ | Branch (1010:21): [True: 465, False: 1.17k] ------------------ 1011| 465| if (mutate) { ------------------ | Branch (1011:25): [True: 198, False: 267] ------------------ 1012| 198| node->inner()[idx] = next; 1013| 198| pos.each_right(dec_visitor{}, idx + 1); 1014| 198| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 267| } else { 1016| 267| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 267| newn->inner()[idx] = next; 1018| 267| if (Mutating) ------------------ | Branch (1018:29): [True: 267, Folded] ------------------ 1019| 267| pos.visit(dec_visitor{}); 1020| 267| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 267| } 1022| 1.17k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.17k] ------------------ 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.17k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.17k, Folded] | Branch (1026:40): [True: 767, False: 403] | Branch (1026:52): [True: 548, False: 219] ------------------ 1027| 548| auto newn = pos.node()->inner()[0]; 1028| 548| if (!mutate) ------------------ | Branch (1028:25): [True: 258, False: 290] ------------------ 1029| 258| newn->inc(); 1030| 548| if (Mutating) ------------------ | Branch (1030:25): [True: 548, Folded] ------------------ 1031| 548| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 548| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 622| } else { 1034| 622| if (mutate) { ------------------ | Branch (1034:25): [True: 294, False: 328] ------------------ 1035| 294| pos.each_right(dec_visitor{}, idx + 1); 1036| 294| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 328| } else { 1038| 328| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 328| if (Mutating) ------------------ | Branch (1039:29): [True: 328, Folded] ------------------ 1040| 328| pos.visit(dec_visitor{}); 1041| 328| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 328| } 1043| 622| } 1044| 1.63k| } 1045| 1.63k| 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.63k| } 1055| 3.68k| } _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| 747| { 1060| 747| auto old_tail_size = pos.count(); 1061| 747| auto new_tail_size = pos.index(last) + 1; 1062| 747| auto node = pos.node(); 1063| 747| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 747, Folded] | Branch (1063:42): [True: 228, False: 519] ------------------ 1064| 747| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 201, False: 546] ------------------ 1065| 201| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 201] ------------------ 1066| 0| node->inc(); 1067| 201| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 546| } else if (mutate) { ------------------ | Branch (1068:20): [True: 225, False: 321] ------------------ 1069| 225| detail::destroy_n(node->leaf() + new_tail_size, 1070| 225| old_tail_size - new_tail_size); 1071| 225| 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| 747| } _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| 875| { 1378| 875| auto node = pos.node(); 1379| 875| auto idx = pos.index(first); 1380| 875| auto count = pos.count(); 1381| 875| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 875| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 608, False: 267] ------------------ 1384| 875| if (mutate) { ------------------ | Branch (1384:13): [True: 608, False: 267] ------------------ 1385| 608| auto data = node->leaf(); 1386| 608| auto newcount = count - idx; 1387| 608| std::move(data + idx, data + count, data); 1388| 608| detail::destroy_n(data + newcount, idx); 1389| 608| return std::make_tuple(0, node); 1390| 608| } else { 1391| 267| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 267| if (Mutating) ------------------ | Branch (1392:17): [True: 267, Folded] ------------------ 1393| 267| pos.visit(dec_visitor{}); 1394| 267| return std::make_tuple(0, newn); 1395| 267| } 1396| 875| } _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| 49.0k| { 1247| 49.0k| auto idx = pos.subindex(first); 1248| 49.0k| auto count = pos.count(); 1249| 49.0k| auto node = pos.node(); 1250| 49.0k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 49.0k, Folded] | Branch (1250:47): [True: 41.6k, False: 7.31k] ------------------ 1251| 49.0k| auto left_size = pos.size_before(idx); 1252| 49.0k| auto child_size = pos.size_sbh(idx, left_size); 1253| 49.0k| auto dropped_size = first; 1254| 49.0k| auto child_dropped_size = dropped_size - left_size; 1255| 49.0k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 49.0k, Folded] | Branch (1255:25): [True: 46.7k, False: 2.28k] | Branch (1255:45): [True: 4.60k, False: 42.1k] ------------------ 1256| 4.60k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 1.83k, False: 2.76k] ------------------ 1257| 4.60k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 4.60k| if (mutate) ------------------ | Branch (1258:17): [True: 1.83k, False: 2.76k] ------------------ 1259| 1.83k| pos.visit(dec_left_visitor{}, idx); 1260| 2.76k| else if (Mutating) ------------------ | Branch (1260:22): [True: 2.76k, Folded] ------------------ 1261| 2.76k| pos.visit(dec_visitor{}); 1262| 4.60k| return r; 1263| 44.4k| } else { 1264| 44.4k| using std::get; 1265| 44.4k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 39.8k, False: 4.54k] ------------------ 1266| 44.4k| : node_t::make_inner_r_e(e); 1267| 44.4k| auto newr = newn->relaxed(); 1268| 44.4k| auto newcount = count - idx; 1269| 44.4k| auto new_child_size = child_size - child_dropped_size; 1270| 44.4k| IMMER_TRY { ------------------ | | 49| 44.4k|#define IMMER_TRY try ------------------ 1271| 44.4k| auto subs = 1272| 44.4k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 39.8k, False: 4.54k] ------------------ 1273| 44.4k| : pos.towards_sub_oh( 1274| 4.54k| no_collapse_no_mut_t{}, first, idx, e); 1275| 44.4k| if (mutate) ------------------ | Branch (1275:21): [True: 39.8k, False: 4.54k] ------------------ 1276| 39.8k| pos.each_left(dec_visitor{}, idx); 1277| 44.4k| pos.copy_sizes( 1278| 44.4k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 44.4k| std::copy(node->inner() + idx + 1, 1280| 44.4k| node->inner() + count, 1281| 44.4k| newn->inner() + 1); 1282| 44.4k| newn->inner()[0] = get<1>(subs); 1283| 44.4k| newr->d.sizes[0] = new_child_size; 1284| 44.4k| newr->d.count = newcount; 1285| 44.4k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 44.4k, False: 0] ------------------ 1286| 44.4k| if (!mutate) { ------------------ | Branch (1286:21): [True: 4.54k, False: 39.8k] ------------------ 1287| 4.54k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 4.54k| if (Mutating) ------------------ | Branch (1288:25): [True: 4.54k, Folded] ------------------ 1289| 4.54k| pos.visit(dec_visitor{}); 1290| 4.54k| } 1291| 44.4k| return std::make_tuple(pos.shift(), newn); 1292| 44.4k| } 1293| 44.4k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 44.4k| } 1299| 49.0k| } _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.24k| { 1247| 2.24k| auto idx = pos.subindex(first); 1248| 2.24k| auto count = pos.count(); 1249| 2.24k| auto node = pos.node(); 1250| 2.24k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.24k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.24k| auto left_size = pos.size_before(idx); 1252| 2.24k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.24k| auto dropped_size = first; 1254| 2.24k| auto child_dropped_size = dropped_size - left_size; 1255| 2.24k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.24k, Folded] | Branch (1255:25): [True: 986, False: 1.25k] | Branch (1255:45): [True: 762, False: 224] ------------------ 1256| 762| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 762] ------------------ 1257| 762| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 762| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 762] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 762| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 762] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 762| return r; 1263| 1.47k| } else { 1264| 1.47k| using std::get; 1265| 1.47k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.47k] ------------------ 1266| 1.47k| : node_t::make_inner_r_e(e); 1267| 1.47k| auto newr = newn->relaxed(); 1268| 1.47k| auto newcount = count - idx; 1269| 1.47k| auto new_child_size = child_size - child_dropped_size; 1270| 1.47k| IMMER_TRY { ------------------ | | 49| 1.47k|#define IMMER_TRY try ------------------ 1271| 1.47k| auto subs = 1272| 1.47k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.47k] ------------------ 1273| 1.47k| : pos.towards_sub_oh( 1274| 1.47k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.47k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.47k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.47k| pos.copy_sizes( 1278| 1.47k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.47k| std::copy(node->inner() + idx + 1, 1280| 1.47k| node->inner() + count, 1281| 1.47k| newn->inner() + 1); 1282| 1.47k| newn->inner()[0] = get<1>(subs); 1283| 1.47k| newr->d.sizes[0] = new_child_size; 1284| 1.47k| newr->d.count = newcount; 1285| 1.47k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.47k, False: 0] ------------------ 1286| 1.47k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.47k, False: 0] ------------------ 1287| 1.47k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.47k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.47k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.47k| } 1291| 1.47k| return std::make_tuple(pos.shift(), newn); 1292| 1.47k| } 1293| 1.47k| 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.47k| } 1299| 2.24k| } _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: 788, False: 1.24k] | Branch (1316:45): [True: 534, False: 254] ------------------ 1317| 534| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 534] ------------------ 1318| 534| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 534| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 534] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 534| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 534] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 534| return r; 1324| 1.49k| } else { 1325| 1.49k| 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.49k| auto newcount = count - idx; 1330| 1.49k| auto newn = 1331| 1.49k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.49k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.49k| : node_t::make_inner_r_e(e); 1336| 1.49k| auto newr = newn->relaxed(); 1337| 1.49k| IMMER_TRY { ------------------ | | 49| 1.49k|#define IMMER_TRY try ------------------ 1338| 1.49k| auto subs = 1339| 1.49k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.49k] ------------------ 1340| 1.49k| : pos.towards_sub_oh( 1341| 1.49k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.49k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.49k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.49k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.49k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.49k, False: 0] ------------------ 1346| 1.49k| pos.copy_sizes( 1347| 1.49k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.49k| newr->d.count = newcount; 1349| 1.49k| newn->inner()[0] = get<1>(subs); 1350| 1.49k| std::copy(node->inner() + idx + 1, 1351| 1.49k| node->inner() + count, 1352| 1.49k| newn->inner() + 1); 1353| 1.49k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.49k, False: 0] ------------------ 1354| 1.49k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.49k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.49k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.49k| } 1358| 1.49k| return std::make_tuple(pos.shift(), newn); 1359| 1.49k| } 1360| 1.49k| 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.49k| } 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| 629| { 1304| 629| auto idx = pos.subindex(first); 1305| 629| auto count = pos.count(); 1306| 629| auto node = pos.node(); 1307| 629| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 629] ------------------ 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| 629| auto left_size = pos.size_before(idx); 1313| 629| auto child_size = pos.size_sbh(idx, left_size); 1314| 629| auto dropped_size = first; 1315| 629| auto child_dropped_size = dropped_size - left_size; 1316| 629| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 629, Folded] | Branch (1316:25): [True: 198, False: 431] | Branch (1316:45): [True: 0, False: 198] ------------------ 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| 629| } else { 1325| 629| 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| 629| auto newcount = count - idx; 1330| 629| auto newn = 1331| 629| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 629] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 629| : node_t::make_inner_r_e(e); 1336| 629| auto newr = newn->relaxed(); 1337| 629| IMMER_TRY { ------------------ | | 49| 629|#define IMMER_TRY try ------------------ 1338| 629| auto subs = 1339| 629| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 629] ------------------ 1340| 629| : pos.towards_sub_oh( 1341| 629| no_collapse_no_mut_t{}, first, idx, e); 1342| 629| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 629] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 629| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 629| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 629, False: 0] ------------------ 1346| 629| pos.copy_sizes( 1347| 629| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 629| newr->d.count = newcount; 1349| 629| newn->inner()[0] = get<1>(subs); 1350| 629| std::copy(node->inner() + idx + 1, 1351| 629| node->inner() + count, 1352| 629| newn->inner() + 1); 1353| 629| if (!mutate) { ------------------ | Branch (1353:21): [True: 629, False: 0] ------------------ 1354| 629| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 629| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 629] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 629| } 1358| 629| return std::make_tuple(pos.shift(), newn); 1359| 629| } 1360| 629| 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| 629| } 1373| 629| } _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| 6.68k| { 1378| 6.68k| auto node = pos.node(); 1379| 6.68k| auto idx = pos.index(first); 1380| 6.68k| auto count = pos.count(); 1381| 6.68k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 6.68k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 6.68k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 6.68k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 6.68k| } else { 1391| 6.68k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 6.68k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 6.68k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 6.68k| return std::make_tuple(0, newn); 1395| 6.68k| } 1396| 6.68k| } _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.49k| { 1304| 1.49k| auto idx = pos.subindex(first); 1305| 1.49k| auto count = pos.count(); 1306| 1.49k| auto node = pos.node(); 1307| 1.49k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.49k] ------------------ 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.49k| auto left_size = pos.size_before(idx); 1313| 1.49k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.49k| auto dropped_size = first; 1315| 1.49k| auto child_dropped_size = dropped_size - left_size; 1316| 1.49k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.49k] | 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.49k| } else { 1325| 1.49k| 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.49k| auto newcount = count - idx; 1330| 1.49k| auto newn = 1331| 1.49k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.49k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.49k| : node_t::make_inner_r_e(e); 1336| 1.49k| auto newr = newn->relaxed(); 1337| 1.49k| IMMER_TRY { ------------------ | | 49| 1.49k|#define IMMER_TRY try ------------------ 1338| 1.49k| auto subs = 1339| 1.49k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.49k] ------------------ 1340| 1.49k| : pos.towards_sub_oh( 1341| 1.49k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.49k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.49k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.49k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.49k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.49k, False: 0] ------------------ 1346| 1.49k| pos.copy_sizes( 1347| 1.49k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.49k| newr->d.count = newcount; 1349| 1.49k| newn->inner()[0] = get<1>(subs); 1350| 1.49k| std::copy(node->inner() + idx + 1, 1351| 1.49k| node->inner() + count, 1352| 1.49k| newn->inner() + 1); 1353| 1.49k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.49k, False: 0] ------------------ 1354| 1.49k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.49k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.49k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.49k| } 1358| 1.49k| return std::make_tuple(pos.shift(), newn); 1359| 1.49k| } 1360| 1.49k| 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.49k| } 1373| 1.49k| } _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.09k| { 1378| 4.09k| auto node = pos.node(); 1379| 4.09k| auto idx = pos.index(first); 1380| 4.09k| auto count = pos.count(); 1381| 4.09k| 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.09k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 1.72k, False: 2.37k] ------------------ 1384| 4.09k| if (mutate) { ------------------ | Branch (1384:13): [True: 1.72k, False: 2.37k] ------------------ 1385| 1.72k| auto data = node->leaf(); 1386| 1.72k| auto newcount = count - idx; 1387| 1.72k| std::move(data + idx, data + count, data); 1388| 1.72k| detail::destroy_n(data + newcount, idx); 1389| 1.72k| return std::make_tuple(0, node); 1390| 2.37k| } else { 1391| 2.37k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.37k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.37k, Folded] ------------------ 1393| 2.37k| pos.visit(dec_visitor{}); 1394| 2.37k| return std::make_tuple(0, newn); 1395| 2.37k| } 1396| 4.09k| } _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.31k| { 1304| 1.31k| auto idx = pos.subindex(first); 1305| 1.31k| auto count = pos.count(); 1306| 1.31k| auto node = pos.node(); 1307| 1.31k| 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.31k| auto left_size = pos.size_before(idx); 1313| 1.31k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.31k| auto dropped_size = first; 1315| 1.31k| auto child_dropped_size = dropped_size - left_size; 1316| 1.31k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.31k] | 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.31k| } else { 1325| 1.31k| 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.31k| auto newcount = count - idx; 1330| 1.31k| auto newn = 1331| 1.31k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.31k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.31k| : node_t::make_inner_r_e(e); 1336| 1.31k| auto newr = newn->relaxed(); 1337| 1.31k| IMMER_TRY { ------------------ | | 49| 1.31k|#define IMMER_TRY try ------------------ 1338| 1.31k| auto subs = 1339| 1.31k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.31k] ------------------ 1340| 1.31k| : pos.towards_sub_oh( 1341| 1.31k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.31k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.31k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.31k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.31k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.31k, False: 0] ------------------ 1346| 1.31k| pos.copy_sizes( 1347| 1.31k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.31k| newr->d.count = newcount; 1349| 1.31k| newn->inner()[0] = get<1>(subs); 1350| 1.31k| std::copy(node->inner() + idx + 1, 1351| 1.31k| node->inner() + count, 1352| 1.31k| newn->inner() + 1); 1353| 1.31k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.31k, False: 0] ------------------ 1354| 1.31k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.31k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.31k, Folded] ------------------ 1356| 1.31k| pos.visit(dec_visitor{}); 1357| 1.31k| } 1358| 1.31k| return std::make_tuple(pos.shift(), newn); 1359| 1.31k| } 1360| 1.31k| 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.31k| } 1373| 1.31k| } _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| 38.8k| { 1378| 38.8k| auto node = pos.node(); 1379| 38.8k| auto idx = pos.index(first); 1380| 38.8k| auto count = pos.count(); 1381| 38.8k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 38.8k] ------------------ 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| 38.8k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 38.8k] ------------------ 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| 38.8k| } else { 1391| 38.8k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 38.8k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 38.8k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 38.8k| return std::make_tuple(0, newn); 1395| 38.8k| } 1396| 38.8k| } _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| 1.64k| { 1304| 1.64k| auto idx = pos.subindex(first); 1305| 1.64k| auto count = pos.count(); 1306| 1.64k| auto node = pos.node(); 1307| 1.64k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.64k] ------------------ 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.64k| auto left_size = pos.size_before(idx); 1313| 1.64k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.64k| auto dropped_size = first; 1315| 1.64k| auto child_dropped_size = dropped_size - left_size; 1316| 1.64k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.64k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 1.64k| } else { 1325| 1.64k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.64k| auto newcount = count - idx; 1330| 1.64k| auto newn = 1331| 1.64k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.64k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.64k| : node_t::make_inner_r_e(e); 1336| 1.64k| auto newr = newn->relaxed(); 1337| 1.64k| IMMER_TRY { ------------------ | | 49| 1.64k|#define IMMER_TRY try ------------------ 1338| 1.64k| auto subs = 1339| 1.64k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.64k] ------------------ 1340| 1.64k| : pos.towards_sub_oh( 1341| 1.64k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.64k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.64k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.64k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.64k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.64k, False: 0] ------------------ 1346| 1.64k| pos.copy_sizes( 1347| 1.64k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.64k| newr->d.count = newcount; 1349| 1.64k| newn->inner()[0] = get<1>(subs); 1350| 1.64k| std::copy(node->inner() + idx + 1, 1351| 1.64k| node->inner() + count, 1352| 1.64k| newn->inner() + 1); 1353| 1.64k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.64k, False: 0] ------------------ 1354| 1.64k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.64k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.64k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.64k| } 1358| 1.64k| return std::make_tuple(pos.shift(), newn); 1359| 1.64k| } 1360| 1.64k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.64k| } 1373| 1.64k| } _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.83k| { 1199| 1.83k| using node_t = node_type; 1200| 1.83k| auto node = p.node(); 1201| 1.83k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 1.83k, False: 0] ------------------ 1202| 1.83k| p.each_left(dec_t{}, idx); 1203| 1.83k| node_t::delete_inner_r(node, p.count()); 1204| 1.83k| } 1205| 1.83k| } _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| 158k| { 1247| 158k| auto idx = pos.subindex(first); 1248| 158k| auto count = pos.count(); 1249| 158k| auto node = pos.node(); 1250| 158k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 158k, Folded] | Branch (1250:47): [True: 124k, False: 34.4k] ------------------ 1251| 158k| auto left_size = pos.size_before(idx); 1252| 158k| auto child_size = pos.size_sbh(idx, left_size); 1253| 158k| auto dropped_size = first; 1254| 158k| auto child_dropped_size = dropped_size - left_size; 1255| 158k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 158k] | 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| 158k| } else { 1264| 158k| using std::get; 1265| 158k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 124k, False: 34.4k] ------------------ 1266| 158k| : node_t::make_inner_r_e(e); 1267| 158k| auto newr = newn->relaxed(); 1268| 158k| auto newcount = count - idx; 1269| 158k| auto new_child_size = child_size - child_dropped_size; 1270| 158k| IMMER_TRY { ------------------ | | 49| 158k|#define IMMER_TRY try ------------------ 1271| 158k| auto subs = 1272| 158k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 124k, False: 34.4k] ------------------ 1273| 158k| : pos.towards_sub_oh( 1274| 34.4k| no_collapse_no_mut_t{}, first, idx, e); 1275| 158k| if (mutate) ------------------ | Branch (1275:21): [True: 124k, False: 34.4k] ------------------ 1276| 124k| pos.each_left(dec_visitor{}, idx); 1277| 158k| pos.copy_sizes( 1278| 158k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 158k| std::copy(node->inner() + idx + 1, 1280| 158k| node->inner() + count, 1281| 158k| newn->inner() + 1); 1282| 158k| newn->inner()[0] = get<1>(subs); 1283| 158k| newr->d.sizes[0] = new_child_size; 1284| 158k| newr->d.count = newcount; 1285| 158k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 158k, False: 0] ------------------ 1286| 158k| if (!mutate) { ------------------ | Branch (1286:21): [True: 34.4k, False: 124k] ------------------ 1287| 34.4k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 34.4k| if (Mutating) ------------------ | Branch (1288:25): [True: 34.4k, Folded] ------------------ 1289| 34.4k| pos.visit(dec_visitor{}); 1290| 34.4k| } 1291| 158k| return std::make_tuple(pos.shift(), newn); 1292| 158k| } 1293| 158k| 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| 158k| } 1299| 158k| } _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| 42.9k| { 1247| 42.9k| auto idx = pos.subindex(first); 1248| 42.9k| auto count = pos.count(); 1249| 42.9k| auto node = pos.node(); 1250| 42.9k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 42.9k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 42.9k| auto left_size = pos.size_before(idx); 1252| 42.9k| auto child_size = pos.size_sbh(idx, left_size); 1253| 42.9k| auto dropped_size = first; 1254| 42.9k| auto child_dropped_size = dropped_size - left_size; 1255| 42.9k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 42.9k] | 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| 42.9k| } else { 1264| 42.9k| using std::get; 1265| 42.9k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 42.9k] ------------------ 1266| 42.9k| : node_t::make_inner_r_e(e); 1267| 42.9k| auto newr = newn->relaxed(); 1268| 42.9k| auto newcount = count - idx; 1269| 42.9k| auto new_child_size = child_size - child_dropped_size; 1270| 42.9k| IMMER_TRY { ------------------ | | 49| 42.9k|#define IMMER_TRY try ------------------ 1271| 42.9k| auto subs = 1272| 42.9k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 42.9k] ------------------ 1273| 42.9k| : pos.towards_sub_oh( 1274| 42.9k| no_collapse_no_mut_t{}, first, idx, e); 1275| 42.9k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 42.9k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 42.9k| pos.copy_sizes( 1278| 42.9k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 42.9k| std::copy(node->inner() + idx + 1, 1280| 42.9k| node->inner() + count, 1281| 42.9k| newn->inner() + 1); 1282| 42.9k| newn->inner()[0] = get<1>(subs); 1283| 42.9k| newr->d.sizes[0] = new_child_size; 1284| 42.9k| newr->d.count = newcount; 1285| 42.9k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 42.9k, False: 0] ------------------ 1286| 42.9k| if (!mutate) { ------------------ | Branch (1286:21): [True: 42.9k, False: 0] ------------------ 1287| 42.9k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 42.9k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 42.9k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 42.9k| } 1291| 42.9k| return std::make_tuple(pos.shift(), newn); 1292| 42.9k| } 1293| 42.9k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 42.9k| } 1299| 42.9k| } _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.43k| { 1304| 2.43k| auto idx = pos.subindex(first); 1305| 2.43k| auto count = pos.count(); 1306| 2.43k| auto node = pos.node(); 1307| 2.43k| 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.43k| auto left_size = pos.size_before(idx); 1313| 2.43k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.43k| auto dropped_size = first; 1315| 2.43k| auto child_dropped_size = dropped_size - left_size; 1316| 2.43k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.43k, Folded] | Branch (1316:25): [True: 1.47k, False: 963] | Branch (1316:45): [True: 838, False: 635] ------------------ 1317| 838| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 838] ------------------ 1318| 838| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 838| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 838] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 838| else if (Mutating) ------------------ | Branch (1321:22): [True: 838, Folded] ------------------ 1322| 838| pos.visit(dec_visitor{}); 1323| 838| return r; 1324| 1.59k| } else { 1325| 1.59k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.59k| auto newcount = count - idx; 1330| 1.59k| auto newn = 1331| 1.59k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.59k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.59k| : node_t::make_inner_r_e(e); 1336| 1.59k| auto newr = newn->relaxed(); 1337| 1.59k| IMMER_TRY { ------------------ | | 49| 1.59k|#define IMMER_TRY try ------------------ 1338| 1.59k| auto subs = 1339| 1.59k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.59k] ------------------ 1340| 1.59k| : pos.towards_sub_oh( 1341| 1.59k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.59k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.59k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.59k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.59k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.59k, False: 0] ------------------ 1346| 1.59k| pos.copy_sizes( 1347| 1.59k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.59k| newr->d.count = newcount; 1349| 1.59k| newn->inner()[0] = get<1>(subs); 1350| 1.59k| std::copy(node->inner() + idx + 1, 1351| 1.59k| node->inner() + count, 1352| 1.59k| newn->inner() + 1); 1353| 1.59k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.59k, False: 0] ------------------ 1354| 1.59k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.59k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.59k, Folded] ------------------ 1356| 1.59k| pos.visit(dec_visitor{}); 1357| 1.59k| } 1358| 1.59k| return std::make_tuple(pos.shift(), newn); 1359| 1.59k| } 1360| 1.59k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.59k| } 1373| 2.43k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 12.5k| { 350| 12.5k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 12.5k, False: 0] ------------------ 351| 12.5k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 11.4k, False: 1.08k] ------------------ 352| 12.5k| ? visit_maybe_relaxed_sub(rootl, 353| 11.4k| shiftl, 354| 11.4k| sizel, 355| 11.4k| this_t{}, 356| 11.4k| posr, 357| 11.4k| first, 358| 11.4k| size_t{}) 359| 12.5k| : posr.first_sub_inner( 360| 1.08k| rrb{}, first, rootl, shiftl, sizel); 361| 12.5k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 32.6k| { 383| 32.6k| auto nl = posl.node(); 384| 32.6k| auto nr = posr.node(); 385| 32.6k| if (nl == nr) ------------------ | Branch (385:13): [True: 11.1k, False: 21.4k] ------------------ 386| 11.1k| return true; 387| 21.4k| auto cl = posl.count(); 388| 21.4k| auto cr = posr.count(); 389| 21.4k| assert(cr > 0); ------------------ | Branch (389:9): [True: 21.4k, False: 0] ------------------ 390| 21.4k| auto sbr = size_t{}; 391| 21.4k| auto i = count_t{}; 392| 21.4k| auto j = count_t{}; 393| 120k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 107k, False: 13.2k] ------------------ 394| 107k| auto sbl = posl.size_before(i); 395| 191k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 171k, False: 19.9k] | Branch (395:34): [True: 84.0k, False: 87.3k] ------------------ 396| 84.0k| ; 397| 107k| auto res = 398| 107k| sbl == sbr ------------------ | Branch (398:17): [True: 51.7k, False: 55.5k] ------------------ 399| 107k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 107k| : posl.nth_sub(i, 401| 55.5k| for_each_chunk_p_visitor{}, 402| 55.5k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 107k| if (!res) ------------------ | Branch (403:17): [True: 8.24k, False: 99.0k] ------------------ 404| 8.24k| return false; 405| 107k| } 406| 13.2k| return true; 407| 21.4k| } _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| 24.8k| { 337| 24.8k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 24.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| 25.4k| { 428| 25.4k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 16.1k, False: 9.35k] ------------------ 429| 16.1k| return true; 430| 9.35k| auto cl = posl.count(); 431| 9.35k| auto cr = posr.count(); 432| 9.35k| auto mp = std::min(cl, cr); 433| 9.35k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 7.97k, False: 1.38k] ------------------ 434| 9.35k| posl.node()->leaf() + mp, 435| 9.35k| posr.node()->leaf()) && 436| 7.97k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 7.51k, False: 456] ------------------ 437| 7.97k| posl.node()->leaf() + posl.count(), 438| 7.97k| first + (idx + mp)); 439| 25.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| 24.0k| { 330| 24.0k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 24.0k| } _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.28k| { 413| 4.28k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.28k| } _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.28k| { 383| 4.28k| auto nl = posl.node(); 384| 4.28k| auto nr = posr.node(); 385| 4.28k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.28k] ------------------ 386| 0| return true; 387| 4.28k| auto cl = posl.count(); 388| 4.28k| auto cr = posr.count(); 389| 4.28k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.28k, False: 0] ------------------ 390| 4.28k| auto sbr = size_t{}; 391| 4.28k| auto i = count_t{}; 392| 4.28k| auto j = count_t{}; 393| 14.8k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 12.9k, False: 1.93k] ------------------ 394| 12.9k| auto sbl = posl.size_before(i); 395| 21.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 18.0k, False: 3.64k] | Branch (395:34): [True: 8.77k, False: 9.30k] ------------------ 396| 8.77k| ; 397| 12.9k| auto res = 398| 12.9k| sbl == sbr ------------------ | Branch (398:17): [True: 8.08k, False: 4.87k] ------------------ 399| 12.9k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 12.9k| : posl.nth_sub(i, 401| 4.87k| for_each_chunk_p_visitor{}, 402| 4.87k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 12.9k| if (!res) ------------------ | Branch (403:17): [True: 2.34k, False: 10.6k] ------------------ 404| 2.34k| return false; 405| 12.9k| } 406| 1.93k| return true; 407| 4.28k| } _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.07k| { 337| 5.07k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 5.07k| } _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.5k| { 428| 11.5k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 7.87k, False: 3.66k] ------------------ 429| 7.87k| return true; 430| 3.66k| auto cl = posl.count(); 431| 3.66k| auto cr = posr.count(); 432| 3.66k| auto mp = std::min(cl, cr); 433| 3.66k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 3.38k, False: 283] ------------------ 434| 3.66k| posl.node()->leaf() + mp, 435| 3.66k| posr.node()->leaf()) && 436| 3.38k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 3.02k, False: 363] ------------------ 437| 3.38k| posl.node()->leaf() + posl.count(), 438| 3.38k| first + (idx + mp)); 439| 11.5k| } _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.10k| { 330| 2.10k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.10k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIX12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 412| 2.23k| { 413| 2.23k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.23k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 2.23k| { 383| 2.23k| auto nl = posl.node(); 384| 2.23k| auto nr = posr.node(); 385| 2.23k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.23k] ------------------ 386| 0| return true; 387| 2.23k| auto cl = posl.count(); 388| 2.23k| auto cr = posr.count(); 389| 2.23k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.23k, False: 0] ------------------ 390| 2.23k| auto sbr = size_t{}; 391| 2.23k| auto i = count_t{}; 392| 2.23k| auto j = count_t{}; 393| 15.7k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 14.2k, False: 1.48k] ------------------ 394| 14.2k| auto sbl = posl.size_before(i); 395| 25.1k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 21.4k, False: 3.60k] | Branch (395:34): [True: 10.8k, False: 10.6k] ------------------ 396| 10.8k| ; 397| 14.2k| auto res = 398| 14.2k| sbl == sbr ------------------ | Branch (398:17): [True: 8.43k, False: 5.82k] ------------------ 399| 14.2k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 14.2k| : posl.nth_sub(i, 401| 5.82k| for_each_chunk_p_visitor{}, 402| 5.82k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 14.2k| if (!res) ------------------ | Branch (403:17): [True: 754, False: 13.5k] ------------------ 404| 754| return false; 405| 14.2k| } 406| 1.48k| return true; 407| 2.23k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 7.15k| { 337| 7.15k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 7.15k| } _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| 452| { 330| 452| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 452| } _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| 825| { 330| 825| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 825| } _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.72k| { 420| 1.72k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.72k, False: 0] ------------------ 421| 1.72k| ? this_t::visit_regular(posl, posr.node()) 422| 1.72k| : this_t::visit_regular(posr, posl.node()); 423| 1.72k| } _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.91k, False: 3.57k] | Branch (445:33): [True: 2.10k, False: 1.47k] ------------------ 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.2k| { 451| 24.2k| auto node = pos.node(); 452| 24.2k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 18.7k, False: 5.43k] | Branch (452:33): [True: 3.15k, False: 2.28k] ------------------ 453| 5.43k| node->leaf() + pos.count(), 454| 5.43k| other->leaf()); 455| 24.2k| } _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| 10.3k| { 444| 10.3k| auto node = pos.node(); 445| 10.3k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 4.98k, False: 5.31k] | Branch (445:33): [True: 2.33k, False: 2.98k] ------------------ 446| 10.3k| } _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.13k| { 451| 3.13k| auto node = pos.node(); 452| 3.13k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.50k, False: 1.63k] | Branch (452:33): [True: 547, False: 1.08k] ------------------ 453| 1.63k| node->leaf() + pos.count(), 454| 1.63k| other->leaf()); 455| 3.13k| } _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.22k| { 444| 3.22k| auto node = pos.node(); 445| 3.22k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 285, False: 2.94k] | Branch (445:33): [True: 1.52k, False: 1.41k] ------------------ 446| 3.22k| } _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| 181k| { 113| 181k| auto data = as_const(pos.node()->leaf()); 114| 181k| return fn(data, data + pos.count()); 115| 181k| } _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.21M| return [iter](auto f, auto e) mutable { 368| 1.21M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 74.9k, False: 1.13M] ------------------ 369| 74.9k| iter += e - f; 370| 74.9k| return true; 371| 74.9k| } 372| 9.55M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 8.42M, False: 1.13M] ------------------ 373| 8.42M| if (*f != *iter) ------------------ | Branch (373:21): [True: 4.62k, False: 8.41M] ------------------ 374| 4.62k| return false; 375| 1.13M| return true; 376| 1.13M| }; _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.80M| { 54| 4.80M| return pos.towards(this_t{}, idx); 55| 4.80M| } _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| 1.06M| { 60| 1.06M| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 1.06M| } _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| 211k| { 54| 211k| return pos.towards(this_t{}, idx); 55| 211k| } _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| 194k| { 60| 194k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 194k| } _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.8k| { 54| 26.8k| return pos.towards(this_t{}, idx); 55| 26.8k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 15.4k| { 107| 15.4k| return pos.each_pred(this_t{}, fn); 108| 15.4k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 897| { 330| 897| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 897| } _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| 8.69k| { 420| 8.69k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 8.69k, False: 0] ------------------ 421| 8.69k| ? this_t::visit_regular(posl, posr.node()) 422| 8.69k| : this_t::visit_regular(posr, posl.node()); 423| 8.69k| } _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| 1.01M| { 113| 1.01M| auto data = as_const(pos.node()->leaf()); 114| 1.01M| return fn(data, data + pos.count()); 115| 1.01M| } _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| 13.1k| { 107| 13.1k| return pos.each_pred(this_t{}, fn); 108| 13.1k| } _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.2k| { 113| 11.2k| auto data = as_const(pos.node()->leaf()); 114| 11.2k| return fn(data, data + pos.count()); 115| 11.2k| } _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.32k| { 107| 3.32k| return pos.each_pred(this_t{}, fn); 108| 3.32k| } _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| 3.51k| { 330| 3.51k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 3.51k| } _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.42k| { 383| 3.42k| auto nl = posl.node(); 384| 3.42k| auto nr = posr.node(); 385| 3.42k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 3.42k] ------------------ 386| 0| return true; 387| 3.42k| auto cl = posl.count(); 388| 3.42k| auto cr = posr.count(); 389| 3.42k| assert(cr > 0); ------------------ | Branch (389:9): [True: 3.42k, False: 0] ------------------ 390| 3.42k| auto sbr = size_t{}; 391| 3.42k| auto i = count_t{}; 392| 3.42k| auto j = count_t{}; 393| 14.0k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 12.4k, False: 1.66k] ------------------ 394| 12.4k| auto sbl = posl.size_before(i); 395| 19.9k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 17.0k, False: 2.94k] | Branch (395:34): [True: 7.54k, False: 9.47k] ------------------ 396| 7.54k| ; 397| 12.4k| auto res = 398| 12.4k| sbl == sbr ------------------ | Branch (398:17): [True: 7.22k, False: 5.19k] ------------------ 399| 12.4k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 12.4k| : posl.nth_sub(i, 401| 5.19k| for_each_chunk_p_visitor{}, 402| 5.19k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 12.4k| if (!res) ------------------ | Branch (403:17): [True: 1.76k, False: 10.6k] ------------------ 404| 1.76k| return false; 405| 12.4k| } 406| 1.66k| return true; 407| 3.42k| } _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| 9.30k| { 337| 9.30k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 9.30k| } _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| 9.30k| { 428| 9.30k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 6.59k, False: 2.71k] ------------------ 429| 6.59k| return true; 430| 2.71k| auto cl = posl.count(); 431| 2.71k| auto cr = posr.count(); 432| 2.71k| auto mp = std::min(cl, cr); 433| 2.71k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 2.38k, False: 326] ------------------ 434| 2.71k| posl.node()->leaf() + mp, 435| 2.71k| posr.node()->leaf()) && 436| 2.38k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.38k, False: 0] ------------------ 437| 2.38k| posl.node()->leaf() + posl.count(), 438| 2.38k| first + (idx + mp)); 439| 9.30k| } _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.02k| { 330| 3.02k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 3.02k| } _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.41k| { 383| 1.41k| auto nl = posl.node(); 384| 1.41k| auto nr = posr.node(); 385| 1.41k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.41k] ------------------ 386| 0| return true; 387| 1.41k| auto cl = posl.count(); 388| 1.41k| auto cr = posr.count(); 389| 1.41k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.41k, False: 0] ------------------ 390| 1.41k| auto sbr = size_t{}; 391| 1.41k| auto i = count_t{}; 392| 1.41k| auto j = count_t{}; 393| 10.6k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 9.70k, False: 993] ------------------ 394| 9.70k| auto sbl = posl.size_before(i); 395| 17.6k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 16.8k, False: 717] | Branch (395:34): [True: 7.90k, False: 8.98k] ------------------ 396| 7.90k| ; 397| 9.70k| auto res = 398| 9.70k| sbl == sbr ------------------ | Branch (398:17): [True: 5.68k, False: 4.01k] ------------------ 399| 9.70k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 9.70k| : posl.nth_sub(i, 401| 4.01k| for_each_chunk_p_visitor{}, 402| 4.01k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 9.70k| if (!res) ------------------ | Branch (403:17): [True: 425, False: 9.27k] ------------------ 404| 425| return false; 405| 9.70k| } 406| 993| return true; 407| 1.41k| } _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| 1.60k| { 420| 1.60k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.60k, False: 0] ------------------ 421| 1.60k| ? this_t::visit_regular(posl, posr.node()) 422| 1.60k| : this_t::visit_regular(posr, posl.node()); 423| 1.60k| } _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| 154k| { 107| 154k| return pos.each_pred(this_t{}, fn); 108| 154k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 366| 75.4k| { 367| 75.4k| return [iter](auto f, auto e) mutable { 368| 75.4k| if (f == &*iter) { 369| 75.4k| iter += e - f; 370| 75.4k| return true; 371| 75.4k| } 372| 75.4k| for (; f != e; ++f, ++iter) 373| 75.4k| if (*f != *iter) 374| 75.4k| return false; 375| 75.4k| return true; 376| 75.4k| }; 377| 75.4k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 1.34k| { 350| 1.34k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 1.34k, False: 0] ------------------ 351| 1.34k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 1.08k, False: 261] ------------------ 352| 1.34k| ? visit_maybe_relaxed_sub(rootl, 353| 1.08k| shiftl, 354| 1.08k| sizel, 355| 1.08k| this_t{}, 356| 1.08k| posr, 357| 1.08k| first, 358| 1.08k| size_t{}) 359| 1.34k| : posr.first_sub_inner( 360| 261| rrb{}, first, rootl, shiftl, sizel); 361| 1.34k| } _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.61k| { 350| 8.61k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 8.61k, False: 0] ------------------ 351| 8.61k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 8.61k, False: 0] ------------------ 352| 8.61k| ? visit_maybe_relaxed_sub(rootl, 353| 8.61k| shiftl, 354| 8.61k| sizel, 355| 8.61k| this_t{}, 356| 8.61k| posr, 357| 8.61k| first, 358| 8.61k| size_t{}) 359| 8.61k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 8.61k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 6.74k| { 451| 6.74k| auto node = pos.node(); 452| 6.74k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.75k, False: 4.99k] | Branch (452:33): [True: 2.17k, False: 2.82k] ------------------ 453| 4.99k| node->leaf() + pos.count(), 454| 4.99k| other->leaf()); 455| 6.74k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_11dec_visitorEJEEEDcPT_jmT0_DpOT1_: 1838| 165M|{ 1839| 165M| assert(node); ------------------ | Branch (1839:5): [True: 165M, False: 0] ------------------ 1840| 165M| auto relaxed = node->relaxed(); 1841| 165M| if (relaxed) { ------------------ | Branch (1841:9): [True: 152M, False: 13.4M] ------------------ 1842| 152M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 152M, False: 0] ------------------ 1843| 152M| return make_relaxed_pos(node, shift, relaxed) 1844| 152M| .visit(v, std::forward(args)...); 1845| 152M| } else { 1846| 13.4M| return make_regular_sub_pos(node, shift, size) 1847| 13.4M| .visit(v, std::forward(args)...); 1848| 13.4M| } 1849| 165M|} _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| 426M|{ 1829| 426M| assert(node); ------------------ | Branch (1829:5): [True: 426M, False: 0] ------------------ 1830| 426M| assert(relaxed); ------------------ | Branch (1830:5): [True: 426M, False: 0] ------------------ 1831| 426M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 426M, False: 0] ------------------ 1832| 426M| return {node, shift, relaxed}; 1833| 426M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 173M| { 1814| 173M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 173M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1431| 288M| 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| 34.5M| { 1477| 34.5M| each_left(v, relaxed_->d.count, args...); 1478| 34.5M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 34.6M| { 1624| 34.6M| auto p = node_->inner(); 1625| 34.6M| auto s = size_t{}; 1626| 34.6M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 7.77M, False: 26.9M] ------------------ 1627| 63.5M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 55.7M, False: 7.77M] ------------------ 1628| 55.7M| IMMER_PREFETCH(p + i + 1); 1629| 55.7M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 55.7M| .visit(v, args...); 1631| 55.7M| s = relaxed_->d.sizes[i]; 1632| 55.7M| assert(s); ------------------ | Branch (1632:17): [True: 55.7M, False: 0] ------------------ 1633| 55.7M| } 1634| 26.9M| } else { 1635| 26.9M| auto ss = shift_ - B; 1636| 190M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 163M, False: 26.9M] ------------------ 1637| 163M| visit_maybe_relaxed_sub( 1638| 163M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 163M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 163M, False: 0] ------------------ 1641| 163M| } 1642| 26.9M| } 1643| 34.6M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1430| 262M| count_t count() const { return relaxed_->d.count; } _ZN5immer6detail4rbts20make_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_15regular_sub_posIT_EEPSE_jm: 1044| 24.5M|{ 1045| 24.5M| assert(node); ------------------ | Branch (1045:5): [True: 24.5M, False: 0] ------------------ 1046| 24.5M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 24.5M, False: 0] ------------------ 1047| 24.5M| assert(size > 0); ------------------ | Branch (1047:5): [True: 24.5M, False: 0] ------------------ 1048| 24.5M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 24.5M, False: 0] ------------------ 1049| 24.5M| return {node, shift, size}; 1050| 24.5M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1036| 13.4M| { 1037| 13.4M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 13.4M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 785| 24.3M| node_t* node() const { return node_; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 825| 410k| { 826| 410k| return each_regular(*this, v, args...); 827| 410k| } _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| 410k|{ 344| 410k| constexpr auto B = bits; 345| 410k| constexpr auto BL = bits_leaf; 346| 410k| auto n = p.node()->inner(); 347| 410k| auto last = p.count() - 1; 348| 410k| auto e = n + last; 349| 410k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 101k, False: 309k] ------------------ 350| 230k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 129k, False: 101k] ------------------ 351| 129k| IMMER_PREFETCH(n + 1); 352| 129k| make_full_leaf_pos(*n).visit(v, args...); 353| 129k| } 354| 101k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 309k| } else { 356| 309k| auto ss = p.shift() - B; 357| 1.13M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 822k, False: 309k] ------------------ 358| 822k| make_full_pos(*n, ss).visit(v, args...); 359| 309k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 309k| } 361| 410k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 787| 9.52M| 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| 14.7M|{ 215| 14.7M| assert(node); ------------------ | Branch (215:5): [True: 14.7M, False: 0] ------------------ 216| 14.7M| return {node}; 217| 14.7M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 1.58M| { 208| 1.58M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.58M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 199| 8.65M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 198| 13.6M| count_t count() const { return branches; } _ZN5immer6detail4rbts13make_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_8leaf_posIT_EEPSE_m: 119| 1.54M|{ 120| 1.54M| assert(node); ------------------ | Branch (120:5): [True: 1.54M, False: 0] ------------------ 121| 1.54M| assert(size > 0); ------------------ | Branch (121:5): [True: 1.54M, False: 0] ------------------ 122| 1.54M| return {node, size}; 123| 1.54M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 786| 7.27M| 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| 378k| { 113| 378k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 378k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 104| 1.54M| 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.29M| 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.37M| 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.04M|{ 1413| 4.04M| assert(node); ------------------ | Branch (1413:5): [True: 4.04M, False: 0] ------------------ 1414| 4.04M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 4.04M, False: 0] ------------------ 1415| 4.04M| return {node, shift}; 1416| 4.04M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 2.56M| { 1406| 2.56M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.56M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1159| 3.20M| 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| 93.3k| { 1186| 93.3k| auto p = node_->inner(); 1187| 93.3k| auto e = p + branches; 1188| 93.3k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 81.2k, False: 12.0k] ------------------ 1189| 731k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 650k, False: 81.2k] ------------------ 1190| 650k| IMMER_PREFETCH(p + 1); 1191| 650k| make_full_leaf_pos(*p).visit(v, args...); 1192| 650k| } 1193| 81.2k| } else { 1194| 12.0k| auto ss = shift_ - B; 1195| 108k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 96.6k, False: 12.0k] ------------------ 1196| 96.6k| make_full_pos(*p, ss).visit(v, args...); 1197| 12.0k| } 1198| 93.3k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1158| 1.30M| 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.73M|{ 691| 2.73M| assert(node); ------------------ | Branch (691:5): [True: 2.73M, False: 0] ------------------ 692| 2.73M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 2.73M, False: 0] ------------------ 693| 2.73M| assert(size > 0); ------------------ | Branch (693:5): [True: 2.73M, False: 0] ------------------ 694| 2.73M| return {node, shift, size}; 695| 2.73M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 842k| { 337| 842k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 842k| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 231| 4.77M| 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| 796k| { 244| 796k| return each_regular(*this, v, args...); 245| 796k| } _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| 796k|{ 344| 796k| constexpr auto B = bits; 345| 796k| constexpr auto BL = bits_leaf; 346| 796k| auto n = p.node()->inner(); 347| 796k| auto last = p.count() - 1; 348| 796k| auto e = n + last; 349| 796k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 272k, False: 524k] ------------------ 350| 1.05M| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 782k, False: 272k] ------------------ 351| 782k| IMMER_PREFETCH(n + 1); 352| 782k| make_full_leaf_pos(*n).visit(v, args...); 353| 782k| } 354| 272k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 524k| } else { 356| 524k| auto ss = p.shift() - B; 357| 2.15M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 1.63M, False: 524k] ------------------ 358| 1.63M| make_full_pos(*n, ss).visit(v, args...); 359| 524k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 524k| } 361| 796k|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 233| 4.47M| 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.56M| 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| 2.91M| 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| 6.68M| 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| 19.4M| 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| 23.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.41M|{ 65| 1.41M| return {node}; 66| 1.41M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 1.41M| { 58| 1.41M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 1.41M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 41| 1.41M| 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| 80.4M|{ 152| 80.4M| assert(node); ------------------ | Branch (152:5): [True: 80.4M, False: 0] ------------------ 153| 80.4M| assert(count <= branches); ------------------ | Branch (153:5): [True: 80.4M, False: 0] ------------------ 154| 80.4M| return {node, count}; 155| 80.4M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 61.0M| { 145| 61.0M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 61.0M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 136| 72.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| 20.3M| 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.28M|{ 89| 1.28M| assert(node); ------------------ | Branch (89:5): [True: 1.28M, False: 0] ------------------ 90| 1.28M| return {node}; 91| 1.28M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 1.28M| { 82| 1.28M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 1.28M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 75| 1.28M| 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.40k| 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| 222k| { 1814| 222k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 222k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1433| 26.7M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEj: 1443| 12.8M| { 1444| 12.8M| return size_sbh(offset, size_before(offset)); 1445| 12.8M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1448| 13.2M| { 1449| 13.2M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 13.2M, False: 0] ------------------ 1450| 13.2M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 13.2M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 1438| 47.3M| { 1439| 47.3M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 31.0M, False: 16.3M] ------------------ 1440| 47.3M| } _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| 207k| { 1738| 207k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 207k, False: 0] ------------------ 1739| 207k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 207k, False: 0] ------------------ 1740| 207k| auto child = node_->inner()[offset_hint]; 1741| 207k| auto is_leaf = shift_ == BL; 1742| 207k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 207k] ------------------ 1743| 207k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 207k| : visit_maybe_relaxed_sub( 1745| 207k| child, shift_ - B, child_size_hint, v, args...); 1746| 207k| } _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| 207k|{ 1839| 207k| assert(node); ------------------ | Branch (1839:5): [True: 207k, False: 0] ------------------ 1840| 207k| auto relaxed = node->relaxed(); 1841| 207k| if (relaxed) { ------------------ | Branch (1841:9): [True: 167k, False: 39.4k] ------------------ 1842| 167k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 167k, False: 0] ------------------ 1843| 167k| return make_relaxed_pos(node, shift, relaxed) 1844| 167k| .visit(v, std::forward(args)...); 1845| 167k| } else { 1846| 39.4k| return make_regular_sub_pos(node, shift, size) 1847| 39.4k| .visit(v, std::forward(args)...); 1848| 39.4k| } 1849| 207k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_DpOT0_: 1036| 39.4k| { 1037| 39.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 39.4k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 788| 1.96M| 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| 275k| { 953| 275k| return last_oh_regular(*this, v, offset_hint, args...); 954| 275k| } _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| 275k|{ 678| 275k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 275k, False: 0] ------------------ 679| 275k| constexpr auto B = bits; 680| 275k| constexpr auto BL = bits_leaf; 681| 275k| auto child = p.node()->inner()[offset_hint]; 682| 275k| auto is_leaf = p.shift() == BL; 683| 275k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 275k] ------------------ 684| 275k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 275k| .visit(v, args...); 686| 275k|} _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| 756k| { 337| 756k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 756k| } _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| 480k| { 331| 480k| return last_oh_regular(*this, v, offset_hint, args...); 332| 480k| } _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| 480k|{ 678| 480k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 480k, False: 0] ------------------ 679| 480k| constexpr auto B = bits; 680| 480k| constexpr auto BL = bits_leaf; 681| 480k| auto child = p.node()->inner()[offset_hint]; 682| 480k| auto is_leaf = p.shift() == BL; 683| 480k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 480k] ------------------ 684| 480k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 480k| .visit(v, args...); 686| 480k|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1432| 113M| 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| 266k| { 1037| 266k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 266k| } 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| 59.1k| { 145| 59.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 59.1k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 139| 1.25M| count_t index(size_t idx) const { return idx & mask; } flex-vector-bo.cpp:_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSJ_E_EEEDcPSJ_jmT0_DpOT1_: 1838| 240k|{ 1839| 240k| assert(node); ------------------ | Branch (1839:5): [True: 240k, False: 0] ------------------ 1840| 240k| auto relaxed = node->relaxed(); 1841| 240k| if (relaxed) { ------------------ | Branch (1841:9): [True: 181k, False: 59.4k] ------------------ 1842| 181k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 181k, False: 0] ------------------ 1843| 181k| return make_relaxed_pos(node, shift, relaxed) 1844| 181k| .visit(v, std::forward(args)...); 1845| 181k| } else { 1846| 59.4k| return make_regular_sub_pos(node, shift, size) 1847| 59.4k| .visit(v, std::forward(args)...); 1848| 59.4k| } 1849| 240k|} flex-vector-bo.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1813| 181k| { 1814| 181k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 181k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 1454| 16.6M| { 1455| 16.6M| auto offset = idx >> shift_; 1456| 24.3M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 7.66M, False: 16.6M] ------------------ 1457| 7.66M| ++offset; 1458| 16.6M| return offset; 1459| 16.6M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7relaxedEv: 1435| 181k| 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| 181k| { 1687| 181k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 181k, False: 0] ------------------ 1688| 181k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 25.0k, False: 156k] ------------------ 1689| 181k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 181k| } 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| 181k| { 1699| 181k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 181k| } 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| 181k| { 1718| 181k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 181k, False: 0] ------------------ 1719| 181k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 25.0k, False: 156k] | Branch (1719:9): [True: 181k, False: 0] ------------------ 1720| 181k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 181k| auto child = node_->inner()[offset_hint]; 1722| 181k| auto is_leaf = shift_ == BL; 1723| 181k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 181k| auto next_idx = idx - left_size_hint; 1725| 181k| return is_leaf ------------------ | Branch (1725:16): [True: 41.9k, False: 139k] ------------------ 1726| 181k| ? make_leaf_sub_pos(child, next_size) 1727| 41.9k| .visit(v, next_idx, args...) 1728| 181k| : visit_maybe_relaxed_sub( 1729| 139k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 181k| } 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| 41.9k| { 145| 41.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 41.9k| } 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| 59.4k| { 1037| 59.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 59.4k| } 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| 59.4k| { 939| 59.4k| return towards_oh_ch_regular( 940| 59.4k| *this, v, idx, offset_hint, count(), args...); 941| 59.4k| } 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| 59.4k|{ 633| 59.4k| constexpr auto B = bits; 634| 59.4k| constexpr auto BL = bits_leaf; 635| 59.4k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 59.4k, False: 0] ------------------ 636| 59.4k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 59.4k, False: 0] ------------------ 637| 59.4k| auto is_leaf = p.shift() == BL; 638| 59.4k| auto child = p.node()->inner()[offset_hint]; 639| 59.4k| auto is_full = offset_hint + 1 != count_hint; 640| 59.4k| return is_full ------------------ | Branch (640:12): [True: 9.40k, False: 50.0k] ------------------ 641| 59.4k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.05k, False: 7.34k] ------------------ 642| 9.40k| : make_full_pos(child, p.shift() - B) 643| 7.34k| .visit(v, idx, args...)) 644| 59.4k| : (is_leaf ------------------ | Branch (644:19): [True: 46.1k, False: 3.86k] ------------------ 645| 50.0k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 50.0k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.86k| .visit(v, idx, args...)); 648| 59.4k|} 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| 11.8k| { 208| 11.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 11.8k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 202| 249k| 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| 12.7k| { 1406| 12.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 12.7k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 1162| 522k| 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| 12.7k| { 1330| 12.7k| return towards_oh(v, idx, offset_hint, args...); 1331| 12.7k| } 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| 12.7k| { 1337| 12.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 12.7k, False: 0] ------------------ 1338| 12.7k| auto is_leaf = shift_ == BL; 1339| 12.7k| auto child = node_->inner()[offset_hint]; 1340| 12.7k| return is_leaf ------------------ | Branch (1340:16): [True: 8.59k, False: 4.17k] ------------------ 1341| 12.7k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 12.7k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 12.7k| } 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| 47.5k| { 113| 47.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 47.5k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 336| 4.18k| { 337| 4.18k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.18k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 316| 4.18k| { 317| 4.18k| return towards_oh_ch_regular( 318| 4.18k| *this, v, idx, offset_hint, count(), args...); 319| 4.18k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 4.18k|{ 633| 4.18k| constexpr auto B = bits; 634| 4.18k| constexpr auto BL = bits_leaf; 635| 4.18k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.18k, False: 0] ------------------ 636| 4.18k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.18k, False: 0] ------------------ 637| 4.18k| auto is_leaf = p.shift() == BL; 638| 4.18k| auto child = p.node()->inner()[offset_hint]; 639| 4.18k| auto is_full = offset_hint + 1 != count_hint; 640| 4.18k| return is_full ------------------ | Branch (640:12): [True: 2.44k, False: 1.74k] ------------------ 641| 4.18k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.19k, False: 1.24k] ------------------ 642| 2.44k| : make_full_pos(child, p.shift() - B) 643| 1.24k| .visit(v, idx, args...)) 644| 4.18k| : (is_leaf ------------------ | Branch (644:19): [True: 1.42k, False: 320] ------------------ 645| 1.74k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.74k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 320| .visit(v, idx, args...)); 648| 4.18k|} _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| 43.3k|{ 1839| 43.3k| assert(node); ------------------ | Branch (1839:5): [True: 43.3k, False: 0] ------------------ 1840| 43.3k| auto relaxed = node->relaxed(); 1841| 43.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 35.5k, False: 7.77k] ------------------ 1842| 35.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 35.5k, False: 0] ------------------ 1843| 35.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 35.5k| .visit(v, std::forward(args)...); 1845| 35.5k| } else { 1846| 7.77k| return make_regular_sub_pos(node, shift, size) 1847| 7.77k| .visit(v, std::forward(args)...); 1848| 7.77k| } 1849| 43.3k|} _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.5k| { 1814| 35.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 35.5k| } _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: 2.01k, False: 26.1k] ------------------ 1726| 28.1k| ? make_leaf_sub_pos(child, next_size) 1727| 2.01k| .visit(v, next_idx, args...) 1728| 28.1k| : visit_maybe_relaxed_sub( 1729| 26.1k| 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| 2.01k| { 145| 2.01k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.01k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1686| 10.9k| { 1687| 10.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 10.9k, False: 0] ------------------ 1688| 10.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.35k, False: 1.55k] ------------------ 1689| 10.9k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 10.9k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1698| 10.9k| { 1699| 10.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 10.9k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 10.9k| { 1718| 10.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 10.9k, False: 0] ------------------ 1719| 10.9k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.35k, False: 1.55k] | Branch (1719:9): [True: 10.9k, False: 0] ------------------ 1720| 10.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 10.9k| auto child = node_->inner()[offset_hint]; 1722| 10.9k| auto is_leaf = shift_ == BL; 1723| 10.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 10.9k| auto next_idx = idx - left_size_hint; 1725| 10.9k| return is_leaf ------------------ | Branch (1725:16): [True: 4.18k, False: 6.72k] ------------------ 1726| 10.9k| ? make_leaf_sub_pos(child, next_size) 1727| 4.18k| .visit(v, next_idx, args...) 1728| 10.9k| : visit_maybe_relaxed_sub( 1729| 6.72k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 10.9k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 4.18k| { 145| 4.18k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.18k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 6.72k|{ 1839| 6.72k| assert(node); ------------------ | Branch (1839:5): [True: 6.72k, False: 0] ------------------ 1840| 6.72k| auto relaxed = node->relaxed(); 1841| 6.72k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.55k, False: 3.16k] ------------------ 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.16k| return make_regular_sub_pos(node, shift, size) 1847| 3.16k| .visit(v, std::forward(args)...); 1848| 3.16k| } 1849| 6.72k|} _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.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_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 3.16k| { 1037| 3.16k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.16k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 927| 5.44k| { 928| 5.44k| return towards_oh_ch_regular( 929| 5.44k| *this, v, idx, offset_hint, count(), args...); 930| 5.44k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 5.44k|{ 633| 5.44k| constexpr auto B = bits; 634| 5.44k| constexpr auto BL = bits_leaf; 635| 5.44k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.44k, False: 0] ------------------ 636| 5.44k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.44k, False: 0] ------------------ 637| 5.44k| auto is_leaf = p.shift() == BL; 638| 5.44k| auto child = p.node()->inner()[offset_hint]; 639| 5.44k| auto is_full = offset_hint + 1 != count_hint; 640| 5.44k| return is_full ------------------ | Branch (640:12): [True: 1.85k, False: 3.59k] ------------------ 641| 5.44k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.05k, False: 801] ------------------ 642| 1.85k| : make_full_pos(child, p.shift() - B) 643| 801| .visit(v, idx, args...)) 644| 5.44k| : (is_leaf ------------------ | Branch (644:19): [True: 1.26k, False: 2.32k] ------------------ 645| 3.59k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.59k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.32k| .visit(v, idx, args...)); 648| 5.44k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 207| 5.81k| { 208| 5.81k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.81k| } _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.24k| { 1406| 2.24k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.24k| } _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.04k| { 1337| 5.04k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 5.04k, False: 0] ------------------ 1338| 5.04k| auto is_leaf = shift_ == BL; 1339| 5.04k| auto child = node_->inner()[offset_hint]; 1340| 5.04k| return is_leaf ------------------ | Branch (1340:16): [True: 4.12k, False: 919] ------------------ 1341| 5.04k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 5.04k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 5.04k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1161| 53.7k| 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.43k| { 113| 2.43k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.43k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 336| 2.85k| { 337| 2.85k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.85k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 305| 2.85k| { 306| 2.85k| return towards_oh_ch_regular( 307| 2.85k| *this, v, idx, offset_hint, count(), args...); 308| 2.85k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 2.85k|{ 633| 2.85k| constexpr auto B = bits; 634| 2.85k| constexpr auto BL = bits_leaf; 635| 2.85k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.85k, False: 0] ------------------ 636| 2.85k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.85k, False: 0] ------------------ 637| 2.85k| auto is_leaf = p.shift() == BL; 638| 2.85k| auto child = p.node()->inner()[offset_hint]; 639| 2.85k| auto is_full = offset_hint + 1 != count_hint; 640| 2.85k| return is_full ------------------ | Branch (640:12): [True: 1.15k, False: 1.69k] ------------------ 641| 2.85k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 630, False: 524] ------------------ 642| 1.15k| : make_full_pos(child, p.shift() - B) 643| 524| .visit(v, idx, args...)) 644| 2.85k| : (is_leaf ------------------ | Branch (644:19): [True: 1.16k, False: 530] ------------------ 645| 1.69k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.69k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 530| .visit(v, idx, args...)); 648| 2.85k|} _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| 7.77k| { 1037| 7.77k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.77k| } _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.48k| { 928| 5.48k| return towards_oh_ch_regular( 929| 5.48k| *this, v, idx, offset_hint, count(), args...); 930| 5.48k| } _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.48k|{ 633| 5.48k| constexpr auto B = bits; 634| 5.48k| constexpr auto BL = bits_leaf; 635| 5.48k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.48k, False: 0] ------------------ 636| 5.48k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.48k, False: 0] ------------------ 637| 5.48k| auto is_leaf = p.shift() == BL; 638| 5.48k| auto child = p.node()->inner()[offset_hint]; 639| 5.48k| auto is_full = offset_hint + 1 != count_hint; 640| 5.48k| return is_full ------------------ | Branch (640:12): [True: 4.65k, False: 830] ------------------ 641| 5.48k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.04k, False: 3.61k] ------------------ 642| 4.65k| : make_full_pos(child, p.shift() - B) 643| 3.61k| .visit(v, idx, args...)) 644| 5.48k| : (is_leaf ------------------ | Branch (644:19): [True: 830, False: 0] ------------------ 645| 830| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 830| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.48k|} _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.85k| { 208| 1.85k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.85k| } _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.04k| { 1406| 5.04k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.04k| } _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.24k| { 1337| 2.24k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.24k, False: 0] ------------------ 1338| 2.24k| auto is_leaf = shift_ == BL; 1339| 2.24k| auto child = node_->inner()[offset_hint]; 1340| 2.24k| return is_leaf ------------------ | Branch (1340:16): [True: 809, False: 1.43k] ------------------ 1341| 2.24k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.24k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.24k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 830| { 113| 830| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 830| } _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| 31.0k|{ 1839| 31.0k| assert(node); ------------------ | Branch (1839:5): [True: 31.0k, False: 0] ------------------ 1840| 31.0k| auto relaxed = node->relaxed(); 1841| 31.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 22.7k, False: 8.30k] ------------------ 1842| 22.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 22.7k, False: 0] ------------------ 1843| 22.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 22.7k| .visit(v, std::forward(args)...); 1845| 22.7k| } else { 1846| 8.30k| return make_regular_sub_pos(node, shift, size) 1847| 8.30k| .visit(v, std::forward(args)...); 1848| 8.30k| } 1849| 31.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 22.7k| { 1814| 22.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 22.7k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1434| 5.16M| count_t subindex(size_t idx) const { return index(idx); } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1705| 3.99k| { 1706| 3.99k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.99k, False: 0] ------------------ 1707| 3.99k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.69k, False: 298] ------------------ 1708| 3.99k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.99k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 3.99k| { 1718| 3.99k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.99k, False: 0] ------------------ 1719| 3.99k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.69k, False: 298] | Branch (1719:9): [True: 3.99k, False: 0] ------------------ 1720| 3.99k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.99k| auto child = node_->inner()[offset_hint]; 1722| 3.99k| auto is_leaf = shift_ == BL; 1723| 3.99k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.99k| auto next_idx = idx - left_size_hint; 1725| 3.99k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.99k] ------------------ 1726| 3.99k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.99k| : visit_maybe_relaxed_sub( 1729| 3.99k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.99k| } _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| 106k| { 1706| 106k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 106k, False: 0] ------------------ 1707| 106k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 31.2k, False: 75.0k] ------------------ 1708| 106k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 106k| } _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| 106k| { 1718| 106k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 106k, False: 0] ------------------ 1719| 106k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 31.2k, False: 75.0k] | Branch (1719:9): [True: 106k, False: 0] ------------------ 1720| 106k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 106k| auto child = node_->inner()[offset_hint]; 1722| 106k| auto is_leaf = shift_ == BL; 1723| 106k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 106k| auto next_idx = idx - left_size_hint; 1725| 106k| return is_leaf ------------------ | Branch (1725:16): [True: 17.5k, False: 88.7k] ------------------ 1726| 106k| ? make_leaf_sub_pos(child, next_size) 1727| 17.5k| .visit(v, next_idx, args...) 1728| 106k| : visit_maybe_relaxed_sub( 1729| 88.7k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 106k| } _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| 17.5k| { 145| 17.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 17.5k| } _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| 88.7k|{ 1839| 88.7k| assert(node); ------------------ | Branch (1839:5): [True: 88.7k, False: 0] ------------------ 1840| 88.7k| auto relaxed = node->relaxed(); 1841| 88.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 87.5k, False: 1.18k] ------------------ 1842| 87.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 87.5k, False: 0] ------------------ 1843| 87.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 87.5k| .visit(v, std::forward(args)...); 1845| 87.5k| } else { 1846| 1.18k| return make_regular_sub_pos(node, shift, size) 1847| 1.18k| .visit(v, std::forward(args)...); 1848| 1.18k| } 1849| 88.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 87.5k| { 1814| 87.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 87.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 1.18k| { 1037| 1.18k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.18k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 791| 1.90M| { 792| 1.90M| return size_t{offset} << shift_; 793| 1.90M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 803| 18.6k| { 804| 18.6k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 18.6k, False: 0] ------------------ 805| 18.6k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 8.11k, False: 10.5k] ------------------ 806| 18.6k| : size_t{1} << shift_; 807| 18.6k| } _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| 8.77k| { 947| 8.77k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 8.77k| } _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| 8.77k|{ 654| 8.77k| constexpr auto B = bits; 655| 8.77k| constexpr auto BL = bits_leaf; 656| 8.77k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 8.77k, False: 0] ------------------ 657| 8.77k| auto is_leaf = p.shift() == BL; 658| 8.77k| auto child = p.node()->inner()[offset_hint]; 659| 8.77k| auto lsize = offset_hint << p.shift(); 660| 8.77k| auto size = p.this_size(); 661| 8.77k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 8.77k| return is_full ------------------ | Branch (662:12): [True: 8.77k, False: 0] ------------------ 663| 8.77k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.45k, False: 4.31k] ------------------ 664| 8.77k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 8.77k| : make_full_pos(child, p.shift() - B) 666| 4.31k| .visit(v, idx - lsize, args...)) 667| 8.77k| : (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| 8.77k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9this_sizeEv: 794| 18.6k| size_t this_size() const { return size_; } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 207| 9.48k| { 208| 9.48k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.48k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 1405| 6.86k| { 1406| 6.86k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 6.86k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1163| 9.71k| 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| 40.8k| { 1171| 40.8k| return size_t{offset} << shift_; 1172| 40.8k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1166| 9.71k| { 1167| 9.71k| return size_t{1} << shift_; 1168| 9.71k| } _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.58k| { 1349| 7.58k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 7.58k, False: 0] ------------------ 1350| 7.58k| auto is_leaf = shift_ == BL; 1351| 7.58k| auto child = node_->inner()[offset_hint]; 1352| 7.58k| auto lsize = size_t{offset_hint} << shift_; 1353| 7.58k| return is_leaf ------------------ | Branch (1353:16): [True: 5.02k, False: 2.55k] ------------------ 1354| 7.58k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 7.58k| : make_full_pos(child, shift_ - B) 1356| 2.55k| .visit(v, idx - lsize, args...); 1357| 7.58k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1175| 9.71k| { 1176| 9.71k| auto e = sizes + n; 1177| 55.4k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 45.7k, False: 9.71k] ------------------ 1178| 45.7k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 45.7k, False: 0] ------------------ 1180| 45.7k| } 1181| 9.71k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1160| 585k| 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.66M| { 811| 3.66M| if (n) { ------------------ | Branch (811:13): [True: 3.65M, False: 4.25k] ------------------ 812| 3.65M| auto last = offset + n - 1; 813| 3.65M| auto e = sizes + n - 1; 814| 14.6M| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 10.9M, False: 3.65M] ------------------ 815| 10.9M| init = *sizes = init + (size_t{1} << shift_); 816| 10.9M| assert(init); ------------------ | Branch (816:17): [True: 10.9M, False: 0] ------------------ 817| 10.9M| } 818| 3.65M| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 3.65M, False: 0] ------------------ 820| 3.65M| } 821| 3.66M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEj: 797| 3.67M| { 798| 3.67M| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 1.83M, False: 1.84M] ------------------ 799| 3.67M| : size_t{1} << shift_; 800| 3.67M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1462| 20.6M| { 1463| 20.6M| auto e = sizes + n; 1464| 20.6M| auto prev = size_before(offset); 1465| 20.6M| auto these = relaxed_->d.sizes + offset; 1466| 95.3M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 74.7M, False: 20.6M] ------------------ 1467| 74.7M| auto this_size = *these; 1468| 74.7M| init = *sizes = init + (this_size - prev); 1469| 74.7M| assert(init); ------------------ | Branch (1469:13): [True: 74.7M, False: 0] ------------------ 1470| 74.7M| prev = this_size; 1471| 74.7M| } 1472| 20.6M| } _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.30k| { 1037| 8.30k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.30k| } _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.48k| { 947| 2.48k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.48k| } _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.48k|{ 654| 2.48k| constexpr auto B = bits; 655| 2.48k| constexpr auto BL = bits_leaf; 656| 2.48k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.48k, False: 0] ------------------ 657| 2.48k| auto is_leaf = p.shift() == BL; 658| 2.48k| auto child = p.node()->inner()[offset_hint]; 659| 2.48k| auto lsize = offset_hint << p.shift(); 660| 2.48k| auto size = p.this_size(); 661| 2.48k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.48k| return is_full ------------------ | Branch (662:12): [True: 715, False: 1.77k] ------------------ 663| 2.48k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 715] ------------------ 664| 715| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 715| : make_full_pos(child, p.shift() - B) 666| 715| .visit(v, idx - lsize, args...)) 667| 2.48k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.77k] ------------------ 668| 1.77k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.77k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.77k| .visit(v, idx - lsize, args...)); 672| 2.48k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1405| 715| { 1406| 715| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 715| } _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.77k| { 1037| 1.77k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.77k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaPT_j: 766| 7.40k|{ 767| 7.40k| assert(leaf); ------------------ | Branch (767:5): [True: 7.40k, False: 0] ------------------ 768| 7.40k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 7.40k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 7.40k, False: 0] ------------------ 769| 7.40k| assert(count > 0); ------------------ | Branch (769:5): [True: 7.40k, False: 0] ------------------ 770| 7.40k| return singleton_regular_sub_pos{leaf, count}; 771| 7.40k|} _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.40k| { 760| 7.40k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 7.40k| } _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.40k|{ 1839| 7.40k| assert(node); ------------------ | Branch (1839:5): [True: 7.40k, False: 0] ------------------ 1840| 7.40k| auto relaxed = node->relaxed(); 1841| 7.40k| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.14k, False: 2.26k] ------------------ 1842| 5.14k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.14k, False: 0] ------------------ 1843| 5.14k| return make_relaxed_pos(node, shift, relaxed) 1844| 5.14k| .visit(v, std::forward(args)...); 1845| 5.14k| } else { 1846| 2.26k| return make_regular_sub_pos(node, shift, size) 1847| 2.26k| .visit(v, std::forward(args)...); 1848| 2.26k| } 1849| 7.40k|} _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.14k| { 1814| 5.14k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.14k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 735| 26.5k| 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.40k| { 745| 7.40k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 144| 7.69M| { 145| 7.69M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.69M| } _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| 112M| { 1814| 112M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 112M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 707| 3.34M| { 708| 3.34M| } _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.40k| { 745| 7.40k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 144| 7.69M| { 145| 7.69M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.69M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 137| 7.69M| 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| 112M| { 1814| 112M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 112M| } _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.34M| { 708| 3.34M| } _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| 18.2k| { 1763| 18.2k| auto child = node_->inner()[0]; 1764| 18.2k| auto child_size = relaxed_->d.sizes[0]; 1765| 18.2k| auto is_leaf = shift_ == BL; 1766| 18.2k| assert(child_size); ------------------ | Branch (1766:9): [True: 18.2k, False: 0] ------------------ 1767| 18.2k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 18.2k] ------------------ 1768| 18.2k| : visit_maybe_relaxed_sub( 1769| 18.2k| child, shift_ - B, child_size, v, args...); 1770| 18.2k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 76| 7.40k| shift_t shift() const { return 0; } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 138| 3.89M| 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| 18.2k|{ 1839| 18.2k| assert(node); ------------------ | Branch (1839:5): [True: 18.2k, False: 0] ------------------ 1840| 18.2k| auto relaxed = node->relaxed(); 1841| 18.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 17.9k, False: 297] ------------------ 1842| 17.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 17.9k, False: 0] ------------------ 1843| 17.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 17.9k| .visit(v, std::forward(args)...); 1845| 17.9k| } else { 1846| 297| return make_regular_sub_pos(node, shift, size) 1847| 297| .visit(v, std::forward(args)...); 1848| 297| } 1849| 18.2k|} _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.9k| { 1814| 17.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 17.9k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1036| 297| { 1037| 297| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 297| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 970| 664| { 971| 664| auto is_leaf = shift_ == BL; 972| 664| auto child = node_->inner()[0]; 973| 664| auto is_full = size_ >= (size_t{1} << shift_); 974| 664| return is_full ------------------ | Branch (974:16): [True: 664, False: 0] ------------------ 975| 664| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 664] ------------------ 976| 664| ? make_full_leaf_pos(child).visit(v, args...) 977| 664| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 664| : (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| 664| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 201| 432k| 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| 914| { 1406| 914| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 914| } _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| 250| { 1362| 250| auto is_leaf = shift_ == BL; 1363| 250| auto child = node_->inner()[0]; 1364| 250| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 250] ------------------ 1365| 250| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 250| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 711| 72.5k| { 712| 72.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1304| 24.4k| { 1305| 24.4k| each_i(v, 1, branches, args...); 1306| 24.4k| } _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| 24.4k| { 1264| 24.4k| auto p = node_->inner() + i; 1265| 24.4k| auto e = node_->inner() + n; 1266| 24.4k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 17.8k, False: 6.57k] ------------------ 1267| 142k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 124k, False: 17.8k] ------------------ 1268| 124k| IMMER_PREFETCH(p + 1); 1269| 124k| make_full_leaf_pos(*p).visit(v, args...); 1270| 124k| } 1271| 17.8k| } else { 1272| 6.57k| auto ss = shift_ - B; 1273| 52.6k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 46.0k, False: 6.57k] ------------------ 1274| 46.0k| make_full_pos(*p, ss).visit(v, args...); 1275| 6.57k| } 1276| 24.4k| } _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.13M| { 208| 6.13M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.13M| } _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| 577k| { 1406| 577k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 577k| } _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| 72.5k| { 712| 72.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1304| 24.4k| { 1305| 24.4k| each_i(v, 1, branches, args...); 1306| 24.4k| } _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| 24.4k| { 1264| 24.4k| auto p = node_->inner() + i; 1265| 24.4k| auto e = node_->inner() + n; 1266| 24.4k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 17.8k, False: 6.57k] ------------------ 1267| 142k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 124k, False: 17.8k] ------------------ 1268| 124k| IMMER_PREFETCH(p + 1); 1269| 124k| make_full_leaf_pos(*p).visit(v, args...); 1270| 124k| } 1271| 17.8k| } else { 1272| 6.57k| auto ss = shift_ - B; 1273| 52.6k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 46.0k, False: 6.57k] ------------------ 1274| 46.0k| make_full_pos(*p, ss).visit(v, args...); 1275| 6.57k| } 1276| 24.4k| } _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.13M| { 208| 6.13M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.13M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 200| 6.13M| 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| 577k| { 1406| 577k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 577k| } _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| 664| { 754| 664| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 664| } _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| 664| { 145| 664| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 664| } _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| 664| { 1371| 664| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 664, False: 0] ------------------ 1372| 664| auto child = node_->inner()[0]; 1373| 664| return make_full_leaf_pos(child).visit(v, args...); 1374| 664| } _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.56k| { 208| 2.56k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.56k| } _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| 432k| { 907| 432k| if (count() > 1) ------------------ | Branch (907:13): [True: 422k, False: 10.3k] ------------------ 908| 422k| each_right_sub_(v, 1, args...); 909| 432k| } _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| 422k| { 880| 422k| auto last = count() - 1; 881| 422k| auto lsize = size_ - (last << shift_); 882| 422k| auto n = node()->inner() + i; 883| 422k| auto e = node()->inner() + last; 884| 422k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 404k, False: 17.8k] ------------------ 885| 2.82M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.41M, False: 404k] ------------------ 886| 2.41M| IMMER_PREFETCH(n + 1); 887| 2.41M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.41M| } 889| 404k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 404k| } else { 891| 17.8k| auto ss = shift_ - B; 892| 87.2k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 69.4k, False: 17.8k] ------------------ 893| 69.4k| make_full_pos(*n, ss).visit(v, args...); 894| 17.8k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 17.8k| } 896| 422k| } _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.12M| { 1037| 4.12M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.12M| } _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| 432k| { 907| 432k| if (count() > 1) ------------------ | Branch (907:13): [True: 422k, False: 10.3k] ------------------ 908| 422k| each_right_sub_(v, 1, args...); 909| 432k| } _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| 422k| { 880| 422k| auto last = count() - 1; 881| 422k| auto lsize = size_ - (last << shift_); 882| 422k| auto n = node()->inner() + i; 883| 422k| auto e = node()->inner() + last; 884| 422k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 404k, False: 17.8k] ------------------ 885| 2.82M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.41M, False: 404k] ------------------ 886| 2.41M| IMMER_PREFETCH(n + 1); 887| 2.41M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.41M| } 889| 404k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 404k| } else { 891| 17.8k| auto ss = shift_ - B; 892| 87.2k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 69.4k, False: 17.8k] ------------------ 893| 69.4k| make_full_pos(*n, ss).visit(v, args...); 894| 17.8k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 17.8k| } 896| 422k| } _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.12M| { 1037| 4.12M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.12M| } _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.84k| { 145| 4.84k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.84k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1647| 9.56M| { 1648| 9.56M| each_right(v, 1, std::forward(args)...); 1649| 9.56M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 1653| 9.56M| { 1654| 9.56M| assert(start > 0); ------------------ | Branch (1654:9): [True: 9.56M, False: 0] ------------------ 1655| 9.56M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 9.56M, False: 0] ------------------ 1656| 9.56M| auto s = relaxed_->d.sizes[start - 1]; 1657| 9.56M| auto p = node_->inner(); 1658| 9.56M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 650k, False: 8.91M] ------------------ 1659| 3.29M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 2.64M, False: 650k] ------------------ 1660| 2.64M| IMMER_PREFETCH(p + i + 1); 1661| 2.64M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 2.64M| .visit(v, args...); 1663| 2.64M| s = relaxed_->d.sizes[i]; 1664| 2.64M| assert(s); ------------------ | Branch (1664:17): [True: 2.64M, False: 0] ------------------ 1665| 2.64M| } 1666| 8.91M| } else { 1667| 8.91M| auto ss = shift_ - B; 1668| 64.8M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 55.9M, False: 8.91M] ------------------ 1669| 55.9M| visit_maybe_relaxed_sub( 1670| 55.9M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 55.9M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 55.9M, False: 0] ------------------ 1673| 55.9M| } 1674| 8.91M| } 1675| 9.56M| } _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| 96.0M|{ 1839| 96.0M| assert(node); ------------------ | Branch (1839:5): [True: 96.0M, False: 0] ------------------ 1840| 96.0M| auto relaxed = node->relaxed(); 1841| 96.0M| if (relaxed) { ------------------ | Branch (1841:9): [True: 91.9M, False: 4.10M] ------------------ 1842| 91.9M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 91.9M, False: 0] ------------------ 1843| 91.9M| return make_relaxed_pos(node, shift, relaxed) 1844| 91.9M| .visit(v, std::forward(args)...); 1845| 91.9M| } else { 1846| 4.10M| return make_regular_sub_pos(node, shift, size) 1847| 4.10M| .visit(v, std::forward(args)...); 1848| 4.10M| } 1849| 96.0M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1647| 9.56M| { 1648| 9.56M| each_right(v, 1, std::forward(args)...); 1649| 9.56M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 1653| 9.56M| { 1654| 9.56M| assert(start > 0); ------------------ | Branch (1654:9): [True: 9.56M, False: 0] ------------------ 1655| 9.56M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 9.56M, False: 0] ------------------ 1656| 9.56M| auto s = relaxed_->d.sizes[start - 1]; 1657| 9.56M| auto p = node_->inner(); 1658| 9.56M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 650k, False: 8.91M] ------------------ 1659| 3.29M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 2.64M, False: 650k] ------------------ 1660| 2.64M| IMMER_PREFETCH(p + i + 1); 1661| 2.64M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 2.64M| .visit(v, args...); 1663| 2.64M| s = relaxed_->d.sizes[i]; 1664| 2.64M| assert(s); ------------------ | Branch (1664:17): [True: 2.64M, False: 0] ------------------ 1665| 2.64M| } 1666| 8.91M| } else { 1667| 8.91M| auto ss = shift_ - B; 1668| 64.8M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 55.9M, False: 8.91M] ------------------ 1669| 55.9M| visit_maybe_relaxed_sub( 1670| 55.9M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 55.9M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 55.9M, False: 0] ------------------ 1673| 55.9M| } 1674| 8.91M| } 1675| 9.56M| } _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| 96.0M|{ 1839| 96.0M| assert(node); ------------------ | Branch (1839:5): [True: 96.0M, False: 0] ------------------ 1840| 96.0M| auto relaxed = node->relaxed(); 1841| 96.0M| if (relaxed) { ------------------ | Branch (1841:9): [True: 91.9M, False: 4.10M] ------------------ 1842| 91.9M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 91.9M, False: 0] ------------------ 1843| 91.9M| return make_relaxed_pos(node, shift, relaxed) 1844| 91.9M| .visit(v, std::forward(args)...); 1845| 91.9M| } else { 1846| 4.10M| return make_regular_sub_pos(node, shift, size) 1847| 4.10M| .visit(v, std::forward(args)...); 1848| 4.10M| } 1849| 96.0M|} _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.84k| { 754| 4.84k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 4.84k| } _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.84k| { 145| 4.84k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.84k| } _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.84k| { 1775| 4.84k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 4.84k, False: 0] ------------------ 1776| 4.84k| auto child = node_->inner()[0]; 1777| 4.84k| auto child_size = relaxed_->d.sizes[0]; 1778| 4.84k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 4.84k| } _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.26k| { 1037| 2.26k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.26k| } _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.07M|{ 1839| 1.07M| assert(node); ------------------ | Branch (1839:5): [True: 1.07M, False: 0] ------------------ 1840| 1.07M| auto relaxed = node->relaxed(); 1841| 1.07M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.05M, False: 15.5k] ------------------ 1842| 1.05M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.05M, False: 0] ------------------ 1843| 1.05M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.05M| .visit(v, std::forward(args)...); 1845| 1.05M| } else { 1846| 15.5k| return make_regular_sub_pos(node, shift, size) 1847| 15.5k| .visit(v, std::forward(args)...); 1848| 15.5k| } 1849| 1.07M|} _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.05M| { 1814| 1.05M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.05M| } _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.05M|{ 1839| 1.05M| assert(node); ------------------ | Branch (1839:5): [True: 1.05M, False: 0] ------------------ 1840| 1.05M| auto relaxed = node->relaxed(); 1841| 1.05M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.05M, False: 8.60k] ------------------ 1842| 1.05M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.05M, False: 0] ------------------ 1843| 1.05M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.05M| .visit(v, std::forward(args)...); 1845| 1.05M| } else { 1846| 8.60k| return make_regular_sub_pos(node, shift, size) 1847| 8.60k| .visit(v, std::forward(args)...); 1848| 8.60k| } 1849| 1.05M|} _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.05M| { 1814| 1.05M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.05M| } _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.32M| { 1751| 3.32M| auto offset = relaxed_->d.count - 1; 1752| 3.32M| auto child = node_->inner()[offset]; 1753| 3.32M| auto child_size = size(offset); 1754| 3.32M| auto is_leaf = shift_ == BL; 1755| 3.32M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 3.32M] ------------------ 1756| 3.32M| : visit_maybe_relaxed_sub( 1757| 3.32M| child, shift_ - B, child_size, v, args...); 1758| 3.32M| } _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.32M|{ 1839| 3.32M| assert(node); ------------------ | Branch (1839:5): [True: 3.32M, False: 0] ------------------ 1840| 3.32M| auto relaxed = node->relaxed(); 1841| 3.32M| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.32M, False: 2.19k] ------------------ 1842| 3.32M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.32M, False: 0] ------------------ 1843| 3.32M| return make_relaxed_pos(node, shift, relaxed) 1844| 3.32M| .visit(v, std::forward(args)...); 1845| 3.32M| } else { 1846| 2.19k| return make_regular_sub_pos(node, shift, size) 1847| 2.19k| .visit(v, std::forward(args)...); 1848| 2.19k| } 1849| 3.32M|} _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.32M| { 1814| 3.32M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.32M| } _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.41k| { 1037| 4.41k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.41k| } _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.22k| { 959| 2.22k| auto offset = count() - 1; 960| 2.22k| auto child = node_->inner()[offset]; 961| 2.22k| auto is_leaf = shift_ == BL; 962| 2.22k| auto lsize = size_ - (size_t{offset} << shift_); 963| 2.22k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 2.22k] ------------------ 964| 2.22k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 2.22k| .visit(v, args...); 966| 2.22k| } _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.44M| { 914| 1.44M| each_left(v, count() - 1, args...); 915| 1.44M| } _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.44M| { 874| 1.44M| return each_left_regular(*this, v, last, args...); 875| 1.44M| } _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.44M|{ 576| 1.44M| constexpr auto B = bits; 577| 1.44M| constexpr auto BL = bits_leaf; 578| 1.44M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.44M, False: 0] ------------------ 579| 1.44M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 834k, False: 614k] ------------------ 580| 834k| auto n = p.node()->inner(); 581| 834k| auto e = n + last; 582| 4.43M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.59M, False: 834k] ------------------ 583| 3.59M| IMMER_PREFETCH(n + 1); 584| 3.59M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.59M| } 586| 834k| } else { 587| 614k| auto n = p.node()->inner(); 588| 614k| auto e = n + last; 589| 614k| auto ss = p.shift() - B; 590| 1.07M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 462k, False: 614k] ------------------ 591| 462k| make_full_pos(*n, ss).visit(v, args...); 592| 614k| } 593| 1.44M|} _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.44M| { 914| 1.44M| each_left(v, count() - 1, args...); 915| 1.44M| } _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.44M| { 874| 1.44M| return each_left_regular(*this, v, last, args...); 875| 1.44M| } _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.44M|{ 576| 1.44M| constexpr auto B = bits; 577| 1.44M| constexpr auto BL = bits_leaf; 578| 1.44M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.44M, False: 0] ------------------ 579| 1.44M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 834k, False: 614k] ------------------ 580| 834k| auto n = p.node()->inner(); 581| 834k| auto e = n + last; 582| 4.43M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.59M, False: 834k] ------------------ 583| 3.59M| IMMER_PREFETCH(n + 1); 584| 3.59M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.59M| } 586| 834k| } else { 587| 614k| auto n = p.node()->inner(); 588| 614k| auto e = n + last; 589| 614k| auto ss = p.shift() - B; 590| 1.07M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 462k, False: 614k] ------------------ 591| 462k| make_full_pos(*n, ss).visit(v, args...); 592| 614k| } 593| 1.44M|} _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.41M| { 1763| 1.41M| auto child = node_->inner()[0]; 1764| 1.41M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.41M| auto is_leaf = shift_ == BL; 1766| 1.41M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.41M, False: 0] ------------------ 1767| 1.41M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.41M] ------------------ 1768| 1.41M| : visit_maybe_relaxed_sub( 1769| 1.41M| child, shift_ - B, child_size, v, args...); 1770| 1.41M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 106| 1.07M| 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.41M|{ 1839| 1.41M| assert(node); ------------------ | Branch (1839:5): [True: 1.41M, False: 0] ------------------ 1840| 1.41M| auto relaxed = node->relaxed(); 1841| 1.41M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.00M, False: 411k] ------------------ 1842| 1.00M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.00M, False: 0] ------------------ 1843| 1.00M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.00M| .visit(v, std::forward(args)...); 1845| 1.00M| } else { 1846| 411k| return make_regular_sub_pos(node, shift, size) 1847| 411k| .visit(v, std::forward(args)...); 1848| 411k| } 1849| 1.41M|} _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.00M| { 1814| 1.00M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.00M| } _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| 411k| { 1037| 411k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 411k| } _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| 843| { 959| 843| auto offset = count() - 1; 960| 843| auto child = node_->inner()[offset]; 961| 843| auto is_leaf = shift_ == BL; 962| 843| auto lsize = size_ - (size_t{offset} << shift_); 963| 843| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 843] ------------------ 964| 843| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 843| .visit(v, args...); 966| 843| } _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.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_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 16.1k| { 971| 16.1k| auto is_leaf = shift_ == BL; 972| 16.1k| auto child = node_->inner()[0]; 973| 16.1k| auto is_full = size_ >= (size_t{1} << shift_); 974| 16.1k| return is_full ------------------ | Branch (974:16): [True: 16.1k, False: 0] ------------------ 975| 16.1k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 16.1k] ------------------ 976| 16.1k| ? make_full_leaf_pos(child).visit(v, args...) 977| 16.1k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 16.1k| : (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| 16.1k| } _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| 22.0k| { 1406| 22.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 22.0k| } _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.92k| { 1362| 5.92k| auto is_leaf = shift_ == BL; 1363| 5.92k| auto child = node_->inner()[0]; 1364| 5.92k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 5.92k] ------------------ 1365| 5.92k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 5.92k| } _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| 21.8k| { 959| 21.8k| auto offset = count() - 1; 960| 21.8k| auto child = node_->inner()[offset]; 961| 21.8k| auto is_leaf = shift_ == BL; 962| 21.8k| auto lsize = size_ - (size_t{offset} << shift_); 963| 21.8k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 16.3k, False: 5.51k] ------------------ 964| 21.8k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 5.51k| .visit(v, args...); 966| 21.8k| } _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| 17.1k| { 145| 17.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 17.1k| } _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| 17.1k| { 1371| 17.1k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 17.1k, False: 0] ------------------ 1372| 17.1k| auto child = node_->inner()[0]; 1373| 17.1k| return make_full_leaf_pos(child).visit(v, args...); 1374| 17.1k| } _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| 430k| { 208| 430k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 430k| } _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.72k| { 1037| 5.72k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.72k| } _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| 420k| { 959| 420k| auto offset = count() - 1; 960| 420k| auto child = node_->inner()[offset]; 961| 420k| auto is_leaf = shift_ == BL; 962| 420k| auto lsize = size_ - (size_t{offset} << shift_); 963| 420k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 409k, False: 11.4k] ------------------ 964| 420k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 11.4k| .visit(v, args...); 966| 420k| } _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| 412k| { 145| 412k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 412k| } _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| 412k| { 987| 412k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 412k, False: 0] ------------------ 988| 412k| auto child = node_->inner()[0]; 989| 412k| auto is_full = size_ >= branches; 990| 412k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 412k, False: 0] ------------------ 991| 412k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 412k| } _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| 645k| { 145| 645k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 645k| } _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| 15.7k| { 1037| 15.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 15.7k| } _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.00M| { 959| 1.00M| auto offset = count() - 1; 960| 1.00M| auto child = node_->inner()[offset]; 961| 1.00M| auto is_leaf = shift_ == BL; 962| 1.00M| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.00M| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 408k, False: 593k] ------------------ 964| 1.00M| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 593k| .visit(v, args...); 966| 1.00M| } _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| 645k| { 145| 645k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 645k| } _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| 645k| { 1775| 645k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 645k, False: 0] ------------------ 1776| 645k| auto child = node_->inner()[0]; 1777| 645k| auto child_size = relaxed_->d.sizes[0]; 1778| 645k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 645k| } _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.40M| { 1037| 1.40M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.40M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1617| 11.8M| { 1618| 11.8M| each_left(v, relaxed_->d.count - 1, args...); 1619| 11.8M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 1623| 11.8M| { 1624| 11.8M| auto p = node_->inner(); 1625| 11.8M| auto s = size_t{}; 1626| 11.8M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 240k, False: 11.5M] ------------------ 1627| 1.64M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 1.40M, False: 240k] ------------------ 1628| 1.40M| IMMER_PREFETCH(p + i + 1); 1629| 1.40M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 1.40M| .visit(v, args...); 1631| 1.40M| s = relaxed_->d.sizes[i]; 1632| 1.40M| assert(s); ------------------ | Branch (1632:17): [True: 1.40M, False: 0] ------------------ 1633| 1.40M| } 1634| 11.5M| } else { 1635| 11.5M| auto ss = shift_ - B; 1636| 51.7M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 40.1M, False: 11.5M] ------------------ 1637| 40.1M| visit_maybe_relaxed_sub( 1638| 40.1M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 40.1M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 40.1M, False: 0] ------------------ 1641| 40.1M| } 1642| 11.5M| } 1643| 11.8M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1617| 11.8M| { 1618| 11.8M| each_left(v, relaxed_->d.count - 1, args...); 1619| 11.8M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 1623| 11.8M| { 1624| 11.8M| auto p = node_->inner(); 1625| 11.8M| auto s = size_t{}; 1626| 11.8M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 240k, False: 11.5M] ------------------ 1627| 1.64M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 1.40M, False: 240k] ------------------ 1628| 1.40M| IMMER_PREFETCH(p + i + 1); 1629| 1.40M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 1.40M| .visit(v, args...); 1631| 1.40M| s = relaxed_->d.sizes[i]; 1632| 1.40M| assert(s); ------------------ | Branch (1632:17): [True: 1.40M, False: 0] ------------------ 1633| 1.40M| } 1634| 11.5M| } else { 1635| 11.5M| auto ss = shift_ - B; 1636| 51.7M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 40.1M, False: 11.5M] ------------------ 1637| 40.1M| visit_maybe_relaxed_sub( 1638| 40.1M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 40.1M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 40.1M, False: 0] ------------------ 1641| 40.1M| } 1642| 11.5M| } 1643| 11.8M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1762| 7.47M| { 1763| 7.47M| auto child = node_->inner()[0]; 1764| 7.47M| auto child_size = relaxed_->d.sizes[0]; 1765| 7.47M| auto is_leaf = shift_ == BL; 1766| 7.47M| assert(child_size); ------------------ | Branch (1766:9): [True: 7.47M, False: 0] ------------------ 1767| 7.47M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 7.47M] ------------------ 1768| 7.47M| : visit_maybe_relaxed_sub( 1769| 7.47M| child, shift_ - B, child_size, v, args...); 1770| 7.47M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 7.47M|{ 1839| 7.47M| assert(node); ------------------ | Branch (1839:5): [True: 7.47M, False: 0] ------------------ 1840| 7.47M| auto relaxed = node->relaxed(); 1841| 7.47M| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.47M, False: 543] ------------------ 1842| 7.47M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.47M, False: 0] ------------------ 1843| 7.47M| return make_relaxed_pos(node, shift, relaxed) 1844| 7.47M| .visit(v, std::forward(args)...); 1845| 7.47M| } else { 1846| 543| return make_regular_sub_pos(node, shift, size) 1847| 543| .visit(v, std::forward(args)...); 1848| 543| } 1849| 7.47M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 7.47M| { 1814| 7.47M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.47M| } _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| 543| { 1037| 543| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 543| } _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| 14.4k| { 1751| 14.4k| auto offset = relaxed_->d.count - 1; 1752| 14.4k| auto child = node_->inner()[offset]; 1753| 14.4k| auto child_size = size(offset); 1754| 14.4k| auto is_leaf = shift_ == BL; 1755| 14.4k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 14.4k] ------------------ 1756| 14.4k| : visit_maybe_relaxed_sub( 1757| 14.4k| child, shift_ - B, child_size, v, args...); 1758| 14.4k| } _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| 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: 14.0k, False: 398] ------------------ 1842| 14.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 14.0k, False: 0] ------------------ 1843| 14.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 14.0k| .visit(v, std::forward(args)...); 1845| 14.0k| } else { 1846| 398| return make_regular_sub_pos(node, shift, size) 1847| 398| .visit(v, std::forward(args)...); 1848| 398| } 1849| 14.4k|} _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| 14.0k| { 1814| 14.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 14.0k| } _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.01k| { 971| 1.01k| auto is_leaf = shift_ == BL; 972| 1.01k| auto child = node_->inner()[0]; 973| 1.01k| auto is_full = size_ >= (size_t{1} << shift_); 974| 1.01k| return is_full ------------------ | Branch (974:16): [True: 1.01k, False: 0] ------------------ 975| 1.01k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 1.01k] ------------------ 976| 1.01k| ? make_full_leaf_pos(child).visit(v, args...) 977| 1.01k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 1.01k| : (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.01k| } _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.40k| { 1406| 1.40k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.40k| } _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| 397| { 1362| 397| auto is_leaf = shift_ == BL; 1363| 397| auto child = node_->inner()[0]; 1364| 397| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 397] ------------------ 1365| 397| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 397| } _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.21k| { 1751| 1.21k| auto offset = relaxed_->d.count - 1; 1752| 1.21k| auto child = node_->inner()[offset]; 1753| 1.21k| auto child_size = size(offset); 1754| 1.21k| auto is_leaf = shift_ == BL; 1755| 1.21k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 802, False: 410] ------------------ 1756| 1.21k| : visit_maybe_relaxed_sub( 1757| 410| child, shift_ - B, child_size, v, args...); 1758| 1.21k| } _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| 410|{ 1839| 410| assert(node); ------------------ | Branch (1839:5): [True: 410, False: 0] ------------------ 1840| 410| auto relaxed = node->relaxed(); 1841| 410| if (relaxed) { ------------------ | Branch (1841:9): [True: 201, False: 209] ------------------ 1842| 201| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 201, False: 0] ------------------ 1843| 201| return make_relaxed_pos(node, shift, relaxed) 1844| 201| .visit(v, std::forward(args)...); 1845| 209| } else { 1846| 209| return make_regular_sub_pos(node, shift, size) 1847| 209| .visit(v, std::forward(args)...); 1848| 209| } 1849| 410|} _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| 201| { 1814| 201| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 201| } _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| 8.15k| { 1751| 8.15k| auto offset = relaxed_->d.count - 1; 1752| 8.15k| auto child = node_->inner()[offset]; 1753| 8.15k| auto child_size = size(offset); 1754| 8.15k| auto is_leaf = shift_ == BL; 1755| 8.15k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 3.49k, False: 4.66k] ------------------ 1756| 8.15k| : visit_maybe_relaxed_sub( 1757| 4.66k| child, shift_ - B, child_size, v, args...); 1758| 8.15k| } _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.66k|{ 1839| 4.66k| assert(node); ------------------ | Branch (1839:5): [True: 4.66k, False: 0] ------------------ 1840| 4.66k| auto relaxed = node->relaxed(); 1841| 4.66k| if (relaxed) { ------------------ | Branch (1841:9): [True: 416, False: 4.25k] ------------------ 1842| 416| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 416, False: 0] ------------------ 1843| 416| return make_relaxed_pos(node, shift, relaxed) 1844| 416| .visit(v, std::forward(args)...); 1845| 4.25k| } else { 1846| 4.25k| return make_regular_sub_pos(node, shift, size) 1847| 4.25k| .visit(v, std::forward(args)...); 1848| 4.25k| } 1849| 4.66k|} _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| 416| { 1814| 416| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 416| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1750| 8.48M| { 1751| 8.48M| auto offset = relaxed_->d.count - 1; 1752| 8.48M| auto child = node_->inner()[offset]; 1753| 8.48M| auto child_size = size(offset); 1754| 8.48M| auto is_leaf = shift_ == BL; 1755| 8.48M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 236k, False: 8.24M] ------------------ 1756| 8.48M| : visit_maybe_relaxed_sub( 1757| 8.24M| child, shift_ - B, child_size, v, args...); 1758| 8.48M| } _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.24M|{ 1839| 8.24M| assert(node); ------------------ | Branch (1839:5): [True: 8.24M, False: 0] ------------------ 1840| 8.24M| auto relaxed = node->relaxed(); 1841| 8.24M| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.43M, False: 811k] ------------------ 1842| 7.43M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.43M, False: 0] ------------------ 1843| 7.43M| return make_relaxed_pos(node, shift, relaxed) 1844| 7.43M| .visit(v, std::forward(args)...); 1845| 7.43M| } else { 1846| 811k| return make_regular_sub_pos(node, shift, size) 1847| 811k| .visit(v, std::forward(args)...); 1848| 811k| } 1849| 8.24M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1813| 7.43M| { 1814| 7.43M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.43M| } _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| 8.60k| { 1037| 8.60k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.60k| } _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| 15.5k| { 1037| 15.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 15.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| 15.5k|{ 1839| 15.5k| assert(node); ------------------ | Branch (1839:5): [True: 15.5k, False: 0] ------------------ 1840| 15.5k| auto relaxed = node->relaxed(); 1841| 15.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.39k, False: 9.13k] ------------------ 1842| 6.39k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.39k, False: 0] ------------------ 1843| 6.39k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.39k| .visit(v, std::forward(args)...); 1845| 9.13k| } else { 1846| 9.13k| return make_regular_sub_pos(node, shift, size) 1847| 9.13k| .visit(v, std::forward(args)...); 1848| 9.13k| } 1849| 15.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.39k| { 1814| 6.39k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.39k| } _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.13k| { 1037| 9.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 9.13k| } _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| 184k| { 1814| 184k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 184k| } _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| 179k| { 1738| 179k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 179k, False: 0] ------------------ 1739| 179k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 179k, False: 0] ------------------ 1740| 179k| auto child = node_->inner()[offset_hint]; 1741| 179k| auto is_leaf = shift_ == BL; 1742| 179k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 179k] ------------------ 1743| 179k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 179k| : visit_maybe_relaxed_sub( 1745| 179k| child, shift_ - B, child_size_hint, v, args...); 1746| 179k| } _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| 179k|{ 1839| 179k| assert(node); ------------------ | Branch (1839:5): [True: 179k, False: 0] ------------------ 1840| 179k| auto relaxed = node->relaxed(); 1841| 179k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.2k, False: 167k] ------------------ 1842| 11.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.2k, False: 0] ------------------ 1843| 11.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.2k| .visit(v, std::forward(args)...); 1845| 167k| } else { 1846| 167k| return make_regular_sub_pos(node, shift, size) 1847| 167k| .visit(v, std::forward(args)...); 1848| 167k| } 1849| 179k|} _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| 167k| { 1037| 167k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 167k| } _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| 342k| { 953| 342k| return last_oh_regular(*this, v, offset_hint, args...); 954| 342k| } _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| 342k|{ 678| 342k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 342k, False: 0] ------------------ 679| 342k| constexpr auto B = bits; 680| 342k| constexpr auto BL = bits_leaf; 681| 342k| auto child = p.node()->inner()[offset_hint]; 682| 342k| auto is_leaf = p.shift() == BL; 683| 342k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 342k] ------------------ 684| 342k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 342k| .visit(v, args...); 686| 342k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 336| 1.08M| { 337| 1.08M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.08M| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 330| 738k| { 331| 738k| return last_oh_regular(*this, v, offset_hint, args...); 332| 738k| } _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| 738k|{ 678| 738k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 738k, False: 0] ------------------ 679| 738k| constexpr auto B = bits; 680| 738k| constexpr auto BL = bits_leaf; 681| 738k| auto child = p.node()->inner()[offset_hint]; 682| 738k| auto is_leaf = p.shift() == BL; 683| 738k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 738k] ------------------ 684| 738k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 738k| .visit(v, args...); 686| 738k|} _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.86k| { 331| 2.86k| return last_oh_regular(*this, v, offset_hint, args...); 332| 2.86k| } _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.86k|{ 678| 2.86k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 2.86k, False: 0] ------------------ 679| 2.86k| constexpr auto B = bits; 680| 2.86k| constexpr auto BL = bits_leaf; 681| 2.86k| auto child = p.node()->inner()[offset_hint]; 682| 2.86k| auto is_leaf = p.shift() == BL; 683| 2.86k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 2.86k] ------------------ 684| 2.86k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 2.86k| .visit(v, args...); 686| 2.86k|} _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.45k| { 337| 4.45k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.45k| } _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.59k| { 953| 1.59k| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.59k| } _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.59k|{ 678| 1.59k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.59k, False: 0] ------------------ 679| 1.59k| constexpr auto B = bits; 680| 1.59k| constexpr auto BL = bits_leaf; 681| 1.59k| auto child = p.node()->inner()[offset_hint]; 682| 1.59k| auto is_leaf = p.shift() == BL; 683| 1.59k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.59k] ------------------ 684| 1.59k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.59k| .visit(v, args...); 686| 1.59k|} _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.21k| { 1738| 8.21k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 8.21k, False: 0] ------------------ 1739| 8.21k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 8.21k, False: 0] ------------------ 1740| 8.21k| auto child = node_->inner()[offset_hint]; 1741| 8.21k| auto is_leaf = shift_ == BL; 1742| 8.21k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 8.21k] ------------------ 1743| 8.21k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 8.21k| : visit_maybe_relaxed_sub( 1745| 8.21k| child, shift_ - B, child_size_hint, v, args...); 1746| 8.21k| } _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.21k|{ 1839| 8.21k| assert(node); ------------------ | Branch (1839:5): [True: 8.21k, False: 0] ------------------ 1840| 8.21k| auto relaxed = node->relaxed(); 1841| 8.21k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.16k, False: 1.04k] ------------------ 1842| 7.16k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.16k, False: 0] ------------------ 1843| 7.16k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.16k| .visit(v, std::forward(args)...); 1845| 7.16k| } else { 1846| 1.04k| return make_regular_sub_pos(node, shift, size) 1847| 1.04k| .visit(v, std::forward(args)...); 1848| 1.04k| } 1849| 8.21k|} _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.16k| { 1814| 7.16k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.16k| } _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.04k| { 1037| 1.04k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.04k| } _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| 187k| { 1037| 187k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 187k| } _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: 17.0k, False: 3.87k] ------------------ 1842| 17.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 17.0k, False: 0] ------------------ 1843| 17.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 17.0k| .visit(v, std::forward(args)...); 1845| 17.0k| } else { 1846| 3.87k| return make_regular_sub_pos(node, shift, size) 1847| 3.87k| .visit(v, std::forward(args)...); 1848| 3.87k| } 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| 17.0k| { 1814| 17.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 17.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| 104k| { 1687| 104k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 104k, False: 0] ------------------ 1688| 104k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 21.2k, False: 83.0k] ------------------ 1689| 104k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 104k| } _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| 104k| { 1699| 104k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 104k| } _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| 104k| { 1718| 104k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 104k, False: 0] ------------------ 1719| 104k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 21.2k, False: 83.0k] | Branch (1719:9): [True: 104k, False: 0] ------------------ 1720| 104k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 104k| auto child = node_->inner()[offset_hint]; 1722| 104k| auto is_leaf = shift_ == BL; 1723| 104k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 104k| auto next_idx = idx - left_size_hint; 1725| 104k| return is_leaf ------------------ | Branch (1725:16): [True: 15.5k, False: 88.7k] ------------------ 1726| 104k| ? make_leaf_sub_pos(child, next_size) 1727| 15.5k| .visit(v, next_idx, args...) 1728| 104k| : visit_maybe_relaxed_sub( 1729| 88.7k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 104k| } _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| 15.5k| { 145| 15.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 15.5k| } _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| 88.7k|{ 1839| 88.7k| assert(node); ------------------ | Branch (1839:5): [True: 88.7k, False: 0] ------------------ 1840| 88.7k| auto relaxed = node->relaxed(); 1841| 88.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 87.2k, False: 1.48k] ------------------ 1842| 87.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 87.2k, False: 0] ------------------ 1843| 87.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 87.2k| .visit(v, std::forward(args)...); 1845| 87.2k| } else { 1846| 1.48k| return make_regular_sub_pos(node, shift, size) 1847| 1.48k| .visit(v, std::forward(args)...); 1848| 1.48k| } 1849| 88.7k|} _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| 87.2k| { 1814| 87.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 87.2k| } _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.48k| { 1037| 1.48k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.48k| } _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| 5.35k| { 939| 5.35k| return towards_oh_ch_regular( 940| 5.35k| *this, v, idx, offset_hint, count(), args...); 941| 5.35k| } _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| 5.35k|{ 633| 5.35k| constexpr auto B = bits; 634| 5.35k| constexpr auto BL = bits_leaf; 635| 5.35k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.35k, False: 0] ------------------ 636| 5.35k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.35k, False: 0] ------------------ 637| 5.35k| auto is_leaf = p.shift() == BL; 638| 5.35k| auto child = p.node()->inner()[offset_hint]; 639| 5.35k| auto is_full = offset_hint + 1 != count_hint; 640| 5.35k| return is_full ------------------ | Branch (640:12): [True: 2.29k, False: 3.06k] ------------------ 641| 5.35k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.14k, False: 1.14k] ------------------ 642| 2.29k| : make_full_pos(child, p.shift() - B) 643| 1.14k| .visit(v, idx, args...)) 644| 5.35k| : (is_leaf ------------------ | Branch (644:19): [True: 1.73k, False: 1.33k] ------------------ 645| 3.06k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.06k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.33k| .visit(v, idx, args...)); 648| 5.35k|} _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.97k| { 208| 2.97k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.97k| } _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.04k| { 1406| 2.04k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.04k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 1329| 2.04k| { 1330| 2.04k| return towards_oh(v, idx, offset_hint, args...); 1331| 2.04k| } _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.04k| { 1337| 2.04k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.04k, False: 0] ------------------ 1338| 2.04k| auto is_leaf = shift_ == BL; 1339| 2.04k| auto child = node_->inner()[offset_hint]; 1340| 2.04k| return is_leaf ------------------ | Branch (1340:16): [True: 1.40k, False: 645] ------------------ 1341| 2.04k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.04k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.04k| } _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| 2.37k| { 113| 2.37k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.37k| } _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.74k| { 337| 1.74k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.74k| } _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.74k| { 317| 1.74k| return towards_oh_ch_regular( 318| 1.74k| *this, v, idx, offset_hint, count(), args...); 319| 1.74k| } _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.74k|{ 633| 1.74k| constexpr auto B = bits; 634| 1.74k| constexpr auto BL = bits_leaf; 635| 1.74k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 1.74k, False: 0] ------------------ 636| 1.74k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 1.74k, False: 0] ------------------ 637| 1.74k| auto is_leaf = p.shift() == BL; 638| 1.74k| auto child = p.node()->inner()[offset_hint]; 639| 1.74k| auto is_full = offset_hint + 1 != count_hint; 640| 1.74k| return is_full ------------------ | Branch (640:12): [True: 688, False: 1.05k] ------------------ 641| 1.74k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 426, False: 262] ------------------ 642| 688| : make_full_pos(child, p.shift() - B) 643| 262| .visit(v, idx, args...)) 644| 1.74k| : (is_leaf ------------------ | Branch (644:19): [True: 646, False: 412] ------------------ 645| 1.05k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.05k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 412| .visit(v, idx, args...)); 648| 1.74k|} _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| 3.87k| { 1037| 3.87k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.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_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 47.0k|{ 1839| 47.0k| assert(node); ------------------ | Branch (1839:5): [True: 47.0k, False: 0] ------------------ 1840| 47.0k| auto relaxed = node->relaxed(); 1841| 47.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 34.7k, False: 12.3k] ------------------ 1842| 34.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 34.7k, False: 0] ------------------ 1843| 34.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 34.7k| .visit(v, std::forward(args)...); 1845| 34.7k| } else { 1846| 12.3k| return make_regular_sub_pos(node, shift, size) 1847| 12.3k| .visit(v, std::forward(args)...); 1848| 12.3k| } 1849| 47.0k|} _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| 34.7k| { 1814| 34.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 34.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 18.4k| { 1687| 18.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 18.4k, False: 0] ------------------ 1688| 18.4k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 18.4k] ------------------ 1689| 18.4k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 18.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 18.4k| { 1699| 18.4k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 18.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 18.4k| { 1718| 18.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 18.4k, False: 0] ------------------ 1719| 18.4k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 18.4k] | Branch (1719:9): [True: 18.4k, False: 0] ------------------ 1720| 18.4k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 18.4k| auto child = node_->inner()[offset_hint]; 1722| 18.4k| auto is_leaf = shift_ == BL; 1723| 18.4k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 18.4k| auto next_idx = idx - left_size_hint; 1725| 18.4k| return is_leaf ------------------ | Branch (1725:16): [True: 833, False: 17.6k] ------------------ 1726| 18.4k| ? make_leaf_sub_pos(child, next_size) 1727| 833| .visit(v, next_idx, args...) 1728| 18.4k| : visit_maybe_relaxed_sub( 1729| 17.6k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 18.4k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 833| { 145| 833| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 833| } _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| 14.5k| { 1687| 14.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 14.5k, False: 0] ------------------ 1688| 14.5k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 14.5k] ------------------ 1689| 14.5k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 14.5k| } _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| 14.5k| { 1699| 14.5k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 14.5k| } _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| 14.5k| { 1718| 14.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 14.5k, False: 0] ------------------ 1719| 14.5k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 14.5k] | Branch (1719:9): [True: 14.5k, False: 0] ------------------ 1720| 14.5k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 14.5k| auto child = node_->inner()[offset_hint]; 1722| 14.5k| auto is_leaf = shift_ == BL; 1723| 14.5k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 14.5k| auto next_idx = idx - left_size_hint; 1725| 14.5k| return is_leaf ------------------ | Branch (1725:16): [True: 843, False: 13.7k] ------------------ 1726| 14.5k| ? make_leaf_sub_pos(child, next_size) 1727| 843| .visit(v, next_idx, args...) 1728| 14.5k| : visit_maybe_relaxed_sub( 1729| 13.7k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 14.5k| } _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| 843| { 145| 843| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 843| } _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| 13.7k|{ 1839| 13.7k| assert(node); ------------------ | Branch (1839:5): [True: 13.7k, False: 0] ------------------ 1840| 13.7k| auto relaxed = node->relaxed(); 1841| 13.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.4k, False: 1.30k] ------------------ 1842| 12.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.4k, False: 0] ------------------ 1843| 12.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 12.4k| .visit(v, std::forward(args)...); 1845| 12.4k| } else { 1846| 1.30k| return make_regular_sub_pos(node, shift, size) 1847| 1.30k| .visit(v, std::forward(args)...); 1848| 1.30k| } 1849| 13.7k|} _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| 12.4k| { 1814| 12.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 12.4k| } _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.30k| { 1037| 1.30k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.30k| } _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.51k| { 928| 2.51k| return towards_oh_ch_regular( 929| 2.51k| *this, v, idx, offset_hint, count(), args...); 930| 2.51k| } _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.51k|{ 633| 2.51k| constexpr auto B = bits; 634| 2.51k| constexpr auto BL = bits_leaf; 635| 2.51k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.51k, False: 0] ------------------ 636| 2.51k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.51k, False: 0] ------------------ 637| 2.51k| auto is_leaf = p.shift() == BL; 638| 2.51k| auto child = p.node()->inner()[offset_hint]; 639| 2.51k| auto is_full = offset_hint + 1 != count_hint; 640| 2.51k| return is_full ------------------ | Branch (640:12): [True: 2.09k, False: 420] ------------------ 641| 2.51k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 770, False: 1.32k] ------------------ 642| 2.09k| : make_full_pos(child, p.shift() - B) 643| 1.32k| .visit(v, idx, args...)) 644| 2.51k| : (is_leaf ------------------ | Branch (644:19): [True: 420, False: 0] ------------------ 645| 420| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 420| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.51k|} _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.92k| { 208| 1.92k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.92k| } _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.60k| { 1406| 1.60k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.60k| } _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.43k| { 1337| 1.43k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.43k, False: 0] ------------------ 1338| 1.43k| auto is_leaf = shift_ == BL; 1339| 1.43k| auto child = node_->inner()[offset_hint]; 1340| 1.43k| return is_leaf ------------------ | Branch (1340:16): [True: 1.15k, False: 281] ------------------ 1341| 1.43k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.43k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.43k| } _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.32k| { 1337| 2.32k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.32k, False: 0] ------------------ 1338| 2.32k| auto is_leaf = shift_ == BL; 1339| 2.32k| auto child = node_->inner()[offset_hint]; 1340| 2.32k| return is_leaf ------------------ | Branch (1340:16): [True: 1.40k, False: 918] ------------------ 1341| 2.32k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.32k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.32k| } _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| 2.95k| { 208| 2.95k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.95k| } _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.61k| { 1406| 3.61k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.61k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 3.61k| { 1406| 3.61k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.61k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 8.99k| { 1337| 8.99k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 8.99k, False: 0] ------------------ 1338| 8.99k| auto is_leaf = shift_ == BL; 1339| 8.99k| auto child = node_->inner()[offset_hint]; 1340| 8.99k| return is_leaf ------------------ | Branch (1340:16): [True: 6.75k, False: 2.23k] ------------------ 1341| 8.99k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 8.99k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 8.99k| } _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| 9.83k| { 208| 9.83k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.83k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 5.01k| { 1406| 5.01k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.01k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 3.49k| { 1311| 3.49k| each_i(v, start, branches, args...); 1312| 3.49k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 3.49k| { 1264| 3.49k| auto p = node_->inner() + i; 1265| 3.49k| auto e = node_->inner() + n; 1266| 3.49k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 2.08k, False: 1.41k] ------------------ 1267| 14.2k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 12.1k, False: 2.08k] ------------------ 1268| 12.1k| IMMER_PREFETCH(p + 1); 1269| 12.1k| make_full_leaf_pos(*p).visit(v, args...); 1270| 12.1k| } 1271| 2.08k| } else { 1272| 1.41k| auto ss = shift_ - B; 1273| 10.7k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 9.37k, False: 1.41k] ------------------ 1274| 9.37k| make_full_pos(*p, ss).visit(v, args...); 1275| 1.41k| } 1276| 3.49k| } _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| 420| { 113| 420| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 420| } _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.36k| { 306| 2.36k| return towards_oh_ch_regular( 307| 2.36k| *this, v, idx, offset_hint, count(), args...); 308| 2.36k| } _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.36k|{ 633| 2.36k| constexpr auto B = bits; 634| 2.36k| constexpr auto BL = bits_leaf; 635| 2.36k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.36k, False: 0] ------------------ 636| 2.36k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.36k, False: 0] ------------------ 637| 2.36k| auto is_leaf = p.shift() == BL; 638| 2.36k| auto child = p.node()->inner()[offset_hint]; 639| 2.36k| auto is_full = offset_hint + 1 != count_hint; 640| 2.36k| return is_full ------------------ | Branch (640:12): [True: 1.45k, False: 908] ------------------ 641| 2.36k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 706, False: 750] ------------------ 642| 1.45k| : make_full_pos(child, p.shift() - B) 643| 750| .visit(v, idx, args...)) 644| 2.36k| : (is_leaf ------------------ | Branch (644:19): [True: 553, False: 355] ------------------ 645| 908| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 908| : make_regular_pos(child, p.shift() - B, p.size()) 647| 355| .visit(v, idx, args...)); 648| 2.36k|} _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.54k| { 113| 1.54k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.54k| } _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.27k| { 337| 3.27k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.27k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 1.05k| { 337| 1.05k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.05k| } _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.53k| { 306| 4.53k| return towards_oh_ch_regular( 307| 4.53k| *this, v, idx, offset_hint, count(), args...); 308| 4.53k| } _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.53k|{ 633| 4.53k| constexpr auto B = bits; 634| 4.53k| constexpr auto BL = bits_leaf; 635| 4.53k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.53k, False: 0] ------------------ 636| 4.53k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.53k, False: 0] ------------------ 637| 4.53k| auto is_leaf = p.shift() == BL; 638| 4.53k| auto child = p.node()->inner()[offset_hint]; 639| 4.53k| auto is_full = offset_hint + 1 != count_hint; 640| 4.53k| return is_full ------------------ | Branch (640:12): [True: 2.33k, False: 2.20k] ------------------ 641| 4.53k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.37k, False: 960] ------------------ 642| 2.33k| : make_full_pos(child, p.shift() - B) 643| 960| .visit(v, idx, args...)) 644| 4.53k| : (is_leaf ------------------ | Branch (644:19): [True: 1.47k, False: 723] ------------------ 645| 2.20k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.20k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 723| .visit(v, idx, args...)); 648| 4.53k|} _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.26k| { 113| 2.26k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.26k| } _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.62k| { 337| 3.62k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.62k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 2.36k| { 286| 2.36k| return each_right_regular(*this, v, start, args...); 287| 2.36k| } _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.36k|{ 598| 2.36k| constexpr auto B = bits; 599| 2.36k| constexpr auto BL = bits_leaf; 600| | 601| 2.36k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 1.25k, False: 1.10k] ------------------ 602| 1.25k| auto n = p.node()->inner() + start; 603| 1.25k| auto last = p.count() - 1; 604| 1.25k| auto e = p.node()->inner() + last; 605| 1.25k| if (n <= e) { ------------------ | Branch (605:13): [True: 706, False: 553] ------------------ 606| 2.60k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.89k, False: 706] ------------------ 607| 1.89k| IMMER_PREFETCH(n + 1); 608| 1.89k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.89k| } 610| 706| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 706| } 612| 1.25k| } else { 613| 1.10k| auto n = p.node()->inner() + start; 614| 1.10k| auto last = p.count() - 1; 615| 1.10k| auto e = p.node()->inner() + last; 616| 1.10k| auto ss = p.shift() - B; 617| 1.10k| if (n <= e) { ------------------ | Branch (617:13): [True: 750, False: 355] ------------------ 618| 1.97k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.22k, False: 750] ------------------ 619| 1.22k| make_full_pos(*n, ss).visit(v, args...); 620| 750| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 750| } 622| 1.10k| } 623| 2.36k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 6.70k| { 928| 6.70k| return towards_oh_ch_regular( 929| 6.70k| *this, v, idx, offset_hint, count(), args...); 930| 6.70k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 6.70k|{ 633| 6.70k| constexpr auto B = bits; 634| 6.70k| constexpr auto BL = bits_leaf; 635| 6.70k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.70k, False: 0] ------------------ 636| 6.70k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.70k, False: 0] ------------------ 637| 6.70k| auto is_leaf = p.shift() == BL; 638| 6.70k| auto child = p.node()->inner()[offset_hint]; 639| 6.70k| auto is_full = offset_hint + 1 != count_hint; 640| 6.70k| return is_full ------------------ | Branch (640:12): [True: 2.79k, False: 3.91k] ------------------ 641| 6.70k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 841, False: 1.95k] ------------------ 642| 2.79k| : make_full_pos(child, p.shift() - B) 643| 1.95k| .visit(v, idx, args...)) 644| 6.70k| : (is_leaf ------------------ | Branch (644:19): [True: 989, False: 2.92k] ------------------ 645| 3.91k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.91k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.92k| .visit(v, idx, args...)); 648| 6.70k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 7.20k| { 928| 7.20k| return towards_oh_ch_regular( 929| 7.20k| *this, v, idx, offset_hint, count(), args...); 930| 7.20k| } _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.20k|{ 633| 7.20k| constexpr auto B = bits; 634| 7.20k| constexpr auto BL = bits_leaf; 635| 7.20k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.20k, False: 0] ------------------ 636| 7.20k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.20k, False: 0] ------------------ 637| 7.20k| auto is_leaf = p.shift() == BL; 638| 7.20k| auto child = p.node()->inner()[offset_hint]; 639| 7.20k| auto is_full = offset_hint + 1 != count_hint; 640| 7.20k| return is_full ------------------ | Branch (640:12): [True: 3.52k, False: 3.68k] ------------------ 641| 7.20k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.70k, False: 1.82k] ------------------ 642| 3.52k| : make_full_pos(child, p.shift() - B) 643| 1.82k| .visit(v, idx, args...)) 644| 7.20k| : (is_leaf ------------------ | Branch (644:19): [True: 786, False: 2.89k] ------------------ 645| 3.68k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.68k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.89k| .visit(v, idx, args...)); 648| 7.20k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 867| 11.6k| { 868| 11.6k| return each_right_regular(*this, v, start, args...); 869| 11.6k| } _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| 11.6k|{ 598| 11.6k| constexpr auto B = bits; 599| 11.6k| constexpr auto BL = bits_leaf; 600| | 601| 11.6k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 3.54k, False: 8.06k] ------------------ 602| 3.54k| auto n = p.node()->inner() + start; 603| 3.54k| auto last = p.count() - 1; 604| 3.54k| auto e = p.node()->inner() + last; 605| 3.54k| if (n <= e) { ------------------ | Branch (605:13): [True: 1.80k, False: 1.73k] ------------------ 606| 4.27k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 2.46k, False: 1.80k] ------------------ 607| 2.46k| IMMER_PREFETCH(n + 1); 608| 2.46k| make_full_leaf_pos(*n).visit(v, args...); 609| 2.46k| } 610| 1.80k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 1.80k| } 612| 8.06k| } else { 613| 8.06k| auto n = p.node()->inner() + start; 614| 8.06k| auto last = p.count() - 1; 615| 8.06k| auto e = p.node()->inner() + last; 616| 8.06k| auto ss = p.shift() - B; 617| 8.06k| if (n <= e) { ------------------ | Branch (617:13): [True: 5.14k, False: 2.92k] ------------------ 618| 6.28k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.14k, False: 5.14k] ------------------ 619| 1.14k| make_full_pos(*n, ss).visit(v, args...); 620| 5.14k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 5.14k| } 622| 8.06k| } 623| 11.6k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 24.8k| { 1814| 24.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 24.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 9.05k| { 1687| 9.05k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 9.05k, False: 0] ------------------ 1688| 9.05k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 8.63k, False: 424] ------------------ 1689| 9.05k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 9.05k| } _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.05k| { 1699| 9.05k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 9.05k| } _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.05k| { 1718| 9.05k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 9.05k, False: 0] ------------------ 1719| 9.05k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 8.63k, False: 424] | Branch (1719:9): [True: 9.05k, False: 0] ------------------ 1720| 9.05k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 9.05k| auto child = node_->inner()[offset_hint]; 1722| 9.05k| auto is_leaf = shift_ == BL; 1723| 9.05k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 9.05k| auto next_idx = idx - left_size_hint; 1725| 9.05k| return is_leaf ------------------ | Branch (1725:16): [True: 1.83k, False: 7.22k] ------------------ 1726| 9.05k| ? make_leaf_sub_pos(child, next_size) 1727| 1.83k| .visit(v, next_idx, args...) 1728| 9.05k| : visit_maybe_relaxed_sub( 1729| 7.22k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 9.05k| } _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.83k| { 145| 1.83k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.83k| } _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.22k|{ 1839| 7.22k| assert(node); ------------------ | Branch (1839:5): [True: 7.22k, False: 0] ------------------ 1840| 7.22k| auto relaxed = node->relaxed(); 1841| 7.22k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.80k, False: 4.41k] ------------------ 1842| 2.80k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.80k, False: 0] ------------------ 1843| 2.80k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.80k| .visit(v, std::forward(args)...); 1845| 4.41k| } else { 1846| 4.41k| return make_regular_sub_pos(node, shift, size) 1847| 4.41k| .visit(v, std::forward(args)...); 1848| 4.41k| } 1849| 7.22k|} _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.80k| { 1814| 2.80k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.80k| } _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.41k| { 1037| 4.41k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.41k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1036| 9.96k| { 1037| 9.96k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 9.96k| } _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.5k| { 1687| 11.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 11.5k, False: 0] ------------------ 1688| 11.5k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.66k, False: 1.89k] ------------------ 1689| 11.5k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 11.5k| } _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.5k| { 1699| 11.5k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 11.5k| } _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.5k| { 1718| 11.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 11.5k, False: 0] ------------------ 1719| 11.5k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.66k, False: 1.89k] | Branch (1719:9): [True: 11.5k, False: 0] ------------------ 1720| 11.5k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 11.5k| auto child = node_->inner()[offset_hint]; 1722| 11.5k| auto is_leaf = shift_ == BL; 1723| 11.5k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 11.5k| auto next_idx = idx - left_size_hint; 1725| 11.5k| return is_leaf ------------------ | Branch (1725:16): [True: 4.58k, False: 6.97k] ------------------ 1726| 11.5k| ? make_leaf_sub_pos(child, next_size) 1727| 4.58k| .visit(v, next_idx, args...) 1728| 11.5k| : visit_maybe_relaxed_sub( 1729| 6.97k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 11.5k| } _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.58k| { 145| 4.58k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.58k| } _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.97k|{ 1839| 6.97k| assert(node); ------------------ | Branch (1839:5): [True: 6.97k, False: 0] ------------------ 1840| 6.97k| auto relaxed = node->relaxed(); 1841| 6.97k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.68k, False: 3.28k] ------------------ 1842| 3.68k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.68k, False: 0] ------------------ 1843| 3.68k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.68k| .visit(v, std::forward(args)...); 1845| 3.68k| } else { 1846| 3.28k| return make_regular_sub_pos(node, shift, size) 1847| 3.28k| .visit(v, std::forward(args)...); 1848| 3.28k| } 1849| 6.97k|} _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.68k| { 1814| 3.68k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.68k| } _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.28k| { 1037| 3.28k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.28k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 27.5k| { 1654| 27.5k| assert(start > 0); ------------------ | Branch (1654:9): [True: 27.5k, False: 0] ------------------ 1655| 27.5k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 27.5k, False: 0] ------------------ 1656| 27.5k| auto s = relaxed_->d.sizes[start - 1]; 1657| 27.5k| auto p = node_->inner(); 1658| 27.5k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 2.66k, False: 24.8k] ------------------ 1659| 8.82k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 6.16k, False: 2.66k] ------------------ 1660| 6.16k| IMMER_PREFETCH(p + i + 1); 1661| 6.16k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 6.16k| .visit(v, args...); 1663| 6.16k| s = relaxed_->d.sizes[i]; 1664| 6.16k| assert(s); ------------------ | Branch (1664:17): [True: 6.16k, False: 0] ------------------ 1665| 6.16k| } 1666| 24.8k| } else { 1667| 24.8k| auto ss = shift_ - B; 1668| 143k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 118k, False: 24.8k] ------------------ 1669| 118k| visit_maybe_relaxed_sub( 1670| 118k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 118k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 118k, False: 0] ------------------ 1673| 118k| } 1674| 24.8k| } 1675| 27.5k| } _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.3k| { 1037| 12.3k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 12.3k| } _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| 4.90k| { 928| 4.90k| return towards_oh_ch_regular( 929| 4.90k| *this, v, idx, offset_hint, count(), args...); 930| 4.90k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 4.90k|{ 633| 4.90k| constexpr auto B = bits; 634| 4.90k| constexpr auto BL = bits_leaf; 635| 4.90k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.90k, False: 0] ------------------ 636| 4.90k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.90k, False: 0] ------------------ 637| 4.90k| auto is_leaf = p.shift() == BL; 638| 4.90k| auto child = p.node()->inner()[offset_hint]; 639| 4.90k| auto is_full = offset_hint + 1 != count_hint; 640| 4.90k| return is_full ------------------ | Branch (640:12): [True: 4.15k, False: 747] ------------------ 641| 4.90k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 967, False: 3.19k] ------------------ 642| 4.15k| : make_full_pos(child, p.shift() - B) 643| 3.19k| .visit(v, idx, args...)) 644| 4.90k| : (is_leaf ------------------ | Branch (644:19): [True: 747, False: 0] ------------------ 645| 747| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 747| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 4.90k|} _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.64k| { 208| 1.64k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.64k| } _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.68k| { 1406| 3.68k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.68k| } _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.17k| { 1337| 1.17k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.17k, False: 0] ------------------ 1338| 1.17k| auto is_leaf = shift_ == BL; 1339| 1.17k| auto child = node_->inner()[offset_hint]; 1340| 1.17k| return is_leaf ------------------ | Branch (1340:16): [True: 678, False: 493] ------------------ 1341| 1.17k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.17k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.17k| } _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| 747| { 113| 747| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 747| } _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| 875| { 145| 875| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 875| } _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| 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: 49.0k, False: 2.43k] ------------------ 1842| 49.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 49.0k, False: 0] ------------------ 1843| 49.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 49.0k| .visit(v, std::forward(args)...); 1845| 49.0k| } else { 1846| 2.43k| return make_regular_sub_pos(node, shift, size) 1847| 2.43k| .visit(v, std::forward(args)...); 1848| 2.43k| } 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_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 49.0k| { 1814| 49.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 49.0k| } _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.83k| { 1706| 1.83k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 1.83k, False: 0] ------------------ 1707| 1.83k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 1.40k, False: 429] ------------------ 1708| 1.83k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 1.83k| } _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.83k| { 1718| 1.83k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 1.83k, False: 0] ------------------ 1719| 1.83k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 1.40k, False: 429] | Branch (1719:9): [True: 1.83k, False: 0] ------------------ 1720| 1.83k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 1.83k| auto child = node_->inner()[offset_hint]; 1722| 1.83k| auto is_leaf = shift_ == BL; 1723| 1.83k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 1.83k| auto next_idx = idx - left_size_hint; 1725| 1.83k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 1.83k] ------------------ 1726| 1.83k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 1.83k| : visit_maybe_relaxed_sub( 1729| 1.83k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 1.83k| } _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.53k| { 1706| 3.53k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.53k, False: 0] ------------------ 1707| 3.53k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.01k, False: 514] ------------------ 1708| 3.53k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.53k| } _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.53k| { 1718| 3.53k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.53k, False: 0] ------------------ 1719| 3.53k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.01k, False: 514] | Branch (1719:9): [True: 3.53k, False: 0] ------------------ 1720| 3.53k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.53k| auto child = node_->inner()[offset_hint]; 1722| 3.53k| auto is_leaf = shift_ == BL; 1723| 3.53k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.53k| auto next_idx = idx - left_size_hint; 1725| 3.53k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.53k] ------------------ 1726| 3.53k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.53k| : visit_maybe_relaxed_sub( 1729| 3.53k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.53k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 3.53k|{ 1839| 3.53k| assert(node); ------------------ | Branch (1839:5): [True: 3.53k, False: 0] ------------------ 1840| 3.53k| auto relaxed = node->relaxed(); 1841| 3.53k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.24k, False: 1.29k] ------------------ 1842| 2.24k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.24k, False: 0] ------------------ 1843| 2.24k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.24k| .visit(v, std::forward(args)...); 1845| 2.24k| } 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.53k|} _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.24k| { 1814| 2.24k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.24k| } _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.37k| { 947| 1.37k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 1.37k| } _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.37k|{ 654| 1.37k| constexpr auto B = bits; 655| 1.37k| constexpr auto BL = bits_leaf; 656| 1.37k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 1.37k, False: 0] ------------------ 657| 1.37k| auto is_leaf = p.shift() == BL; 658| 1.37k| auto child = p.node()->inner()[offset_hint]; 659| 1.37k| auto lsize = offset_hint << p.shift(); 660| 1.37k| auto size = p.this_size(); 661| 1.37k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 1.37k| return is_full ------------------ | Branch (662:12): [True: 629, False: 743] ------------------ 663| 1.37k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 629] ------------------ 664| 629| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 629| : make_full_pos(child, p.shift() - B) 666| 629| .visit(v, idx - lsize, args...)) 667| 1.37k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 743] ------------------ 668| 743| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 743| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 743| .visit(v, idx - lsize, args...)); 672| 1.37k|} _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| 629| { 1406| 629| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 629| } _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.12k| { 1349| 2.12k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 2.12k, False: 0] ------------------ 1350| 2.12k| auto is_leaf = shift_ == BL; 1351| 2.12k| auto child = node_->inner()[offset_hint]; 1352| 2.12k| auto lsize = size_t{offset_hint} << shift_; 1353| 2.12k| return is_leaf ------------------ | Branch (1353:16): [True: 1.65k, False: 473] ------------------ 1354| 2.12k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 2.12k| : make_full_pos(child, shift_ - B) 1356| 473| .visit(v, idx - lsize, args...); 1357| 2.12k| } _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| 6.68k| { 208| 6.68k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.68k| } _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.49k| { 1406| 1.49k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.49k| } _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| 743| { 1037| 743| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 743| } _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| 6.05k| { 947| 6.05k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 6.05k| } _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| 6.05k|{ 654| 6.05k| constexpr auto B = bits; 655| 6.05k| constexpr auto BL = bits_leaf; 656| 6.05k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 6.05k, False: 0] ------------------ 657| 6.05k| auto is_leaf = p.shift() == BL; 658| 6.05k| auto child = p.node()->inner()[offset_hint]; 659| 6.05k| auto lsize = offset_hint << p.shift(); 660| 6.05k| auto size = p.this_size(); 661| 6.05k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 6.05k| return is_full ------------------ | Branch (662:12): [True: 6.05k, False: 0] ------------------ 663| 6.05k| ? (is_leaf ------------------ | Branch (663:19): [True: 5.02k, False: 1.02k] ------------------ 664| 6.05k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 6.05k| : make_full_pos(child, p.shift() - B) 666| 1.02k| .visit(v, idx - lsize, args...)) 667| 6.05k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 6.05k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 1.83k| { 1814| 1.83k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.83k| } _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| 164k| { 1706| 164k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 164k, False: 0] ------------------ 1707| 164k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 38.1k, False: 125k] ------------------ 1708| 164k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 164k| } _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| 164k| { 1718| 164k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 164k, False: 0] ------------------ 1719| 164k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 38.1k, False: 125k] | Branch (1719:9): [True: 164k, False: 0] ------------------ 1720| 164k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 164k| auto child = node_->inner()[offset_hint]; 1722| 164k| auto is_leaf = shift_ == BL; 1723| 164k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 164k| auto next_idx = idx - left_size_hint; 1725| 164k| return is_leaf ------------------ | Branch (1725:16): [True: 4.09k, False: 160k] ------------------ 1726| 164k| ? make_leaf_sub_pos(child, next_size) 1727| 4.09k| .visit(v, next_idx, args...) 1728| 164k| : visit_maybe_relaxed_sub( 1729| 160k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 164k| } _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.09k| { 145| 4.09k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.09k| } _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| 160k|{ 1839| 160k| assert(node); ------------------ | Branch (1839:5): [True: 160k, False: 0] ------------------ 1840| 160k| auto relaxed = node->relaxed(); 1841| 160k| if (relaxed) { ------------------ | Branch (1841:9): [True: 158k, False: 1.31k] ------------------ 1842| 158k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 158k, False: 0] ------------------ 1843| 158k| return make_relaxed_pos(node, shift, relaxed) 1844| 158k| .visit(v, std::forward(args)...); 1845| 158k| } else { 1846| 1.31k| return make_regular_sub_pos(node, shift, size) 1847| 1.31k| .visit(v, std::forward(args)...); 1848| 1.31k| } 1849| 160k|} _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| 158k| { 1814| 158k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 158k| } _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.31k| { 1037| 1.31k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.31k| } _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| 83.3k| { 1706| 83.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 83.3k, False: 0] ------------------ 1707| 83.3k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 51.1k, False: 32.2k] ------------------ 1708| 83.3k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 83.3k| } _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| 83.3k| { 1718| 83.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 83.3k, False: 0] ------------------ 1719| 83.3k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 51.1k, False: 32.2k] | Branch (1719:9): [True: 83.3k, False: 0] ------------------ 1720| 83.3k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 83.3k| auto child = node_->inner()[offset_hint]; 1722| 83.3k| auto is_leaf = shift_ == BL; 1723| 83.3k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 83.3k| auto next_idx = idx - left_size_hint; 1725| 83.3k| return is_leaf ------------------ | Branch (1725:16): [True: 38.8k, False: 44.5k] ------------------ 1726| 83.3k| ? make_leaf_sub_pos(child, next_size) 1727| 38.8k| .visit(v, next_idx, args...) 1728| 83.3k| : visit_maybe_relaxed_sub( 1729| 44.5k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 83.3k| } _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| 38.8k| { 145| 38.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 38.8k| } _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| 44.5k|{ 1839| 44.5k| assert(node); ------------------ | Branch (1839:5): [True: 44.5k, False: 0] ------------------ 1840| 44.5k| auto relaxed = node->relaxed(); 1841| 44.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 42.9k, False: 1.64k] ------------------ 1842| 42.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 42.9k, False: 0] ------------------ 1843| 42.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 42.9k| .visit(v, std::forward(args)...); 1845| 42.9k| } else { 1846| 1.64k| return make_regular_sub_pos(node, shift, size) 1847| 1.64k| .visit(v, std::forward(args)...); 1848| 1.64k| } 1849| 44.5k|} _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| 42.9k| { 1814| 42.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 42.9k| } _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| 1.64k| { 1037| 1.64k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.64k| } _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.43k| { 1037| 2.43k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.43k| } _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.1k|{ 1839| 21.1k| assert(node); ------------------ | Branch (1839:5): [True: 21.1k, False: 0] ------------------ 1840| 21.1k| auto relaxed = node->relaxed(); 1841| 21.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.5k, False: 8.61k] ------------------ 1842| 12.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.5k, False: 0] ------------------ 1843| 12.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 12.5k| .visit(v, std::forward(args)...); 1845| 12.5k| } else { 1846| 8.61k| return make_regular_sub_pos(node, shift, size) 1847| 8.61k| .visit(v, std::forward(args)...); 1848| 8.61k| } 1849| 21.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcT_DpOT0_: 1813| 12.5k| { 1814| 12.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 12.5k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcPT_jmT0_DpOT1_: 1838| 12.5k|{ 1839| 12.5k| assert(node); ------------------ | Branch (1839:5): [True: 12.5k, False: 0] ------------------ 1840| 12.5k| auto relaxed = node->relaxed(); 1841| 12.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.42k, False: 3.14k] ------------------ 1842| 9.42k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.42k, False: 0] ------------------ 1843| 9.42k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.42k| .visit(v, std::forward(args)...); 1845| 9.42k| } else { 1846| 3.14k| return make_regular_sub_pos(node, shift, size) 1847| 3.14k| .visit(v, std::forward(args)...); 1848| 3.14k| } 1849| 12.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1813| 9.42k| { 1814| 9.42k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 9.42k| } _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| 51.7k| { 1794| 51.7k| auto child = node_->inner()[offset]; 1795| 51.7k| auto child_size = size(offset); 1796| 51.7k| auto is_leaf = shift_ == BL; 1797| 51.7k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 24.2k, False: 27.5k] ------------------ 1798| 51.7k| : visit_maybe_relaxed_sub( 1799| 27.5k| child, shift_ - B, child_size, v, args...); 1800| 51.7k| } _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| 24.8k| { 145| 24.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 24.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| 24.8k| { 1805| 24.8k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 24.8k, False: 0] ------------------ 1806| 24.8k| auto child = node_->inner()[offset]; 1807| 24.8k| auto child_size = size(offset); 1808| 24.8k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 24.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| 25.4k| { 145| 25.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 25.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| 27.5k|{ 1839| 27.5k| assert(node); ------------------ | Branch (1839:5): [True: 27.5k, False: 0] ------------------ 1840| 27.5k| auto relaxed = node->relaxed(); 1841| 27.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 24.0k, False: 3.51k] ------------------ 1842| 24.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 24.0k, False: 0] ------------------ 1843| 24.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 24.0k| .visit(v, std::forward(args)...); 1845| 24.0k| } else { 1846| 3.51k| return make_regular_sub_pos(node, shift, size) 1847| 3.51k| .visit(v, std::forward(args)...); 1848| 3.51k| } 1849| 27.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 24.0k| { 1814| 24.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 24.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 24.0k| { 1794| 24.0k| auto child = node_->inner()[offset]; 1795| 24.0k| auto child_size = size(offset); 1796| 24.0k| auto is_leaf = shift_ == BL; 1797| 24.0k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 24.0k] ------------------ 1798| 24.0k| : visit_maybe_relaxed_sub( 1799| 24.0k| child, shift_ - B, child_size, v, args...); 1800| 24.0k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 24.0k|{ 1839| 24.0k| assert(node); ------------------ | Branch (1839:5): [True: 24.0k, False: 0] ------------------ 1840| 24.0k| auto relaxed = node->relaxed(); 1841| 24.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 23.2k, False: 808] ------------------ 1842| 23.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 23.2k, False: 0] ------------------ 1843| 23.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 23.2k| .visit(v, std::forward(args)...); 1845| 23.2k| } else { 1846| 808| return make_regular_sub_pos(node, shift, size) 1847| 808| .visit(v, std::forward(args)...); 1848| 808| } 1849| 24.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 23.2k| { 1814| 23.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 23.2k| } _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.13k| { 1037| 1.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.13k| } _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.08k| { 1794| 8.08k| auto child = node_->inner()[offset]; 1795| 8.08k| auto child_size = size(offset); 1796| 8.08k| auto is_leaf = shift_ == BL; 1797| 8.08k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 5.07k, False: 3.00k] ------------------ 1798| 8.08k| : visit_maybe_relaxed_sub( 1799| 3.00k| child, shift_ - B, child_size, v, args...); 1800| 8.08k| } _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.07k| { 145| 5.07k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.07k| } _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.07k| { 1026| 5.07k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 5.07k, False: 0] ------------------ 1027| 5.07k| auto child = node_->inner()[idx]; 1028| 5.07k| auto lsize = size(idx); 1029| 5.07k| auto is_full = idx + 1 < count(); 1030| 5.07k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 4.39k, False: 686] ------------------ 1031| 5.07k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 5.07k| } _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.5k| { 208| 11.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 11.5k| } _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| 3.00k|{ 1839| 3.00k| assert(node); ------------------ | Branch (1839:5): [True: 3.00k, False: 0] ------------------ 1840| 3.00k| auto relaxed = node->relaxed(); 1841| 3.00k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.10k, False: 897] ------------------ 1842| 2.10k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.10k, False: 0] ------------------ 1843| 2.10k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.10k| .visit(v, std::forward(args)...); 1845| 2.10k| } else { 1846| 897| return make_regular_sub_pos(node, shift, size) 1847| 897| .visit(v, std::forward(args)...); 1848| 897| } 1849| 3.00k|} _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.10k| { 1814| 2.10k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.10k| } _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.10k| { 1008| 2.10k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.10k, False: 0] ------------------ 1009| 2.10k| auto is_leaf = shift_ == BL; 1010| 2.10k| auto child = node_->inner()[idx]; 1011| 2.10k| auto lsize = size(idx); 1012| 2.10k| auto is_full = idx + 1 < count(); 1013| 2.10k| return is_full ------------------ | Branch (1013:16): [True: 1.78k, False: 324] ------------------ 1014| 2.10k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.78k] ------------------ 1015| 1.78k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.78k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.10k| : (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.10k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1405| 2.23k| { 1406| 2.23k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.23k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 8.43k| { 1794| 8.43k| auto child = node_->inner()[offset]; 1795| 8.43k| auto child_size = size(offset); 1796| 8.43k| auto is_leaf = shift_ == BL; 1797| 8.43k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 7.15k, False: 1.27k] ------------------ 1798| 8.43k| : visit_maybe_relaxed_sub( 1799| 1.27k| child, shift_ - B, child_size, v, args...); 1800| 8.43k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 7.15k| { 145| 7.15k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.15k| } _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.15k| { 1397| 7.15k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 7.15k, False: 0] ------------------ 1398| 7.15k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 7.15k, False: 0] ------------------ 1399| 7.15k| auto child = node_->inner()[idx]; 1400| 7.15k| return make_full_leaf_pos(child).visit(v, args...); 1401| 7.15k| } _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.27k|{ 1839| 1.27k| assert(node); ------------------ | Branch (1839:5): [True: 1.27k, False: 0] ------------------ 1840| 1.27k| auto relaxed = node->relaxed(); 1841| 1.27k| if (relaxed) { ------------------ | Branch (1841:9): [True: 452, False: 825] ------------------ 1842| 452| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 452, False: 0] ------------------ 1843| 452| return make_relaxed_pos(node, shift, relaxed) 1844| 452| .visit(v, std::forward(args)...); 1845| 825| } else { 1846| 825| return make_regular_sub_pos(node, shift, size) 1847| 825| .visit(v, std::forward(args)...); 1848| 825| } 1849| 1.27k|} _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| 452| { 1814| 452| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 452| } _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| 452| { 1387| 452| assert(idx < count()); ------------------ | Branch (1387:9): [True: 452, False: 0] ------------------ 1388| 452| auto is_leaf = shift_ == BL; 1389| 452| auto child = node_->inner()[idx]; 1390| 452| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 452] ------------------ 1391| 452| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 452| } _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| 825| { 1037| 825| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 825| } _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| 825| { 1387| 825| assert(idx < count()); ------------------ | Branch (1387:9): [True: 825, False: 0] ------------------ 1388| 825| auto is_leaf = shift_ == BL; 1389| 825| auto child = node_->inner()[idx]; 1390| 825| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 825] ------------------ 1391| 825| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 825| } _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.72k| { 1406| 1.72k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.72k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 1222| 3.57k| { 1223| 3.57k| auto p = node_->inner(); 1224| 3.57k| auto p2 = other->inner(); 1225| 3.57k| auto e = p + branches; 1226| 3.57k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 2.71k, False: 862] ------------------ 1227| 18.0k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 16.5k, False: 1.50k] ------------------ 1228| 16.5k| IMMER_PREFETCH(p + 1); 1229| 16.5k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 1.21k, False: 15.3k] ------------------ 1230| 1.21k| return false; 1231| 16.5k| } 1232| 2.71k| } else { 1233| 862| auto ss = shift_ - B; 1234| 5.89k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 5.28k, False: 602] ------------------ 1235| 5.28k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 260, False: 5.02k] ------------------ 1236| 260| return false; 1237| 862| } 1238| 2.10k| return true; 1239| 3.57k| } _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.2k| { 208| 24.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 24.2k| } _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.31k| { 838| 5.31k| return each_pred_zip_regular(*this, v, other, args...); 839| 5.31k| } _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.31k|{ 393| 5.31k| constexpr auto B = bits; 394| 5.31k| constexpr auto BL = bits_leaf; 395| | 396| 5.31k| auto n = p.node()->inner(); 397| 5.31k| auto n2 = other->inner(); 398| 5.31k| auto last = p.count() - 1; 399| 5.31k| auto e = n + last; 400| 5.31k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.16k, False: 3.15k] ------------------ 401| 6.25k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 4.93k, False: 1.31k] ------------------ 402| 4.93k| IMMER_PREFETCH(n + 1); 403| 4.93k| IMMER_PREFETCH(n2 + 1); 404| 4.93k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 841, False: 4.09k] ------------------ 405| 841| return false; 406| 4.93k| } 407| 1.31k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 3.15k| } else { 409| 3.15k| auto ss = p.shift() - B; 410| 7.01k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 4.46k, False: 2.55k] ------------------ 411| 4.46k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 606, False: 3.85k] ------------------ 412| 606| return false; 413| 2.55k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 3.15k| } 415| 5.31k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 3.13k| { 113| 3.13k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 3.13k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 3.22k| { 337| 3.22k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.22k| } _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.94k| { 256| 2.94k| return each_pred_zip_regular(*this, v, other, args...); 257| 2.94k| } _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.94k|{ 393| 2.94k| constexpr auto B = bits; 394| 2.94k| constexpr auto BL = bits_leaf; 395| | 396| 2.94k| auto n = p.node()->inner(); 397| 2.94k| auto n2 = other->inner(); 398| 2.94k| auto last = p.count() - 1; 399| 2.94k| auto e = n + last; 400| 2.94k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.05k, False: 892] ------------------ 401| 4.51k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 2.69k, False: 1.82k] ------------------ 402| 2.69k| IMMER_PREFETCH(n + 1); 403| 2.69k| IMMER_PREFETCH(n2 + 1); 404| 2.69k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 230, False: 2.46k] ------------------ 405| 230| return false; 406| 2.69k| } 407| 1.82k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 2.05k| } else { 409| 892| auto ss = p.shift() - B; 410| 1.69k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 1.01k, False: 674] ------------------ 411| 1.01k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 218, False: 799] ------------------ 412| 218| return false; 413| 674| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 892| } 415| 2.94k|} _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.82k| { 1387| 5.82k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 5.82k, False: 0] ------------------ 1388| 5.82k| auto is_leaf = shift_ == BL; 1389| 5.82k| auto child = node_->inner()[idx]; 1390| 5.82k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 5.10k, False: 728] ------------------ 1391| 5.82k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 5.82k| } _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| 181k| { 208| 181k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 181k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_18region_for_visitorIiEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 5.01M|{ 1839| 5.01M| assert(node); ------------------ | Branch (1839:5): [True: 5.01M, False: 0] ------------------ 1840| 5.01M| auto relaxed = node->relaxed(); 1841| 5.01M| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.80M, False: 211k] ------------------ 1842| 4.80M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.80M, False: 0] ------------------ 1843| 4.80M| return make_relaxed_pos(node, shift, relaxed) 1844| 4.80M| .visit(v, std::forward(args)...); 1845| 4.80M| } else { 1846| 211k| return make_regular_sub_pos(node, shift, size) 1847| 211k| .visit(v, std::forward(args)...); 1848| 211k| } 1849| 5.01M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 4.80M| { 1814| 4.80M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.80M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 4.80M| { 1680| 4.80M| return towards_oh(v, idx, subindex(idx), args...); 1681| 4.80M| } _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.80M| { 1687| 4.80M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 4.80M, False: 0] ------------------ 1688| 4.80M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 3.36M, False: 1.44M] ------------------ 1689| 4.80M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 4.80M| } _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.80M| { 1699| 4.80M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 4.80M| } _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.80M| { 1718| 4.80M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.80M, False: 0] ------------------ 1719| 4.80M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.36M, False: 1.44M] | Branch (1719:9): [True: 4.80M, False: 0] ------------------ 1720| 4.80M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.80M| auto child = node_->inner()[offset_hint]; 1722| 4.80M| auto is_leaf = shift_ == BL; 1723| 4.80M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.80M| auto next_idx = idx - left_size_hint; 1725| 4.80M| return is_leaf ------------------ | Branch (1725:16): [True: 1.06M, False: 3.73M] ------------------ 1726| 4.80M| ? make_leaf_sub_pos(child, next_size) 1727| 1.06M| .visit(v, next_idx, args...) 1728| 4.80M| : visit_maybe_relaxed_sub( 1729| 3.73M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.80M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 144| 1.06M| { 145| 1.06M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.06M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 211k| { 1037| 211k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 211k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 211k| { 920| 211k| return towards_oh_ch_regular( 921| 211k| *this, v, idx, index(idx), count(), args...); 922| 211k| } _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| 211k|{ 633| 211k| constexpr auto B = bits; 634| 211k| constexpr auto BL = bits_leaf; 635| 211k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 211k, False: 0] ------------------ 636| 211k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 211k, False: 0] ------------------ 637| 211k| auto is_leaf = p.shift() == BL; 638| 211k| auto child = p.node()->inner()[offset_hint]; 639| 211k| auto is_full = offset_hint + 1 != count_hint; 640| 211k| return is_full ------------------ | Branch (640:12): [True: 173k, False: 37.7k] ------------------ 641| 211k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 69.0k, False: 104k] ------------------ 642| 173k| : make_full_pos(child, p.shift() - B) 643| 104k| .visit(v, idx, args...)) 644| 211k| : (is_leaf ------------------ | Branch (644:19): [True: 13.3k, False: 24.4k] ------------------ 645| 37.7k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 37.7k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 24.4k| .visit(v, idx, args...)); 648| 211k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 194k| { 208| 194k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 194k| } _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: 101k] ------------------ 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.8k| { 337| 26.8k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 26.8k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 26.8k| { 298| 26.8k| return towards_oh_ch_regular( 299| 26.8k| *this, v, idx, index(idx), count(), args...); 300| 26.8k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_18region_for_visitorIiEEJEEEDcOT_T0_mjjDpOT1_: 632| 26.8k|{ 633| 26.8k| constexpr auto B = bits; 634| 26.8k| constexpr auto BL = bits_leaf; 635| 26.8k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 26.8k, False: 0] ------------------ 636| 26.8k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 26.8k, False: 0] ------------------ 637| 26.8k| auto is_leaf = p.shift() == BL; 638| 26.8k| auto child = p.node()->inner()[offset_hint]; 639| 26.8k| auto is_full = offset_hint + 1 != count_hint; 640| 26.8k| return is_full ------------------ | Branch (640:12): [True: 20.7k, False: 6.03k] ------------------ 641| 26.8k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 5.84k, False: 14.9k] ------------------ 642| 20.7k| : make_full_pos(child, p.shift() - B) 643| 14.9k| .visit(v, idx, args...)) 644| 26.8k| : (is_leaf ------------------ | Branch (644:19): [True: 3.63k, False: 2.39k] ------------------ 645| 6.03k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 6.03k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.39k| .visit(v, idx, args...)); 648| 26.8k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1405| 15.4k| { 1406| 15.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 15.4k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1202| 15.4k| { 1203| 15.4k| auto p = node_->inner(); 1204| 15.4k| auto e = p + branches; 1205| 15.4k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 14.2k, False: 1.15k] ------------------ 1206| 123k| 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: 1.01k, False: 108k] ------------------ 1209| 1.01k| return false; 1210| 109k| } 1211| 14.2k| } else { 1212| 1.15k| auto ss = shift_ - B; 1213| 9.39k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 8.50k, False: 894] ------------------ 1214| 8.50k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 258, False: 8.24k] ------------------ 1215| 258| return false; 1216| 1.15k| } 1217| 14.1k| return true; 1218| 15.4k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 897| { 1037| 897| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 897| } _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| 897| { 1008| 897| assert(idx < count()); ------------------ | Branch (1008:9): [True: 897, False: 0] ------------------ 1009| 897| auto is_leaf = shift_ == BL; 1010| 897| auto child = node_->inner()[idx]; 1011| 897| auto lsize = size(idx); 1012| 897| auto is_full = idx + 1 < count(); 1013| 897| return is_full ------------------ | Branch (1013:16): [True: 897, False: 0] ------------------ 1014| 897| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 897] ------------------ 1015| 897| ? make_full_leaf_pos(child).visit(v, args...) 1016| 897| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 897| : (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| 897| } _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| 2.73k| { 1037| 2.73k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.73k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1007| 4.87k| { 1008| 4.87k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 4.87k, False: 0] ------------------ 1009| 4.87k| auto is_leaf = shift_ == BL; 1010| 4.87k| auto child = node_->inner()[idx]; 1011| 4.87k| auto lsize = size(idx); 1012| 4.87k| auto is_full = idx + 1 < count(); 1013| 4.87k| return is_full ------------------ | Branch (1013:16): [True: 2.96k, False: 1.91k] ------------------ 1014| 4.87k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.50k, False: 459] ------------------ 1015| 2.96k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 2.96k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.87k| : (is_leaf ------------------ | Branch (1017:23): [True: 1.10k, False: 812] ------------------ 1018| 1.91k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 1.91k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 812| .visit(v, args...)); 1021| 4.87k| } _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| 1.01M| { 145| 1.01M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.01M| } _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| 13.1k| { 1037| 13.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 13.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 831| 13.1k| { 832| 13.1k| return each_pred_regular(*this, v, args...); 833| 13.1k| } _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| 13.1k|{ 366| 13.1k| constexpr auto B = bits; 367| 13.1k| constexpr auto BL = bits_leaf; 368| 13.1k| auto n = p.node()->inner(); 369| 13.1k| auto last = p.count() - 1; 370| 13.1k| auto e = n + last; 371| 13.1k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 10.1k, False: 2.97k] ------------------ 372| 69.3k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 60.0k, False: 9.27k] ------------------ 373| 60.0k| IMMER_PREFETCH(n + 1); 374| 60.0k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 874, False: 59.2k] ------------------ 375| 874| return false; 376| 60.0k| } 377| 9.27k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 10.1k| } else { 379| 2.97k| auto ss = p.shift() - B; 380| 7.15k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 4.73k, False: 2.42k] ------------------ 381| 4.73k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 550, False: 4.18k] ------------------ 382| 550| return false; 383| 2.42k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 2.97k| } 385| 13.1k|} _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.2k| { 113| 11.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 11.2k| } _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.32k| { 337| 3.32k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.32k| } _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.32k| { 250| 3.32k| return each_pred_regular(*this, v, args...); 251| 3.32k| } _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.32k|{ 366| 3.32k| constexpr auto B = bits; 367| 3.32k| constexpr auto BL = bits_leaf; 368| 3.32k| auto n = p.node()->inner(); 369| 3.32k| auto last = p.count() - 1; 370| 3.32k| auto e = n + last; 371| 3.32k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 2.19k, False: 1.13k] ------------------ 372| 5.69k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 3.76k, False: 1.93k] ------------------ 373| 3.76k| IMMER_PREFETCH(n + 1); 374| 3.76k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 260, False: 3.50k] ------------------ 375| 260| return false; 376| 3.76k| } 377| 1.93k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 2.19k| } else { 379| 1.13k| auto ss = p.shift() - B; 380| 1.91k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 1.00k, False: 907] ------------------ 381| 1.00k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 230, False: 773] ------------------ 382| 230| return false; 383| 907| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 1.13k| } 385| 3.32k|} _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| 3.51k| { 1037| 3.51k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.51k| } _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| 3.51k| { 1794| 3.51k| auto child = node_->inner()[offset]; 1795| 3.51k| auto child_size = size(offset); 1796| 3.51k| auto is_leaf = shift_ == BL; 1797| 3.51k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 3.51k] ------------------ 1798| 3.51k| : visit_maybe_relaxed_sub( 1799| 3.51k| child, shift_ - B, child_size, v, args...); 1800| 3.51k| } _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| 3.51k|{ 1839| 3.51k| assert(node); ------------------ | Branch (1839:5): [True: 3.51k, False: 0] ------------------ 1840| 3.51k| auto relaxed = node->relaxed(); 1841| 3.51k| if (relaxed) { ------------------ | Branch (1841:9): [True: 778, False: 2.73k] ------------------ 1842| 778| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 778, False: 0] ------------------ 1843| 778| return make_relaxed_pos(node, shift, relaxed) 1844| 778| .visit(v, std::forward(args)...); 1845| 2.73k| } else { 1846| 2.73k| return make_regular_sub_pos(node, shift, size) 1847| 2.73k| .visit(v, std::forward(args)...); 1848| 2.73k| } 1849| 3.51k|} _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| 778| { 1814| 778| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 778| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1007| 7.22k| { 1008| 7.22k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 7.22k, False: 0] ------------------ 1009| 7.22k| auto is_leaf = shift_ == BL; 1010| 7.22k| auto child = node_->inner()[idx]; 1011| 7.22k| auto lsize = size(idx); 1012| 7.22k| auto is_full = idx + 1 < count(); 1013| 7.22k| return is_full ------------------ | Branch (1013:16): [True: 6.63k, False: 591] ------------------ 1014| 7.22k| ? (is_leaf ------------------ | Branch (1014:23): [True: 4.38k, False: 2.25k] ------------------ 1015| 6.63k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 6.63k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 7.22k| : (is_leaf ------------------ | Branch (1017:23): [True: 591, False: 0] ------------------ 1018| 591| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 591| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 7.22k| } _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| 9.30k| { 208| 9.30k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.30k| } _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| 9.30k| { 1805| 9.30k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 9.30k, False: 0] ------------------ 1806| 9.30k| auto child = node_->inner()[offset]; 1807| 9.30k| auto child_size = size(offset); 1808| 9.30k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 9.30k| } _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| 9.30k| { 145| 9.30k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.30k| } _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.02k| { 1406| 3.02k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.02k| } _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.02k| { 1794| 3.02k| auto child = node_->inner()[offset]; 1795| 3.02k| auto child_size = size(offset); 1796| 3.02k| auto is_leaf = shift_ == BL; 1797| 3.02k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 3.02k] ------------------ 1798| 3.02k| : visit_maybe_relaxed_sub( 1799| 3.02k| child, shift_ - B, child_size, v, args...); 1800| 3.02k| } _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.02k|{ 1839| 3.02k| assert(node); ------------------ | Branch (1839:5): [True: 3.02k, False: 0] ------------------ 1840| 3.02k| auto relaxed = node->relaxed(); 1841| 3.02k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.41k, False: 1.60k] ------------------ 1842| 1.41k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.41k, False: 0] ------------------ 1843| 1.41k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.41k| .visit(v, std::forward(args)...); 1845| 1.60k| } else { 1846| 1.60k| return make_regular_sub_pos(node, shift, size) 1847| 1.60k| .visit(v, std::forward(args)...); 1848| 1.60k| } 1849| 3.02k|} _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.41k| { 1814| 1.41k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.41k| } _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| 5.68k| { 1387| 5.68k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 5.68k, False: 0] ------------------ 1388| 5.68k| auto is_leaf = shift_ == BL; 1389| 5.68k| auto child = node_->inner()[idx]; 1390| 5.68k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 4.91k, False: 770] ------------------ 1391| 5.68k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 5.68k| } _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| 1.60k| { 1037| 1.60k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.60k| } _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| 64.7k| { 1794| 64.7k| auto child = node_->inner()[offset]; 1795| 64.7k| auto child_size = size(offset); 1796| 64.7k| auto is_leaf = shift_ == BL; 1797| 64.7k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 29.7k, False: 34.9k] ------------------ 1798| 64.7k| : visit_maybe_relaxed_sub( 1799| 34.9k| child, shift_ - B, child_size, v, args...); 1800| 64.7k| } _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| 167k|{ 1839| 167k| assert(node); ------------------ | Branch (1839:5): [True: 167k, False: 0] ------------------ 1840| 167k| auto relaxed = node->relaxed(); 1841| 167k| if (relaxed) { ------------------ | Branch (1841:9): [True: 154k, False: 12.3k] ------------------ 1842| 154k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 154k, False: 0] ------------------ 1843| 154k| return make_relaxed_pos(node, shift, relaxed) 1844| 154k| .visit(v, std::forward(args)...); 1845| 154k| } else { 1846| 12.3k| return make_regular_sub_pos(node, shift, size) 1847| 12.3k| .visit(v, std::forward(args)...); 1848| 12.3k| } 1849| 167k|} _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| 154k| { 1814| 154k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 154k| } _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| 154k| { 1483| 154k| auto p = node_->inner(); 1484| 154k| auto s = size_t{}; 1485| 154k| auto n = count(); 1486| 154k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 135k, False: 19.3k] ------------------ 1487| 1.12M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 986k, False: 134k] ------------------ 1488| 986k| IMMER_PREFETCH(p + i + 1); 1489| 986k| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 1.13k, False: 985k] ------------------ 1490| 986k| .visit(v, args...)) 1491| 1.13k| return false; 1492| 985k| s = relaxed_->d.sizes[i]; 1493| 985k| } 1494| 135k| } else { 1495| 19.3k| auto ss = shift_ - B; 1496| 150k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 132k, False: 18.5k] ------------------ 1497| 132k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 795, False: 131k] ------------------ 1498| 132k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 795| return false; 1500| 131k| s = relaxed_->d.sizes[i]; 1501| 131k| } 1502| 19.3k| } 1503| 152k| return true; 1504| 154k| } _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.14k| { 1037| 3.14k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.14k| } _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.34k| { 1784| 1.34k| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 1.34k, False: 0] ------------------ 1785| 1.34k| auto child = node_->inner()[0]; 1786| 1.34k| auto child_size = relaxed_->d.sizes[0]; 1787| 1.34k| return visit_maybe_relaxed_sub( 1788| 1.34k| child, shift_ - B, child_size, v, args...); 1789| 1.34k| } _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.34k|{ 1839| 1.34k| assert(node); ------------------ | Branch (1839:5): [True: 1.34k, False: 0] ------------------ 1840| 1.34k| auto relaxed = node->relaxed(); 1841| 1.34k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.34k, False: 0] ------------------ 1842| 1.34k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.34k, False: 0] ------------------ 1843| 1.34k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.34k| .visit(v, std::forward(args)...); 1845| 1.34k| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 1.34k|} _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.34k| { 1814| 1.34k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.34k| } _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.61k|{ 1839| 8.61k| assert(node); ------------------ | Branch (1839:5): [True: 8.61k, False: 0] ------------------ 1840| 8.61k| auto relaxed = node->relaxed(); 1841| 8.61k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.65k, False: 5.96k] ------------------ 1842| 2.65k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.65k, False: 0] ------------------ 1843| 2.65k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.65k| .visit(v, std::forward(args)...); 1845| 5.96k| } else { 1846| 5.96k| return make_regular_sub_pos(node, shift, size) 1847| 5.96k| .visit(v, std::forward(args)...); 1848| 5.96k| } 1849| 8.61k|} _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.65k| { 1814| 2.65k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.65k| } _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.96k| { 1037| 5.96k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.96k| } _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.61k| { 1037| 8.61k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.61k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRKPSC_EEEDcT_DpOT0_: 144| 6.74k| { 145| 6.74k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.74k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 114| 1.27M| : size{0} 115| 1.27M| , shift{BL} 116| 1.27M| , root{empty_root()} 117| 1.27M| , tail{empty_tail()} 118| 1.27M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 1.27M, False: 0] ------------------ 120| 1.27M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_rootEv: 61| 1.29M| { 62| 1.29M| static const auto empty_ = [] { 63| 1.29M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1.29M| static std::aligned_storage_t 65| 1.29M| storage; 66| 1.29M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1.29M| }(); 68| 1.29M| return empty_->inc(); 69| 1.29M| } _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.27M| { 73| 1.27M| static const auto empty_ = [] { 74| 1.27M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1.27M| static std::aligned_storage_t 76| 1.27M| storage; 77| 1.27M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1.27M| }(); 79| 1.27M| return empty_->inc(); 80| 1.27M| } _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.20M| { 1373| 3.20M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 3.20M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.20M] | | ------------------ | | 33| 3.20M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 3.20M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 3.20M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.20M] | | ------------------ | | 33| 3.20M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 3.20M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 3.20M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.20M] | | ------------------ | | 33| 3.20M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 3.20M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 3.20M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.20M] | | ------------------ | | 33| 3.20M| 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.20M| return true; 1382| 3.20M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11tail_offsetEv: 197| 17.7M| { 198| 17.7M| auto r = root->relaxed(); 199| 17.7M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 7.00M, False: 10.7M] | Branch (199:9): [True: 10.7M, False: 0] | Branch (199:9): [True: 17.7M, False: 0] ------------------ 200| 17.7M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 10.7M, False: 7.00M] ------------------ 201| 17.7M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 3.13M, False: 3.86M] ------------------ 202| | /* otherwise */ 203| 7.00M| : 0; 204| 17.7M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9tail_sizeEv: 194| 3.57M| 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.20M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3decEv: 192| 3.20M| 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.20M| { 209| 3.20M| auto tail_off = tail_offset(); 210| 3.20M| auto tail_size = size - tail_off; 211| | 212| 3.20M| if (tail_off) ------------------ | Branch (212:13): [True: 1.79M, False: 1.41M] ------------------ 213| 1.79M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 1.41M| else 215| 1.41M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 3.20M| if (tail_size) ------------------ | Branch (217:13): [True: 1.92M, False: 1.28M] ------------------ 218| 1.92M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 1.28M| else 220| 1.28M| make_empty_leaf_pos(tail).visit(v, args...); 221| 3.20M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 500| 322k| { 501| 322k| auto ts = tail_size(); 502| 322k| if (ts < branches) { ------------------ | Branch (502:13): [True: 271k, False: 50.9k] ------------------ 503| 271k| auto new_tail = 504| 271k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 271k| return {size + 1, shift, root->inc(), new_tail}; 506| 271k| } else { 507| 50.9k| using std::get; 508| 50.9k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 50.9k| auto tail_off = tail_offset(); 510| 50.9k| IMMER_TRY { ------------------ | | 49| 50.9k|#define IMMER_TRY try ------------------ 511| 50.9k| auto new_root = 512| 50.9k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 50.9k| tail->inc(); 514| 50.9k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 50.9k| } 516| 50.9k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 50.9k| } 521| 322k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2EmjPNS1_4nodeIiSA_Lj3ELj3EEESE_: 127| 1.92M| : size{sz} 128| 1.92M| , shift{sh} 129| 1.92M| , root{r} 130| 1.92M| , tail{t} 131| 1.92M| { 132| 1.92M|#if IMMER_THROW_ON_INVALID_STATE 133| | // assert only happens in the Debug build, but when 134| | // IMMER_THROW_ON_INVALID_STATE is activated, we want to just check_tree 135| | // even in Release. 136| 1.92M| try { 137| 1.92M| check_tree(); 138| 1.92M| } catch (...) { 139| | // This not fully constructed rrbtree owns the nodes already, have 140| | // to dec them. 141| 0| if (r && t) ------------------ | Branch (141:17): [True: 0, False: 0] | Branch (141:22): [True: 0, False: 0] ------------------ 142| 0| dec(); 143| 0| throw; 144| 0| } 145| |#else 146| | assert(check_tree()); 147| |#endif 148| 1.92M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_tailEPNS1_4nodeIiSA_Lj3ELj3EEEjmSE_j: 369| 337k| { 370| 337k| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 54.6k, False: 283k] ------------------ 371| 54.6k| auto new_root = 372| 54.6k| make_relaxed_pos(root, shift, r) 373| 54.6k| .visit(push_tail_visitor{}, tail, tail_size); 374| 54.6k| if (new_root) ------------------ | Branch (374:17): [True: 52.6k, False: 1.99k] ------------------ 375| 52.6k| return std::make_tuple(shift, new_root); 376| 1.99k| else { 377| 1.99k| auto new_root = node_t::make_inner_r_n(2); 378| 1.99k| IMMER_TRY { ------------------ | | 49| 1.99k|#define IMMER_TRY try ------------------ 379| 1.99k| auto new_path = node_t::make_path(shift, tail); 380| 1.99k| new_root->inner()[0] = root->inc(); 381| 1.99k| new_root->inner()[1] = new_path; 382| 1.99k| new_root->relaxed()->d.sizes[0] = size; 383| 1.99k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 1.99k| assert(size); ------------------ | Branch (384:21): [True: 1.99k, False: 0] ------------------ 385| 1.99k| assert(tail_size); ------------------ | Branch (385:21): [True: 1.99k, False: 0] ------------------ 386| 1.99k| new_root->relaxed()->d.count = 2u; 387| 1.99k| } 388| 1.99k| 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.99k| return std::make_tuple(shift + B, new_root); 393| 1.99k| } 394| 283k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 3.48k, False: 279k] ------------------ 395| 3.48k| auto new_root = node_t::make_inner_n(2); 396| 3.48k| IMMER_TRY { ------------------ | | 49| 3.48k|#define IMMER_TRY try ------------------ 397| 3.48k| auto new_path = node_t::make_path(shift, tail); 398| 3.48k| new_root->inner()[0] = root->inc(); 399| 3.48k| new_root->inner()[1] = new_path; 400| 3.48k| } 401| 3.48k| 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.48k| return std::make_tuple(shift + B, new_root); 406| 279k| } else if (size) { ------------------ | Branch (406:20): [True: 266k, False: 13.5k] ------------------ 407| 266k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 266k| .visit(push_tail_visitor{}, tail); 409| 266k| return std::make_tuple(shift, new_root); 410| 266k| } else { 411| 13.5k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 13.5k| } 413| 337k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2EOSB_: 157| 1.18M| : rrbtree{} 158| 1.18M| { 159| 1.18M| swap(*this, other); 160| 1.18M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESC_: 176| 4.37M| { 177| 4.37M| using std::swap; 178| 4.37M| swap(x.size, y.size); 179| 4.37M| swap(x.shift, y.shift); 180| 4.37M| swap(x.root, y.root); 181| 4.37M| swap(x.tail, y.tail); 182| 4.37M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEaSEOSB_: 170| 3.18M| { 171| 3.18M| swap(*this, other); 172| 3.18M| return *this; 173| 3.18M| } flex-vector-bo.cpp:_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSG_E_EESB_mOSG_: 580| 160k| { 581| 160k| auto tail_off = tail_offset(); 582| 160k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 59.1k, False: 101k] ------------------ 583| 59.1k| auto tail_size = size - tail_off; 584| 59.1k| auto new_tail = 585| 59.1k| make_leaf_sub_pos(tail, tail_size) 586| 59.1k| .visit(update_visitor{}, idx - tail_off, fn); 587| 59.1k| return {size, shift, root->inc(), new_tail}; 588| 101k| } else { 589| 101k| auto new_root = visit_maybe_relaxed_sub( 590| 101k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 101k| return {size, shift, new_root, tail->inc()}; 592| 101k| } 593| 160k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 647| 23.7k| { 648| 23.7k| auto tail_off = tail_offset(); 649| 23.7k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 4.08k, False: 19.6k] ------------------ 650| 4.08k| return {}; 651| 19.6k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 1.22k, False: 18.4k] ------------------ 652| 1.22k| return *this; 653| 18.4k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 1.28k, False: 17.1k] ------------------ 654| 1.28k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 1.28k| return {new_size, shift, root->inc(), new_tail}; 656| 17.1k| } else { 657| 17.1k| using std::get; 658| 17.1k| auto l = new_size - 1; 659| 17.1k| auto v = slice_right_visitor(); 660| 17.1k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 17.1k| auto new_shift = get<0>(r); 662| 17.1k| auto new_root = get<1>(r); 663| 17.1k| auto new_tail = get<3>(r); 664| 17.1k| if (new_root) { ------------------ | Branch (664:17): [True: 12.4k, False: 4.69k] ------------------ 665| 12.4k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 12.4k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 12.4k, False: 0] ------------------ 666| 12.4k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 12.4k, False: 0] ------------------ 667| 12.4k| return {new_size, new_shift, new_root, new_tail}; 668| 12.4k| } else { 669| 4.69k| return {new_size, BL, empty_root(), new_tail}; 670| 4.69k| } 671| 17.1k| } 672| 23.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKSB_: 151| 9.35k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 9.35k| { 153| 9.35k| inc(); 154| 9.35k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 187| 9.35k| { 188| 9.35k| root->inc(); 189| 9.35k| tail->inc(); 190| 9.35k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 711| 34.9k| { 712| 34.9k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.69k, False: 32.2k] ------------------ 713| 2.69k| return *this; 714| 32.2k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 2.02k, False: 30.2k] ------------------ 715| 2.02k| return {}; 716| 30.2k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 1.84k, False: 28.4k] ------------------ 717| 1.84k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 28.4k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 1.40k, False: 27.0k] ------------------ 719| 1.40k| auto tail_off = tail_offset(); 720| 1.40k| auto new_tail = 721| 1.40k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 1.40k| return {size - elems, BL, empty_root(), new_tail}; 723| 27.0k| } else { 724| 27.0k| using std::get; 725| 27.0k| auto v = slice_left_visitor(); 726| 27.0k| auto r = 727| 27.0k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 27.0k| auto new_root = get<1>(r); 729| 27.0k| auto new_shift = get<0>(r); 730| 27.0k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 27.0k| } 732| 34.9k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8max_sizeEv: 54| 2.39M| { 55| 2.39M| auto S = sizeof(size_t) * 8; 56| 2.39M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 2.39M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 2.39M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6concatERKSB_: 735| 619k| { 736| 619k| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 619k, False: 0] ------------------ 737| 619k| using std::get; 738| 619k| if (size == 0) ------------------ | Branch (738:13): [True: 1.42k, False: 618k] ------------------ 739| 1.42k| return r; 740| 618k| else if (r.size == 0) ------------------ | Branch (740:18): [True: 1.38k, False: 616k] ------------------ 741| 1.38k| return *this; 742| 616k| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 304k, False: 312k] ------------------ 743| | // just concat the tail, similar to push_back 744| 304k| auto tail_offst = tail_offset(); 745| 304k| auto tail_size = size - tail_offst; 746| 304k| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 65.8k, False: 238k] ------------------ 747| 65.8k| auto new_root = 748| 65.8k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 65.8k| tail->inc(); 750| 65.8k| return {size + r.size, 751| 65.8k| get<0>(new_root), 752| 65.8k| get<1>(new_root), 753| 65.8k| r.tail->inc()}; 754| 238k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 18.2k, False: 220k] ------------------ 755| 18.2k| auto new_tail = 756| 18.2k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 18.2k| return {size + r.size, shift, root->inc(), new_tail}; 758| 220k| } else { 759| 220k| auto remaining = branches - tail_size; 760| 220k| auto add_tail = 761| 220k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 220k| IMMER_TRY { ------------------ | | 49| 220k|#define IMMER_TRY try ------------------ 763| 220k| auto new_tail = 764| 220k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 220k| IMMER_TRY { ------------------ | | 49| 220k|#define IMMER_TRY try ------------------ 766| 220k| auto new_root = push_tail( 767| 220k| root, shift, tail_offst, add_tail, branches); 768| 220k| return {size + r.size, 769| 220k| get<0>(new_root), 770| 220k| get<1>(new_root), 771| 220k| new_tail}; 772| 220k| } 773| 220k| 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| 220k| } 778| 220k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 220k| } 783| 312k| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 2.63k, False: 309k] ------------------ 784| 2.63k| auto tail_offst = tail_offset(); 785| 2.63k| auto tail_size = size - tail_offst; 786| 2.63k| auto concated = 787| 2.63k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 2.63k| auto new_shift = concated.shift(); 789| 2.63k| auto new_root = concated.node(); 790| 2.63k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 2.63k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 2.63k, False: 0] ------------------ 791| 2.63k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 2.63k, False: 0] ------------------ 792| 2.63k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 309k| } else { 794| 309k| auto tail_offst = tail_offset(); 795| 309k| auto tail_size = size - tail_offst; 796| 309k| auto concated = concat_trees(root, 797| 309k| shift, 798| 309k| tail_offst, 799| 309k| tail, 800| 309k| tail_size, 801| 309k| r.root, 802| 309k| r.shift, 803| 309k| r.tail_offset()); 804| 309k| auto new_shift = concated.shift(); 805| 309k| auto new_root = concated.node(); 806| 309k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 309k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 309k, False: 0] ------------------ 807| 309k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 309k, False: 0] ------------------ 808| 309k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 309k| } 810| 619k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 37.5k| { 479| 37.5k| auto ts = tail_size(); 480| 37.5k| if (ts < branches) { ------------------ | Branch (480:13): [True: 28.2k, False: 9.29k] ------------------ 481| 28.2k| ensure_mutable_tail(e, ts); 482| 28.2k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 28.2k| } else { 484| 9.29k| using std::get; 485| 9.29k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 9.29k| auto tail_off = tail_offset(); 487| 9.29k| IMMER_TRY { ------------------ | | 49| 9.29k|#define IMMER_TRY try ------------------ 488| 9.29k| push_tail_mut(e, tail_off, tail, ts); 489| 9.29k| tail = new_tail; 490| 9.29k| } 491| 9.29k| 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.29k| } 496| 37.5k| ++size; 497| 37.5k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 349k| { 470| 349k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 9.06k, False: 340k] ------------------ 471| 9.06k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 9.06k| dec_leaf(tail, n); 473| 9.06k| tail = new_tail; 474| 9.06k| } 475| 349k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj3ELj3EEEj: 417| 365k| { 418| 365k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 173k, False: 192k] ------------------ 419| 173k| auto new_root = 420| 173k| make_relaxed_pos(root, shift, r) 421| 173k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 173k| if (new_root) { ------------------ | Branch (422:17): [True: 172k, False: 728] ------------------ 423| 172k| root = new_root; 424| 172k| } else { 425| 728| auto new_root = node_t::make_inner_r_e(e); 426| 728| IMMER_TRY { ------------------ | | 49| 728|#define IMMER_TRY try ------------------ 427| 728| auto new_path = node_t::make_path_e(e, shift, tail); 428| 728| new_root->inner()[0] = root; 429| 728| new_root->inner()[1] = new_path; 430| 728| new_root->relaxed()->d.sizes[0] = tail_off; 431| 728| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 728| assert(tail_off); ------------------ | Branch (432:21): [True: 728, False: 0] ------------------ 433| 728| assert(tail_size); ------------------ | Branch (433:21): [True: 728, False: 0] ------------------ 434| 728| new_root->relaxed()->d.count = 2u; 435| 728| root = new_root; 436| 728| shift += B; 437| 728| } 438| 728| 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| 728| } 443| 192k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 1.84k, False: 190k] ------------------ 444| 1.84k| auto new_root = node_t::make_inner_e(e); 445| 1.84k| IMMER_TRY { ------------------ | | 49| 1.84k|#define IMMER_TRY try ------------------ 446| 1.84k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 1.84k| new_root->inner()[0] = root; 448| 1.84k| new_root->inner()[1] = new_path; 449| 1.84k| root = new_root; 450| 1.84k| shift += B; 451| 1.84k| } 452| 1.84k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 190k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 187k, False: 2.34k] ------------------ 457| 187k| auto new_root = 458| 187k| make_regular_sub_pos(root, shift, tail_off) 459| 187k| .visit(push_tail_mut_visitor{}, e, tail); 460| 187k| root = new_root; 461| 187k| } else { 462| 2.34k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 2.34k| dec_empty_regular(root); 464| 2.34k| root = new_root; 465| 2.34k| } 466| 365k| } 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| 31.8k| { 574| 31.8k| auto& elem = get_mut(e, idx); 575| 31.8k| elem = std::forward(fn)(std::move(elem)); 576| 31.8k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 31.8k| { 540| 31.8k| auto tail_off = tail_offset(); 541| 31.8k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 10.9k, False: 20.8k] ------------------ 542| 10.9k| ensure_mutable_tail(e, size - tail_off); 543| 10.9k| 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| 31.8k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 31.2k| { 607| 31.2k| auto tail_off = tail_offset(); 608| 31.2k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 746, False: 30.5k] ------------------ 609| 746| *this = {}; 610| 30.5k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 486, False: 30.0k] ------------------ 611| 486| return; 612| 30.0k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 596, False: 29.4k] ------------------ 613| 596| auto ts = size - tail_off; 614| 596| auto newts = new_size - tail_off; 615| 596| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 349, False: 247] ------------------ 616| 349| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 349| } else { 618| 247| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 247| dec_leaf(tail, ts); 620| 247| tail = new_tail; 621| 247| } 622| 596| size = new_size; 623| 596| return; 624| 29.4k| } else { 625| 29.4k| using std::get; 626| 29.4k| auto l = new_size - 1; 627| 29.4k| auto v = slice_right_mut_visitor(); 628| 29.4k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 29.4k| auto new_shift = get<0>(r); 630| 29.4k| auto new_root = get<1>(r); 631| 29.4k| auto new_tail = get<3>(r); 632| 29.4k| if (new_root) { ------------------ | Branch (632:17): [True: 23.0k, False: 6.41k] ------------------ 633| 23.0k| root = new_root; 634| 23.0k| shift = new_shift; 635| 23.0k| } else { 636| 6.41k| root = empty_root(); 637| 6.41k| shift = BL; 638| 6.41k| } 639| 29.4k| dec_leaf(tail, size - tail_off); 640| 29.4k| size = new_size; 641| 29.4k| tail = new_tail; 642| 29.4k| return; 643| 29.4k| } 644| 31.2k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 56.3k| { 676| 56.3k| using std::get; 677| 56.3k| auto tail_off = tail_offset(); 678| 56.3k| if (elems == 0) { ------------------ | Branch (678:13): [True: 5.34k, False: 50.9k] ------------------ 679| 5.34k| return; 680| 50.9k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 276, False: 50.6k] ------------------ 681| 276| *this = {}; 682| 50.6k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 206, False: 50.4k] ------------------ 683| 206| dec_inner(root, shift, tail_off); 684| 206| shift = BL; 685| 206| root = empty_root(); 686| 206| size -= elems; 687| 206| return; 688| 50.4k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 875, False: 49.6k] ------------------ 689| 875| auto v = slice_left_mut_visitor(); 690| 875| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 875| .visit(v, elems - tail_off, e)); 692| 875| if (tail_off) { ------------------ | Branch (692:17): [True: 219, False: 656] ------------------ 693| 219| dec_inner(root, shift, tail_off); 694| 219| shift = BL; 695| 219| root = empty_root(); 696| 219| } 697| 875| size -= elems; 698| 875| return; 699| 49.6k| } else { 700| 49.6k| auto v = slice_left_mut_visitor(); 701| 49.6k| auto r = 702| 49.6k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 49.6k| shift = get<0>(r); 704| 49.6k| root = get<1>(r); 705| 49.6k| size -= elems; 706| 49.6k| return; 707| 49.6k| } 708| 56.3k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editERKSB_: 816| 211k| { 817| 211k| assert(&l != &r); ------------------ | Branch (817:9): [True: 211k, False: 0] ------------------ 818| 211k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 211k, False: 0] ------------------ 819| 211k| using std::get; 820| 211k| if (l.size == 0) ------------------ | Branch (820:13): [True: 426, False: 211k] ------------------ 821| 426| l = r; 822| 211k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 603, False: 210k] ------------------ 823| 603| return; 824| 210k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 66.6k, False: 144k] ------------------ 825| | // just concat the tail, similar to push_back 826| 66.6k| auto tail_offst = l.tail_offset(); 827| 66.6k| auto tail_size = l.size - tail_offst; 828| 66.6k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 10.9k, False: 55.7k] ------------------ 829| 10.9k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 10.9k| l.tail = r.tail->inc(); 831| 10.9k| l.size += r.size; 832| 10.9k| return; 833| 55.7k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 840, False: 54.8k] ------------------ 834| 840| l.ensure_mutable_tail(el, tail_size); 835| 840| detail::uninitialized_copy(r.tail->leaf(), 836| 840| r.tail->leaf() + r.size, 837| 840| l.tail->leaf() + tail_size); 838| 840| l.size += r.size; 839| 840| return; 840| 54.8k| } else { 841| 54.8k| auto remaining = branches - tail_size; 842| 54.8k| l.ensure_mutable_tail(el, tail_size); 843| 54.8k| detail::uninitialized_copy(r.tail->leaf(), 844| 54.8k| r.tail->leaf() + remaining, 845| 54.8k| l.tail->leaf() + tail_size); 846| 54.8k| IMMER_TRY { ------------------ | | 49| 54.8k|#define IMMER_TRY try ------------------ 847| 54.8k| auto new_tail = 848| 54.8k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 54.8k| IMMER_TRY { ------------------ | | 49| 54.8k|#define IMMER_TRY try ------------------ 850| 54.8k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 54.8k| l.tail = new_tail; 852| 54.8k| l.size += r.size; 853| 54.8k| return; 854| 54.8k| } 855| 54.8k| 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| 54.8k| } 860| 54.8k| 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| 54.8k| } 865| 144k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 438, False: 143k] ------------------ 866| 438| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 438] ------------------ 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| 438| } else { 886| 438| auto tail_offst = l.tail_offset(); 887| 438| auto tail_size = l.size - tail_offst; 888| 438| auto concated = concat_trees( 889| 438| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 438| l = {l.size + r.size, 891| 438| concated.shift(), 892| 438| concated.node(), 893| 438| r.tail->inc()}; 894| 438| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 438, False: 0] ------------------ 895| 438| return; 896| 438| } 897| 143k| } else { 898| 143k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 143k] ------------------ 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| 143k| } else { 923| 143k| auto tail_offst = l.tail_offset(); 924| 143k| auto tail_size = l.size - tail_offst; 925| 143k| auto concated = concat_trees(l.root, 926| 143k| l.shift, 927| 143k| tail_offst, 928| 143k| l.tail, 929| 143k| tail_size, 930| 143k| r.root, 931| 143k| r.shift, 932| 143k| r.tail_offset()); 933| 143k| l = {l.size + r.size, 934| 143k| concated.shift(), 935| 143k| concated.node(), 936| 143k| r.tail->inc()}; 937| 143k| } 938| 143k| } 939| 211k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEaSERKSB_: 163| 2.63k| { 164| 2.63k| auto next{other}; 165| 2.63k| swap(*this, next); 166| 2.63k| return *this; 167| 2.63k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERSB_NS9_5applyIS6_E4type4editE: 942| 3.67k| { 943| 3.67k| assert(&l != &r); ------------------ | Branch (943:9): [True: 3.67k, False: 0] ------------------ 944| 3.67k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 3.67k, False: 0] ------------------ 945| 3.67k| using std::get; 946| 3.67k| if (r.size == 0) ------------------ | Branch (946:13): [True: 242, False: 3.43k] ------------------ 947| 242| r = std::move(l); 948| 3.43k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 200, False: 3.23k] ------------------ 949| 200| return; 950| 3.23k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 1.15k, False: 2.07k] ------------------ 951| | // just concat the tail, similar to push_back 952| 1.15k| auto tail_offst = l.tail_offset(); 953| 1.15k| auto tail_size = l.size - tail_offst; 954| 1.15k| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 321, False: 835] ------------------ 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| 321| auto res = 959| 321| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 321| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 321| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 321| return; 965| 835| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 320, False: 515] ------------------ 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| 320| auto new_tail = 974| 320| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 320| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 320| return; 977| 515| } else { 978| | // like the immutable version 979| 515| auto remaining = branches - tail_size; 980| 515| auto add_tail = node_t::copy_leaf_e( 981| 515| er, l.tail, tail_size, r.tail, remaining); 982| 515| IMMER_TRY { ------------------ | | 49| 515|#define IMMER_TRY try ------------------ 983| 515| auto new_tail = 984| 515| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 515| IMMER_TRY { ------------------ | | 49| 515|#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| 515| auto new_root = l.push_tail(l.root, 990| 515| l.shift, 991| 515| tail_offst, 992| 515| add_tail, 993| 515| branches); 994| 515| r = {l.size + r.size, 995| 515| get<0>(new_root), 996| 515| get<1>(new_root), 997| 515| new_tail}; 998| 515| return; 999| 515| } 1000| 515| 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| 515| } 1005| 515| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 515| } 1010| 2.07k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 607, False: 1.47k] ------------------ 1011| 607| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 607] ------------------ 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| 607| } else { 1030| 607| auto tail_offst = l.tail_offset(); 1031| 607| auto tail_size = l.size - tail_offst; 1032| 607| auto concated = concat_trees( 1033| 607| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 607| r = {l.size + r.size, 1035| 607| concated.shift(), 1036| 607| concated.node(), 1037| 607| r.tail->inc()}; 1038| 607| return; 1039| 607| } 1040| 1.47k| } else { 1041| 1.47k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.47k] ------------------ 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.47k| } else { 1064| 1.47k| auto tail_offst = l.tail_offset(); 1065| 1.47k| auto tail_size = l.size - tail_offst; 1066| 1.47k| auto concated = concat_trees(l.root, 1067| 1.47k| l.shift, 1068| 1.47k| tail_offst, 1069| 1.47k| l.tail, 1070| 1.47k| tail_size, 1071| 1.47k| r.root, 1072| 1.47k| r.shift, 1073| 1.47k| r.tail_offset()); 1074| 1.47k| r = {l.size + r.size, 1075| 1.47k| concated.shift(), 1076| 1.47k| concated.node(), 1077| 1.47k| r.tail->inc()}; 1078| 1.47k| return; 1079| 1.47k| } 1080| 1.47k| } 1081| 3.67k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 922k| { 1085| 922k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 922k, False: 0] ------------------ 1086| 922k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 922k, False: 0] ------------------ 1087| 922k| using std::get; 1088| 922k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 1.96k, False: 920k] ------------------ 1089| 1.96k| l = r; 1090| 920k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 2.32k, False: 917k] ------------------ 1091| 2.32k| return; 1092| 917k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 294k, False: 623k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 294k| auto tail_offst = l.tail_offset(); 1095| 294k| auto tail_size = l.size - tail_offst; 1096| 294k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 39.2k, False: 254k] ------------------ 1097| 39.2k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 39.2k| l.tail = r.tail->inc(); 1099| 39.2k| l.size += r.size; 1100| 39.2k| return; 1101| 254k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 3.55k, False: 251k] ------------------ 1102| 3.55k| l.ensure_mutable_tail(el, tail_size); 1103| 3.55k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 1.96k, False: 1.58k] ------------------ 1104| 1.96k| detail::uninitialized_move(r.tail->leaf(), 1105| 1.96k| r.tail->leaf() + r.size, 1106| 1.96k| l.tail->leaf() + tail_size); 1107| 1.58k| else 1108| 1.58k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.58k| r.tail->leaf() + r.size, 1110| 1.58k| l.tail->leaf() + tail_size); 1111| 3.55k| l.size += r.size; 1112| 3.55k| return; 1113| 251k| } else { 1114| 251k| auto remaining = branches - tail_size; 1115| 251k| l.ensure_mutable_tail(el, tail_size); 1116| 251k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 107k, False: 143k] ------------------ 1117| 107k| detail::uninitialized_move(r.tail->leaf(), 1118| 107k| r.tail->leaf() + remaining, 1119| 107k| l.tail->leaf() + tail_size); 1120| 143k| else 1121| 143k| detail::uninitialized_copy(r.tail->leaf(), 1122| 143k| r.tail->leaf() + remaining, 1123| 143k| l.tail->leaf() + tail_size); 1124| 251k| IMMER_TRY { ------------------ | | 49| 251k|#define IMMER_TRY try ------------------ 1125| 251k| auto new_tail = 1126| 251k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 251k| IMMER_TRY { ------------------ | | 49| 251k|#define IMMER_TRY try ------------------ 1128| 251k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 251k| l.tail = new_tail; 1130| 251k| l.size += r.size; 1131| 251k| return; 1132| 251k| } 1133| 251k| 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| 251k| } 1138| 251k| 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| 251k| } 1143| 623k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.72k, False: 620k] ------------------ 1144| 3.72k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.72k] ------------------ 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.72k| } else { 1165| 3.72k| auto tail_offst = l.tail_offset(); 1166| 3.72k| auto tail_size = l.size - tail_offst; 1167| 3.72k| auto concated = concat_trees( 1168| 3.72k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.72k| l = {l.size + r.size, 1170| 3.72k| concated.shift(), 1171| 3.72k| concated.node(), 1172| 3.72k| r.tail->inc()}; 1173| 3.72k| return; 1174| 3.72k| } 1175| 620k| } else { 1176| 620k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 620k] ------------------ 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| 620k| } else { 1200| 620k| auto tail_offst = l.tail_offset(); 1201| 620k| auto tail_size = l.size - tail_offst; 1202| 620k| auto concated = concat_trees(l.root, 1203| 620k| l.shift, 1204| 620k| tail_offst, 1205| 620k| l.tail, 1206| 620k| tail_size, 1207| 620k| r.root, 1208| 620k| r.shift, 1209| 620k| r.tail_offset()); 1210| 620k| l = {l.size + r.size, 1211| 620k| concated.shift(), 1212| 620k| concated.node(), 1213| 620k| r.tail->inc()}; 1214| 620k| return; 1215| 620k| } 1216| 620k| } 1217| 922k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6equalsERKSB_: 315| 73.1k| { 316| 73.1k| using iter_t = rrbtree_iterator; 317| 73.1k| if (size != other.size) ------------------ | Branch (317:13): [True: 50.7k, False: 22.4k] ------------------ 318| 50.7k| return false; 319| 22.4k| if (size == 0) ------------------ | Branch (319:13): [True: 197, False: 22.2k] ------------------ 320| 197| return true; 321| 22.2k| auto tail_off = tail_offset(); 322| 22.2k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 22.2k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 21.3k, False: 839] | Branch (324:29): [True: 21.1k, False: 195] ------------------ 325| | // other.shift != shift is a theoretical possibility for 326| | // relaxed trees that sadly we haven't managed to exercise 327| | // in tests yet... 328| 21.1k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 20.5k, False: 656] ------------------ 329| 20.5k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 10.5k, False: 9.97k] ------------------ 330| 20.5k| other.shift, 331| 20.5k| tail_off_other, 332| 20.5k| equals_visitor::rrb{}, 333| 20.5k| iter_t{other}, 334| 20.5k| root, 335| 20.5k| shift, 336| 20.5k| tail_off)) 337| 10.5k| return false; 338| 20.5k| } else { 339| 656| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 248, False: 408] ------------------ 340| 656| shift, 341| 656| tail_off, 342| 656| equals_visitor::rrb{}, 343| 656| iter_t{*this}, 344| 656| other.root, 345| 656| other.shift, 346| 656| tail_off_other)) 347| 248| return false; 348| 656| } 349| 21.1k| } 350| 11.4k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 6.74k, False: 4.66k] ------------------ 351| 11.4k| ? make_leaf_sub_pos(tail, tail_size()) 352| 6.74k| .visit(equals_visitor{}, other.tail) 353| 11.4k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 2.08k, False: 2.58k] ------------------ 354| 4.66k| ? std::equal(tail->leaf(), 355| 2.08k| tail->leaf() + (size - tail_off), 356| 2.08k| other.tail->leaf() + 357| 2.08k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 4.66k| : std::equal(tail->leaf(), 360| 2.58k| tail->leaf() + (size - tail_off), 361| 2.58k| iter_t{other} + tail_off); 362| 22.2k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10region_forEm: 524| 1.28M| { 525| 1.28M| using std::get; 526| 1.28M| auto tail_off = tail_offset(); 527| 1.28M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 4.37k, False: 1.27M] ------------------ 528| 4.37k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.27M| } else { 530| 1.27M| auto subs = visit_maybe_relaxed_sub( 531| 1.27M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.27M| auto first = idx - get<1>(subs); 533| 1.27M| auto end = first + get<2>(subs); 534| 1.27M| return std::make_tuple(get<0>(subs), first, end); 535| 1.27M| } 536| 1.28M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11dereferenceEv: 90| 9.66M| { 91| 9.66M| using std::get; 92| 9.66M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 83.0k, False: 9.58M] | Branch (92:35): [True: 1.20M, False: 8.38M] ------------------ 93| 1.28M| curr_ = v_->region_for(i_); 94| 9.66M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 9.66M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7advanceEl: 74| 166k| { 75| 166k| using std::get; 76| 166k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 286, False: 166k] | Branch (76:9): [True: 166k, False: 0] | Branch (76:9): [True: 166k, False: 0] ------------------ 77| 166k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 166k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 166k, False: 0] ------------------ 78| 166k| i_ += n; 79| 166k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9incrementEv: 60| 8.44M| { 61| 8.44M| using std::get; 62| 8.44M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 8.44M, False: 0] ------------------ 63| 8.44M| ++i_; 64| 8.44M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKNS1_7rrbtreeIiSA_Lj3ELj3EEE: 39| 23.7k| : v_{&v} 40| 23.7k| , i_{0} 41| 23.7k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 23.7k| { 43| 23.7k| } _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| 22.7k| { 32| 22.7k| return Deriv::visit_inner(std::forward(args)...); 33| 22.7k| } _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| 87.5k| { 32| 87.5k| return Deriv::visit_inner(std::forward(args)...); 33| 87.5k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EEEE13visit_regularIJRNS1_15regular_sub_posISD_EERmEEEDcDpOT_: 37| 1.18k| { 38| 1.18k| return Deriv::visit_inner(std::forward(args)...); 39| 1.18k| } _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| 6.86k| { 38| 6.86k| return Deriv::visit_inner(std::forward(args)...); 39| 6.86k| } _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.30k| { 38| 8.30k| return Deriv::visit_inner(std::forward(args)...); 39| 8.30k| } _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| 715| { 38| 715| return Deriv::visit_inner(std::forward(args)...); 39| 715| } _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.77k| { 38| 1.77k| return Deriv::visit_inner(std::forward(args)...); 39| 1.77k| } _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.40k| { 38| 7.40k| return Deriv::visit_inner(std::forward(args)...); 39| 7.40k| } _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.40k| { 44| 7.40k| return Deriv::visit_node(std::forward(args)...); 45| 7.40k| } _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.14k| { 32| 5.14k| return Deriv::visit_inner(std::forward(args)...); 33| 5.14k| } _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.14k| { 44| 5.14k| return Deriv::visit_node(std::forward(args)...); 45| 5.14k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE10visit_leafIJRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 49| 7.69M| { 50| 7.69M| return Deriv::visit_node(std::forward(args)...); 51| 7.69M| } _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| 112M| { 32| 112M| return Deriv::visit_inner(std::forward(args)...); 33| 112M| } _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| 112M| { 44| 112M| return Deriv::visit_node(std::forward(args)...); 45| 112M| } _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| 112M| { 32| 112M| return Deriv::visit_inner(std::forward(args)...); 33| 112M| } _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.9k| { 32| 17.9k| return Deriv::visit_inner(std::forward(args)...); 33| 17.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 297| { 38| 297| return Deriv::visit_inner(std::forward(args)...); 39| 297| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 914| { 38| 914| return Deriv::visit_inner(std::forward(args)...); 39| 914| } _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.13M| { 50| 6.13M| return Deriv::visit_node(std::forward(args)...); 51| 6.13M| } _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| 577k| { 38| 577k| return Deriv::visit_inner(std::forward(args)...); 39| 577k| } _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| 577k| { 44| 577k| return Deriv::visit_node(std::forward(args)...); 45| 577k| } _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| 577k| { 38| 577k| return Deriv::visit_inner(std::forward(args)...); 39| 577k| } _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.12M| { 38| 4.12M| return Deriv::visit_inner(std::forward(args)...); 39| 4.12M| } _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.12M| { 44| 4.12M| return Deriv::visit_node(std::forward(args)...); 45| 4.12M| } _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.12M| { 38| 4.12M| return Deriv::visit_inner(std::forward(args)...); 39| 4.12M| } _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.26k| { 38| 2.26k| return Deriv::visit_inner(std::forward(args)...); 39| 2.26k| } _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.26k| { 44| 2.26k| return Deriv::visit_node(std::forward(args)...); 45| 2.26k| } _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.05M| { 32| 1.05M| return Deriv::visit_inner(std::forward(args)...); 33| 1.05M| } _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.05M| { 44| 1.05M| return Deriv::visit_node(std::forward(args)...); 45| 1.05M| } _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.05M| { 32| 1.05M| return Deriv::visit_inner(std::forward(args)...); 33| 1.05M| } _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.05M| { 44| 1.05M| return Deriv::visit_node(std::forward(args)...); 45| 1.05M| } _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.32M| { 32| 3.32M| return Deriv::visit_inner(std::forward(args)...); 33| 3.32M| } _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.41k| { 38| 4.41k| return Deriv::visit_inner(std::forward(args)...); 39| 4.41k| } _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.00M| { 32| 1.00M| return Deriv::visit_inner(std::forward(args)...); 33| 1.00M| } _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| 411k| { 38| 411k| return Deriv::visit_inner(std::forward(args)...); 39| 411k| } _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.24k| { 38| 1.24k| return Deriv::visit_inner(std::forward(args)...); 39| 1.24k| } _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| 22.0k| { 38| 22.0k| return Deriv::visit_inner(std::forward(args)...); 39| 22.0k| } _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.72k| { 38| 5.72k| return Deriv::visit_inner(std::forward(args)...); 39| 5.72k| } _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| 15.7k| { 38| 15.7k| return Deriv::visit_inner(std::forward(args)...); 39| 15.7k| } _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.40M| { 38| 1.40M| return Deriv::visit_inner(std::forward(args)...); 39| 1.40M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 7.47M| { 32| 7.47M| return Deriv::visit_inner(std::forward(args)...); 33| 7.47M| } _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| 543| { 38| 543| return Deriv::visit_inner(std::forward(args)...); 39| 543| } _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| 14.0k| { 32| 14.0k| return Deriv::visit_inner(std::forward(args)...); 33| 14.0k| } _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.40k| { 38| 1.40k| return Deriv::visit_inner(std::forward(args)...); 39| 1.40k| } _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| 201| { 32| 201| return Deriv::visit_inner(std::forward(args)...); 33| 201| } _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| 416| { 32| 416| return Deriv::visit_inner(std::forward(args)...); 33| 416| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 31| 7.43M| { 32| 7.43M| return Deriv::visit_inner(std::forward(args)...); 33| 7.43M| } _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| 8.60k| { 38| 8.60k| return Deriv::visit_inner(std::forward(args)...); 39| 8.60k| } _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| 8.60k| { 44| 8.60k| return Deriv::visit_node(std::forward(args)...); 45| 8.60k| } _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| 15.5k| { 38| 15.5k| return Deriv::visit_inner(std::forward(args)...); 39| 15.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| 15.5k| { 44| 15.5k| return Deriv::visit_node(std::forward(args)...); 45| 15.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.39k| { 32| 6.39k| return Deriv::visit_inner(std::forward(args)...); 33| 6.39k| } _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.39k| { 44| 6.39k| return Deriv::visit_node(std::forward(args)...); 45| 6.39k| } _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.13k| { 38| 9.13k| return Deriv::visit_inner(std::forward(args)...); 39| 9.13k| } _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.13k| { 44| 9.13k| return Deriv::visit_node(std::forward(args)...); 45| 9.13k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 31| 12.5k| { 32| 12.5k| return Deriv::visit_inner(std::forward(args)...); 33| 12.5k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 43| 12.5k| { 44| 12.5k| return Deriv::visit_node(std::forward(args)...); 45| 12.5k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 24.0k| { 32| 24.0k| return Deriv::visit_inner(std::forward(args)...); 33| 24.0k| } _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.10k| { 32| 2.10k| return Deriv::visit_inner(std::forward(args)...); 33| 2.10k| } _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| 452| { 32| 452| return Deriv::visit_inner(std::forward(args)...); 33| 452| } _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| 825| { 38| 825| return Deriv::visit_inner(std::forward(args)...); 39| 825| } _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.80M| { 32| 4.80M| return Deriv::visit_inner(std::forward(args)...); 33| 4.80M| } _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| 211k| { 38| 211k| return Deriv::visit_inner(std::forward(args)...); 39| 211k| } _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.8k| { 38| 26.8k| return Deriv::visit_inner(std::forward(args)...); 39| 26.8k| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj3ELj3EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 15.4k| { 38| 15.4k| return Deriv::visit_inner(std::forward(args)...); 39| 15.4k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 897| { 38| 897| return Deriv::visit_inner(std::forward(args)...); 39| 897| } _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| 13.1k| { 38| 13.1k| return Deriv::visit_inner(std::forward(args)...); 39| 13.1k| } _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.32k| { 38| 3.32k| return Deriv::visit_inner(std::forward(args)...); 39| 3.32k| } _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| 3.51k| { 38| 3.51k| return Deriv::visit_inner(std::forward(args)...); 39| 3.51k| } _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.02k| { 38| 3.02k| return Deriv::visit_inner(std::forward(args)...); 39| 3.02k| } _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| 154k| { 32| 154k| return Deriv::visit_inner(std::forward(args)...); 33| 154k| } _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.34k| { 32| 1.34k| return Deriv::visit_inner(std::forward(args)...); 33| 1.34k| } _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.34k| { 44| 1.34k| return Deriv::visit_node(std::forward(args)...); 45| 1.34k| } _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.61k| { 38| 8.61k| return Deriv::visit_inner(std::forward(args)...); 39| 8.61k| } _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.61k| { 44| 8.61k| return Deriv::visit_node(std::forward(args)...); 45| 8.61k| } _ZN5immer6detail15auto_const_castINS_22unsafe_refcount_policyEEERT_RKS3_: 143| 476M|{ 144| 476M| return const_cast(x); 145| 476M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 295M| { 114| 295M| check_base(); 115| 295M| auto* base = static_cast(this); 116| 295M| return reinterpret_cast(base + 1); 117| 295M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 295M| { 135| 295M| static_assert(std::is_standard_layout::value && 136| 295M| !std::is_empty::value, 137| 295M| "Please add 'true' if the derived class is emtpy"); 138| 295M| } _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| 34.5M|{ 335| 34.5M|} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 1.52M|{ 189| 1.52M| return first + n; 190| 1.52M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6leaf_tEiLb1EE15get_storage_ptrEv: 75| 10.9M| { 76| 10.9M| check_base(); 77| 10.9M| return reinterpret_cast(this); 78| 10.9M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6leaf_tEiLb1EE10check_baseEv: 94| 10.9M| { 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| 10.9M| static_assert(std::is_standard_layout::value, 100| 10.9M| "Please remove 'true' if the derived class is non emtpy"); 101| 10.9M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 2.03M|{ 237| 2.03M| return std::copy(first, last, out); 238| 2.03M|} _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| 181k|{ 340| 181k| return std::forward(f1)(empty_t{}); 341| 181k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 50.3M|{ 324| 50.3M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 2.39M, False: 47.9M] ------------------ 325| 50.3M|} _ZN5immer6detail9static_ifILb1EPNS0_3csl6memberINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14relaxed_data_tEvE4typeEZNSE_24ensure_mutable_relaxed_nENSC_5applyIS9_E4type4editEjEUlT_E_ZNSE_24ensure_mutable_relaxed_nESM_jEUlSN_E0_EENSt3__19enable_ifIXT_ET0_E4typeEOT1_OT2_: 339| 188k|{ 340| 188k| return std::forward(f1)(empty_t{}); 341| 188k|} _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| 136k|{ 335| 136k|} _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| 26.9k|{ 340| 26.9k| return std::forward(f1)(empty_t{}); 341| 26.9k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 349|{ 189| 349| return first + n; 190| 349|} _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| 164k|{ 340| 164k| return std::forward(f1)(empty_t{}); 341| 164k|} _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.21M|{ 30| 1.21M| return x; 31| 1.21M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 15.1k|{ 261| 15.1k| auto ptr = Heap::allocate(sizeof(T)); 262| 15.1k| IMMER_TRY { ------------------ | | 49| 15.1k|#define IMMER_TRY try ------------------ 263| 15.1k| return new (ptr) T(std::forward(args)...); 264| 15.1k| } 265| 15.1k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 15.1k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 96| 83.0k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 246| 322k| { 247| 322k| return impl_.push_back(std::move(value)); 248| 322k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj3ELj3EEE: 536| 1.16M| : impl_(std::move(impl)) 537| 1.16M| { 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.16M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4sizeEv: 181| 3.99M| IMMER_NODISCARD size_type size() const { return impl_.size; } flex-vector-bo.cpp:_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E_EES9_mOSE_: 323| 160k| { 324| 160k| return impl_.update(index, std::forward(fn)); 325| 160k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 350| 23.7k| { 351| 23.7k| return impl_.take(elems); 352| 23.7k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 376| 34.9k| { 377| 34.9k| return impl_.drop(elems); 378| 34.9k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8max_sizeEv: 90| 1.77M| 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| 619k| { 404| 619k| return l.impl_.concat(r.impl_); 405| 619k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 251| 37.5k| { 252| 37.5k| return push_back_move(move_t{}, std::move(value)); 253| 37.5k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 37.5k| { 548| 37.5k| impl_.push_back_mut({}, std::move(value)); 549| 37.5k| return std::move(*this); 550| 37.5k| } 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| 31.8k| { 330| 31.8k| return update_move(move_t{}, index, std::forward(fn)); 331| 31.8k| } 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| 31.8k| { 569| 31.8k| impl_.update_mut({}, index, std::forward(fn)); 570| 31.8k| return std::move(*this); 571| 31.8k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 355| 31.2k| { 356| 31.2k| return take_move(move_t{}, elems); 357| 31.2k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 31.2k| { 580| 31.2k| impl_.take_mut({}, elems); 581| 31.2k| return std::move(*this); 582| 31.2k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 381| 56.3k| { 382| 56.3k| return drop_move(move_t{}, elems); 383| 56.3k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 56.3k| { 590| 56.3k| impl_.drop_mut({}, elems); 591| 56.3k| return std::move(*this); 592| 56.3k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERKS9_: 409| 211k| { 410| 211k| return concat_move(move_t{}, std::move(l), r); 411| 211k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 211k| { 601| 211k| concat_mut_l(l.impl_, {}, r.impl_); 602| 211k| return std::move(l); 603| 211k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEOS9_: 415| 3.67k| { 416| 3.67k| return concat_move(move_t{}, l, std::move(r)); 417| 3.67k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 3.67k| { 607| 3.67k| concat_mut_r(l.impl_, r.impl_, {}); 608| 3.67k| return std::move(r); 609| 3.67k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESA_: 421| 922k| { 422| 922k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 922k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 922k| { 613| 922k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 922k| return std::move(l); 615| 922k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEeqERKS9_: 222| 73.1k| { 223| 73.1k| return impl_.equals(other.impl_); 224| 73.1k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5eraseEm: 480| 6.58k| { 481| 6.58k| return take(pos) + drop(pos + 1); 482| 6.58k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6insertEmi: 442| 15.1k| { 443| 15.1k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 15.1k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 37.3M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 37.3M| { 28| 37.3M| return ::operator new(size); 29| 37.3M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 15.1k| { 50| 15.1k| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 15.1k| new (p) std::size_t{size}; 52| 15.1k| return ((char*) p) + extra_size; 53| 15.1k| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 15.1k| { 58| 15.1k| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 15.1k| assert(*p == size); ------------------ | Branch (59:9): [True: 15.1k, False: 0] ------------------ 60| 15.1k| Base::deallocate(size + extra_size, p, tags...); 61| 15.1k| } _ZN5immer15refcount_policyC2Ev: 28| 15.1k| : refcount{1} {}; _ZN5immer15refcount_policy3decEv: 36| 15.1k| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer22unsafe_refcount_policyC2Ev: 27| 37.3M| : refcount{1} {}; _ZN5immer22unsafe_refcount_policy3incEv: 33| 218M| void inc() { ++refcount; } _ZN5immer22unsafe_refcount_policy3decEv: 34| 255M| bool dec() { return --refcount == 0; } _ZN5immer22unsafe_refcount_policy6uniqueEv: 35| 2.64M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee5ownedEv: 36| 37.3M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee10can_mutateENS6_4editE: 35| 277k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeaSENS6_4editE: 34| 628k| ownee& operator=(edit) { return *this; };