LLVMFuzzerTestOneInput: 24| 10.5k|{ 25| 10.5k| constexpr auto var_count = 8; 26| 10.5k| constexpr auto bits = 3; 27| | 28| 10.5k| using vector_t = immer::flex_vector; 29| 10.5k| using size_t = std::uint8_t; 30| | 31| 10.5k| auto vars = std::array{}; 32| | 33| 10.5k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 34| 10.5k| auto is_valid_var_neq = [](auto other) { 35| 10.5k| return [=](auto idx) { 36| 10.5k| return idx >= 0 && idx < var_count && idx != other; 37| 10.5k| }; 38| 10.5k| }; 39| 10.5k| auto is_valid_index = [](auto& v) { 40| 10.5k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 10.5k| }; 42| 10.5k| auto is_valid_size = [](auto& v) { 43| 10.5k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 10.5k| }; 45| 10.5k| auto can_concat = [](auto&& v1, auto&& v2) { 46| 10.5k| return v1.size() + v2.size() < vector_t::max_size(); 47| 10.5k| }; 48| 10.5k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 10.5k| return v.size() < (1 << 15); 51| 10.5k| }; 52| 10.5k| return fuzzer_input{data, size}.run([&](auto& in) { 53| 10.5k| enum ops 54| 10.5k| { 55| 10.5k| op_push_back, 56| 10.5k| op_update, 57| 10.5k| op_take, 58| 10.5k| op_drop, 59| 10.5k| op_concat, 60| 10.5k| op_push_back_move, 61| 10.5k| op_update_move, 62| 10.5k| op_take_move, 63| 10.5k| op_drop_move, 64| 10.5k| op_concat_move_l, 65| 10.5k| op_concat_move_r, 66| 10.5k| op_concat_move_lr, 67| 10.5k| op_insert, 68| 10.5k| op_erase, 69| 10.5k| op_compare, 70| 10.5k| }; 71| 10.5k| auto src = read(in, is_valid_var); 72| 10.5k| auto dst = read(in, is_valid_var); 73| 10.5k| switch (read(in)) { 74| 10.5k| case op_push_back: { 75| 10.5k| vars[dst] = vars[src].push_back(42); 76| 10.5k| break; 77| 10.5k| } 78| 10.5k| case op_update: { 79| 10.5k| auto idx = read(in, is_valid_index(vars[src])); 80| 10.5k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 10.5k| break; 82| 10.5k| } 83| 10.5k| case op_take: { 84| 10.5k| auto idx = read(in, is_valid_size(vars[src])); 85| 10.5k| vars[dst] = vars[src].take(idx); 86| 10.5k| break; 87| 10.5k| } 88| 10.5k| case op_drop: { 89| 10.5k| auto idx = read(in, is_valid_size(vars[src])); 90| 10.5k| vars[dst] = vars[src].drop(idx); 91| 10.5k| break; 92| 10.5k| } 93| 10.5k| case op_concat: { 94| 10.5k| auto src2 = read(in, is_valid_var); 95| 10.5k| if (can_concat(vars[src], vars[src2])) 96| 10.5k| vars[dst] = vars[src] + vars[src2]; 97| 10.5k| break; 98| 10.5k| } 99| 10.5k| case op_push_back_move: { 100| 10.5k| vars[dst] = std::move(vars[src]).push_back(21); 101| 10.5k| break; 102| 10.5k| } 103| 10.5k| case op_update_move: { 104| 10.5k| auto idx = read(in, is_valid_index(vars[src])); 105| 10.5k| vars[dst] = 106| 10.5k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 10.5k| break; 108| 10.5k| } 109| 10.5k| case op_take_move: { 110| 10.5k| auto idx = read(in, is_valid_size(vars[src])); 111| 10.5k| vars[dst] = std::move(vars[src]).take(idx); 112| 10.5k| break; 113| 10.5k| } 114| 10.5k| case op_drop_move: { 115| 10.5k| auto idx = read(in, is_valid_size(vars[src])); 116| 10.5k| vars[dst] = std::move(vars[src]).drop(idx); 117| 10.5k| break; 118| 10.5k| } 119| 10.5k| case op_concat_move_l: { 120| 10.5k| auto src2 = read(in, is_valid_var_neq(src)); 121| 10.5k| if (can_concat(vars[src], vars[src2])) 122| 10.5k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 10.5k| break; 124| 10.5k| } 125| 10.5k| case op_concat_move_r: { 126| 10.5k| auto src2 = read(in, is_valid_var_neq(src)); 127| 10.5k| if (can_concat(vars[src], vars[src2])) 128| 10.5k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 10.5k| break; 130| 10.5k| } 131| 10.5k| case op_concat_move_lr: { 132| 10.5k| auto src2 = read(in, is_valid_var_neq(src)); 133| 10.5k| if (can_concat(vars[src], vars[src2])) 134| 10.5k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 10.5k| break; 136| 10.5k| } 137| 10.5k| case op_compare: { 138| 10.5k| using std::swap; 139| 10.5k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 140| 10.5k| swap(vars[src], vars[dst]); 141| 10.5k| break; 142| 10.5k| } 143| 10.5k| case op_erase: { 144| 10.5k| auto idx = read(in, is_valid_index(vars[src])); 145| 10.5k| vars[dst] = vars[src].erase(idx); 146| 10.5k| break; 147| 10.5k| } 148| 10.5k| case op_insert: { 149| 10.5k| auto idx = read(in, is_valid_size(vars[src])); 150| 10.5k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 10.5k| break; 152| 10.5k| } 153| 10.5k| default: 154| 10.5k| break; 155| 10.5k| }; 156| 10.5k| return true; 157| 10.5k| }); 158| 10.5k|} flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 52| 2.53M| return fuzzer_input{data, size}.run([&](auto& in) { 53| 2.53M| enum ops 54| 2.53M| { 55| 2.53M| op_push_back, 56| 2.53M| op_update, 57| 2.53M| op_take, 58| 2.53M| op_drop, 59| 2.53M| op_concat, 60| 2.53M| op_push_back_move, 61| 2.53M| op_update_move, 62| 2.53M| op_take_move, 63| 2.53M| op_drop_move, 64| 2.53M| op_concat_move_l, 65| 2.53M| op_concat_move_r, 66| 2.53M| op_concat_move_lr, 67| 2.53M| op_insert, 68| 2.53M| op_erase, 69| 2.53M| op_compare, 70| 2.53M| }; 71| 2.53M| auto src = read(in, is_valid_var); 72| 2.53M| auto dst = read(in, is_valid_var); 73| 2.53M| switch (read(in)) { 74| 347k| case op_push_back: { ------------------ | Branch (74:9): [True: 347k, False: 2.18M] ------------------ 75| 347k| vars[dst] = vars[src].push_back(42); 76| 347k| break; 77| 0| } 78| 171k| case op_update: { ------------------ | Branch (78:9): [True: 171k, False: 2.36M] ------------------ 79| 171k| auto idx = read(in, is_valid_index(vars[src])); 80| 171k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 171k| break; 82| 0| } 83| 1.89k| case op_take: { ------------------ | Branch (83:9): [True: 1.89k, False: 2.53M] ------------------ 84| 1.89k| auto idx = read(in, is_valid_size(vars[src])); 85| 1.89k| vars[dst] = vars[src].take(idx); 86| 1.89k| break; 87| 0| } 88| 16.9k| case op_drop: { ------------------ | Branch (88:9): [True: 16.9k, False: 2.51M] ------------------ 89| 16.9k| auto idx = read(in, is_valid_size(vars[src])); 90| 16.9k| vars[dst] = vars[src].drop(idx); 91| 16.9k| break; 92| 0| } 93| 651k| case op_concat: { ------------------ | Branch (93:9): [True: 651k, False: 1.88M] ------------------ 94| 651k| auto src2 = read(in, is_valid_var); 95| 651k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (95:17): [True: 638k, False: 12.4k] ------------------ 96| 638k| vars[dst] = vars[src] + vars[src2]; 97| 651k| break; 98| 0| } 99| 24.1k| case op_push_back_move: { ------------------ | Branch (99:9): [True: 24.1k, False: 2.51M] ------------------ 100| 24.1k| vars[dst] = std::move(vars[src]).push_back(21); 101| 24.1k| break; 102| 0| } 103| 32.2k| case op_update_move: { ------------------ | Branch (103:9): [True: 32.2k, False: 2.50M] ------------------ 104| 32.2k| auto idx = read(in, is_valid_index(vars[src])); 105| 32.2k| vars[dst] = 106| 32.2k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 32.2k| break; 108| 0| } 109| 31.4k| case op_take_move: { ------------------ | Branch (109:9): [True: 31.4k, False: 2.50M] ------------------ 110| 31.4k| auto idx = read(in, is_valid_size(vars[src])); 111| 31.4k| vars[dst] = std::move(vars[src]).take(idx); 112| 31.4k| break; 113| 0| } 114| 67.6k| case op_drop_move: { ------------------ | Branch (114:9): [True: 67.6k, False: 2.46M] ------------------ 115| 67.6k| auto idx = read(in, is_valid_size(vars[src])); 116| 67.6k| vars[dst] = std::move(vars[src]).drop(idx); 117| 67.6k| break; 118| 0| } 119| 184k| case op_concat_move_l: { ------------------ | Branch (119:9): [True: 184k, False: 2.35M] ------------------ 120| 184k| auto src2 = read(in, is_valid_var_neq(src)); 121| 184k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (121:17): [True: 181k, False: 2.13k] ------------------ 122| 181k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 184k| break; 124| 0| } 125| 4.03k| case op_concat_move_r: { ------------------ | Branch (125:9): [True: 4.03k, False: 2.53M] ------------------ 126| 4.03k| auto src2 = read(in, is_valid_var_neq(src)); 127| 4.03k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (127:17): [True: 3.65k, False: 375] ------------------ 128| 3.65k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 4.03k| break; 130| 0| } 131| 852k| case op_concat_move_lr: { ------------------ | Branch (131:9): [True: 852k, False: 1.68M] ------------------ 132| 852k| auto src2 = read(in, is_valid_var_neq(src)); 133| 852k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (133:17): [True: 845k, False: 7.31k] ------------------ 134| 845k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 852k| break; 136| 0| } 137| 92.7k| case op_compare: { ------------------ | Branch (137:9): [True: 92.7k, False: 2.44M] ------------------ 138| 92.7k| using std::swap; 139| 92.7k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (139:17): [True: 75.5k, False: 17.2k] | Branch (139:43): [True: 5.59k, False: 69.9k] ------------------ 140| 5.59k| swap(vars[src], vars[dst]); 141| 92.7k| break; 142| 0| } 143| 5.95k| case op_erase: { ------------------ | Branch (143:9): [True: 5.95k, False: 2.53M] ------------------ 144| 5.95k| auto idx = read(in, is_valid_index(vars[src])); 145| 5.95k| vars[dst] = vars[src].erase(idx); 146| 5.95k| break; 147| 0| } 148| 15.7k| case op_insert: { ------------------ | Branch (148:9): [True: 15.7k, False: 2.52M] ------------------ 149| 15.7k| auto idx = read(in, is_valid_size(vars[src])); 150| 15.7k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 15.7k| break; 152| 0| } 153| 26.2k| default: ------------------ | Branch (153:9): [True: 26.2k, False: 2.51M] ------------------ 154| 26.2k| break; 155| 2.53M| }; 156| 2.52M| return true; 157| 2.53M| }); 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.89M, False: 199k] | Branch (33:60): [True: 5.70M, False: 191k] ------------------ 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| 246k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (40:39): [True: 246k, False: 0] | Branch (40:51): [True: 209k, False: 36.7k] ------------------ flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_: 39| 210k| auto is_valid_index = [](auto& v) { 40| 210k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 210k| }; flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 80| 171k| 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| 146k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (43:39): [True: 146k, False: 0] | Branch (43:51): [True: 133k, False: 13.4k] ------------------ flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_: 42| 133k| auto is_valid_size = [](auto& v) { 43| 133k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 133k| }; 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.69M| auto can_concat = [](auto&& v1, auto&& v2) { 46| 1.69M| return v1.size() + v2.size() < vector_t::max_size(); 47| 1.69M| }; flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 106| 32.2k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 35| 1.09M| return [=](auto idx) { 36| 1.09M| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (36:20): [True: 1.08M, False: 10.3k] | Branch (36:32): [True: 1.06M, False: 17.0k] | Branch (36:51): [True: 1.04M, False: 24.9k] ------------------ 37| 1.09M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 34| 1.04M| auto is_valid_var_neq = [](auto other) { 35| 1.04M| return [=](auto idx) { 36| 1.04M| return idx >= 0 && idx < var_count && idx != other; 37| 1.04M| }; 38| 1.04M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 48| 92.7k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 92.7k| return v.size() < (1 << 15); 51| 92.7k| }; flex-vector-bo.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 10.5k| { 51| 10.5k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 6, False: 10.5k] ------------------ 52| 6| return 0; 53| 10.5k| try { 54| 2.53M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.52M, False: 10.5k] ------------------ 55| 2.52M| continue; 56| 10.5k| } catch (const no_more_input&) { 57| 10.5k| }; 58| 10.5k| return 0; 59| 10.5k| } flex-vector-bo.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 5.71M|{ 71| 5.71M| auto x = read(fz); 72| 6.10M| while (!cond(x)) ------------------ | Branch (72:12): [True: 390k, False: 5.71M] ------------------ 73| 390k| x = read(fz); 74| 5.71M| return x; 75| 5.71M|} _Z4readIcERKT_R12fuzzer_input: 64| 9.72M|{ 65| 9.72M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 9.72M|} _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.5k, False: 10.1M] ------------------ 44| 10.5k| 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| 210k|{ 71| 210k| auto x = read(fz); 72| 246k| while (!cond(x)) ------------------ | Branch (72:12): [True: 36.7k, False: 210k] ------------------ 73| 36.7k| x = read(fz); 74| 210k| return x; 75| 210k|} _Z4readIhERKT_R12fuzzer_input: 64| 393k|{ 65| 393k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 393k|} 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| 133k|{ 71| 133k| auto x = read(fz); 72| 147k| while (!cond(x)) ------------------ | Branch (72:12): [True: 13.4k, False: 133k] ------------------ 73| 13.4k| x = read(fz); 74| 133k| return x; 75| 133k|} flex-vector-bo.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 1.04M|{ 71| 1.04M| auto x = read(fz); 72| 1.09M| while (!cond(x)) ------------------ | Branch (72:12): [True: 52.2k, False: 1.04M] ------------------ 73| 52.2k| x = read(fz); 74| 1.04M| return x; 75| 1.04M|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 15.6k| : impl_{detail::make(std::forward(arg))} 86| 15.6k| { 87| 15.6k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 15.6k| : value(std::forward(args)...) 48| 15.6k| { 49| 15.6k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 15.6k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 15.6k| 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.6k| { 132| 15.6k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 15.6k, False: 0] | Branch (132:22): [True: 15.6k, False: 0] ------------------ 133| 15.6k| impl_->~holder(); 134| 15.6k| heap::deallocate(sizeof(holder), impl_); 135| 15.6k| } 136| 15.6k| } _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| 431M| { 171| 431M| return x.get_(type_t{}); 172| 431M| } _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| 431M| { 185| 431M| return n.get_(t); 186| 431M| } _ZNK5immer6detail3csl6memberINS_22unsafe_refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 431M| 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| 34.7M| { 166| 34.7M| return x.get_(type_t{}); 167| 34.7M| } _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| 34.7M| { 180| 34.7M| return n.get_(t); 181| 34.7M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 34.7M| 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| 287k| { 171| 287k| return x.get_(type_t{}); 172| 287k| } _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| 287k| { 185| 287k| return n.get_(t); 186| 287k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 287k| 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.63M| 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.63M| { 23| 9.63M| return x.dereference(); 24| 9.63M| } _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.72M| { 87| 9.72M| static_assert(std::is_base_of::value, 88| 9.72M| "must pass a derived thing"); 89| 9.72M| return *static_cast(this); 90| 9.72M| } _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| 180k| { 152| 180k| access_t::advance(derived(), n); 153| 180k| return derived(); 154| 180k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEElEEDcOT_T0_: 46| 180k| { 47| 180k| return x.advance(d); 48| 180k| } _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.42M| { 120| 8.42M| access_t::increment(derived()); 121| 8.42M| return derived(); 122| 8.42M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDcOT_: 28| 8.42M| { 29| 8.42M| return x.increment(); 30| 8.42M| } _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| 95.3k| { 165| 95.3k| auto tmp = derived(); 166| 95.3k| return tmp += n; 167| 95.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17make_inner_n_intoEPvmj: 213| 1.32M| { 214| 1.32M| assert(n <= branches); ------------------ | Branch (214:9): [True: 1.32M, False: 0] ------------------ 215| 1.32M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 1.32M, False: 0] ------------------ 216| 1.32M| auto p = new (buffer) node_t; 217| 1.32M| p->impl.d.data.inner.relaxed = nullptr; 218| 1.32M|#if IMMER_TAGGED_NODE 219| 1.32M| p->impl.d.kind = node_t::kind_t::inner; 220| 1.32M|#endif 221| 1.32M| return p; 222| 1.32M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14sizeof_inner_nEj: 145| 36.3M| { 146| 36.3M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 36.3M, Folded] ------------------ 147| 36.3M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 956| 112M| { 957| 112M| refs(this).inc(); 958| 112M| return this; 959| 112M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4refsEPKSB_: 203| 431M| { 204| 431M| return auto_const_cast(get(x->impl)); 205| 431M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE16make_leaf_n_intoEPvmj: 330| 1.19M| { 331| 1.19M| assert(n <= branches); ------------------ | Branch (331:9): [True: 1.19M, False: 0] ------------------ 332| 1.19M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 1.19M, False: 0] ------------------ 333| 1.19M| auto p = new (buffer) node_t; 334| 1.19M|#if IMMER_TAGGED_NODE 335| 1.19M| p->impl.d.kind = node_t::kind_t::leaf; 336| 1.19M|#endif 337| 1.19M| return p; 338| 1.19M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13sizeof_leaf_nEj: 160| 5.17M| { 161| 5.17M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 5.17M, Folded] ------------------ 162| 5.17M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7relaxedEv: 172| 618M| { 173| 618M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 618M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 618M, False: 0] ------------------ 174| 618M| return impl.d.data.inner.relaxed; 175| 618M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4kindEv: 168| 943M| 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| 231M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5innerEv: 184| 269M| { 185| 269M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 269M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 269M, False: 0] ------------------ 186| 269M| return impl.d.data.inner.get_storage_ptr(); 187| 269M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14delete_inner_rEPSB_j: 832| 31.1M| { 833| 31.1M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 31.1M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 31.1M, False: 0] ------------------ 834| 31.1M| auto r = p->relaxed(); 835| 31.1M| assert(r); ------------------ | Branch (835:9): [True: 31.1M, False: 0] ------------------ 836| 31.1M| static_if([&](auto) { 837| 31.1M| if (node_t::refs(r).dec()) 838| 31.1M| heap::deallocate(node_t::ownee(r).owned() 839| 31.1M| ? node_t::max_sizeof_relaxed 840| 31.1M| : node_t::sizeof_relaxed_n(n), 841| 31.1M| r); 842| 31.1M| }); 843| 31.1M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 31.1M] ------------------ 844| 31.1M| : node_t::sizeof_inner_r_n(n), 845| 31.1M| p); 846| 31.1M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPSB_: 210| 34.7M| 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| 62.1M| { 151| 62.1M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 62.1M, Folded] ------------------ 152| 62.1M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11delete_leafEPSB_j: 861| 1.59M| { 862| 1.59M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 68| 1.59M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (862:9): [True: 1.59M, False: 0] ------------------ 863| 1.59M| detail::destroy_n(p->leaf(), n); 864| 1.59M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (864:26): [True: 0, False: 1.59M] ------------------ 865| 1.59M| : node_t::sizeof_leaf_n(n), 866| 1.59M| p); 867| 1.59M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4leafEv: 190| 11.3M| { 191| 11.3M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 11.3M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 11.3M, False: 0] ------------------ 192| 11.3M| return impl.d.data.leaf.get_storage_ptr(); 193| 11.3M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12delete_innerEPSB_j: 808| 1.40M| { 809| 1.40M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 1.40M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 1.40M, False: 0] ------------------ 810| 1.40M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 1.40M, False: 0] ------------------ 811| 1.40M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 1.40M] ------------------ 812| 1.40M| : node_t::sizeof_inner_n(n), 813| 1.40M| p); 814| 1.40M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 295k| { 795| 295k| auto dst = copy_leaf_n(n + 1, src, n); 796| 295k| IMMER_TRY { ------------------ | | 49| 295k|#define IMMER_TRY try ------------------ 797| 295k| new (dst->leaf() + n) T(std::forward(x)); 798| 295k| } 799| 295k| 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| 295k| return dst; 805| 295k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_nEjPSB_j: 696| 295k| { 697| 295k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 295k, False: 0] ------------------ 698| 295k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 295k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 295k, False: 0] ------------------ 699| 295k| auto dst = make_leaf_n(allocn); 700| 295k| IMMER_TRY { ------------------ | | 49| 295k|#define IMMER_TRY try ------------------ 701| 295k| detail::uninitialized_copy( 702| 295k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 295k| } 704| 295k| 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| 295k| return dst; 709| 295k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nEj: 341| 1.19M| { 342| 1.19M| assert(n <= branches); ------------------ | Branch (342:9): [True: 1.19M, False: 0] ------------------ 343| 1.19M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 1.19M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 1.19M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nIiEEPSB_jOT_: 470| 52.2k| { 471| 52.2k| assert(n >= 1); ------------------ | Branch (471:9): [True: 52.2k, False: 0] ------------------ 472| 52.2k| auto p = make_leaf_n(n); 473| 52.2k| IMMER_TRY { ------------------ | | 49| 52.2k|#define IMMER_TRY try ------------------ 474| 52.2k| new (p->leaf()) T(std::forward(x)); 475| 52.2k| } 476| 52.2k| IMMER_CATCH (...) { 477| 0| heap::deallocate(node_t::sizeof_leaf_n(n), p); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 52.2k| return p; 481| 52.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13do_copy_innerEPSB_SC_j: 558| 1.20M| { 559| 1.20M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 1.20M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 1.20M, False: 0] ------------------ 560| 1.20M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 1.20M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 1.20M, False: 0] ------------------ 561| 1.20M| auto p = src->inner(); 562| 1.20M| inc_nodes(p, n); 563| 1.20M| std::copy(p, p + n, dst->inner()); 564| 1.20M| return dst; 565| 1.20M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9inc_nodesEPPSB_j: 970| 23.7M| { 971| 108M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 85.0M, False: 23.7M] ------------------ 972| 85.0M| refs(*i).inc(); 973| 23.7M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14copy_inner_r_nEjPSB_j: 588| 193k| { 589| 193k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 193k, False: 0] ------------------ 590| 193k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 193k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 193k, False: 0] ------------------ 591| 193k| auto dst = make_inner_r_n(allocn); 592| 193k| return do_copy_inner_r(dst, src, n); 593| 193k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15do_copy_inner_rEPSB_SC_j: 610| 252k| { 611| 252k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 252k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 252k, False: 0] ------------------ 612| 252k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 252k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 252k, False: 0] ------------------ 613| 252k| auto src_r = src->relaxed(); 614| 252k| auto dst_r = dst->relaxed(); 615| 252k| inc_nodes(src->inner(), n); 616| 252k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 252k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 252k| dst_r->d.count = n; 619| 252k| return dst; 620| 252k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_nEj: 243| 30.9M| { 244| 30.9M| assert(n <= branches); ------------------ | Branch (244:9): [True: 30.9M, False: 0] ------------------ 245| 30.9M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 30.9M| auto mr = static_cast(nullptr); 247| 30.9M| if (embed_relaxed) { ------------------ | Branch (247:13): [True: 30.9M, Folded] ------------------ 248| 30.9M| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 30.9M| } 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| 30.9M| auto p = new (mp) node_t; 259| 30.9M| auto r = new (mr) relaxed_t; 260| 30.9M| r->d.count = 0; 261| 30.9M| p->impl.d.data.inner.relaxed = r; 262| 30.9M|#if IMMER_TAGGED_NODE 263| 30.9M| p->impl.d.kind = node_t::kind_t::inner; 264| 30.9M|#endif 265| 30.9M| return p; 266| 30.9M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9make_pathEjPSB_: 498| 442k| { 499| 442k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 442k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 442k, False: 0] ------------------ 500| 442k| if (shift == endshift) ------------------ | Branch (500:13): [True: 368k, False: 74.1k] ------------------ 501| 368k| return node; 502| 74.1k| else { 503| 74.1k| auto n = node_t::make_inner_n(1); 504| 74.1k| IMMER_TRY { ------------------ | | 49| 74.1k|#define IMMER_TRY try ------------------ 505| 74.1k| n->inner()[0] = make_path(shift - B, node); 506| 74.1k| } 507| 74.1k| 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| 74.1k| return n; 512| 74.1k| } 513| 442k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_nEj: 224| 1.32M| { 225| 1.32M| assert(n <= branches); ------------------ | Branch (225:9): [True: 1.32M, False: 0] ------------------ 226| 1.32M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 1.32M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 1.32M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_j: 666| 184k| { 667| 184k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 184k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 184k, False: 0] ------------------ 668| 184k| auto dst = make_leaf_n(n); 669| 184k| IMMER_TRY { ------------------ | | 49| 184k|#define IMMER_TRY try ------------------ 670| 184k| detail::uninitialized_copy( 671| 184k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 184k| } 673| 184k| 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| 184k| return dst; 678| 184k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_nEjPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeE: 269| 234k| { 270| 234k| return static_if( 271| 234k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 234k| [&](auto) { 273| 234k| auto p = 274| 234k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 234k| assert(r->d.count >= n); 276| 234k| node_t::refs(r).inc(); 277| 234k| p->impl.d.data.inner.relaxed = r; 278| 234k|#if IMMER_TAGGED_NODE 279| 234k| p->impl.d.kind = node_t::kind_t::inner; 280| 234k|#endif 281| 234k| return p; 282| 234k| }); 283| 234k| } _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| 234k| [&](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| 234k| { 653| 234k| if (embed_relaxed) ------------------ | Branch (653:13): [True: 234k, Folded] ------------------ 654| 234k| 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| 234k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE23do_copy_inner_replace_rEPSB_SC_jjSC_: 624| 234k| { 625| 234k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 234k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (625:9): [True: 234k, False: 0] ------------------ 626| 234k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 234k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (626:9): [True: 234k, False: 0] ------------------ 627| 234k| auto src_r = src->relaxed(); 628| 234k| auto dst_r = dst->relaxed(); 629| 234k| auto p = src->inner(); 630| 234k| inc_nodes(p, offset); 631| 234k| inc_nodes(p + offset + 1, n - offset - 1); 632| 234k| std::copy(src->inner(), src->inner() + n, dst->inner()); 633| 234k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 634| 234k| dst_r->d.count = n; 635| 234k| dst->inner()[offset] = child; 636| 234k| return dst; 637| 234k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 71.7k| { 570| 71.7k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 71.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 71.7k, False: 0] ------------------ 571| 71.7k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 71.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 71.7k, False: 0] ------------------ 572| 71.7k| auto p = src->inner(); 573| 71.7k| inc_nodes(p, offset); 574| 71.7k| inc_nodes(p + offset + 1, n - offset - 1); 575| 71.7k| std::copy(p, p + n, dst->inner()); 576| 71.7k| dst->inner()[offset] = child; 577| 71.7k| return dst; 578| 71.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_nEjPSB_j: 543| 10.2k| { 544| 10.2k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 10.2k, False: 0] ------------------ 545| 10.2k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 10.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 10.2k, False: 0] ------------------ 546| 10.2k| auto dst = make_inner_n(allocn); 547| 10.2k| return do_copy_inner(dst, src, n); 548| 10.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_rEPSB_j: 581| 3.71k| { 582| 3.71k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 3.71k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 3.71k, False: 0] ------------------ 583| 3.71k| auto dst = make_inner_r_n(n); 584| 3.71k| return do_copy_inner_r(dst, src, n); 585| 3.71k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13compute_shiftEv: 977| 3.35M| { 978| 3.35M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 313k, False: 3.03M] ------------------ 979| 313k| return endshift; 980| 3.03M| else 981| 3.03M| return B + inner()[0]->compute_shift(); 982| 3.35M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5checkEjm: 986| 313k| { 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| 313k| return true; 1023| 313k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jj: 778| 281k| { 779| 281k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 281k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 281k, False: 0] ------------------ 780| 281k| auto dst = make_leaf_n(last - idx); 781| 281k| IMMER_TRY { ------------------ | | 49| 281k|#define IMMER_TRY try ------------------ 782| 281k| detail::uninitialized_copy( 783| 281k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 281k| } 785| 281k| 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| 281k| return dst; 790| 281k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jSC_j: 712| 268k| { 713| 268k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 268k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 268k, False: 0] ------------------ 714| 268k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 268k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 268k, False: 0] ------------------ 715| 268k| auto dst = make_leaf_n(n1 + n2); 716| 268k| IMMER_TRY { ------------------ | | 49| 268k|#define IMMER_TRY try ------------------ 717| 268k| detail::uninitialized_copy( 718| 268k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 268k| } 720| 268k| 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| 268k| IMMER_TRY { ------------------ | | 49| 268k|#define IMMER_TRY try ------------------ 725| 268k| detail::uninitialized_copy( 726| 268k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 268k| } 728| 268k| 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| 268k| return dst; 734| 268k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 2.62M| { 871| 2.62M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 2.34M, False: 287k] | Branch (871:39): [True: 0, False: 287k] ------------------ 872| 2.62M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPKSB_: 207| 287k| { 208| 287k| return get(x->impl); 209| 287k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 45.4k| { 682| 45.4k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 45.4k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 45.4k, False: 0] ------------------ 683| 45.4k| auto dst = make_leaf_e(e); 684| 45.4k| IMMER_TRY { ------------------ | | 49| 45.4k|#define IMMER_TRY try ------------------ 685| 45.4k| detail::uninitialized_copy( 686| 45.4k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 45.4k| } 688| 45.4k| 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| 45.4k| return dst; 693| 45.4k| } _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.92k| { 486| 9.92k| auto p = make_leaf_e(e); 487| 9.92k| IMMER_TRY { ------------------ | | 49| 9.92k|#define IMMER_TRY try ------------------ 488| 9.92k| new (p->leaf()) T(std::forward(x)); 489| 9.92k| } 490| 9.92k| 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.92k| return p; 495| 9.92k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 176k| { 931| 176k| auto src_r = relaxed(); 932| 176k| return static_if( 933| 176k| [&](auto) { return src_r; }, 934| 176k| [&](auto) { 935| 176k| if (node_t::refs(src_r).unique() || 936| 176k| node_t::ownee(src_r).can_mutate(e)) 937| 176k| return src_r; 938| 176k| else { 939| 176k| auto dst_r = 940| 176k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 176k| if (src_r) { 942| 176k| std::copy( 943| 176k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 176k| if (node_t::refs(src_r).dec()) 945| 176k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 176k| src_r); 947| 176k| } 948| 176k| dst_r->d.count = n; 949| 176k| node_t::ownee(dst_r) = e; 950| 176k| return impl.d.data.inner.relaxed = dst_r; 951| 176k| } 952| 176k| }); 953| 176k| } _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| 176k| [&](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| 18.2k| { 597| 18.2k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 18.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (597:9): [True: 18.2k, False: 0] ------------------ 598| 18.2k| auto dst = make_inner_r_e(e); 599| 18.2k| return do_copy_inner_r(dst, src, n); 600| 18.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 286| 165k| { 287| 165k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 165k| auto mr = static_cast(nullptr); 289| 165k| if (embed_relaxed) { ------------------ | Branch (289:13): [True: 165k, Folded] ------------------ 290| 165k| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 165k| } 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| 165k| auto p = new (mp) node_t; 301| 165k| auto r = new (mr) relaxed_t; 302| 165k| ownee(p) = e; 303| 165k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 165k| r->d.count = 0; 305| 165k| p->impl.d.data.inner.relaxed = r; 306| 165k|#if IMMER_TAGGED_NODE 307| 165k| p->impl.d.kind = node_t::kind_t::inner; 308| 165k|#endif 309| 165k| return p; 310| 165k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_path_eENS9_5applyIS6_E4type4editEjPSB_: 516| 399k| { 517| 399k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 399k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 399k, False: 0] ------------------ 518| 399k| if (shift == endshift) ------------------ | Branch (518:13): [True: 345k, False: 53.3k] ------------------ 519| 345k| return node; 520| 53.3k| else { 521| 53.3k| auto n = node_t::make_inner_e(e); 522| 53.3k| IMMER_TRY { ------------------ | | 49| 53.3k|#define IMMER_TRY try ------------------ 523| 53.3k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 53.3k| } 525| 53.3k| IMMER_CATCH (...) { 526| 0| heap::deallocate(node_t::max_sizeof_inner, n); 527| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 528| 0| } 529| 53.3k| return n; 530| 53.3k| } 531| 399k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 84.6k| { 232| 84.6k| auto m = heap::allocate(max_sizeof_inner); 233| 84.6k| auto p = new (m) node_t; 234| 84.6k| ownee(p) = e; 235| 84.6k| p->impl.d.data.inner.relaxed = nullptr; 236| 84.6k|#if IMMER_TAGGED_NODE 237| 84.6k| p->impl.d.kind = node_t::kind_t::inner; 238| 84.6k|#endif 239| 84.6k| return p; 240| 84.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 20.1k| { 552| 20.1k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 20.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 20.1k, False: 0] ------------------ 553| 20.1k| auto dst = make_inner_e(e); 554| 20.1k| return do_copy_inner(dst, src, n); 555| 20.1k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 36.6k| { 604| 36.6k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 36.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 36.6k, False: 0] ------------------ 605| 36.6k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 36.6k| return do_copy_inner_sr(dst, src, n); 607| 36.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeE: 313| 36.6k| { 314| 36.6k| return static_if( 315| 36.6k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 36.6k| [&](auto) { 317| 36.6k| auto p = 318| 36.6k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 36.6k| node_t::refs(r).inc(); 320| 36.6k| p->impl.d.data.inner.relaxed = r; 321| 36.6k| node_t::ownee(p) = e; 322| 36.6k|#if IMMER_TAGGED_NODE 323| 36.6k| p->impl.d.kind = node_t::kind_t::inner; 324| 36.6k|#endif 325| 36.6k| return p; 326| 36.6k| }); 327| 36.6k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeEENKUlT_E_clINS0_7empty_tEEEDaSM_: 315| 36.6k| [&](auto) { return node_t::make_inner_r_e(e); }, _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE16do_copy_inner_srEPSB_SC_j: 640| 36.6k| { 641| 36.6k| if (embed_relaxed) ------------------ | Branch (641:13): [True: 36.6k, Folded] ------------------ 642| 36.6k| return do_copy_inner_r(dst, src, n); 643| 0| else { 644| 0| inc_nodes(src->inner(), n); 645| 0| std::copy(src->inner(), src->inner() + n, dst->inner()); 646| 0| return dst; 647| 0| } 648| 36.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 350k| { 764| 350k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 350k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 350k, False: 0] ------------------ 765| 350k| auto dst = make_leaf_e(e); 766| 350k| IMMER_TRY { ------------------ | | 49| 350k|#define IMMER_TRY try ------------------ 767| 350k| detail::uninitialized_copy( 768| 350k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 350k| } 770| 350k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 350k| return dst; 775| 350k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 207k| { 878| 207k| auto src_r = relaxed(); 879| 207k| return static_if( 880| 207k| [&](auto) { return src_r; }, 881| 207k| [&](auto) { 882| 207k| if (node_t::refs(src_r).unique() || 883| 207k| node_t::ownee(src_r).can_mutate(e)) 884| 207k| return src_r; 885| 207k| else { 886| 207k| auto dst_r = impl.d.data.inner.relaxed = 887| 207k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 207k| if (src_r) { 889| 207k| auto n = dst_r->d.count = src_r->d.count; 890| 207k| std::copy( 891| 207k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 207k| if (node_t::refs(src_r).dec()) 893| 207k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 207k| src_r); 895| 207k| } 896| 207k| node_t::ownee(dst_r) = e; 897| 207k| return dst_r; 898| 207k| } 899| 207k| }); 900| 207k| } _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| 207k| [&](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| 485| { 739| 485| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 485|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 485, False: 0] ------------------ 740| 485| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 485|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 485, False: 0] ------------------ 741| 485| auto dst = make_leaf_e(e); 742| 485| IMMER_TRY { ------------------ | | 49| 485|#define IMMER_TRY try ------------------ 743| 485| detail::uninitialized_copy( 744| 485| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 485| } 746| 485| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 485| IMMER_TRY { ------------------ | | 49| 485|#define IMMER_TRY try ------------------ 751| 485| detail::uninitialized_copy( 752| 485| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 485| } 754| 485| 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| 485| return dst; 760| 485| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 523| 156M| { 524| 156M| using node_t = node_type; 525| 156M| auto node = p.node(); 526| 156M| if (node->dec()) { ------------------ | Branch (526:13): [True: 31.1M, False: 125M] ------------------ 527| 31.1M| p.each(this_t{}); 528| 31.1M| node_t::delete_inner_r(node, p.count()); 529| 31.1M| } 530| 156M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 14.9M| { 535| 14.9M| using node_t = node_type; 536| 14.9M| auto node = p.node(); 537| 14.9M| if (node->dec()) { ------------------ | Branch (537:13): [True: 434k, False: 14.5M] ------------------ 538| 434k| p.each(this_t{}); 539| 434k| node_t::delete_inner(node, p.count()); 540| 434k| } 541| 14.9M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.69M| { 546| 1.69M| using node_t = node_type; 547| 1.69M| auto node = p.node(); 548| 1.69M| if (node->dec()) { ------------------ | Branch (548:13): [True: 562k, False: 1.12M] ------------------ 549| 562k| node_t::delete_leaf(node, p.count()); 550| 562k| } 551| 1.69M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 397k| { 546| 397k| using node_t = node_type; 547| 397k| auto node = p.node(); 548| 397k| if (node->dec()) { ------------------ | Branch (548:13): [True: 52.4k, False: 345k] ------------------ 549| 52.4k| node_t::delete_leaf(node, p.count()); 550| 52.4k| } 551| 397k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 2.87M| { 535| 2.87M| using node_t = node_type; 536| 2.87M| auto node = p.node(); 537| 2.87M| if (node->dec()) { ------------------ | Branch (537:13): [True: 94.6k, False: 2.77M] ------------------ 538| 94.6k| p.each(this_t{}); 539| 94.6k| node_t::delete_inner(node, p.count()); 540| 94.6k| } 541| 2.87M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 916k| { 535| 916k| using node_t = node_type; 536| 916k| auto node = p.node(); 537| 916k| if (node->dec()) { ------------------ | Branch (537:13): [True: 866k, False: 50.0k] ------------------ 538| 866k| p.each(this_t{}); 539| 866k| node_t::delete_inner(node, p.count()); 540| 866k| } 541| 916k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 1.47M| { 535| 1.47M| using node_t = node_type; 536| 1.47M| auto node = p.node(); 537| 1.47M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 1.47M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 1.47M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 51.1M| { 546| 51.1M| using node_t = node_type; 547| 51.1M| auto node = p.node(); 548| 51.1M| if (node->dec()) { ------------------ | Branch (548:13): [True: 982k, False: 50.1M] ------------------ 549| 982k| node_t::delete_leaf(node, p.count()); 550| 982k| } 551| 51.1M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.33M| { 546| 1.33M| using node_t = node_type; 547| 1.33M| auto node = p.node(); 548| 1.33M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 1.33M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 1.33M| } _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| 195k| { 792| 195k| auto level = pos.shift(); 793| 195k| auto idx = pos.count() - 1; 794| 195k| auto children = pos.size(idx); 795| 195k| auto new_idx = 796| 195k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 13.4k, False: 181k] | Branch (796:47): [True: 884, False: 180k] ------------------ 797| 195k| auto new_child = static_cast(nullptr); 798| 195k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 3.74k, False: 191k] ------------------ 799| 3.74k| return nullptr; 800| 191k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 180k, False: 10.6k] ------------------ 801| 180k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 180k| if (!new_child) { ------------------ | Branch (802:17): [True: 4.04k, False: 176k] ------------------ 803| 4.04k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 1.81k, False: 2.22k] ------------------ 804| 1.81k| new_child = node_t::make_path(level - B, tail); 805| 2.22k| else 806| 2.22k| return nullptr; 807| 4.04k| } 808| 180k| } else 809| 10.6k| new_child = node_t::make_path(level - B, tail); 810| 189k| IMMER_TRY { ------------------ | | 49| 189k|#define IMMER_TRY try ------------------ 811| 189k| auto count = new_idx + 1; 812| 189k| auto new_parent = 813| 189k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 189k| auto new_relaxed = new_parent->relaxed(); 815| 189k| new_parent->inner()[new_idx] = new_child; 816| 189k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 189k| new_relaxed->d.count = count; 818| 189k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 189k, False: 0] ------------------ 819| 189k| return new_parent; 820| 189k| } 821| 189k| 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| 189k| } _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.9k| { 835| 39.9k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 39.9k, False: 0] ------------------ 836| 39.9k| auto idx = pos.index(pos.size() - 1); 837| 39.9k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 39.9k| auto count = new_idx + 1; 839| 39.9k| auto new_parent = node_t::make_inner_n(count); 840| 39.9k| IMMER_TRY { ------------------ | | 49| 39.9k|#define IMMER_TRY try ------------------ 841| 39.9k| new_parent->inner()[new_idx] = 842| 39.9k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 29.9k, False: 10.0k] ------------------ 843| | /* otherwise */ 844| 39.9k| : node_t::make_path(pos.shift() - B, tail); 845| 39.9k| } 846| 39.9k| 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.9k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 39.9k| } _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| 823k| { 835| 823k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 823k, False: 0] ------------------ 836| 823k| auto idx = pos.index(pos.size() - 1); 837| 823k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 823k| auto count = new_idx + 1; 839| 823k| auto new_parent = node_t::make_inner_n(count); 840| 823k| IMMER_TRY { ------------------ | | 49| 823k|#define IMMER_TRY try ------------------ 841| 823k| new_parent->inner()[new_idx] = 842| 823k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 517k, False: 306k] ------------------ 843| | /* otherwise */ 844| 823k| : node_t::make_path(pos.shift() - B, tail); 845| 823k| } 846| 823k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 823k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 823k| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_jm: 562| 426|{ 563| 426| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 426|} _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| 297k| { 835| 297k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 297k, False: 0] ------------------ 836| 297k| auto idx = pos.index(pos.size() - 1); 837| 297k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 297k| auto count = new_idx + 1; 839| 297k| auto new_parent = node_t::make_inner_n(count); 840| 297k| IMMER_TRY { ------------------ | | 49| 297k|#define IMMER_TRY try ------------------ 841| 297k| new_parent->inner()[new_idx] = 842| 297k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 276k, False: 20.8k] ------------------ 843| | /* otherwise */ 844| 297k| : node_t::make_path(pos.shift() - B, tail); 845| 297k| } 846| 297k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 297k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 297k| } 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| 119k| { 503| 119k| auto offset = pos.index(idx); 504| 119k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 119k| IMMER_TRY { ------------------ | | 49| 119k|#define IMMER_TRY try ------------------ 506| 119k| node->leaf()[offset] = 507| 119k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 119k| return node; 509| 119k| } 510| 119k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 119k| } 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| 234k| { 467| 234k| auto offset = pos.index(idx); 468| 234k| auto count = pos.count(); 469| 234k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 234k| IMMER_TRY { ------------------ | | 49| 234k|#define IMMER_TRY try ------------------ 471| 234k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 234k| node_t::do_copy_inner_replace_sr( 473| 234k| node, pos.node(), count, offset, child); 474| 234k| return node; 475| 234k| } 476| 234k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 234k| } 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| 52.0k| { 485| 52.0k| auto offset = pos.index(idx); 486| 52.0k| auto count = pos.count(); 487| 52.0k| auto node = node_t::make_inner_n(count); 488| 52.0k| IMMER_TRY { ------------------ | | 49| 52.0k|#define IMMER_TRY try ------------------ 489| 52.0k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 52.0k| node_t::do_copy_inner_replace( 491| 52.0k| node, pos.node(), count, offset, child); 492| 52.0k| return node; 493| 52.0k| } 494| 52.0k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 52.0k| } 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| 14.5k| { 503| 14.5k| auto offset = pos.index(idx); 504| 14.5k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 14.5k| IMMER_TRY { ------------------ | | 49| 14.5k|#define IMMER_TRY try ------------------ 506| 14.5k| node->leaf()[offset] = 507| 14.5k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 14.5k| return node; 509| 14.5k| } 510| 14.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| 14.5k| } 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| 37.5k| { 503| 37.5k| auto offset = pos.index(idx); 504| 37.5k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 37.5k| IMMER_TRY { ------------------ | | 49| 37.5k|#define IMMER_TRY try ------------------ 506| 37.5k| node->leaf()[offset] = 507| 37.5k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 37.5k| return node; 509| 37.5k| } 510| 37.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| 37.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| 6.91k| { 485| 6.91k| auto offset = pos.index(idx); 486| 6.91k| auto count = pos.count(); 487| 6.91k| auto node = node_t::make_inner_n(count); 488| 6.91k| IMMER_TRY { ------------------ | | 49| 6.91k|#define IMMER_TRY try ------------------ 489| 6.91k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 6.91k| node_t::do_copy_inner_replace( 491| 6.91k| node, pos.node(), count, offset, child); 492| 6.91k| return node; 493| 6.91k| } 494| 6.91k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 6.91k| } _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| 29.4k| { 1097| 29.4k| auto idx = pos.index(last); 1098| 29.4k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 29.4k, Folded] | Branch (1098:25): [True: 22.3k, False: 7.07k] ------------------ 1099| 22.3k| return pos.towards_oh(this_t{}, last, idx); 1100| 22.3k| } else { 1101| 7.07k| using std::get; 1102| 7.07k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 7.07k| auto next = get<1>(subs); 1104| 7.07k| auto ts = get<2>(subs); 1105| 7.07k| auto tail = get<3>(subs); 1106| 7.07k| IMMER_TRY { ------------------ | | 49| 7.07k|#define IMMER_TRY try ------------------ 1107| 7.07k| if (next) { ------------------ | Branch (1107:21): [True: 3.95k, False: 3.12k] ------------------ 1108| 3.95k| auto count = idx + 1; 1109| 3.95k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 3.95k| auto newr = newn->relaxed(); 1111| 3.95k| newn->inner()[idx] = next; 1112| 3.95k| newr->d.sizes[idx] = last + 1 - ts; 1113| 3.95k| newr->d.count = count; 1114| 3.95k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 3.95k, False: 0] ------------------ 1115| 3.95k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 3.95k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 3.12k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 3.12k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 3.12k, Folded] | Branch (1118:40): [True: 1.67k, False: 1.45k] | Branch (1118:52): [True: 1.06k, False: 611] ------------------ 1119| 1.06k| auto newn = pos.node()->inner()[0]; 1120| 1.06k| return std::make_tuple( 1121| 1.06k| pos.shift() - B, newn->inc(), ts, tail); 1122| 2.06k| } else { 1123| 2.06k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 2.06k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 2.06k| } 1126| 7.07k| } 1127| 7.07k| 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.07k| } 1138| 29.4k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 1.64k| { 1182| 1.64k| auto old_tail_size = pos.count(); 1183| 1.64k| auto new_tail_size = pos.index(last) + 1; 1184| 1.64k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 408, False: 1.23k] ------------------ 1185| 1.64k| ? pos.node()->inc() 1186| 1.64k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.64k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.64k| } _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.16k| { 1182| 4.16k| auto old_tail_size = pos.count(); 1183| 4.16k| auto new_tail_size = pos.index(last) + 1; 1184| 4.16k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.50k, False: 2.66k] ------------------ 1185| 4.16k| ? pos.node()->inc() 1186| 4.16k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 4.16k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 4.16k| } _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.67k| { 1097| 3.67k| auto idx = pos.index(last); 1098| 3.67k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 3.67k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 3.67k| } else { 1101| 3.67k| using std::get; 1102| 3.67k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 3.67k| auto next = get<1>(subs); 1104| 3.67k| auto ts = get<2>(subs); 1105| 3.67k| auto tail = get<3>(subs); 1106| 3.67k| IMMER_TRY { ------------------ | | 49| 3.67k|#define IMMER_TRY try ------------------ 1107| 3.67k| if (next) { ------------------ | Branch (1107:21): [True: 780, False: 2.89k] ------------------ 1108| 780| auto count = idx + 1; 1109| 780| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 780| auto newr = newn->relaxed(); 1111| 780| newn->inner()[idx] = next; 1112| 780| newr->d.sizes[idx] = last + 1 - ts; 1113| 780| newr->d.count = count; 1114| 780| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 780, False: 0] ------------------ 1115| 780| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 2.89k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 1.24k, False: 1.65k] ------------------ 1117| 1.24k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 1.65k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 1.65k] | 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.65k| } else { 1123| 1.65k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.65k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.65k| } 1126| 3.67k| } 1127| 3.67k| 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.67k| } 1138| 3.67k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.90k| { 1143| 2.90k| auto idx = pos.index(last); 1144| 2.90k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.90k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.90k| } else { 1147| 2.90k| using std::get; 1148| 2.90k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.90k| auto next = get<1>(subs); 1150| 2.90k| auto ts = get<2>(subs); 1151| 2.90k| auto tail = get<3>(subs); 1152| 2.90k| IMMER_TRY { ------------------ | | 49| 2.90k|#define IMMER_TRY try ------------------ 1153| 2.90k| if (next) { ------------------ | Branch (1153:21): [True: 1.55k, False: 1.35k] ------------------ 1154| 1.55k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.55k| newn->inner()[idx] = next; 1156| 1.55k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.55k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 603, False: 754] ------------------ 1158| 603| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 754| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 754] | 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| 754| } else { 1164| 754| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 754| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 754| } 1167| 2.90k| } 1168| 2.90k| 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.90k| } 1177| 2.90k| } _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.87k| { 1182| 5.87k| auto old_tail_size = pos.count(); 1183| 5.87k| auto new_tail_size = pos.index(last) + 1; 1184| 5.87k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.86k, False: 4.00k] ------------------ 1185| 5.87k| ? pos.node()->inc() 1186| 5.87k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 5.87k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 5.87k| } _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.18k| { 1143| 2.18k| auto idx = pos.index(last); 1144| 2.18k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.18k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.18k| } else { 1147| 2.18k| using std::get; 1148| 2.18k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.18k| auto next = get<1>(subs); 1150| 2.18k| auto ts = get<2>(subs); 1151| 2.18k| auto tail = get<3>(subs); 1152| 2.18k| IMMER_TRY { ------------------ | | 49| 2.18k|#define IMMER_TRY try ------------------ 1153| 2.18k| if (next) { ------------------ | Branch (1153:21): [True: 266, False: 1.91k] ------------------ 1154| 266| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 266| newn->inner()[idx] = next; 1156| 266| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.91k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 582, False: 1.33k] ------------------ 1158| 582| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.33k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.33k] | 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.33k| } else { 1164| 1.33k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.33k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.33k| } 1167| 2.18k| } 1168| 2.18k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 2.18k| } 1177| 2.18k| } _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.61k| { 1182| 2.61k| auto old_tail_size = pos.count(); 1183| 2.61k| auto new_tail_size = pos.index(last) + 1; 1184| 2.61k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.25k, False: 1.35k] ------------------ 1185| 2.61k| ? pos.node()->inc() 1186| 2.61k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.61k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.61k| } _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.69k| { 1143| 2.69k| auto idx = pos.index(last); 1144| 2.69k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.69k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.69k| } else { 1147| 2.69k| using std::get; 1148| 2.69k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.69k| auto next = get<1>(subs); 1150| 2.69k| auto ts = get<2>(subs); 1151| 2.69k| auto tail = get<3>(subs); 1152| 2.69k| IMMER_TRY { ------------------ | | 49| 2.69k|#define IMMER_TRY try ------------------ 1153| 2.69k| if (next) { ------------------ | Branch (1153:21): [True: 669, False: 2.02k] ------------------ 1154| 669| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 669| newn->inner()[idx] = next; 1156| 669| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.02k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 860, False: 1.16k] ------------------ 1158| 860| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.16k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.16k] | Branch (1159:40): [True: 0, False: 0] | Branch (1159:52): [True: 0, False: 0] ------------------ 1160| 0| auto newn = pos.node()->inner()[0]; 1161| 0| return std::make_tuple( 1162| 0| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.16k| } else { 1164| 1.16k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.16k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.16k| } 1167| 2.69k| } 1168| 2.69k| 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.69k| } 1177| 2.69k| } _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| 8.03k| { 1143| 8.03k| auto idx = pos.index(last); 1144| 8.03k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 8.03k, Folded] | Branch (1144:25): [True: 5.67k, False: 2.35k] ------------------ 1145| 5.67k| return pos.towards_oh(this_t{}, last, idx); 1146| 5.67k| } else { 1147| 2.35k| using std::get; 1148| 2.35k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.35k| auto next = get<1>(subs); 1150| 2.35k| auto ts = get<2>(subs); 1151| 2.35k| auto tail = get<3>(subs); 1152| 2.35k| IMMER_TRY { ------------------ | | 49| 2.35k|#define IMMER_TRY try ------------------ 1153| 2.35k| if (next) { ------------------ | Branch (1153:21): [True: 550, False: 1.80k] ------------------ 1154| 550| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 550| newn->inner()[idx] = next; 1156| 550| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.80k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 1.80k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.80k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 1.80k, Folded] | Branch (1159:40): [True: 1.10k, False: 707] | Branch (1159:52): [True: 694, False: 408] ------------------ 1160| 694| auto newn = pos.node()->inner()[0]; 1161| 694| return std::make_tuple( 1162| 694| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.11k| } else { 1164| 1.11k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.11k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.11k| } 1167| 2.35k| } 1168| 2.35k| 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.35k| } 1177| 8.03k| } _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.71k| { 1182| 1.71k| auto old_tail_size = pos.count(); 1183| 1.71k| auto new_tail_size = pos.index(last) + 1; 1184| 1.71k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 672, False: 1.04k] ------------------ 1185| 1.71k| ? pos.node()->inc() 1186| 1.71k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.71k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.71k| } _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.41k| { 1143| 5.41k| auto idx = pos.index(last); 1144| 5.41k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 5.41k, Folded] | Branch (1144:25): [True: 2.19k, False: 3.21k] ------------------ 1145| 2.19k| return pos.towards_oh(this_t{}, last, idx); 1146| 3.21k| } else { 1147| 3.21k| using std::get; 1148| 3.21k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.21k| auto next = get<1>(subs); 1150| 3.21k| auto ts = get<2>(subs); 1151| 3.21k| auto tail = get<3>(subs); 1152| 3.21k| IMMER_TRY { ------------------ | | 49| 3.21k|#define IMMER_TRY try ------------------ 1153| 3.21k| if (next) { ------------------ | Branch (1153:21): [True: 393, False: 2.82k] ------------------ 1154| 393| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 393| newn->inner()[idx] = next; 1156| 393| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.82k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.82k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.82k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.82k, Folded] | Branch (1159:40): [True: 756, False: 2.06k] | Branch (1159:52): [True: 323, False: 433] ------------------ 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.50k| } else { 1164| 2.50k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 2.50k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 2.50k| } 1167| 3.21k| } 1168| 3.21k| 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.21k| } 1177| 5.41k| } _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| 743| { 1182| 743| auto old_tail_size = pos.count(); 1183| 743| auto new_tail_size = pos.index(last) + 1; 1184| 743| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 328, False: 415] ------------------ 1185| 743| ? pos.node()->inc() 1186| 743| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 743| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 743| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 26.1k| { 1415| 26.1k| auto idx = pos.subindex(first); 1416| 26.1k| auto count = pos.count(); 1417| 26.1k| auto left_size = pos.size_before(idx); 1418| 26.1k| auto child_size = pos.size_sbh(idx, left_size); 1419| 26.1k| auto dropped_size = first; 1420| 26.1k| auto child_dropped_size = dropped_size - left_size; 1421| 26.1k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 26.1k, Folded] | Branch (1421:25): [True: 24.2k, False: 1.88k] | Branch (1421:45): [True: 3.68k, False: 20.5k] ------------------ 1422| 3.68k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 22.4k| } else { 1424| 22.4k| using std::get; 1425| 22.4k| auto n = pos.node(); 1426| 22.4k| auto newc = count - idx; 1427| 22.4k| auto newn = node_t::make_inner_r_n(newc); 1428| 22.4k| IMMER_TRY { ------------------ | | 49| 22.4k|#define IMMER_TRY try ------------------ 1429| 22.4k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 22.4k| auto newr = newn->relaxed(); 1431| 22.4k| newr->d.count = count - idx; 1432| 22.4k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 22.4k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 22.4k, False: 0] ------------------ 1434| 22.4k| pos.copy_sizes(idx + 1, 1435| 22.4k| newr->d.count - 1, 1436| 22.4k| newr->d.sizes[0], 1437| 22.4k| newr->d.sizes + 1); 1438| 22.4k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 22.4k, False: 0] ------------------ 1439| 22.4k| pos.size() - dropped_size); 1440| 22.4k| newn->inner()[0] = get<1>(subs); 1441| 22.4k| std::copy(n->inner() + idx + 1, 1442| 22.4k| n->inner() + count, 1443| 22.4k| newn->inner() + 1); 1444| 22.4k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 22.4k| return std::make_tuple(pos.shift(), newn); 1446| 22.4k| } 1447| 22.4k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 22.4k| } 1452| 26.1k| } _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| 20.7k| { 1457| 20.7k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 20.7k| return std::make_tuple(0, n); 1459| 20.7k| } _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| 101k| { 1415| 101k| auto idx = pos.subindex(first); 1416| 101k| auto count = pos.count(); 1417| 101k| auto left_size = pos.size_before(idx); 1418| 101k| auto child_size = pos.size_sbh(idx, left_size); 1419| 101k| auto dropped_size = first; 1420| 101k| auto child_dropped_size = dropped_size - left_size; 1421| 101k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 101k] | 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| 101k| } else { 1424| 101k| using std::get; 1425| 101k| auto n = pos.node(); 1426| 101k| auto newc = count - idx; 1427| 101k| auto newn = node_t::make_inner_r_n(newc); 1428| 101k| IMMER_TRY { ------------------ | | 49| 101k|#define IMMER_TRY try ------------------ 1429| 101k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 101k| auto newr = newn->relaxed(); 1431| 101k| newr->d.count = count - idx; 1432| 101k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 101k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 101k, False: 0] ------------------ 1434| 101k| pos.copy_sizes(idx + 1, 1435| 101k| newr->d.count - 1, 1436| 101k| newr->d.sizes[0], 1437| 101k| newr->d.sizes + 1); 1438| 101k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 101k, False: 0] ------------------ 1439| 101k| pos.size() - dropped_size); 1440| 101k| newn->inner()[0] = get<1>(subs); 1441| 101k| std::copy(n->inner() + idx + 1, 1442| 101k| n->inner() + count, 1443| 101k| newn->inner() + 1); 1444| 101k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 101k| return std::make_tuple(pos.shift(), newn); 1446| 101k| } 1447| 101k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 101k| } 1452| 101k| } _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.70k| { 1415| 1.70k| auto idx = pos.subindex(first); 1416| 1.70k| auto count = pos.count(); 1417| 1.70k| auto left_size = pos.size_before(idx); 1418| 1.70k| auto child_size = pos.size_sbh(idx, left_size); 1419| 1.70k| auto dropped_size = first; 1420| 1.70k| auto child_dropped_size = dropped_size - left_size; 1421| 1.70k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 1.70k] | 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.70k| } else { 1424| 1.70k| using std::get; 1425| 1.70k| auto n = pos.node(); 1426| 1.70k| auto newc = count - idx; 1427| 1.70k| auto newn = node_t::make_inner_r_n(newc); 1428| 1.70k| IMMER_TRY { ------------------ | | 49| 1.70k|#define IMMER_TRY try ------------------ 1429| 1.70k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 1.70k| auto newr = newn->relaxed(); 1431| 1.70k| newr->d.count = count - idx; 1432| 1.70k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 1.70k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 1.70k, False: 0] ------------------ 1434| 1.70k| pos.copy_sizes(idx + 1, 1435| 1.70k| newr->d.count - 1, 1436| 1.70k| newr->d.sizes[0], 1437| 1.70k| newr->d.sizes + 1); 1438| 1.70k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 1.70k, False: 0] ------------------ 1439| 1.70k| pos.size() - dropped_size); 1440| 1.70k| newn->inner()[0] = get<1>(subs); 1441| 1.70k| std::copy(n->inner() + idx + 1, 1442| 1.70k| n->inner() + count, 1443| 1.70k| newn->inner() + 1); 1444| 1.70k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 1.70k| return std::make_tuple(pos.shift(), newn); 1446| 1.70k| } 1447| 1.70k| 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.70k| } 1452| 1.70k| } _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.86k| { 1457| 9.86k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 9.86k| return std::make_tuple(0, n); 1459| 9.86k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE11visit_innerIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 7.42k| { 1415| 7.42k| auto idx = pos.subindex(first); 1416| 7.42k| auto count = pos.count(); 1417| 7.42k| auto left_size = pos.size_before(idx); 1418| 7.42k| auto child_size = pos.size_sbh(idx, left_size); 1419| 7.42k| auto dropped_size = first; 1420| 7.42k| auto child_dropped_size = dropped_size - left_size; 1421| 7.42k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 7.42k] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 7.42k| } else { 1424| 7.42k| using std::get; 1425| 7.42k| auto n = pos.node(); 1426| 7.42k| auto newc = count - idx; 1427| 7.42k| auto newn = node_t::make_inner_r_n(newc); 1428| 7.42k| IMMER_TRY { ------------------ | | 49| 7.42k|#define IMMER_TRY try ------------------ 1429| 7.42k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 7.42k| auto newr = newn->relaxed(); 1431| 7.42k| newr->d.count = count - idx; 1432| 7.42k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 7.42k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 7.42k, False: 0] ------------------ 1434| 7.42k| pos.copy_sizes(idx + 1, 1435| 7.42k| newr->d.count - 1, 1436| 7.42k| newr->d.sizes[0], 1437| 7.42k| newr->d.sizes + 1); 1438| 7.42k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 7.42k, False: 0] ------------------ 1439| 7.42k| pos.size() - dropped_size); 1440| 7.42k| newn->inner()[0] = get<1>(subs); 1441| 7.42k| std::copy(n->inner() + idx + 1, 1442| 7.42k| n->inner() + count, 1443| 7.42k| newn->inner() + 1); 1444| 7.42k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 7.42k| return std::make_tuple(pos.shift(), newn); 1446| 7.42k| } 1447| 7.42k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 7.42k| } 1452| 7.42k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 9.73k| { 1415| 9.73k| auto idx = pos.subindex(first); 1416| 9.73k| auto count = pos.count(); 1417| 9.73k| auto left_size = pos.size_before(idx); 1418| 9.73k| auto child_size = pos.size_sbh(idx, left_size); 1419| 9.73k| auto dropped_size = first; 1420| 9.73k| auto child_dropped_size = dropped_size - left_size; 1421| 9.73k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 9.73k, Folded] | Branch (1421:25): [True: 6.60k, False: 3.12k] | Branch (1421:45): [True: 2.32k, False: 4.28k] ------------------ 1422| 2.32k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 7.40k| } else { 1424| 7.40k| using std::get; 1425| 7.40k| auto n = pos.node(); 1426| 7.40k| auto newc = count - idx; 1427| 7.40k| auto newn = node_t::make_inner_r_n(newc); 1428| 7.40k| IMMER_TRY { ------------------ | | 49| 7.40k|#define IMMER_TRY try ------------------ 1429| 7.40k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 7.40k| auto newr = newn->relaxed(); 1431| 7.40k| newr->d.count = count - idx; 1432| 7.40k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 7.40k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 7.40k, False: 0] ------------------ 1434| 7.40k| pos.copy_sizes(idx + 1, 1435| 7.40k| newr->d.count - 1, 1436| 7.40k| newr->d.sizes[0], 1437| 7.40k| newr->d.sizes + 1); 1438| 7.40k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 7.40k, False: 0] ------------------ 1439| 7.40k| pos.size() - dropped_size); 1440| 7.40k| newn->inner()[0] = get<1>(subs); 1441| 7.40k| std::copy(n->inner() + idx + 1, 1442| 7.40k| n->inner() + count, 1443| 7.40k| newn->inner() + 1); 1444| 7.40k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 7.40k| return std::make_tuple(pos.shift(), newn); 1446| 7.40k| } 1447| 7.40k| 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.40k| } 1452| 9.73k| } _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| 745| { 1415| 745| auto idx = pos.subindex(first); 1416| 745| auto count = pos.count(); 1417| 745| auto left_size = pos.size_before(idx); 1418| 745| auto child_size = pos.size_sbh(idx, left_size); 1419| 745| auto dropped_size = first; 1420| 745| auto child_dropped_size = dropped_size - left_size; 1421| 745| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 745, Folded] | Branch (1421:25): [True: 278, False: 467] | Branch (1421:45): [True: 0, False: 278] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 745| } else { 1424| 745| using std::get; 1425| 745| auto n = pos.node(); 1426| 745| auto newc = count - idx; 1427| 745| auto newn = node_t::make_inner_r_n(newc); 1428| 745| IMMER_TRY { ------------------ | | 49| 745|#define IMMER_TRY try ------------------ 1429| 745| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 745| auto newr = newn->relaxed(); 1431| 745| newr->d.count = count - idx; 1432| 745| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 745| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 745, False: 0] ------------------ 1434| 745| pos.copy_sizes(idx + 1, 1435| 745| newr->d.count - 1, 1436| 745| newr->d.sizes[0], 1437| 745| newr->d.sizes + 1); 1438| 745| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 745, False: 0] ------------------ 1439| 745| pos.size() - dropped_size); 1440| 745| newn->inner()[0] = get<1>(subs); 1441| 745| std::copy(n->inner() + idx + 1, 1442| 745| n->inner() + count, 1443| 745| newn->inner() + 1); 1444| 745| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 745| return std::make_tuple(pos.shift(), newn); 1446| 745| } 1447| 745| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 745| } 1452| 745| } _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.26k|{ 2002| 7.26k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 7.26k| .visit(concat_trees_left_visitor{}, 2004| 7.26k| empty_leaf_pos{}, 2005| 7.26k| rroot, 2006| 7.26k| rshift, 2007| 7.26k| rsize) 2008| 7.26k| .realize(); 2009| 7.26k|} _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.26k| { 1972| 7.26k| return visit_maybe_relaxed_sub( 1973| 7.26k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 7.26k| } _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.11k| { 1959| 5.11k| return concat_inners(lpos, tpos, rpos); 1960| 5.11k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 21.7k|{ 1873| 21.7k| auto lshift = lpos.shift(); 1874| 21.7k| auto rshift = rpos.shift(); 1875| 21.7k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 21.7k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 21.7k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 16.9k, False: 4.83k] ------------------ 1879| 16.9k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 16.9k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 16.9k| } else { 1882| 4.83k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 4.83k, False: 0] ------------------ 1883| 4.83k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 4.83k] | Branch (1883:9): [True: 4.83k, False: 0] | Branch (1883:9): [True: 4.83k, False: 0] ------------------ 1884| 4.83k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 4.83k| return concat_rebalance(lpos, cpos, rpos); 1886| 4.83k| } 1887| 21.7k|} _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8each_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1512| 12.2M| { 1513| 12.2M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.00M, False: 11.2M] ------------------ 1514| 1.00M| auto s = size_t{}; 1515| 4.01M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.01M, False: 1.00M] ------------------ 1516| 3.01M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.01M| s = sizes_[i]; 1518| 3.01M| } 1519| 11.2M| } else { 1520| 30.0M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 18.8M, False: 11.2M] ------------------ 1521| 18.8M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 18.8M| .visit(v, args...); 1523| 11.2M| } 1524| 12.2M| } _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.33M| { 1734| 7.33M| auto count = p.count(); 1735| 7.33M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 7.33M, False: 0] ------------------ 1736| 7.33M| plan.counts[plan.n++] = count; 1737| 7.33M| plan.total += count; 1738| 7.33M| } _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| 102M| { 1734| 102M| auto count = p.count(); 1735| 102M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 102M, False: 0] ------------------ 1736| 102M| plan.counts[plan.n++] = count; 1737| 102M| plan.total += count; 1738| 102M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE7shuffleEj: 1762| 12.2M| { 1763| | // gcc seems to not really understand this code... :( 1764| 12.2M|#if !defined(_MSC_VER) 1765| 12.2M|#pragma GCC diagnostic push 1766| 12.2M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 12.2M|#endif 1768| 12.2M| constexpr count_t rrb_extras = 2; 1769| 12.2M| constexpr count_t rrb_invariant = 1; 1770| 12.2M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 1.00M, False: 11.2M] ------------------ 1771| 12.2M| const auto branches = count_t{1} << bits; 1772| 12.2M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 12.2M| count_t i = 0; 1774| 15.2M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 3.01M, False: 12.2M] ------------------ 1775| | // skip ok nodes 1776| 6.49M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 3.48M, False: 3.01M] ------------------ 1777| 3.48M| i++; 1778| 3.01M| assert(i < n); ------------------ | Branch (1778:13): [True: 3.01M, False: 0] ------------------ 1779| | // short node, redistribute 1780| 3.01M| auto remaining = counts[i]; 1781| 11.1M| do { 1782| 11.1M| auto next = counts[i + 1]; 1783| 11.1M| auto count = std::min(remaining + next, branches); 1784| 11.1M| counts[i] = count; 1785| 11.1M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 11.1M, False: 0] ------------------ 1786| 11.1M| remaining += next - count; 1787| 11.1M| ++i; 1788| 11.1M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 8.11M, False: 3.01M] ------------------ 1789| | // remove node 1790| 3.01M| std::move(counts + i + 1, counts + n, counts + i); 1791| 3.01M| --n; 1792| 3.01M| --i; 1793| 3.01M| } 1794| 12.2M|#if !defined(_MSC_VER) 1795| 12.2M|#pragma GCC diagnostic pop 1796| 12.2M|#endif 1797| 12.2M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1478| 24.4M| auto shift() const { return shift_; } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPjj: 1577| 12.2M| : curr_{counts} 1578| 12.2M| , n_{n} 1579| 12.2M| , result_{ 1580| 12.2M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 12.2M| { 1582| 12.2M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_m: 1481| 12.2M| : shift_{s} 1482| 12.2M| , count_{1} 1483| 12.2M| , nodes_{n0} 1484| 12.2M| , sizes_{s0} 1485| 12.2M| { 1486| 12.2M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8each_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1512| 12.2M| { 1513| 12.2M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.00M, False: 11.2M] ------------------ 1514| 1.00M| auto s = size_t{}; 1515| 4.01M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.01M, False: 1.00M] ------------------ 1516| 3.01M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.01M| s = sizes_[i]; 1518| 3.01M| } 1519| 11.2M| } else { 1520| 30.0M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 18.8M, False: 11.2M] ------------------ 1521| 18.8M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 18.8M| .visit(v, args...); 1523| 11.2M| } 1524| 12.2M| } _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.33M| { 1722| 7.33M| merger.merge_leaf(p); 1723| 7.33M| } _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.33M| { 1615| 7.33M| auto from = p.node(); 1616| 7.33M| auto from_size = p.size(); 1617| 7.33M| auto from_count = p.count(); 1618| 7.33M| assert(from_size); ------------------ | Branch (1618:9): [True: 7.33M, False: 0] ------------------ 1619| 7.33M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 7.22M, False: 113k] | Branch (1619:21): [True: 7.17M, False: 46.9k] ------------------ 1620| 7.17M| add_child(from, from_size); 1621| 7.17M| from->inc(); 1622| 7.17M| } else { 1623| 160k| auto from_offset = count_t{}; 1624| 160k| auto from_data = from->leaf(); 1625| 224k| do { 1626| 224k| if (!to_) { ------------------ | Branch (1626:21): [True: 110k, False: 113k] ------------------ 1627| 110k| to_ = node_t::make_leaf_n(*curr_); 1628| 110k| to_offset_ = 0; 1629| 110k| } 1630| 224k| auto data = to_->leaf(); 1631| 224k| auto to_copy = 1632| 224k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 224k| detail::uninitialized_copy(from_data + from_offset, 1634| 224k| from_data + from_offset + to_copy, 1635| 224k| data + to_offset_); 1636| 224k| to_offset_ += to_copy; 1637| 224k| from_offset += to_copy; 1638| 224k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 110k, False: 113k] ------------------ 1639| 110k| add_child(to_, to_offset_); 1640| 110k| to_ = nullptr; 1641| 110k| } 1642| 224k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 63.4k, False: 160k] ------------------ 1643| 160k| } 1644| 7.33M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9add_childEPSC_m: 1589| 115M| { 1590| 115M| assert(size); ------------------ | Branch (1590:9): [True: 115M, False: 0] ------------------ 1591| 115M| ++curr_; 1592| 115M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 115M| auto relaxed = parent->relaxed(); 1594| 115M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 7.71M, False: 107M] ------------------ 1595| 7.71M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 7.71M, False: 0] ------------------ 1596| 7.71M| n_ -= branches; 1597| 7.71M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 7.71M| relaxed = parent->relaxed(); 1599| 7.71M| result_.nodes_[result_.count_] = parent; 1600| 7.71M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 7.71M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 7.71M, False: 0] ------------------ 1602| 7.71M| ++result_.count_; 1603| 7.71M| } 1604| 115M| auto idx = relaxed->d.count++; 1605| 115M| result_.sizes_[result_.count_ - 1] += size; 1606| 115M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 115M, False: 0] ------------------ 1607| 115M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 95.2M, False: 19.9M] ------------------ 1608| 115M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 115M, False: 0] ------------------ 1609| 115M| parent->inner()[idx] = p; 1610| 115M| }; _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| 102M| { 1716| 102M| merger.merge_inner(p); 1717| 102M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 102M| { 1649| 102M| auto from = p.node(); 1650| 102M| auto from_size = p.size(); 1651| 102M| auto from_count = p.count(); 1652| 102M| assert(from_size); ------------------ | Branch (1652:9): [True: 102M, False: 0] ------------------ 1653| 102M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 92.6M, False: 9.43M] | Branch (1653:21): [True: 90.2M, False: 2.37M] ------------------ 1654| 90.2M| add_child(from, from_size); 1655| 90.2M| from->inc(); 1656| 90.2M| } else { 1657| 11.8M| auto from_offset = count_t{}; 1658| 11.8M| auto from_data = from->inner(); 1659| 18.2M| do { 1660| 18.2M| if (!to_) { ------------------ | Branch (1660:21): [True: 8.84M, False: 9.43M] ------------------ 1661| 8.84M| to_ = node_t::make_inner_r_n(*curr_); 1662| 8.84M| to_offset_ = 0; 1663| 8.84M| to_size_ = 0; 1664| 8.84M| } 1665| 18.2M| auto data = to_->inner(); 1666| 18.2M| auto to_copy = 1667| 18.2M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 18.2M| std::copy(from_data + from_offset, 1669| 18.2M| from_data + from_offset + to_copy, 1670| 18.2M| data + to_offset_); 1671| 18.2M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 18.2M| auto sizes = to_->relaxed()->d.sizes; 1673| 18.2M| p.copy_sizes( 1674| 18.2M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 18.2M| to_offset_ += to_copy; 1676| 18.2M| from_offset += to_copy; 1677| 18.2M| to_size_ = sizes[to_offset_ - 1]; 1678| 18.2M| assert(to_size_); ------------------ | Branch (1678:17): [True: 18.2M, False: 0] ------------------ 1679| 18.2M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 8.84M, False: 9.43M] ------------------ 1680| 8.84M| to_->relaxed()->d.count = to_offset_; 1681| 8.84M| add_child(to_, to_size_); 1682| 8.84M| to_ = nullptr; 1683| 8.84M| } 1684| 18.2M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 6.47M, False: 11.8M] ------------------ 1685| 11.8M| } 1686| 102M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6finishEv: 1689| 12.2M| { 1690| 12.2M| assert(!to_); ------------------ | Branch (1690:9): [True: 12.2M, False: 0] ------------------ 1691| 12.2M| return result_; 1692| 12.2M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8each_subINS1_11dec_visitorEJEEEvT_DpOT0_: 1512| 12.2M| { 1513| 12.2M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.00M, False: 11.2M] ------------------ 1514| 1.00M| auto s = size_t{}; 1515| 4.01M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.01M, False: 1.00M] ------------------ 1516| 3.01M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.01M| s = sizes_[i]; 1518| 3.01M| } 1519| 11.2M| } else { 1520| 30.0M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 18.8M, False: 11.2M] ------------------ 1521| 18.8M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 18.8M| .visit(v, args...); 1523| 11.2M| } 1524| 12.2M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_mSE_m: 1503| 999k| : shift_{s} 1504| 999k| , count_{3} 1505| 999k| , nodes_{n0, n1, n2} 1506| 999k| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 999k| { 1508| 999k| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_m: 1489| 7.26k| : shift_{s} 1490| 7.26k| , count_{2} 1491| 7.26k| , nodes_{n0, n1} 1492| 7.26k| , sizes_{s0, s0 + s1} 1493| 7.26k| { 1494| 7.26k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 16.6k| { 1918| 16.6k| return concat_inners(lpos, tpos, rpos); 1919| 16.6k| } _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| 281| { 1918| 281| return concat_inners(lpos, tpos, rpos); 1919| 281| } _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.43k|{ 1873| 2.43k| auto lshift = lpos.shift(); 1874| 2.43k| auto rshift = rpos.shift(); 1875| 2.43k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.43k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.43k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 610, False: 1.82k] ------------------ 1879| 610| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 610| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.82k| } else { 1882| 1.82k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.82k, False: 0] ------------------ 1883| 1.82k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.82k] | Branch (1883:9): [True: 1.82k, False: 0] | Branch (1883:9): [True: 1.82k, False: 0] ------------------ 1884| 1.82k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.82k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.82k| } 1887| 2.43k|} _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| 931| { 1918| 931| return concat_inners(lpos, tpos, rpos); 1919| 931| } _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| 931|{ 1873| 931| auto lshift = lpos.shift(); 1874| 931| auto rshift = rpos.shift(); 1875| 931| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 931] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 931| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 321, False: 610] ------------------ 1879| 321| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 321| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 610| } else { 1882| 610| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 610, False: 0] ------------------ 1883| 610| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 610] | Branch (1883:9): [True: 610, False: 0] | Branch (1883:9): [True: 610, False: 0] ------------------ 1884| 610| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 610| return concat_rebalance(lpos, cpos, rpos); 1886| 610| } 1887| 931|} _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| 723|{ 1824| 723| auto plan = concat_rebalance_plan{}; 1825| 723| plan.fill(lpos, cpos, rpos); 1826| 723| plan.shuffle(cpos.shift()); 1827| 723| IMMER_TRY { ------------------ | | 49| 723|#define IMMER_TRY try ------------------ 1828| 723| return plan.merge(lpos, cpos, rpos); 1829| 723| } 1830| 723| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 723|} _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| 723| { 1753| 723| assert(n == 0u); ------------------ | Branch (1753:9): [True: 723, False: 0] ------------------ 1754| 723| assert(total == 0u); ------------------ | Branch (1754:9): [True: 723, False: 0] ------------------ 1755| 723| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 723| lpos.each_left_sub(visitor_t{}, *this); 1757| 723| cpos.each_sub(visitor_t{}, *this); 1758| 723| rpos.each_right_sub(visitor_t{}, *this); 1759| 723| } _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| 4.73M| { 1734| 4.73M| auto count = p.count(); 1735| 4.73M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 4.73M, False: 0] ------------------ 1736| 4.73M| plan.counts[plan.n++] = count; 1737| 4.73M| plan.total += count; 1738| 4.73M| } _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| 537k| { 1734| 537k| auto count = p.count(); 1735| 537k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 537k, False: 0] ------------------ 1736| 537k| plan.counts[plan.n++] = count; 1737| 537k| plan.total += count; 1738| 537k| } _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| 723| { 1803| 723| using node_t = node_type; 1804| 723| using merger_t = concat_merger; 1805| 723| using visitor_t = concat_merger_visitor; 1806| 723| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 723| IMMER_TRY { ------------------ | | 49| 723|#define IMMER_TRY try ------------------ 1808| 723| lpos.each_left_sub(visitor_t{}, merger); 1809| 723| cpos.each_sub(visitor_t{}, merger); 1810| 723| rpos.each_right_sub(visitor_t{}, merger); 1811| 723| cpos.each_sub(dec_visitor{}); 1812| 723| return merger.finish(); 1813| 723| } 1814| 723| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 723| } _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| 4.73M| { 1722| 4.73M| merger.merge_leaf(p); 1723| 4.73M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10merge_leafIRNS1_13full_leaf_posISC_EEEEvOT_: 1614| 4.73M| { 1615| 4.73M| auto from = p.node(); 1616| 4.73M| auto from_size = p.size(); 1617| 4.73M| auto from_count = p.count(); 1618| 4.73M| assert(from_size); ------------------ | Branch (1618:9): [True: 4.73M, False: 0] ------------------ 1619| 4.73M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 4.73M, False: 0] | Branch (1619:21): [True: 4.73M, False: 0] ------------------ 1620| 4.73M| add_child(from, from_size); 1621| 4.73M| from->inc(); 1622| 4.73M| } 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| 4.73M| } _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| 537k| { 1716| 537k| merger.merge_inner(p); 1717| 537k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 537k| { 1649| 537k| auto from = p.node(); 1650| 537k| auto from_size = p.size(); 1651| 537k| auto from_count = p.count(); 1652| 537k| assert(from_size); ------------------ | Branch (1652:9): [True: 537k, False: 0] ------------------ 1653| 537k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 537k, False: 0] | Branch (1653:21): [True: 537k, False: 0] ------------------ 1654| 537k| add_child(from, from_size); 1655| 537k| from->inc(); 1656| 537k| } 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| 537k| } _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| 610| { 1945| 610| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 610| } _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.43k| { 1925| 2.43k| return concat_leafs(lpos, tpos, rpos); 1926| 2.43k| } _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.43k|{ 1839| 2.43k| static_assert(Node::bits >= 2, ""); 1840| 2.43k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 2.43k, False: 0] ------------------ 1841| 2.43k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 2.43k, False: 0] ------------------ 1842| 2.43k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 2.43k, False: 0] ------------------ 1843| 2.43k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 2.43k] ------------------ 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.43k| else 1854| 2.43k| return { 1855| 2.43k| Node::bits_leaf, 1856| 2.43k| lpos.node()->inc(), 1857| 2.43k| lpos.count(), 1858| 2.43k| rpos.node()->inc(), 1859| 2.43k| rpos.count(), 1860| 2.43k| }; 1861| 2.43k|} _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| 610|{ 1824| 610| auto plan = concat_rebalance_plan{}; 1825| 610| plan.fill(lpos, cpos, rpos); 1826| 610| plan.shuffle(cpos.shift()); 1827| 610| IMMER_TRY { ------------------ | | 49| 610|#define IMMER_TRY try ------------------ 1828| 610| return plan.merge(lpos, cpos, rpos); 1829| 610| } 1830| 610| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 610|} _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| 610| { 1753| 610| assert(n == 0u); ------------------ | Branch (1753:9): [True: 610, False: 0] ------------------ 1754| 610| assert(total == 0u); ------------------ | Branch (1754:9): [True: 610, False: 0] ------------------ 1755| 610| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 610| lpos.each_left_sub(visitor_t{}, *this); 1757| 610| cpos.each_sub(visitor_t{}, *this); 1758| 610| rpos.each_right_sub(visitor_t{}, *this); 1759| 610| } _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| 610| { 1803| 610| using node_t = node_type; 1804| 610| using merger_t = concat_merger; 1805| 610| using visitor_t = concat_merger_visitor; 1806| 610| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 610| IMMER_TRY { ------------------ | | 49| 610|#define IMMER_TRY try ------------------ 1808| 610| lpos.each_left_sub(visitor_t{}, merger); 1809| 610| cpos.each_sub(visitor_t{}, merger); 1810| 610| rpos.each_right_sub(visitor_t{}, merger); 1811| 610| cpos.each_sub(dec_visitor{}); 1812| 610| return merger.finish(); 1813| 610| } 1814| 610| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 610| } _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.58k|{ 1824| 1.58k| auto plan = concat_rebalance_plan{}; 1825| 1.58k| plan.fill(lpos, cpos, rpos); 1826| 1.58k| plan.shuffle(cpos.shift()); 1827| 1.58k| IMMER_TRY { ------------------ | | 49| 1.58k|#define IMMER_TRY try ------------------ 1828| 1.58k| return plan.merge(lpos, cpos, rpos); 1829| 1.58k| } 1830| 1.58k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.58k|} _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.58k| { 1753| 1.58k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.58k, False: 0] ------------------ 1754| 1.58k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.58k, False: 0] ------------------ 1755| 1.58k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.58k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.58k| cpos.each_sub(visitor_t{}, *this); 1758| 1.58k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.58k| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 3.55M| { 1734| 3.55M| auto count = p.count(); 1735| 3.55M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 3.55M, False: 0] ------------------ 1736| 3.55M| plan.counts[plan.n++] = count; 1737| 3.55M| plan.total += count; 1738| 3.55M| } _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.58k| { 1803| 1.58k| using node_t = node_type; 1804| 1.58k| using merger_t = concat_merger; 1805| 1.58k| using visitor_t = concat_merger_visitor; 1806| 1.58k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.58k| IMMER_TRY { ------------------ | | 49| 1.58k|#define IMMER_TRY try ------------------ 1808| 1.58k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.58k| cpos.each_sub(visitor_t{}, merger); 1810| 1.58k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.58k| cpos.each_sub(dec_visitor{}); 1812| 1.58k| return merger.finish(); 1813| 1.58k| } 1814| 1.58k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.58k| } _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 3.55M| { 1716| 3.55M| merger.merge_inner(p); 1717| 3.55M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_: 1648| 3.55M| { 1649| 3.55M| auto from = p.node(); 1650| 3.55M| auto from_size = p.size(); 1651| 3.55M| auto from_count = p.count(); 1652| 3.55M| assert(from_size); ------------------ | Branch (1652:9): [True: 3.55M, False: 0] ------------------ 1653| 3.55M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 1.97M, False: 1.57M] | Branch (1653:21): [True: 1.97M, False: 0] ------------------ 1654| 1.97M| add_child(from, from_size); 1655| 1.97M| from->inc(); 1656| 1.97M| } else { 1657| 1.57M| auto from_offset = count_t{}; 1658| 1.57M| auto from_data = from->inner(); 1659| 3.15M| do { 1660| 3.15M| if (!to_) { ------------------ | Branch (1660:21): [True: 1.57M, False: 1.57M] ------------------ 1661| 1.57M| to_ = node_t::make_inner_r_n(*curr_); 1662| 1.57M| to_offset_ = 0; 1663| 1.57M| to_size_ = 0; 1664| 1.57M| } 1665| 3.15M| auto data = to_->inner(); 1666| 3.15M| auto to_copy = 1667| 3.15M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 3.15M| std::copy(from_data + from_offset, 1669| 3.15M| from_data + from_offset + to_copy, 1670| 3.15M| data + to_offset_); 1671| 3.15M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 3.15M| auto sizes = to_->relaxed()->d.sizes; 1673| 3.15M| p.copy_sizes( 1674| 3.15M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 3.15M| to_offset_ += to_copy; 1676| 3.15M| from_offset += to_copy; 1677| 3.15M| to_size_ = sizes[to_offset_ - 1]; 1678| 3.15M| assert(to_size_); ------------------ | Branch (1678:17): [True: 3.15M, False: 0] ------------------ 1679| 3.15M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 1.57M, False: 1.57M] ------------------ 1680| 1.57M| to_->relaxed()->d.count = to_offset_; 1681| 1.57M| add_child(to_, to_size_); 1682| 1.57M| to_ = nullptr; 1683| 1.57M| } 1684| 3.15M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.57M, False: 1.57M] ------------------ 1685| 1.57M| } 1686| 3.55M| } _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.82k| { 1945| 1.82k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 1.82k| } _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.83k| { 1925| 4.83k| return concat_leafs(lpos, tpos, rpos); 1926| 4.83k| } _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.83k|{ 1839| 4.83k| static_assert(Node::bits >= 2, ""); 1840| 4.83k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 4.83k, False: 0] ------------------ 1841| 4.83k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 4.83k, False: 0] ------------------ 1842| 4.83k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 4.83k, False: 0] ------------------ 1843| 4.83k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 4.83k] ------------------ 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.83k| else 1854| 4.83k| return { 1855| 4.83k| Node::bits_leaf, 1856| 4.83k| lpos.node()->inc(), 1857| 4.83k| lpos.count(), 1858| 4.83k| rpos.node()->inc(), 1859| 4.83k| rpos.count(), 1860| 4.83k| }; 1861| 4.83k|} _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.82k|{ 1824| 1.82k| auto plan = concat_rebalance_plan{}; 1825| 1.82k| plan.fill(lpos, cpos, rpos); 1826| 1.82k| plan.shuffle(cpos.shift()); 1827| 1.82k| IMMER_TRY { ------------------ | | 49| 1.82k|#define IMMER_TRY try ------------------ 1828| 1.82k| return plan.merge(lpos, cpos, rpos); 1829| 1.82k| } 1830| 1.82k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.82k|} _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.82k| { 1753| 1.82k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.82k, False: 0] ------------------ 1754| 1.82k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.82k, False: 0] ------------------ 1755| 1.82k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.82k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.82k| cpos.each_sub(visitor_t{}, *this); 1758| 1.82k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.82k| } _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.82k| { 1803| 1.82k| using node_t = node_type; 1804| 1.82k| using merger_t = concat_merger; 1805| 1.82k| using visitor_t = concat_merger_visitor; 1806| 1.82k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.82k| IMMER_TRY { ------------------ | | 49| 1.82k|#define IMMER_TRY try ------------------ 1808| 1.82k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.82k| cpos.each_sub(visitor_t{}, merger); 1810| 1.82k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.82k| cpos.each_sub(dec_visitor{}); 1812| 1.82k| return merger.finish(); 1813| 1.82k| } 1814| 1.82k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.82k| } _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| 57.1k|{ 1824| 57.1k| auto plan = concat_rebalance_plan{}; 1825| 57.1k| plan.fill(lpos, cpos, rpos); 1826| 57.1k| plan.shuffle(cpos.shift()); 1827| 57.1k| IMMER_TRY { ------------------ | | 49| 57.1k|#define IMMER_TRY try ------------------ 1828| 57.1k| return plan.merge(lpos, cpos, rpos); 1829| 57.1k| } 1830| 57.1k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 57.1k|} _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| 57.1k| { 1753| 57.1k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 57.1k, False: 0] ------------------ 1754| 57.1k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 57.1k, False: 0] ------------------ 1755| 57.1k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 57.1k| lpos.each_left_sub(visitor_t{}, *this); 1757| 57.1k| cpos.each_sub(visitor_t{}, *this); 1758| 57.1k| rpos.each_right_sub(visitor_t{}, *this); 1759| 57.1k| } _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| 57.1k| { 1803| 57.1k| using node_t = node_type; 1804| 57.1k| using merger_t = concat_merger; 1805| 57.1k| using visitor_t = concat_merger_visitor; 1806| 57.1k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 57.1k| IMMER_TRY { ------------------ | | 49| 57.1k|#define IMMER_TRY try ------------------ 1808| 57.1k| lpos.each_left_sub(visitor_t{}, merger); 1809| 57.1k| cpos.each_sub(visitor_t{}, merger); 1810| 57.1k| rpos.each_right_sub(visitor_t{}, merger); 1811| 57.1k| cpos.each_sub(dec_visitor{}); 1812| 57.1k| return merger.finish(); 1813| 57.1k| } 1814| 57.1k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 57.1k| } _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.83k| { 1945| 4.83k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 4.83k| } _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.83k|{ 1824| 4.83k| auto plan = concat_rebalance_plan{}; 1825| 4.83k| plan.fill(lpos, cpos, rpos); 1826| 4.83k| plan.shuffle(cpos.shift()); 1827| 4.83k| IMMER_TRY { ------------------ | | 49| 4.83k|#define IMMER_TRY try ------------------ 1828| 4.83k| return plan.merge(lpos, cpos, rpos); 1829| 4.83k| } 1830| 4.83k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.83k|} _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.83k| { 1753| 4.83k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.83k, False: 0] ------------------ 1754| 4.83k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.83k, False: 0] ------------------ 1755| 4.83k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.83k| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.83k| cpos.each_sub(visitor_t{}, *this); 1758| 4.83k| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.83k| } _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.83k| { 1803| 4.83k| using node_t = node_type; 1804| 4.83k| using merger_t = concat_merger; 1805| 4.83k| using visitor_t = concat_merger_visitor; 1806| 4.83k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.83k| IMMER_TRY { ------------------ | | 49| 4.83k|#define IMMER_TRY try ------------------ 1808| 4.83k| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.83k| cpos.each_sub(visitor_t{}, merger); 1810| 4.83k| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.83k| cpos.each_sub(dec_visitor{}); 1812| 4.83k| return merger.finish(); 1813| 4.83k| } 1814| 4.83k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.83k| } _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.15k| { 1959| 2.15k| return concat_inners(lpos, tpos, rpos); 1960| 2.15k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7realizeEv: 1527| 1.00M| { 1528| 1.00M| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 47.6k, False: 958k] ------------------ 1529| 47.6k| IMMER_TRY { ------------------ | | 49| 47.6k|#define IMMER_TRY try ------------------ 1530| 47.6k| auto result = node_t::make_inner_r_n(count_); 1531| 47.6k| auto r = result->relaxed(); 1532| 47.6k| r->d.count = count_; 1533| 47.6k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 47.6k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 47.6k| return {result, shift_, r}; 1536| 47.6k| } 1537| 47.6k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 958k| } else { 1542| 958k| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 958k, False: 0] ------------------ 1543| 958k| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 958k| } 1545| 1.00M| } _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| 999k|{ 1987| 999k| return visit_maybe_relaxed_sub(lroot, 1988| 999k| lshift, 1989| 999k| lsize, 1990| 999k| concat_trees_left_visitor{}, 1991| 999k| make_leaf_pos(ltail, ltcount), 1992| 999k| rroot, 1993| 999k| rshift, 1994| 999k| rsize) 1995| 999k| .realize(); 1996| 999k|} _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| 982k| { 1972| 982k| return visit_maybe_relaxed_sub( 1973| 982k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 982k| } _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| 975k| { 1959| 975k| return concat_inners(lpos, tpos, rpos); 1960| 975k| } _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| 10.6M|{ 1873| 10.6M| auto lshift = lpos.shift(); 1874| 10.6M| auto rshift = rpos.shift(); 1875| 10.6M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.96M, False: 7.70M] ------------------ 1876| 2.96M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.96M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 7.70M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 32.7k, False: 7.67M] ------------------ 1879| 32.7k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 32.7k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 7.67M| } else { 1882| 7.67M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 7.67M, False: 0] ------------------ 1883| 7.67M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 7.67M] | Branch (1883:9): [True: 7.67M, False: 0] | Branch (1883:9): [True: 7.67M, False: 0] ------------------ 1884| 7.67M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 7.67M| return concat_rebalance(lpos, cpos, rpos); 1886| 7.67M| } 1887| 10.6M|} _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| 2.96M| { 1898| 2.96M| return concat_inners(lpos, tpos, rpos); 1899| 2.96M| } _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.10k| { 1898| 4.10k| return concat_inners(lpos, tpos, rpos); 1899| 4.10k| } _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.15M|{ 1873| 1.15M| auto lshift = lpos.shift(); 1874| 1.15M| auto rshift = rpos.shift(); 1875| 1.15M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.13k, False: 1.15M] ------------------ 1876| 2.13k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.13k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.15M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 7.48k, False: 1.14M] ------------------ 1879| 7.48k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 7.48k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.14M| } else { 1882| 1.14M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.14M, False: 0] ------------------ 1883| 1.14M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.14M] | Branch (1883:9): [True: 1.14M, False: 0] | Branch (1883:9): [True: 1.14M, False: 0] ------------------ 1884| 1.14M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.14M| return concat_rebalance(lpos, cpos, rpos); 1886| 1.14M| } 1887| 1.15M|} _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.01k|{ 1824| 3.01k| auto plan = concat_rebalance_plan{}; 1825| 3.01k| plan.fill(lpos, cpos, rpos); 1826| 3.01k| plan.shuffle(cpos.shift()); 1827| 3.01k| IMMER_TRY { ------------------ | | 49| 3.01k|#define IMMER_TRY try ------------------ 1828| 3.01k| return plan.merge(lpos, cpos, rpos); 1829| 3.01k| } 1830| 3.01k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.01k|} _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.01k| { 1753| 3.01k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.01k, False: 0] ------------------ 1754| 3.01k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.01k, False: 0] ------------------ 1755| 3.01k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.01k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.01k| cpos.each_sub(visitor_t{}, *this); 1758| 3.01k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.01k| } _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.01k| { 1803| 3.01k| using node_t = node_type; 1804| 3.01k| using merger_t = concat_merger; 1805| 3.01k| using visitor_t = concat_merger_visitor; 1806| 3.01k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.01k| IMMER_TRY { ------------------ | | 49| 3.01k|#define IMMER_TRY try ------------------ 1808| 3.01k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.01k| cpos.each_sub(visitor_t{}, merger); 1810| 3.01k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.01k| cpos.each_sub(dec_visitor{}); 1812| 3.01k| return merger.finish(); 1813| 3.01k| } 1814| 3.01k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.01k| } _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.14M| { 1918| 1.14M| return concat_inners(lpos, tpos, rpos); 1919| 1.14M| } _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| 302k| { 1918| 302k| return concat_inners(lpos, tpos, rpos); 1919| 302k| } _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| 313k|{ 1873| 313k| auto lshift = lpos.shift(); 1874| 313k| auto rshift = rpos.shift(); 1875| 313k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 883, False: 312k] ------------------ 1876| 883| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 883| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 312k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 337, False: 312k] ------------------ 1879| 337| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 337| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 312k| } else { 1882| 312k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 312k, False: 0] ------------------ 1883| 312k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 312k] | Branch (1883:9): [True: 312k, False: 0] | Branch (1883:9): [True: 312k, False: 0] ------------------ 1884| 312k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 312k| return concat_rebalance(lpos, cpos, rpos); 1886| 312k| } 1887| 313k|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 1.28k| { 1898| 1.28k| return concat_inners(lpos, tpos, rpos); 1899| 1.28k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_8full_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 18.3k| { 1918| 18.3k| return concat_inners(lpos, tpos, rpos); 1919| 18.3k| } _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| 18.3k|{ 1873| 18.3k| auto lshift = lpos.shift(); 1874| 18.3k| auto rshift = rpos.shift(); 1875| 18.3k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 18.3k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 18.3k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 204, False: 18.1k] ------------------ 1879| 204| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 204| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 18.1k| } else { 1882| 18.1k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 18.1k, False: 0] ------------------ 1883| 18.1k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 18.1k] | Branch (1883:9): [True: 18.1k, False: 0] | Branch (1883:9): [True: 18.1k, False: 0] ------------------ 1884| 18.1k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 18.1k| return concat_rebalance(lpos, cpos, rpos); 1886| 18.1k| } 1887| 18.3k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 12.8k| { 1945| 12.8k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 12.8k| } _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| 320k| { 1925| 320k| return concat_leafs(lpos, tpos, rpos); 1926| 320k| } _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| 320k|{ 1839| 320k| static_assert(Node::bits >= 2, ""); 1840| 320k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 320k, False: 0] ------------------ 1841| 320k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 320k, False: 0] ------------------ 1842| 320k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 320k, False: 0] ------------------ 1843| 320k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 320k, False: 0] ------------------ 1844| 320k| return { 1845| 320k| Node::bits_leaf, 1846| 320k| lpos.node()->inc(), 1847| 320k| lpos.count(), 1848| 320k| tpos.node()->inc(), 1849| 320k| tpos.count(), 1850| 320k| rpos.node()->inc(), 1851| 320k| rpos.count(), 1852| 320k| }; 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| 320k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 7.12k| { 1938| 7.12k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 7.12k| } _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| 18.1k|{ 1824| 18.1k| auto plan = concat_rebalance_plan{}; 1825| 18.1k| plan.fill(lpos, cpos, rpos); 1826| 18.1k| plan.shuffle(cpos.shift()); 1827| 18.1k| IMMER_TRY { ------------------ | | 49| 18.1k|#define IMMER_TRY try ------------------ 1828| 18.1k| return plan.merge(lpos, cpos, rpos); 1829| 18.1k| } 1830| 18.1k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 18.1k|} _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| 18.1k| { 1753| 18.1k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 18.1k, False: 0] ------------------ 1754| 18.1k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 18.1k, False: 0] ------------------ 1755| 18.1k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 18.1k| lpos.each_left_sub(visitor_t{}, *this); 1757| 18.1k| cpos.each_sub(visitor_t{}, *this); 1758| 18.1k| rpos.each_right_sub(visitor_t{}, *this); 1759| 18.1k| } _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| 18.1k| { 1803| 18.1k| using node_t = node_type; 1804| 18.1k| using merger_t = concat_merger; 1805| 18.1k| using visitor_t = concat_merger_visitor; 1806| 18.1k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 18.1k| IMMER_TRY { ------------------ | | 49| 18.1k|#define IMMER_TRY try ------------------ 1808| 18.1k| lpos.each_left_sub(visitor_t{}, merger); 1809| 18.1k| cpos.each_sub(visitor_t{}, merger); 1810| 18.1k| rpos.each_right_sub(visitor_t{}, merger); 1811| 18.1k| cpos.each_sub(dec_visitor{}); 1812| 18.1k| return merger.finish(); 1813| 18.1k| } 1814| 18.1k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 18.1k| } _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| 307k| { 1945| 307k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 307k| } _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| 678k| { 1925| 678k| return concat_leafs(lpos, tpos, rpos); 1926| 678k| } _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| 678k|{ 1839| 678k| static_assert(Node::bits >= 2, ""); 1840| 678k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 678k, False: 0] ------------------ 1841| 678k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 678k, False: 0] ------------------ 1842| 678k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 678k, False: 0] ------------------ 1843| 678k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 678k, False: 0] ------------------ 1844| 678k| return { 1845| 678k| Node::bits_leaf, 1846| 678k| lpos.node()->inc(), 1847| 678k| lpos.count(), 1848| 678k| tpos.node()->inc(), 1849| 678k| tpos.count(), 1850| 678k| rpos.node()->inc(), 1851| 678k| rpos.count(), 1852| 678k| }; 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| 678k|} _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| 10.7k| { 1938| 10.7k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 10.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| 312k|{ 1824| 312k| auto plan = concat_rebalance_plan{}; 1825| 312k| plan.fill(lpos, cpos, rpos); 1826| 312k| plan.shuffle(cpos.shift()); 1827| 312k| IMMER_TRY { ------------------ | | 49| 312k|#define IMMER_TRY try ------------------ 1828| 312k| return plan.merge(lpos, cpos, rpos); 1829| 312k| } 1830| 312k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 312k|} _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| 312k| { 1753| 312k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 312k, False: 0] ------------------ 1754| 312k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 312k, False: 0] ------------------ 1755| 312k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 312k| lpos.each_left_sub(visitor_t{}, *this); 1757| 312k| cpos.each_sub(visitor_t{}, *this); 1758| 312k| rpos.each_right_sub(visitor_t{}, *this); 1759| 312k| } _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| 312k| { 1803| 312k| using node_t = node_type; 1804| 312k| using merger_t = concat_merger; 1805| 312k| using visitor_t = concat_merger_visitor; 1806| 312k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 312k| IMMER_TRY { ------------------ | | 49| 312k|#define IMMER_TRY try ------------------ 1808| 312k| lpos.each_left_sub(visitor_t{}, merger); 1809| 312k| cpos.each_sub(visitor_t{}, merger); 1810| 312k| rpos.each_right_sub(visitor_t{}, merger); 1811| 312k| cpos.each_sub(dec_visitor{}); 1812| 312k| return merger.finish(); 1813| 312k| } 1814| 312k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 312k| } _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| 678k| { 1945| 678k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 678k| } _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.43M| { 1938| 1.43M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.43M| } _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.14M|{ 1824| 1.14M| auto plan = concat_rebalance_plan{}; 1825| 1.14M| plan.fill(lpos, cpos, rpos); 1826| 1.14M| plan.shuffle(cpos.shift()); 1827| 1.14M| IMMER_TRY { ------------------ | | 49| 1.14M|#define IMMER_TRY try ------------------ 1828| 1.14M| return plan.merge(lpos, cpos, rpos); 1829| 1.14M| } 1830| 1.14M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.14M|} _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.14M| { 1753| 1.14M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.14M, False: 0] ------------------ 1754| 1.14M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.14M, False: 0] ------------------ 1755| 1.14M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.14M| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.14M| cpos.each_sub(visitor_t{}, *this); 1758| 1.14M| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.14M| } _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.14M| { 1803| 1.14M| using node_t = node_type; 1804| 1.14M| using merger_t = concat_merger; 1805| 1.14M| using visitor_t = concat_merger_visitor; 1806| 1.14M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.14M| IMMER_TRY { ------------------ | | 49| 1.14M|#define IMMER_TRY try ------------------ 1808| 1.14M| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.14M| cpos.each_sub(visitor_t{}, merger); 1810| 1.14M| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.14M| cpos.each_sub(dec_visitor{}); 1812| 1.14M| return merger.finish(); 1813| 1.14M| } 1814| 1.14M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.14M| } _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| 2.97M|{ 1824| 2.97M| auto plan = concat_rebalance_plan{}; 1825| 2.97M| plan.fill(lpos, cpos, rpos); 1826| 2.97M| plan.shuffle(cpos.shift()); 1827| 2.97M| IMMER_TRY { ------------------ | | 49| 2.97M|#define IMMER_TRY try ------------------ 1828| 2.97M| return plan.merge(lpos, cpos, rpos); 1829| 2.97M| } 1830| 2.97M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.97M|} _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| 2.97M| { 1753| 2.97M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.97M, False: 0] ------------------ 1754| 2.97M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.97M, False: 0] ------------------ 1755| 2.97M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.97M| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.97M| cpos.each_sub(visitor_t{}, *this); 1758| 2.97M| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.97M| } _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| 2.97M| { 1803| 2.97M| using node_t = node_type; 1804| 2.97M| using merger_t = concat_merger; 1805| 2.97M| using visitor_t = concat_merger_visitor; 1806| 2.97M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.97M| IMMER_TRY { ------------------ | | 49| 2.97M|#define IMMER_TRY try ------------------ 1808| 2.97M| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.97M| cpos.each_sub(visitor_t{}, merger); 1810| 2.97M| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.97M| cpos.each_sub(dec_visitor{}); 1812| 2.97M| return merger.finish(); 1813| 2.97M| } 1814| 2.97M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.97M| } _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| 6.73M| { 1918| 6.73M| return concat_inners(lpos, tpos, rpos); 1919| 6.73M| } _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| 1.29k| { 1918| 1.29k| return concat_inners(lpos, tpos, rpos); 1919| 1.29k| } _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| 19.8k|{ 1873| 19.8k| auto lshift = lpos.shift(); 1874| 19.8k| auto rshift = rpos.shift(); 1875| 19.8k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 11.8k, False: 7.92k] ------------------ 1876| 11.8k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 11.8k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 11.8k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 635, False: 7.28k] ------------------ 1879| 635| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 635| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 7.28k| } else { 1882| 7.28k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 7.28k, False: 0] ------------------ 1883| 7.28k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 7.28k] | Branch (1883:9): [True: 7.28k, False: 0] | Branch (1883:9): [True: 7.28k, False: 0] ------------------ 1884| 7.28k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 7.28k| return concat_rebalance(lpos, cpos, rpos); 1886| 7.28k| } 1887| 19.8k|} _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| 11.4k| { 1898| 11.4k| return concat_inners(lpos, tpos, rpos); 1899| 11.4k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_8full_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 3.75k| { 1918| 3.75k| return concat_inners(lpos, tpos, rpos); 1919| 3.75k| } _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| 3.75k|{ 1873| 3.75k| auto lshift = lpos.shift(); 1874| 3.75k| auto rshift = rpos.shift(); 1875| 3.75k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 3.75k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 3.75k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 198, False: 3.55k] ------------------ 1879| 198| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 198| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 3.55k| } else { 1882| 3.55k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 3.55k, False: 0] ------------------ 1883| 3.55k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 3.55k] | Branch (1883:9): [True: 3.55k, False: 0] | Branch (1883:9): [True: 3.55k, False: 0] ------------------ 1884| 3.55k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 3.55k| return concat_rebalance(lpos, cpos, rpos); 1886| 3.55k| } 1887| 3.75k|} _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| 1.73k| { 1938| 1.73k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.73k| } _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| 3.55k|{ 1824| 3.55k| auto plan = concat_rebalance_plan{}; 1825| 3.55k| plan.fill(lpos, cpos, rpos); 1826| 3.55k| plan.shuffle(cpos.shift()); 1827| 3.55k| IMMER_TRY { ------------------ | | 49| 3.55k|#define IMMER_TRY try ------------------ 1828| 3.55k| return plan.merge(lpos, cpos, rpos); 1829| 3.55k| } 1830| 3.55k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.55k|} _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| 3.55k| { 1753| 3.55k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.55k, False: 0] ------------------ 1754| 3.55k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.55k, False: 0] ------------------ 1755| 3.55k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.55k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.55k| cpos.each_sub(visitor_t{}, *this); 1758| 3.55k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.55k| } _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| 3.55k| { 1803| 3.55k| using node_t = node_type; 1804| 3.55k| using merger_t = concat_merger; 1805| 3.55k| using visitor_t = concat_merger_visitor; 1806| 3.55k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.55k| IMMER_TRY { ------------------ | | 49| 3.55k|#define IMMER_TRY try ------------------ 1808| 3.55k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.55k| cpos.each_sub(visitor_t{}, merger); 1810| 3.55k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.55k| cpos.each_sub(dec_visitor{}); 1812| 3.55k| return merger.finish(); 1813| 3.55k| } 1814| 3.55k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.55k| } _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| 1.18k| { 1938| 1.18k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.18k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 7.28k|{ 1824| 7.28k| auto plan = concat_rebalance_plan{}; 1825| 7.28k| plan.fill(lpos, cpos, rpos); 1826| 7.28k| plan.shuffle(cpos.shift()); 1827| 7.28k| IMMER_TRY { ------------------ | | 49| 7.28k|#define IMMER_TRY try ------------------ 1828| 7.28k| return plan.merge(lpos, cpos, rpos); 1829| 7.28k| } 1830| 7.28k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 7.28k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_: 1752| 7.28k| { 1753| 7.28k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 7.28k, False: 0] ------------------ 1754| 7.28k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 7.28k, False: 0] ------------------ 1755| 7.28k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 7.28k| lpos.each_left_sub(visitor_t{}, *this); 1757| 7.28k| cpos.each_sub(visitor_t{}, *this); 1758| 7.28k| rpos.each_right_sub(visitor_t{}, *this); 1759| 7.28k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 7.28k| { 1803| 7.28k| using node_t = node_type; 1804| 7.28k| using merger_t = concat_merger; 1805| 7.28k| using visitor_t = concat_merger_visitor; 1806| 7.28k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 7.28k| IMMER_TRY { ------------------ | | 49| 7.28k|#define IMMER_TRY try ------------------ 1808| 7.28k| lpos.each_left_sub(visitor_t{}, merger); 1809| 7.28k| cpos.each_sub(visitor_t{}, merger); 1810| 7.28k| rpos.each_right_sub(visitor_t{}, merger); 1811| 7.28k| cpos.each_sub(dec_visitor{}); 1812| 7.28k| return merger.finish(); 1813| 7.28k| } 1814| 7.28k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 7.28k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 6.70M| { 1938| 6.70M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 6.70M| } _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| 7.67M|{ 1824| 7.67M| auto plan = concat_rebalance_plan{}; 1825| 7.67M| plan.fill(lpos, cpos, rpos); 1826| 7.67M| plan.shuffle(cpos.shift()); 1827| 7.67M| IMMER_TRY { ------------------ | | 49| 7.67M|#define IMMER_TRY try ------------------ 1828| 7.67M| return plan.merge(lpos, cpos, rpos); 1829| 7.67M| } 1830| 7.67M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 7.67M|} _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| 7.67M| { 1753| 7.67M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 7.67M, False: 0] ------------------ 1754| 7.67M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 7.67M, False: 0] ------------------ 1755| 7.67M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 7.67M| lpos.each_left_sub(visitor_t{}, *this); 1757| 7.67M| cpos.each_sub(visitor_t{}, *this); 1758| 7.67M| rpos.each_right_sub(visitor_t{}, *this); 1759| 7.67M| } _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| 7.67M| { 1803| 7.67M| using node_t = node_type; 1804| 7.67M| using merger_t = concat_merger; 1805| 7.67M| using visitor_t = concat_merger_visitor; 1806| 7.67M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 7.67M| IMMER_TRY { ------------------ | | 49| 7.67M|#define IMMER_TRY try ------------------ 1808| 7.67M| lpos.each_left_sub(visitor_t{}, merger); 1809| 7.67M| cpos.each_sub(visitor_t{}, merger); 1810| 7.67M| rpos.each_right_sub(visitor_t{}, merger); 1811| 7.67M| cpos.each_sub(dec_visitor{}); 1812| 7.67M| return merger.finish(); 1813| 7.67M| } 1814| 7.67M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 7.67M| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 7.03k| { 1959| 7.03k| return concat_inners(lpos, tpos, rpos); 1960| 7.03k| } _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 16.8k| { 1972| 16.8k| return visit_maybe_relaxed_sub( 1973| 16.8k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 16.8k| } _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.59k| { 1959| 6.59k| return concat_inners(lpos, tpos, rpos); 1960| 6.59k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 10.2k| { 1959| 10.2k| return concat_inners(lpos, tpos, rpos); 1960| 10.2k| } _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| 172k| { 681| 172k| auto node = pos.node(); 682| 172k| auto level = pos.shift(); 683| 172k| auto idx = pos.count() - 1; 684| 172k| auto children = pos.size(idx); 685| 172k| auto new_idx = 686| 172k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 2.70k, False: 169k] | Branch (686:47): [True: 383, False: 169k] ------------------ 687| 172k| auto new_child = static_cast(nullptr); 688| 172k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 172k, Folded] | Branch (688:38): [True: 169k, False: 3.13k] ------------------ 689| | 690| 172k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 809, False: 171k] ------------------ 691| 809| return nullptr; 692| 171k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 169k, False: 2.28k] ------------------ 693| 169k| new_child = 694| 169k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 166k, False: 2.59k] ------------------ 695| 169k| : pos.last_oh_csh( 696| 2.59k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 169k| if (!new_child) { ------------------ | Branch (697:17): [True: 1.09k, False: 168k] ------------------ 698| 1.09k| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 397, False: 694] ------------------ 699| 397| new_child = node_t::make_path_e(e, level - B, tail); 700| 694| else 701| 694| return nullptr; 702| 1.09k| } 703| 169k| } else 704| 2.28k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 171k| if (mutate) { ------------------ | Branch (706:13): [True: 168k, False: 2.72k] ------------------ 707| 168k| auto count = new_idx + 1; 708| 168k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 168k| node->inner()[new_idx] = new_child; 710| 168k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 168k| relaxed->d.count = count; 712| 168k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 168k, False: 0] ------------------ 713| 168k| return node; 714| 168k| } else { 715| 2.72k| IMMER_TRY { ------------------ | | 49| 2.72k|#define IMMER_TRY try ------------------ 716| 2.72k| auto count = new_idx + 1; 717| 2.72k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 2.72k| auto relaxed = new_node->relaxed(); 719| 2.72k| new_node->inner()[new_idx] = new_child; 720| 2.72k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 2.72k| relaxed->d.count = count; 722| 2.72k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 2.72k, False: 0] ------------------ 723| 2.72k| if (Mutating) ------------------ | Branch (723:21): [True: 2.72k, Folded] ------------------ 724| 2.72k| pos.visit(dec_visitor{}); 725| 2.72k| return new_node; 726| 2.72k| } 727| 2.72k| 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.72k| } 737| 171k| } _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| 154k| { 742| 154k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 154k, False: 0] ------------------ 743| 154k| auto node = pos.node(); 744| 154k| auto idx = pos.index(pos.size() - 1); 745| 154k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 154k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 154k, Folded] | Branch (746:36): [True: 153k, False: 1.05k] ------------------ 747| 154k| if (mutate) { ------------------ | Branch (747:13): [True: 153k, False: 1.05k] ------------------ 748| 153k| node->inner()[new_idx] = 749| 153k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 150k, False: 2.71k] ------------------ 750| | /* otherwise */ 751| 153k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 153k| return node; 753| 153k| } else { 754| 1.05k| auto new_parent = node_t::make_inner_e(e); 755| 1.05k| IMMER_TRY { ------------------ | | 49| 1.05k|#define IMMER_TRY try ------------------ 756| 1.05k| new_parent->inner()[new_idx] = 757| 1.05k| idx == new_idx ------------------ | Branch (757:21): [True: 741, False: 311] ------------------ 758| 1.05k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.05k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.05k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.05k| if (Mutating) ------------------ | Branch (762:21): [True: 1.05k, Folded] ------------------ 763| 1.05k| pos.visit(dec_visitor{}); 764| 1.05k| return new_parent; 765| 1.05k| } 766| 1.05k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 1.05k| } 771| 154k| } _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.05M| { 742| 1.05M| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.05M, False: 0] ------------------ 743| 1.05M| auto node = pos.node(); 744| 1.05M| auto idx = pos.index(pos.size() - 1); 745| 1.05M| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.05M| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 1.05M, Folded] | Branch (746:36): [True: 1.04M, False: 1.77k] ------------------ 747| 1.05M| if (mutate) { ------------------ | Branch (747:13): [True: 1.04M, False: 1.77k] ------------------ 748| 1.04M| node->inner()[new_idx] = 749| 1.04M| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 727k, False: 321k] ------------------ 750| | /* otherwise */ 751| 1.04M| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 1.04M| return node; 753| 1.04M| } else { 754| 1.77k| auto new_parent = node_t::make_inner_e(e); 755| 1.77k| IMMER_TRY { ------------------ | | 49| 1.77k|#define IMMER_TRY try ------------------ 756| 1.77k| new_parent->inner()[new_idx] = 757| 1.77k| idx == new_idx ------------------ | Branch (757:21): [True: 1.11k, False: 655] ------------------ 758| 1.77k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.77k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.77k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.77k| if (Mutating) ------------------ | Branch (762:21): [True: 1.77k, Folded] ------------------ 763| 1.77k| pos.visit(dec_visitor{}); 764| 1.77k| return new_parent; 765| 1.77k| } 766| 1.77k| 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.77k| } 771| 1.05M| } _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.70k| { 742| 4.70k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 4.70k, False: 0] ------------------ 743| 4.70k| auto node = pos.node(); 744| 4.70k| auto idx = pos.index(pos.size() - 1); 745| 4.70k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 4.70k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 4.70k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 4.70k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 4.70k] ------------------ 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.70k| } else { 754| 4.70k| auto new_parent = node_t::make_inner_e(e); 755| 4.70k| IMMER_TRY { ------------------ | | 49| 4.70k|#define IMMER_TRY try ------------------ 756| 4.70k| new_parent->inner()[new_idx] = 757| 4.70k| idx == new_idx ------------------ | Branch (757:21): [True: 1.90k, False: 2.79k] ------------------ 758| 4.70k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 4.70k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 4.70k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 4.70k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 4.70k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 4.70k| return new_parent; 765| 4.70k| } 766| 4.70k| 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.70k| } 771| 4.70k| } _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.41k| { 681| 7.41k| auto node = pos.node(); 682| 7.41k| auto level = pos.shift(); 683| 7.41k| auto idx = pos.count() - 1; 684| 7.41k| auto children = pos.size(idx); 685| 7.41k| auto new_idx = 686| 7.41k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 806, False: 6.61k] | Branch (686:47): [True: 670, False: 5.94k] ------------------ 687| 7.41k| auto new_child = static_cast(nullptr); 688| 7.41k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 7.41k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 7.41k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 710, False: 6.70k] ------------------ 691| 710| return nullptr; 692| 6.70k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 5.94k, False: 766] ------------------ 693| 5.94k| new_child = 694| 5.94k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 5.94k] ------------------ 695| 5.94k| : pos.last_oh_csh( 696| 5.94k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 5.94k| if (!new_child) { ------------------ | Branch (697:17): [True: 893, False: 5.04k] ------------------ 698| 893| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 394, False: 499] ------------------ 699| 394| new_child = node_t::make_path_e(e, level - B, tail); 700| 499| else 701| 499| return nullptr; 702| 893| } 703| 5.94k| } else 704| 766| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 6.20k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 6.20k] ------------------ 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.20k| } else { 715| 6.20k| IMMER_TRY { ------------------ | | 49| 6.20k|#define IMMER_TRY try ------------------ 716| 6.20k| auto count = new_idx + 1; 717| 6.20k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 6.20k| auto relaxed = new_node->relaxed(); 719| 6.20k| new_node->inner()[new_idx] = new_child; 720| 6.20k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 6.20k| relaxed->d.count = count; 722| 6.20k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 6.20k, False: 0] ------------------ 723| 6.20k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 6.20k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 6.20k| return new_node; 726| 6.20k| } 727| 6.20k| 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.20k| } 737| 6.20k| } _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.12k| { 742| 1.12k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.12k, False: 0] ------------------ 743| 1.12k| auto node = pos.node(); 744| 1.12k| auto idx = pos.index(pos.size() - 1); 745| 1.12k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.12k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 1.12k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 1.12k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 1.12k] ------------------ 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.12k| } else { 754| 1.12k| auto new_parent = node_t::make_inner_e(e); 755| 1.12k| IMMER_TRY { ------------------ | | 49| 1.12k|#define IMMER_TRY try ------------------ 756| 1.12k| new_parent->inner()[new_idx] = 757| 1.12k| idx == new_idx ------------------ | Branch (757:21): [True: 626, False: 497] ------------------ 758| 1.12k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.12k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.12k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.12k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 1.12k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 1.12k| return new_parent; 765| 1.12k| } 766| 1.12k| 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.12k| } 771| 1.12k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 181k| { 742| 181k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 181k, False: 0] ------------------ 743| 181k| auto node = pos.node(); 744| 181k| auto idx = pos.index(pos.size() - 1); 745| 181k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 181k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 181k, Folded] | Branch (746:36): [True: 181k, False: 622] ------------------ 747| 181k| if (mutate) { ------------------ | Branch (747:13): [True: 181k, False: 622] ------------------ 748| 181k| node->inner()[new_idx] = 749| 181k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 172k, False: 8.69k] ------------------ 750| | /* otherwise */ 751| 181k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 181k| return node; 753| 181k| } else { 754| 622| auto new_parent = node_t::make_inner_e(e); 755| 622| IMMER_TRY { ------------------ | | 49| 622|#define IMMER_TRY try ------------------ 756| 622| new_parent->inner()[new_idx] = 757| 622| idx == new_idx ------------------ | Branch (757:21): [True: 310, False: 312] ------------------ 758| 622| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 622| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 622| node_t::do_copy_inner(new_parent, node, new_idx); 762| 622| if (Mutating) ------------------ | Branch (762:21): [True: 622, Folded] ------------------ 763| 622| pos.visit(dec_visitor{}); 764| 622| return new_parent; 765| 622| } 766| 622| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 622| } 771| 181k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_: 580| 2.08k|{ 581| 2.08k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 2.08k|} _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| 125k| { 596| 125k| auto offset = pos.index(idx); 597| 125k| auto count = pos.count(); 598| 125k| auto node = pos.node(); 599| 125k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 88.6k, False: 36.6k] ------------------ 600| 88.6k| return pos.towards_oh( 601| 88.6k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 88.6k| } else { 603| 36.6k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 36.6k| IMMER_TRY { ------------------ | | 49| 36.6k|#define IMMER_TRY try ------------------ 605| 36.6k| auto& res = pos.towards_oh( 606| 36.6k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 36.6k| pos.visit(dec_visitor{}); 608| 36.6k| *location = new_node; 609| 36.6k| return res; 610| 36.6k| } 611| 36.6k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 36.6k| } 616| 125k| } _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| 18.9k| { 653| 18.9k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 18.9k, False: 0] ------------------ 654| 18.9k| auto node = pos.node(); 655| 18.9k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.42k, False: 17.4k] ------------------ 656| 1.42k| return node->leaf()[pos.index(idx)]; 657| 17.4k| } else { 658| 17.4k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 17.4k| pos.visit(dec_visitor{}); 660| 17.4k| *location = new_node; 661| 17.4k| return new_node->leaf()[pos.index(idx)]; 662| 17.4k| } 663| 18.9k| } _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.42k| { 622| 5.42k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 5.42k, False: 0] ------------------ 623| 5.42k| auto offset = pos.index(idx); 624| 5.42k| auto count = pos.count(); 625| 5.42k| auto node = pos.node(); 626| 5.42k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 3.37k, False: 2.04k] ------------------ 627| 3.37k| return pos.towards_oh_ch( 628| 3.37k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 3.37k| } else { 630| 2.04k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 2.04k| IMMER_TRY { ------------------ | | 49| 2.04k|#define IMMER_TRY try ------------------ 632| 2.04k| auto& res = pos.towards_oh_ch(this_t{}, 633| 2.04k| idx, 634| 2.04k| offset, 635| 2.04k| count, 636| 2.04k| e, 637| 2.04k| &new_node->inner()[offset]); 638| 2.04k| pos.visit(dec_visitor{}); 639| 2.04k| *location = new_node; 640| 2.04k| return res; 641| 2.04k| } 642| 2.04k| IMMER_CATCH (...) { 643| 0| dec_regular(new_node, pos.shift(), pos.size()); 644| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 645| 0| } 646| 2.04k| } 647| 5.42k| } _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| 3.21k| { 653| 3.21k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 3.21k, False: 0] ------------------ 654| 3.21k| auto node = pos.node(); 655| 3.21k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.25k, False: 1.95k] ------------------ 656| 1.25k| return node->leaf()[pos.index(idx)]; 657| 1.95k| } else { 658| 1.95k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 1.95k| pos.visit(dec_visitor{}); 660| 1.95k| *location = new_node; 661| 1.95k| return new_node->leaf()[pos.index(idx)]; 662| 1.95k| } 663| 3.21k| } _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.21k| { 622| 2.21k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.21k, False: 0] ------------------ 623| 2.21k| auto offset = pos.index(idx); 624| 2.21k| auto count = pos.count(); 625| 2.21k| auto node = pos.node(); 626| 2.21k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.04k, False: 1.16k] ------------------ 627| 1.04k| return pos.towards_oh_ch( 628| 1.04k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.16k| } else { 630| 1.16k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.16k| IMMER_TRY { ------------------ | | 49| 1.16k|#define IMMER_TRY try ------------------ 632| 1.16k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.16k| idx, 634| 1.16k| offset, 635| 1.16k| count, 636| 1.16k| e, 637| 1.16k| &new_node->inner()[offset]); 638| 1.16k| pos.visit(dec_visitor{}); 639| 1.16k| *location = new_node; 640| 1.16k| return res; 641| 1.16k| } 642| 1.16k| 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.16k| } 647| 2.21k| } _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.21k| { 653| 2.21k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 2.21k, False: 0] ------------------ 654| 2.21k| auto node = pos.node(); 655| 2.21k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.63k, False: 580] ------------------ 656| 1.63k| return node->leaf()[pos.index(idx)]; 657| 1.63k| } else { 658| 580| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 580| pos.visit(dec_visitor{}); 660| 580| *location = new_node; 661| 580| return new_node->leaf()[pos.index(idx)]; 662| 580| } 663| 2.21k| } _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.76k| { 622| 1.76k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 1.76k, False: 0] ------------------ 623| 1.76k| auto offset = pos.index(idx); 624| 1.76k| auto count = pos.count(); 625| 1.76k| auto node = pos.node(); 626| 1.76k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.33k, False: 435] ------------------ 627| 1.33k| return pos.towards_oh_ch( 628| 1.33k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.33k| } else { 630| 435| auto new_node = node_t::copy_inner_e(e, node, count); 631| 435| IMMER_TRY { ------------------ | | 49| 435|#define IMMER_TRY try ------------------ 632| 435| auto& res = pos.towards_oh_ch(this_t{}, 633| 435| idx, 634| 435| offset, 635| 435| count, 636| 435| e, 637| 435| &new_node->inner()[offset]); 638| 435| pos.visit(dec_visitor{}); 639| 435| *location = new_node; 640| 435| return res; 641| 435| } 642| 435| 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| 435| } 647| 1.76k| } _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| 30.1k| { 914| 30.1k| auto idx = pos.index(last); 915| 30.1k| auto node = pos.node(); 916| 30.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 30.1k, Folded] | Branch (916:35): [True: 21.7k, False: 8.46k] ------------------ 917| 30.1k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 30.1k, Folded] | Branch (917:25): [True: 17.9k, False: 12.2k] ------------------ 918| 17.9k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 14.1k, False: 3.82k] ------------------ 919| 17.9k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 17.9k| if (Mutating) ------------------ | Branch (920:17): [True: 17.9k, Folded] ------------------ 921| 17.9k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 17.9k| return res; 923| 17.9k| } else { 924| 12.2k| using std::get; 925| 12.2k| auto subs = 926| 12.2k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 7.60k, False: 4.63k] ------------------ 927| 12.2k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 12.2k| auto next = get<1>(subs); 929| 12.2k| auto ts = get<2>(subs); 930| 12.2k| auto tail = get<3>(subs); 931| 12.2k| IMMER_TRY { ------------------ | | 49| 12.2k|#define IMMER_TRY try ------------------ 932| 12.2k| if (next) { ------------------ | Branch (932:21): [True: 9.00k, False: 3.22k] ------------------ 933| 9.00k| if (mutate) { ------------------ | Branch (933:25): [True: 5.69k, False: 3.31k] ------------------ 934| 5.69k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 5.69k| pos.each_right(dec_visitor{}, idx + 1); 936| 5.69k| node->inner()[idx] = next; 937| 5.69k| nodr->d.sizes[idx] = last + 1 - ts; 938| 5.69k| nodr->d.count = idx + 1; 939| 5.69k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 5.69k, False: 0] ------------------ 940| 5.69k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 5.69k| } 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| 9.00k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 3.22k] ------------------ 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.22k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 3.22k, Folded] | Branch (956:40): [True: 2.43k, False: 798] | Branch (956:52): [True: 1.80k, False: 629] ------------------ 957| 1.80k| auto newn = pos.node()->inner()[0]; 958| 1.80k| if (!mutate) ------------------ | Branch (958:25): [True: 855, False: 947] ------------------ 959| 855| newn->inc(); 960| 1.80k| if (Mutating) ------------------ | Branch (960:25): [True: 1.80k, Folded] ------------------ 961| 1.80k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 1.80k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.80k| } else { 964| 1.42k| if (mutate) { ------------------ | Branch (964:25): [True: 961, False: 466] ------------------ 965| 961| pos.each_right(dec_visitor{}, idx + 1); 966| 961| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 961| return std::make_tuple(pos.shift(), node, ts, tail); 968| 961| } else { 969| 466| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 466| if (Mutating) ------------------ | Branch (970:29): [True: 466, Folded] ------------------ 971| 466| pos.visit(dec_visitor{}); 972| 466| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 466| } 974| 1.42k| } 975| 12.2k| } 976| 12.2k| 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.2k| } 987| 30.1k| } _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| 876| { 1060| 876| auto old_tail_size = pos.count(); 1061| 876| auto new_tail_size = pos.index(last) + 1; 1062| 876| auto node = pos.node(); 1063| 876| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 876, Folded] | Branch (1063:42): [True: 280, False: 596] ------------------ 1064| 876| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 213, False: 663] ------------------ 1065| 213| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 213] ------------------ 1066| 0| node->inc(); 1067| 213| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 663| } else if (mutate) { ------------------ | Branch (1068:20): [True: 270, False: 393] ------------------ 1069| 270| detail::destroy_n(node->leaf() + new_tail_size, 1070| 270| old_tail_size - new_tail_size); 1071| 270| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 393| } else { 1073| 393| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 393| if (Mutating) ------------------ | Branch (1074:17): [True: 393, Folded] ------------------ 1075| 393| pos.visit(dec_visitor{}); 1076| 393| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 393| } 1078| 876| } _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| 729| { 1060| 729| auto old_tail_size = pos.count(); 1061| 729| auto new_tail_size = pos.index(last) + 1; 1062| 729| auto node = pos.node(); 1063| 729| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 729] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 729| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 368, False: 361] ------------------ 1065| 368| if (!Mutating) ------------------ | Branch (1065:17): [True: 368, Folded] ------------------ 1066| 368| node->inc(); 1067| 368| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 368| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 361] ------------------ 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| 361| } else { 1073| 361| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 361| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 361] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 361| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 361| } 1078| 729| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 11.1k| { 914| 11.1k| auto idx = pos.index(last); 915| 11.1k| auto node = pos.node(); 916| 11.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 11.1k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 11.1k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 11.1k, Folded] | Branch (917:25): [True: 9.21k, False: 1.90k] ------------------ 918| 9.21k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 9.21k] ------------------ 919| 9.21k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 9.21k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 9.21k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 9.21k| return res; 923| 9.21k| } else { 924| 1.90k| using std::get; 925| 1.90k| auto subs = 926| 1.90k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 1.90k] ------------------ 927| 1.90k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 1.90k| auto next = get<1>(subs); 929| 1.90k| auto ts = get<2>(subs); 930| 1.90k| auto tail = get<3>(subs); 931| 1.90k| IMMER_TRY { ------------------ | | 49| 1.90k|#define IMMER_TRY try ------------------ 932| 1.90k| if (next) { ------------------ | Branch (932:21): [True: 888, False: 1.01k] ------------------ 933| 888| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 888] ------------------ 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| 888| } else { 942| 888| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 888| auto newr = newn->relaxed(); 944| 888| newn->inner()[idx] = next; 945| 888| newr->d.sizes[idx] = last + 1 - ts; 946| 888| newr->d.count = idx + 1; 947| 888| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 888, False: 0] ------------------ 948| 888| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 888] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 888| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 888| } 952| 1.01k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 1.01k] ------------------ 953| 0| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 0] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.01k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 1.01k, Folded] | Branch (956:40): [True: 637, False: 381] | Branch (956:52): [True: 326, False: 311] ------------------ 957| 326| auto newn = pos.node()->inner()[0]; 958| 326| if (!mutate) ------------------ | Branch (958:25): [True: 326, False: 0] ------------------ 959| 326| newn->inc(); 960| 326| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 326] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 326| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 692| } else { 964| 692| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 692] ------------------ 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| 692| } else { 969| 692| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 692| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 692] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 692| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 692| } 974| 692| } 975| 1.90k| } 976| 1.90k| 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.90k| } 987| 11.1k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 1.19k| { 992| 1.19k| auto idx = pos.index(last); 993| 1.19k| auto node = pos.node(); 994| 1.19k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.19k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.19k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.19k, Folded] | Branch (995:25): [True: 279, False: 914] ------------------ 996| 279| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 279] ------------------ 997| 279| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 279| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 279] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 279| return res; 1001| 914| } else { 1002| 914| using std::get; 1003| 914| auto subs = 1004| 914| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 914] ------------------ 1005| 914| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 914| auto next = get<1>(subs); 1007| 914| auto ts = get<2>(subs); 1008| 914| auto tail = get<3>(subs); 1009| 914| IMMER_TRY { ------------------ | | 49| 914|#define IMMER_TRY try ------------------ 1010| 914| if (next) { ------------------ | Branch (1010:21): [True: 269, False: 645] ------------------ 1011| 269| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 269] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 269| } else { 1016| 269| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 269| newn->inner()[idx] = next; 1018| 269| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 269] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 269| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 269| } 1022| 645| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 645] ------------------ 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| 645| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 645, Folded] | Branch (1026:40): [True: 397, False: 248] | Branch (1026:52): [True: 195, False: 202] ------------------ 1027| 195| auto newn = pos.node()->inner()[0]; 1028| 195| if (!mutate) ------------------ | Branch (1028:25): [True: 195, False: 0] ------------------ 1029| 195| newn->inc(); 1030| 195| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 195] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 195| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 450| } else { 1034| 450| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 450] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 450| } else { 1038| 450| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 450| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 450] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 450| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 450| } 1043| 450| } 1044| 914| } 1045| 914| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 914| } 1055| 1.19k| } _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.84k| { 1060| 1.84k| auto old_tail_size = pos.count(); 1061| 1.84k| auto new_tail_size = pos.index(last) + 1; 1062| 1.84k| auto node = pos.node(); 1063| 1.84k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.84k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.84k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.14k, False: 693] ------------------ 1065| 1.14k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.14k, Folded] ------------------ 1066| 1.14k| node->inc(); 1067| 1.14k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.14k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 693] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 693| } else { 1073| 693| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 693| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 693] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 693| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 693| } 1078| 1.84k| } _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.66k| { 992| 1.66k| auto idx = pos.index(last); 993| 1.66k| auto node = pos.node(); 994| 1.66k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.66k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.66k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.66k, Folded] | Branch (995:25): [True: 416, False: 1.24k] ------------------ 996| 416| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 416] ------------------ 997| 416| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 416| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 416] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 416| return res; 1001| 1.24k| } else { 1002| 1.24k| using std::get; 1003| 1.24k| auto subs = 1004| 1.24k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.24k] ------------------ 1005| 1.24k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.24k| auto next = get<1>(subs); 1007| 1.24k| auto ts = get<2>(subs); 1008| 1.24k| auto tail = get<3>(subs); 1009| 1.24k| IMMER_TRY { ------------------ | | 49| 1.24k|#define IMMER_TRY try ------------------ 1010| 1.24k| if (next) { ------------------ | Branch (1010:21): [True: 313, False: 932] ------------------ 1011| 313| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 313] ------------------ 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| 313| } else { 1016| 313| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 313| newn->inner()[idx] = next; 1018| 313| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 313] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 313| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 313| } 1022| 932| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 932] ------------------ 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| 932| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 932, Folded] | Branch (1026:40): [True: 551, False: 381] | Branch (1026:52): [True: 224, False: 327] ------------------ 1027| 224| auto newn = pos.node()->inner()[0]; 1028| 224| if (!mutate) ------------------ | Branch (1028:25): [True: 224, False: 0] ------------------ 1029| 224| newn->inc(); 1030| 224| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 224] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 224| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 708| } else { 1034| 708| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 708] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 708| } else { 1038| 708| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 708| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 708] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 708| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 708| } 1043| 708| } 1044| 1.24k| } 1045| 1.24k| 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.24k| } 1055| 1.66k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 3.26k| { 1060| 3.26k| auto old_tail_size = pos.count(); 1061| 3.26k| auto new_tail_size = pos.index(last) + 1; 1062| 3.26k| auto node = pos.node(); 1063| 3.26k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 3.26k, Folded] | Branch (1063:42): [True: 317, False: 2.95k] ------------------ 1064| 3.26k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.76k, False: 1.50k] ------------------ 1065| 1.76k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.76k] ------------------ 1066| 0| node->inc(); 1067| 1.76k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.76k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 312, False: 1.19k] ------------------ 1069| 312| detail::destroy_n(node->leaf() + new_tail_size, 1070| 312| old_tail_size - new_tail_size); 1071| 312| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.19k| } else { 1073| 1.19k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.19k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.19k, Folded] ------------------ 1075| 1.19k| pos.visit(dec_visitor{}); 1076| 1.19k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.19k| } 1078| 3.26k| } _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.77k| { 992| 3.77k| auto idx = pos.index(last); 993| 3.77k| auto node = pos.node(); 994| 3.77k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.77k, Folded] | Branch (994:35): [True: 1.66k, False: 2.11k] ------------------ 995| 3.77k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.77k] | 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.77k| } else { 1002| 3.77k| using std::get; 1003| 3.77k| auto subs = 1004| 3.77k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 1.66k, False: 2.11k] ------------------ 1005| 3.77k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.77k| auto next = get<1>(subs); 1007| 3.77k| auto ts = get<2>(subs); 1008| 3.77k| auto tail = get<3>(subs); 1009| 3.77k| IMMER_TRY { ------------------ | | 49| 3.77k|#define IMMER_TRY try ------------------ 1010| 3.77k| if (next) { ------------------ | Branch (1010:21): [True: 1.00k, False: 2.77k] ------------------ 1011| 1.00k| if (mutate) { ------------------ | Branch (1011:25): [True: 459, False: 543] ------------------ 1012| 459| node->inner()[idx] = next; 1013| 459| pos.each_right(dec_visitor{}, idx + 1); 1014| 459| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 543| } else { 1016| 543| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 543| newn->inner()[idx] = next; 1018| 543| if (Mutating) ------------------ | Branch (1018:29): [True: 543, Folded] ------------------ 1019| 543| pos.visit(dec_visitor{}); 1020| 543| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 543| } 1022| 2.77k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.04k, False: 1.72k] ------------------ 1023| 1.04k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.04k, Folded] ------------------ 1024| 1.04k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.04k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.72k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.72k] | 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.72k| } else { 1034| 1.72k| if (mutate) { ------------------ | Branch (1034:25): [True: 399, False: 1.32k] ------------------ 1035| 399| pos.each_right(dec_visitor{}, idx + 1); 1036| 399| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.32k| } else { 1038| 1.32k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.32k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.32k, Folded] ------------------ 1040| 1.32k| pos.visit(dec_visitor{}); 1041| 1.32k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.32k| } 1043| 1.72k| } 1044| 3.77k| } 1045| 3.77k| 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.77k| } 1055| 3.77k| } _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.78k| { 879| 3.78k| using node_t = node_type; 880| 3.78k| auto node = p.node(); 881| 3.78k| if (node->dec()) { ------------------ | Branch (881:13): [True: 2.23k, False: 1.54k] ------------------ 882| 2.23k| p.each_right(dec_t{}, idx); 883| 2.23k| node_t::delete_inner(node, p.count()); 884| 2.23k| } 885| 3.78k| } _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.84k| { 1060| 9.84k| auto old_tail_size = pos.count(); 1061| 9.84k| auto new_tail_size = pos.index(last) + 1; 1062| 9.84k| auto node = pos.node(); 1063| 9.84k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 9.84k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 9.84k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 4.41k, False: 5.42k] ------------------ 1065| 4.41k| if (!Mutating) ------------------ | Branch (1065:17): [True: 4.41k, Folded] ------------------ 1066| 4.41k| node->inc(); 1067| 4.41k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 5.42k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 5.42k] ------------------ 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.42k| } else { 1073| 5.42k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 5.42k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 5.42k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 5.42k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 5.42k| } 1078| 9.84k| } _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.31k| { 992| 5.31k| auto idx = pos.index(last); 993| 5.31k| auto node = pos.node(); 994| 5.31k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 5.31k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 5.31k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 5.31k] | 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.31k| } else { 1002| 5.31k| using std::get; 1003| 5.31k| auto subs = 1004| 5.31k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 5.31k] ------------------ 1005| 5.31k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.31k| auto next = get<1>(subs); 1007| 5.31k| auto ts = get<2>(subs); 1008| 5.31k| auto tail = get<3>(subs); 1009| 5.31k| IMMER_TRY { ------------------ | | 49| 5.31k|#define IMMER_TRY try ------------------ 1010| 5.31k| if (next) { ------------------ | Branch (1010:21): [True: 693, False: 4.62k] ------------------ 1011| 693| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 693] ------------------ 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| 693| } else { 1016| 693| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 693| newn->inner()[idx] = next; 1018| 693| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 693] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 693| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 693| } 1022| 4.62k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 934, False: 3.68k] ------------------ 1023| 934| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 934] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 934| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.68k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 3.68k] | 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.68k| } else { 1034| 3.68k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 3.68k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 3.68k| } else { 1038| 3.68k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 3.68k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 3.68k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 3.68k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 3.68k| } 1043| 3.68k| } 1044| 5.31k| } 1045| 5.31k| 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.31k| } 1055| 5.31k| } _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| 418| { 1060| 418| auto old_tail_size = pos.count(); 1061| 418| auto new_tail_size = pos.index(last) + 1; 1062| 418| auto node = pos.node(); 1063| 418| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 418] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 418| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 213, False: 205] ------------------ 1065| 213| if (!Mutating) ------------------ | Branch (1065:17): [True: 213, Folded] ------------------ 1066| 213| node->inc(); 1067| 213| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 213| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 205] ------------------ 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| 205| } else { 1073| 205| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 205| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 205] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 205| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 205| } 1078| 418| } _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.45k| { 1060| 1.45k| auto old_tail_size = pos.count(); 1061| 1.45k| auto new_tail_size = pos.index(last) + 1; 1062| 1.45k| auto node = pos.node(); 1063| 1.45k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.45k, Folded] | Branch (1063:42): [True: 203, False: 1.24k] ------------------ 1064| 1.45k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 620, False: 830] ------------------ 1065| 620| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 620] ------------------ 1066| 0| node->inc(); 1067| 620| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 830| } else if (mutate) { ------------------ | Branch (1068:20): [True: 203, False: 627] ------------------ 1069| 203| detail::destroy_n(node->leaf() + new_tail_size, 1070| 203| old_tail_size - new_tail_size); 1071| 203| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 627| } else { 1073| 627| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 627| if (Mutating) ------------------ | Branch (1074:17): [True: 627, Folded] ------------------ 1075| 627| pos.visit(dec_visitor{}); 1076| 627| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 627| } 1078| 1.45k| } _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.42k| { 992| 3.42k| auto idx = pos.index(last); 993| 3.42k| auto node = pos.node(); 994| 3.42k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.42k, Folded] | Branch (994:35): [True: 2.50k, False: 918] ------------------ 995| 3.42k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.42k] | 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.42k| } else { 1002| 3.42k| using std::get; 1003| 3.42k| auto subs = 1004| 3.42k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.50k, False: 918] ------------------ 1005| 3.42k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.42k| auto next = get<1>(subs); 1007| 3.42k| auto ts = get<2>(subs); 1008| 3.42k| auto tail = get<3>(subs); 1009| 3.42k| IMMER_TRY { ------------------ | | 49| 3.42k|#define IMMER_TRY try ------------------ 1010| 3.42k| if (next) { ------------------ | Branch (1010:21): [True: 1.50k, False: 1.92k] ------------------ 1011| 1.50k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.04k, False: 463] ------------------ 1012| 1.04k| node->inner()[idx] = next; 1013| 1.04k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.04k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.04k| } else { 1016| 463| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 463| newn->inner()[idx] = next; 1018| 463| if (Mutating) ------------------ | Branch (1018:29): [True: 463, Folded] ------------------ 1019| 463| pos.visit(dec_visitor{}); 1020| 463| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 463| } 1022| 1.92k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.14k, False: 778] ------------------ 1023| 1.14k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.14k, Folded] ------------------ 1024| 1.14k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.14k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.14k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 778] | 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| 778| } else { 1034| 778| if (mutate) { ------------------ | Branch (1034:25): [True: 527, False: 251] ------------------ 1035| 527| pos.each_right(dec_visitor{}, idx + 1); 1036| 527| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 527| } else { 1038| 251| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 251| if (Mutating) ------------------ | Branch (1039:29): [True: 251, Folded] ------------------ 1040| 251| pos.visit(dec_visitor{}); 1041| 251| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 251| } 1043| 778| } 1044| 3.42k| } 1045| 3.42k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.42k| } 1055| 3.42k| } _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.14k| { 879| 1.14k| using node_t = node_type; 880| 1.14k| auto node = p.node(); 881| 1.14k| if (node->dec()) { ------------------ | Branch (881:13): [True: 940, False: 204] ------------------ 882| 940| p.each_right(dec_t{}, idx); 883| 940| node_t::delete_inner(node, p.count()); 884| 940| } 885| 1.14k| } _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.44k| { 1060| 2.44k| auto old_tail_size = pos.count(); 1061| 2.44k| auto new_tail_size = pos.index(last) + 1; 1062| 2.44k| auto node = pos.node(); 1063| 2.44k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.44k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.44k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 396, False: 2.04k] ------------------ 1065| 396| if (!Mutating) ------------------ | Branch (1065:17): [True: 396, Folded] ------------------ 1066| 396| node->inc(); 1067| 396| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.04k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 2.04k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 2.04k| } else { 1073| 2.04k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 2.04k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 2.04k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 2.04k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 2.04k| } 1078| 2.44k| } _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.38k| { 992| 3.38k| auto idx = pos.index(last); 993| 3.38k| auto node = pos.node(); 994| 3.38k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.38k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.38k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.38k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.38k| } else { 1002| 3.38k| using std::get; 1003| 3.38k| auto subs = 1004| 3.38k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.38k] ------------------ 1005| 3.38k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.38k| auto next = get<1>(subs); 1007| 3.38k| auto ts = get<2>(subs); 1008| 3.38k| auto tail = get<3>(subs); 1009| 3.38k| IMMER_TRY { ------------------ | | 49| 3.38k|#define IMMER_TRY try ------------------ 1010| 3.38k| if (next) { ------------------ | Branch (1010:21): [True: 974, False: 2.40k] ------------------ 1011| 974| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 974] ------------------ 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| 974| } else { 1016| 974| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 974| newn->inner()[idx] = next; 1018| 974| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 974] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 974| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 974| } 1022| 2.40k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 822, False: 1.58k] ------------------ 1023| 822| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 822] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 822| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.58k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.58k] | 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.58k| } else { 1034| 1.58k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.58k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.58k| } else { 1038| 1.58k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.58k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.58k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.58k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.58k| } 1043| 1.58k| } 1044| 3.38k| } 1045| 3.38k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.38k| } 1055| 3.38k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 867| 20.2k| { 868| 20.2k| using node_t = node_type; 869| 20.2k| auto node = p.node(); 870| 20.2k| if (node->dec()) { ------------------ | Branch (870:13): [True: 15.3k, False: 4.93k] ------------------ 871| 15.3k| p.each_right(dec_t{}, idx); 872| 15.3k| node_t::delete_inner_r(node, p.count()); 873| 15.3k| } 874| 20.2k| } _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.80k| { 1060| 1.80k| auto old_tail_size = pos.count(); 1061| 1.80k| auto new_tail_size = pos.index(last) + 1; 1062| 1.80k| auto node = pos.node(); 1063| 1.80k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.80k, Folded] | Branch (1063:42): [True: 334, False: 1.46k] ------------------ 1064| 1.80k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 480, False: 1.32k] ------------------ 1065| 480| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 480] ------------------ 1066| 0| node->inc(); 1067| 480| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.32k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 305, False: 1.01k] ------------------ 1069| 305| detail::destroy_n(node->leaf() + new_tail_size, 1070| 305| old_tail_size - new_tail_size); 1071| 305| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.01k| } else { 1073| 1.01k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.01k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.01k, Folded] ------------------ 1075| 1.01k| pos.visit(dec_visitor{}); 1076| 1.01k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.01k| } 1078| 1.80k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 2.76k| { 914| 2.76k| auto idx = pos.index(last); 915| 2.76k| auto node = pos.node(); 916| 2.76k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 2.76k, Folded] | Branch (916:35): [True: 1.58k, False: 1.17k] ------------------ 917| 2.76k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 2.76k] | Branch (917:25): [True: 0, False: 0] ------------------ 918| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 0] ------------------ 919| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 0| if (Mutating) ------------------ | Branch (920:17): [True: 0, Folded] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 0| return res; 923| 2.76k| } else { 924| 2.76k| using std::get; 925| 2.76k| auto subs = 926| 2.76k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 1.58k, False: 1.17k] ------------------ 927| 2.76k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 2.76k| auto next = get<1>(subs); 929| 2.76k| auto ts = get<2>(subs); 930| 2.76k| auto tail = get<3>(subs); 931| 2.76k| IMMER_TRY { ------------------ | | 49| 2.76k|#define IMMER_TRY try ------------------ 932| 2.76k| if (next) { ------------------ | Branch (932:21): [True: 985, False: 1.78k] ------------------ 933| 985| if (mutate) { ------------------ | Branch (933:25): [True: 538, False: 447] ------------------ 934| 538| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 538| pos.each_right(dec_visitor{}, idx + 1); 936| 538| node->inner()[idx] = next; 937| 538| nodr->d.sizes[idx] = last + 1 - ts; 938| 538| nodr->d.count = idx + 1; 939| 538| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 538, False: 0] ------------------ 940| 538| return std::make_tuple(pos.shift(), node, ts, tail); 941| 538| } else { 942| 447| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 447| auto newr = newn->relaxed(); 944| 447| newn->inner()[idx] = next; 945| 447| newr->d.sizes[idx] = last + 1 - ts; 946| 447| newr->d.count = idx + 1; 947| 447| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 447, False: 0] ------------------ 948| 447| if (Mutating) ------------------ | Branch (948:29): [True: 447, Folded] ------------------ 949| 447| pos.visit(dec_visitor{}); 950| 447| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 447| } 952| 1.78k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 496, False: 1.28k] ------------------ 953| 496| if (Mutating) ------------------ | Branch (953:25): [True: 496, Folded] ------------------ 954| 496| pos.visit(dec_right_visitor{}, count_t{1}); 955| 496| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.28k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.28k] | Branch (956:40): [True: 0, False: 0] | Branch (956:52): [True: 0, False: 0] ------------------ 957| 0| auto newn = pos.node()->inner()[0]; 958| 0| if (!mutate) ------------------ | Branch (958:25): [True: 0, False: 0] ------------------ 959| 0| newn->inc(); 960| 0| if (Mutating) ------------------ | Branch (960:25): [True: 0, Folded] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.28k| } else { 964| 1.28k| if (mutate) { ------------------ | Branch (964:25): [True: 804, False: 483] ------------------ 965| 804| pos.each_right(dec_visitor{}, idx + 1); 966| 804| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 804| return std::make_tuple(pos.shift(), node, ts, tail); 968| 804| } else { 969| 483| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 483| if (Mutating) ------------------ | Branch (970:29): [True: 483, Folded] ------------------ 971| 483| pos.visit(dec_visitor{}); 972| 483| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 483| } 974| 1.28k| } 975| 2.76k| } 976| 2.76k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 2.76k| } 987| 2.76k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 4.62k| { 992| 4.62k| auto idx = pos.index(last); 993| 4.62k| auto node = pos.node(); 994| 4.62k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.62k, Folded] | Branch (994:35): [True: 3.49k, False: 1.12k] ------------------ 995| 4.62k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.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): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 4.62k| } else { 1002| 4.62k| using std::get; 1003| 4.62k| auto subs = 1004| 4.62k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.49k, False: 1.12k] ------------------ 1005| 4.62k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.62k| auto next = get<1>(subs); 1007| 4.62k| auto ts = get<2>(subs); 1008| 4.62k| auto tail = get<3>(subs); 1009| 4.62k| IMMER_TRY { ------------------ | | 49| 4.62k|#define IMMER_TRY try ------------------ 1010| 4.62k| if (next) { ------------------ | Branch (1010:21): [True: 3.27k, False: 1.34k] ------------------ 1011| 3.27k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.72k, False: 549] ------------------ 1012| 2.72k| node->inner()[idx] = next; 1013| 2.72k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.72k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.72k| } else { 1016| 549| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 549| newn->inner()[idx] = next; 1018| 549| if (Mutating) ------------------ | Branch (1018:29): [True: 549, Folded] ------------------ 1019| 549| pos.visit(dec_visitor{}); 1020| 549| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 549| } 1022| 3.27k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 662, False: 684] ------------------ 1023| 662| if (Mutating) ------------------ | Branch (1023:25): [True: 662, Folded] ------------------ 1024| 662| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 662| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 684| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 684] | 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| 684| } else { 1034| 684| if (mutate) { ------------------ | Branch (1034:25): [True: 365, False: 319] ------------------ 1035| 365| pos.each_right(dec_visitor{}, idx + 1); 1036| 365| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 365| } else { 1038| 319| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 319| if (Mutating) ------------------ | Branch (1039:29): [True: 319, Folded] ------------------ 1040| 319| pos.visit(dec_visitor{}); 1041| 319| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 319| } 1043| 684| } 1044| 4.62k| } 1045| 4.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| 4.62k| } 1055| 4.62k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 10.4k| { 879| 10.4k| using node_t = node_type; 880| 10.4k| auto node = p.node(); 881| 10.4k| if (node->dec()) { ------------------ | Branch (881:13): [True: 7.29k, False: 3.11k] ------------------ 882| 7.29k| p.each_right(dec_t{}, idx); 883| 7.29k| node_t::delete_inner(node, p.count()); 884| 7.29k| } 885| 10.4k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 4.54k| { 1060| 4.54k| auto old_tail_size = pos.count(); 1061| 4.54k| auto new_tail_size = pos.index(last) + 1; 1062| 4.54k| auto node = pos.node(); 1063| 4.54k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 4.54k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 4.54k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.19k, False: 3.34k] ------------------ 1065| 1.19k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.19k, Folded] ------------------ 1066| 1.19k| node->inc(); 1067| 1.19k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 3.34k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 3.34k] ------------------ 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.34k| } else { 1073| 3.34k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 3.34k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 3.34k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 3.34k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 3.34k| } 1078| 4.54k| } _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.96k| { 914| 3.96k| auto idx = pos.index(last); 915| 3.96k| auto node = pos.node(); 916| 3.96k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 3.96k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 3.96k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 3.96k] | 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.96k| } else { 924| 3.96k| using std::get; 925| 3.96k| auto subs = 926| 3.96k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 3.96k] ------------------ 927| 3.96k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 3.96k| auto next = get<1>(subs); 929| 3.96k| auto ts = get<2>(subs); 930| 3.96k| auto tail = get<3>(subs); 931| 3.96k| IMMER_TRY { ------------------ | | 49| 3.96k|#define IMMER_TRY try ------------------ 932| 3.96k| if (next) { ------------------ | Branch (932:21): [True: 825, False: 3.13k] ------------------ 933| 825| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 825] ------------------ 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| 825| } else { 942| 825| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 825| auto newr = newn->relaxed(); 944| 825| newn->inner()[idx] = next; 945| 825| newr->d.sizes[idx] = last + 1 - ts; 946| 825| newr->d.count = idx + 1; 947| 825| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 825, False: 0] ------------------ 948| 825| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 825] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 825| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 825| } 952| 3.13k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 984, False: 2.15k] ------------------ 953| 984| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 984] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 984| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 2.15k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 2.15k] | Branch (956:40): [True: 0, False: 0] | Branch (956:52): [True: 0, False: 0] ------------------ 957| 0| auto newn = pos.node()->inner()[0]; 958| 0| if (!mutate) ------------------ | Branch (958:25): [True: 0, False: 0] ------------------ 959| 0| newn->inc(); 960| 0| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 0] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.15k| } else { 964| 2.15k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 2.15k] ------------------ 965| 0| pos.each_right(dec_visitor{}, idx + 1); 966| 0| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 0| return std::make_tuple(pos.shift(), node, ts, tail); 968| 2.15k| } else { 969| 2.15k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 2.15k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 2.15k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 2.15k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 2.15k| } 974| 2.15k| } 975| 3.96k| } 976| 3.96k| 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.96k| } 987| 3.96k| } _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.17k| { 992| 3.17k| auto idx = pos.index(last); 993| 3.17k| auto node = pos.node(); 994| 3.17k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.17k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.17k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.17k] | 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.17k| } else { 1002| 3.17k| using std::get; 1003| 3.17k| auto subs = 1004| 3.17k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.17k] ------------------ 1005| 3.17k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.17k| auto next = get<1>(subs); 1007| 3.17k| auto ts = get<2>(subs); 1008| 3.17k| auto tail = get<3>(subs); 1009| 3.17k| IMMER_TRY { ------------------ | | 49| 3.17k|#define IMMER_TRY try ------------------ 1010| 3.17k| if (next) { ------------------ | Branch (1010:21): [True: 2.05k, False: 1.12k] ------------------ 1011| 2.05k| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 2.05k] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.05k| } else { 1016| 2.05k| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 2.05k| newn->inner()[idx] = next; 1018| 2.05k| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 2.05k] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 2.05k| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 2.05k| } 1022| 2.05k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 680, False: 440] ------------------ 1023| 680| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 680] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 680| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 680| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 440] | 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| 440| } else { 1034| 440| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 440] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 440| } else { 1038| 440| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 440| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 440] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 440| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 440| } 1043| 440| } 1044| 3.17k| } 1045| 3.17k| 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.17k| } 1055| 3.17k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 12.7k| { 992| 12.7k| auto idx = pos.index(last); 993| 12.7k| auto node = pos.node(); 994| 12.7k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 12.7k, Folded] | Branch (994:35): [True: 8.63k, False: 4.08k] ------------------ 995| 12.7k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 12.7k, Folded] | Branch (995:25): [True: 7.36k, False: 5.35k] ------------------ 996| 7.36k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 5.17k, False: 2.18k] ------------------ 997| 7.36k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 7.36k| if (Mutating) ------------------ | Branch (998:17): [True: 7.36k, Folded] ------------------ 999| 7.36k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 7.36k| return res; 1001| 7.36k| } else { 1002| 5.35k| using std::get; 1003| 5.35k| auto subs = 1004| 5.35k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.45k, False: 1.90k] ------------------ 1005| 5.35k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.35k| auto next = get<1>(subs); 1007| 5.35k| auto ts = get<2>(subs); 1008| 5.35k| auto tail = get<3>(subs); 1009| 5.35k| IMMER_TRY { ------------------ | | 49| 5.35k|#define IMMER_TRY try ------------------ 1010| 5.35k| if (next) { ------------------ | Branch (1010:21): [True: 1.38k, False: 3.97k] ------------------ 1011| 1.38k| if (mutate) { ------------------ | Branch (1011:25): [True: 583, False: 798] ------------------ 1012| 583| node->inner()[idx] = next; 1013| 583| pos.each_right(dec_visitor{}, idx + 1); 1014| 583| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 798| } else { 1016| 798| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 798| newn->inner()[idx] = next; 1018| 798| if (Mutating) ------------------ | Branch (1018:29): [True: 798, Folded] ------------------ 1019| 798| pos.visit(dec_visitor{}); 1020| 798| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 798| } 1022| 3.97k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 3.97k] ------------------ 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.97k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 3.97k, Folded] | Branch (1026:40): [True: 3.53k, False: 437] | Branch (1026:52): [True: 2.37k, False: 1.16k] ------------------ 1027| 2.37k| auto newn = pos.node()->inner()[0]; 1028| 2.37k| if (!mutate) ------------------ | Branch (1028:25): [True: 667, False: 1.71k] ------------------ 1029| 667| newn->inc(); 1030| 2.37k| if (Mutating) ------------------ | Branch (1030:25): [True: 2.37k, Folded] ------------------ 1031| 2.37k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 2.37k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 2.37k| } else { 1034| 1.59k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.16k, False: 435] ------------------ 1035| 1.16k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.16k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.16k| } else { 1038| 435| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 435| if (Mutating) ------------------ | Branch (1039:29): [True: 435, Folded] ------------------ 1040| 435| pos.visit(dec_visitor{}); 1041| 435| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 435| } 1043| 1.59k| } 1044| 5.35k| } 1045| 5.35k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 5.35k| } 1055| 12.7k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.67k| { 1060| 1.67k| auto old_tail_size = pos.count(); 1061| 1.67k| auto new_tail_size = pos.index(last) + 1; 1062| 1.67k| auto node = pos.node(); 1063| 1.67k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.67k, Folded] | Branch (1063:42): [True: 688, False: 989] ------------------ 1064| 1.67k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 265, False: 1.41k] ------------------ 1065| 265| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 265] ------------------ 1066| 0| node->inc(); 1067| 265| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.41k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 687, False: 725] ------------------ 1069| 687| detail::destroy_n(node->leaf() + new_tail_size, 1070| 687| old_tail_size - new_tail_size); 1071| 687| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 725| } else { 1073| 725| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 725| if (Mutating) ------------------ | Branch (1074:17): [True: 725, Folded] ------------------ 1075| 725| pos.visit(dec_visitor{}); 1076| 725| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 725| } 1078| 1.67k| } _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.89k| { 992| 3.89k| auto idx = pos.index(last); 993| 3.89k| auto node = pos.node(); 994| 3.89k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.89k, Folded] | Branch (994:35): [True: 1.97k, False: 1.92k] ------------------ 995| 3.89k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.89k, Folded] | Branch (995:25): [True: 2.21k, False: 1.68k] ------------------ 996| 2.21k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 1.17k, False: 1.04k] ------------------ 997| 2.21k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 2.21k| if (Mutating) ------------------ | Branch (998:17): [True: 2.21k, Folded] ------------------ 999| 2.21k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 2.21k| return res; 1001| 2.21k| } else { 1002| 1.68k| using std::get; 1003| 1.68k| auto subs = 1004| 1.68k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 798, False: 889] ------------------ 1005| 1.68k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.68k| auto next = get<1>(subs); 1007| 1.68k| auto ts = get<2>(subs); 1008| 1.68k| auto tail = get<3>(subs); 1009| 1.68k| IMMER_TRY { ------------------ | | 49| 1.68k|#define IMMER_TRY try ------------------ 1010| 1.68k| if (next) { ------------------ | Branch (1010:21): [True: 476, False: 1.21k] ------------------ 1011| 476| if (mutate) { ------------------ | Branch (1011:25): [True: 199, False: 277] ------------------ 1012| 199| node->inner()[idx] = next; 1013| 199| pos.each_right(dec_visitor{}, idx + 1); 1014| 199| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 277| } else { 1016| 277| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 277| newn->inner()[idx] = next; 1018| 277| if (Mutating) ------------------ | Branch (1018:29): [True: 277, Folded] ------------------ 1019| 277| pos.visit(dec_visitor{}); 1020| 277| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 277| } 1022| 1.21k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.21k] ------------------ 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.21k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.21k, Folded] | Branch (1026:40): [True: 740, False: 471] | Branch (1026:52): [True: 519, False: 221] ------------------ 1027| 519| auto newn = pos.node()->inner()[0]; 1028| 519| if (!mutate) ------------------ | Branch (1028:25): [True: 261, False: 258] ------------------ 1029| 261| newn->inc(); 1030| 519| if (Mutating) ------------------ | Branch (1030:25): [True: 519, Folded] ------------------ 1031| 519| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 519| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 692| } else { 1034| 692| if (mutate) { ------------------ | Branch (1034:25): [True: 341, False: 351] ------------------ 1035| 341| pos.each_right(dec_visitor{}, idx + 1); 1036| 341| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 351| } else { 1038| 351| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 351| if (Mutating) ------------------ | Branch (1039:29): [True: 351, Folded] ------------------ 1040| 351| pos.visit(dec_visitor{}); 1041| 351| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 351| } 1043| 692| } 1044| 1.68k| } 1045| 1.68k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 1.68k| } 1055| 3.89k| } _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| 775| { 1060| 775| auto old_tail_size = pos.count(); 1061| 775| auto new_tail_size = pos.index(last) + 1; 1062| 775| auto node = pos.node(); 1063| 775| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 775, Folded] | Branch (1063:42): [True: 253, False: 522] ------------------ 1064| 775| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 200, False: 575] ------------------ 1065| 200| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 200] ------------------ 1066| 0| node->inc(); 1067| 200| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 575| } else if (mutate) { ------------------ | Branch (1068:20): [True: 253, False: 322] ------------------ 1069| 253| detail::destroy_n(node->leaf() + new_tail_size, 1070| 253| old_tail_size - new_tail_size); 1071| 253| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 322| } else { 1073| 322| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 322| if (Mutating) ------------------ | Branch (1074:17): [True: 322, Folded] ------------------ 1075| 322| pos.visit(dec_visitor{}); 1076| 322| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 322| } 1078| 775| } _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| 947| { 1378| 947| auto node = pos.node(); 1379| 947| auto idx = pos.index(first); 1380| 947| auto count = pos.count(); 1381| 947| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 947| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 670, False: 277] ------------------ 1384| 947| if (mutate) { ------------------ | Branch (1384:13): [True: 670, False: 277] ------------------ 1385| 670| auto data = node->leaf(); 1386| 670| auto newcount = count - idx; 1387| 670| std::move(data + idx, data + count, data); 1388| 670| detail::destroy_n(data + newcount, idx); 1389| 670| return std::make_tuple(0, node); 1390| 670| } else { 1391| 277| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 277| if (Mutating) ------------------ | Branch (1392:17): [True: 277, Folded] ------------------ 1393| 277| pos.visit(dec_visitor{}); 1394| 277| return std::make_tuple(0, newn); 1395| 277| } 1396| 947| } _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| 58.1k| { 1247| 58.1k| auto idx = pos.subindex(first); 1248| 58.1k| auto count = pos.count(); 1249| 58.1k| auto node = pos.node(); 1250| 58.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 58.1k, Folded] | Branch (1250:47): [True: 51.0k, False: 7.10k] ------------------ 1251| 58.1k| auto left_size = pos.size_before(idx); 1252| 58.1k| auto child_size = pos.size_sbh(idx, left_size); 1253| 58.1k| auto dropped_size = first; 1254| 58.1k| auto child_dropped_size = dropped_size - left_size; 1255| 58.1k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 58.1k, Folded] | Branch (1255:25): [True: 56.2k, False: 1.90k] | Branch (1255:45): [True: 4.47k, False: 51.7k] ------------------ 1256| 4.47k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 1.90k, False: 2.56k] ------------------ 1257| 4.47k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 4.47k| if (mutate) ------------------ | Branch (1258:17): [True: 1.90k, False: 2.56k] ------------------ 1259| 1.90k| pos.visit(dec_left_visitor{}, idx); 1260| 2.56k| else if (Mutating) ------------------ | Branch (1260:22): [True: 2.56k, Folded] ------------------ 1261| 2.56k| pos.visit(dec_visitor{}); 1262| 4.47k| return r; 1263| 53.6k| } else { 1264| 53.6k| using std::get; 1265| 53.6k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 49.1k, False: 4.54k] ------------------ 1266| 53.6k| : node_t::make_inner_r_e(e); 1267| 53.6k| auto newr = newn->relaxed(); 1268| 53.6k| auto newcount = count - idx; 1269| 53.6k| auto new_child_size = child_size - child_dropped_size; 1270| 53.6k| IMMER_TRY { ------------------ | | 49| 53.6k|#define IMMER_TRY try ------------------ 1271| 53.6k| auto subs = 1272| 53.6k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 49.1k, False: 4.54k] ------------------ 1273| 53.6k| : pos.towards_sub_oh( 1274| 4.54k| no_collapse_no_mut_t{}, first, idx, e); 1275| 53.6k| if (mutate) ------------------ | Branch (1275:21): [True: 49.1k, False: 4.54k] ------------------ 1276| 49.1k| pos.each_left(dec_visitor{}, idx); 1277| 53.6k| pos.copy_sizes( 1278| 53.6k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 53.6k| std::copy(node->inner() + idx + 1, 1280| 53.6k| node->inner() + count, 1281| 53.6k| newn->inner() + 1); 1282| 53.6k| newn->inner()[0] = get<1>(subs); 1283| 53.6k| newr->d.sizes[0] = new_child_size; 1284| 53.6k| newr->d.count = newcount; 1285| 53.6k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 53.6k, False: 0] ------------------ 1286| 53.6k| if (!mutate) { ------------------ | Branch (1286:21): [True: 4.54k, False: 49.1k] ------------------ 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| 53.6k| return std::make_tuple(pos.shift(), newn); 1292| 53.6k| } 1293| 53.6k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 53.6k| } 1299| 58.1k| } _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.20k| { 1247| 2.20k| auto idx = pos.subindex(first); 1248| 2.20k| auto count = pos.count(); 1249| 2.20k| auto node = pos.node(); 1250| 2.20k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.20k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.20k| auto left_size = pos.size_before(idx); 1252| 2.20k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.20k| auto dropped_size = first; 1254| 2.20k| auto child_dropped_size = dropped_size - left_size; 1255| 2.20k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.20k, Folded] | Branch (1255:25): [True: 1.00k, False: 1.20k] | Branch (1255:45): [True: 764, False: 238] ------------------ 1256| 764| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 764] ------------------ 1257| 764| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 764| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 764] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 764| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 764] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 764| return r; 1263| 1.44k| } else { 1264| 1.44k| using std::get; 1265| 1.44k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.44k] ------------------ 1266| 1.44k| : node_t::make_inner_r_e(e); 1267| 1.44k| auto newr = newn->relaxed(); 1268| 1.44k| auto newcount = count - idx; 1269| 1.44k| auto new_child_size = child_size - child_dropped_size; 1270| 1.44k| IMMER_TRY { ------------------ | | 49| 1.44k|#define IMMER_TRY try ------------------ 1271| 1.44k| auto subs = 1272| 1.44k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.44k] ------------------ 1273| 1.44k| : pos.towards_sub_oh( 1274| 1.44k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.44k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.44k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.44k| pos.copy_sizes( 1278| 1.44k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.44k| std::copy(node->inner() + idx + 1, 1280| 1.44k| node->inner() + count, 1281| 1.44k| newn->inner() + 1); 1282| 1.44k| newn->inner()[0] = get<1>(subs); 1283| 1.44k| newr->d.sizes[0] = new_child_size; 1284| 1.44k| newr->d.count = newcount; 1285| 1.44k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.44k, False: 0] ------------------ 1286| 1.44k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.44k, False: 0] ------------------ 1287| 1.44k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.44k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.44k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.44k| } 1291| 1.44k| return std::make_tuple(pos.shift(), newn); 1292| 1.44k| } 1293| 1.44k| 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.44k| } 1299| 2.20k| } _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.09k| { 1304| 2.09k| auto idx = pos.subindex(first); 1305| 2.09k| auto count = pos.count(); 1306| 2.09k| auto node = pos.node(); 1307| 2.09k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.09k] ------------------ 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.09k| auto left_size = pos.size_before(idx); 1313| 2.09k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.09k| auto dropped_size = first; 1315| 2.09k| auto child_dropped_size = dropped_size - left_size; 1316| 2.09k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.09k, Folded] | Branch (1316:25): [True: 876, False: 1.21k] | Branch (1316:45): [True: 497, False: 379] ------------------ 1317| 497| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 497] ------------------ 1318| 497| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 497| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 497] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 497| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 497] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 497| return r; 1324| 1.59k| } else { 1325| 1.59k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.59k| auto newcount = count - idx; 1330| 1.59k| auto newn = 1331| 1.59k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.59k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.59k| : node_t::make_inner_r_e(e); 1336| 1.59k| auto newr = newn->relaxed(); 1337| 1.59k| IMMER_TRY { ------------------ | | 49| 1.59k|#define IMMER_TRY try ------------------ 1338| 1.59k| auto subs = 1339| 1.59k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.59k] ------------------ 1340| 1.59k| : pos.towards_sub_oh( 1341| 1.59k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.59k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.59k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.59k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.59k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.59k, False: 0] ------------------ 1346| 1.59k| pos.copy_sizes( 1347| 1.59k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.59k| newr->d.count = newcount; 1349| 1.59k| newn->inner()[0] = get<1>(subs); 1350| 1.59k| std::copy(node->inner() + idx + 1, 1351| 1.59k| node->inner() + count, 1352| 1.59k| newn->inner() + 1); 1353| 1.59k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.59k, False: 0] ------------------ 1354| 1.59k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.59k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.59k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.59k| } 1358| 1.59k| return std::make_tuple(pos.shift(), newn); 1359| 1.59k| } 1360| 1.59k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.59k| } 1373| 2.09k| } _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| 636| { 1304| 636| auto idx = pos.subindex(first); 1305| 636| auto count = pos.count(); 1306| 636| auto node = pos.node(); 1307| 636| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 636] ------------------ 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| 636| auto left_size = pos.size_before(idx); 1313| 636| auto child_size = pos.size_sbh(idx, left_size); 1314| 636| auto dropped_size = first; 1315| 636| auto child_dropped_size = dropped_size - left_size; 1316| 636| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 636, Folded] | Branch (1316:25): [True: 202, False: 434] | Branch (1316:45): [True: 0, False: 202] ------------------ 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| 636| } else { 1325| 636| 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| 636| auto newcount = count - idx; 1330| 636| auto newn = 1331| 636| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 636] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 636| : node_t::make_inner_r_e(e); 1336| 636| auto newr = newn->relaxed(); 1337| 636| IMMER_TRY { ------------------ | | 49| 636|#define IMMER_TRY try ------------------ 1338| 636| auto subs = 1339| 636| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 636] ------------------ 1340| 636| : pos.towards_sub_oh( 1341| 636| no_collapse_no_mut_t{}, first, idx, e); 1342| 636| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 636] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 636| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 636| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 636, False: 0] ------------------ 1346| 636| pos.copy_sizes( 1347| 636| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 636| newr->d.count = newcount; 1349| 636| newn->inner()[0] = get<1>(subs); 1350| 636| std::copy(node->inner() + idx + 1, 1351| 636| node->inner() + count, 1352| 636| newn->inner() + 1); 1353| 636| if (!mutate) { ------------------ | Branch (1353:21): [True: 636, False: 0] ------------------ 1354| 636| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 636| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 636] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 636| } 1358| 636| return std::make_tuple(pos.shift(), newn); 1359| 636| } 1360| 636| 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| 636| } 1373| 636| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 8.36k| { 1378| 8.36k| auto node = pos.node(); 1379| 8.36k| auto idx = pos.index(first); 1380| 8.36k| auto count = pos.count(); 1381| 8.36k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 8.36k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 8.36k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 8.36k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 8.36k| } else { 1391| 8.36k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 8.36k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 8.36k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 8.36k| return std::make_tuple(0, newn); 1395| 8.36k| } 1396| 8.36k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.35k| { 1304| 2.35k| auto idx = pos.subindex(first); 1305| 2.35k| auto count = pos.count(); 1306| 2.35k| auto node = pos.node(); 1307| 2.35k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.35k] ------------------ 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.35k| auto left_size = pos.size_before(idx); 1313| 2.35k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.35k| auto dropped_size = first; 1315| 2.35k| auto child_dropped_size = dropped_size - left_size; 1316| 2.35k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.35k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 2.35k| } else { 1325| 2.35k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 2.35k| auto newcount = count - idx; 1330| 2.35k| auto newn = 1331| 2.35k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.35k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.35k| : node_t::make_inner_r_e(e); 1336| 2.35k| auto newr = newn->relaxed(); 1337| 2.35k| IMMER_TRY { ------------------ | | 49| 2.35k|#define IMMER_TRY try ------------------ 1338| 2.35k| auto subs = 1339| 2.35k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.35k] ------------------ 1340| 2.35k| : pos.towards_sub_oh( 1341| 2.35k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.35k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.35k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.35k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.35k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.35k, False: 0] ------------------ 1346| 2.35k| pos.copy_sizes( 1347| 2.35k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.35k| newr->d.count = newcount; 1349| 2.35k| newn->inner()[0] = get<1>(subs); 1350| 2.35k| std::copy(node->inner() + idx + 1, 1351| 2.35k| node->inner() + count, 1352| 2.35k| newn->inner() + 1); 1353| 2.35k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.35k, False: 0] ------------------ 1354| 2.35k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.35k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.35k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.35k| } 1358| 2.35k| return std::make_tuple(pos.shift(), newn); 1359| 2.35k| } 1360| 2.35k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 2.35k| } 1373| 2.35k| } _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.19k| { 1378| 4.19k| auto node = pos.node(); 1379| 4.19k| auto idx = pos.index(first); 1380| 4.19k| auto count = pos.count(); 1381| 4.19k| 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.19k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 1.90k, False: 2.29k] ------------------ 1384| 4.19k| if (mutate) { ------------------ | Branch (1384:13): [True: 1.90k, False: 2.29k] ------------------ 1385| 1.90k| auto data = node->leaf(); 1386| 1.90k| auto newcount = count - idx; 1387| 1.90k| std::move(data + idx, data + count, data); 1388| 1.90k| detail::destroy_n(data + newcount, idx); 1389| 1.90k| return std::make_tuple(0, node); 1390| 2.29k| } else { 1391| 2.29k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.29k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.29k, Folded] ------------------ 1393| 2.29k| pos.visit(dec_visitor{}); 1394| 2.29k| return std::make_tuple(0, newn); 1395| 2.29k| } 1396| 4.19k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.29k| { 1304| 2.29k| auto idx = pos.subindex(first); 1305| 2.29k| auto count = pos.count(); 1306| 2.29k| auto node = pos.node(); 1307| 2.29k| 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.29k| auto left_size = pos.size_before(idx); 1313| 2.29k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.29k| auto dropped_size = first; 1315| 2.29k| auto child_dropped_size = dropped_size - left_size; 1316| 2.29k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.29k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [True: 0, Folded] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 2.29k| } else { 1325| 2.29k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 2.29k| auto newcount = count - idx; 1330| 2.29k| auto newn = 1331| 2.29k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.29k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.29k| : node_t::make_inner_r_e(e); 1336| 2.29k| auto newr = newn->relaxed(); 1337| 2.29k| IMMER_TRY { ------------------ | | 49| 2.29k|#define IMMER_TRY try ------------------ 1338| 2.29k| auto subs = 1339| 2.29k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.29k] ------------------ 1340| 2.29k| : pos.towards_sub_oh( 1341| 2.29k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.29k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.29k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.29k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.29k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.29k, False: 0] ------------------ 1346| 2.29k| pos.copy_sizes( 1347| 2.29k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.29k| newr->d.count = newcount; 1349| 2.29k| newn->inner()[0] = get<1>(subs); 1350| 2.29k| std::copy(node->inner() + idx + 1, 1351| 2.29k| node->inner() + count, 1352| 2.29k| newn->inner() + 1); 1353| 2.29k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.29k, False: 0] ------------------ 1354| 2.29k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.29k| if (Mutating) ------------------ | Branch (1355:25): [True: 2.29k, Folded] ------------------ 1356| 2.29k| pos.visit(dec_visitor{}); 1357| 2.29k| } 1358| 2.29k| return std::make_tuple(pos.shift(), newn); 1359| 2.29k| } 1360| 2.29k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 2.29k| } 1373| 2.29k| } _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| 46.4k| { 1378| 46.4k| auto node = pos.node(); 1379| 46.4k| auto idx = pos.index(first); 1380| 46.4k| auto count = pos.count(); 1381| 46.4k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 46.4k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 46.4k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 46.4k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 46.4k| } else { 1391| 46.4k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 46.4k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 46.4k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 46.4k| return std::make_tuple(0, newn); 1395| 46.4k| } 1396| 46.4k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.18k| { 1304| 2.18k| auto idx = pos.subindex(first); 1305| 2.18k| auto count = pos.count(); 1306| 2.18k| auto node = pos.node(); 1307| 2.18k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.18k] ------------------ 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.18k| auto left_size = pos.size_before(idx); 1313| 2.18k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.18k| auto dropped_size = first; 1315| 2.18k| auto child_dropped_size = dropped_size - left_size; 1316| 2.18k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.18k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 2.18k| } else { 1325| 2.18k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 2.18k| auto newcount = count - idx; 1330| 2.18k| auto newn = 1331| 2.18k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.18k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.18k| : node_t::make_inner_r_e(e); 1336| 2.18k| auto newr = newn->relaxed(); 1337| 2.18k| IMMER_TRY { ------------------ | | 49| 2.18k|#define IMMER_TRY try ------------------ 1338| 2.18k| auto subs = 1339| 2.18k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.18k] ------------------ 1340| 2.18k| : pos.towards_sub_oh( 1341| 2.18k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.18k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.18k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.18k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.18k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.18k, False: 0] ------------------ 1346| 2.18k| pos.copy_sizes( 1347| 2.18k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.18k| newr->d.count = newcount; 1349| 2.18k| newn->inner()[0] = get<1>(subs); 1350| 2.18k| std::copy(node->inner() + idx + 1, 1351| 2.18k| node->inner() + count, 1352| 2.18k| newn->inner() + 1); 1353| 2.18k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.18k, False: 0] ------------------ 1354| 2.18k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.18k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.18k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.18k| } 1358| 2.18k| return std::make_tuple(pos.shift(), newn); 1359| 2.18k| } 1360| 2.18k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 2.18k| } 1373| 2.18k| } _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.90k| { 1199| 1.90k| using node_t = node_type; 1200| 1.90k| auto node = p.node(); 1201| 1.90k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 1.90k, False: 0] ------------------ 1202| 1.90k| p.each_left(dec_t{}, idx); 1203| 1.90k| node_t::delete_inner_r(node, p.count()); 1204| 1.90k| } 1205| 1.90k| } _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| 200k| { 1247| 200k| auto idx = pos.subindex(first); 1248| 200k| auto count = pos.count(); 1249| 200k| auto node = pos.node(); 1250| 200k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 200k, Folded] | Branch (1250:47): [True: 158k, False: 42.6k] ------------------ 1251| 200k| auto left_size = pos.size_before(idx); 1252| 200k| auto child_size = pos.size_sbh(idx, left_size); 1253| 200k| auto dropped_size = first; 1254| 200k| auto child_dropped_size = dropped_size - left_size; 1255| 200k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 200k] | 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| 200k| } else { 1264| 200k| using std::get; 1265| 200k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 158k, False: 42.6k] ------------------ 1266| 200k| : node_t::make_inner_r_e(e); 1267| 200k| auto newr = newn->relaxed(); 1268| 200k| auto newcount = count - idx; 1269| 200k| auto new_child_size = child_size - child_dropped_size; 1270| 200k| IMMER_TRY { ------------------ | | 49| 200k|#define IMMER_TRY try ------------------ 1271| 200k| auto subs = 1272| 200k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 158k, False: 42.6k] ------------------ 1273| 200k| : pos.towards_sub_oh( 1274| 42.6k| no_collapse_no_mut_t{}, first, idx, e); 1275| 200k| if (mutate) ------------------ | Branch (1275:21): [True: 158k, False: 42.6k] ------------------ 1276| 158k| pos.each_left(dec_visitor{}, idx); 1277| 200k| pos.copy_sizes( 1278| 200k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 200k| std::copy(node->inner() + idx + 1, 1280| 200k| node->inner() + count, 1281| 200k| newn->inner() + 1); 1282| 200k| newn->inner()[0] = get<1>(subs); 1283| 200k| newr->d.sizes[0] = new_child_size; 1284| 200k| newr->d.count = newcount; 1285| 200k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 200k, False: 0] ------------------ 1286| 200k| if (!mutate) { ------------------ | Branch (1286:21): [True: 42.6k, False: 158k] ------------------ 1287| 42.6k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 42.6k| if (Mutating) ------------------ | Branch (1288:25): [True: 42.6k, Folded] ------------------ 1289| 42.6k| pos.visit(dec_visitor{}); 1290| 42.6k| } 1291| 200k| return std::make_tuple(pos.shift(), newn); 1292| 200k| } 1293| 200k| 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| 200k| } 1299| 200k| } _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| 50.1k| { 1247| 50.1k| auto idx = pos.subindex(first); 1248| 50.1k| auto count = pos.count(); 1249| 50.1k| auto node = pos.node(); 1250| 50.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 50.1k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 50.1k| auto left_size = pos.size_before(idx); 1252| 50.1k| auto child_size = pos.size_sbh(idx, left_size); 1253| 50.1k| auto dropped_size = first; 1254| 50.1k| auto child_dropped_size = dropped_size - left_size; 1255| 50.1k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 50.1k] | Branch (1255:25): [True: 0, False: 0] | Branch (1255:45): [True: 0, False: 0] ------------------ 1256| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 0] ------------------ 1257| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 0| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 0] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 0| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 0] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 0| return r; 1263| 50.1k| } else { 1264| 50.1k| using std::get; 1265| 50.1k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 50.1k] ------------------ 1266| 50.1k| : node_t::make_inner_r_e(e); 1267| 50.1k| auto newr = newn->relaxed(); 1268| 50.1k| auto newcount = count - idx; 1269| 50.1k| auto new_child_size = child_size - child_dropped_size; 1270| 50.1k| IMMER_TRY { ------------------ | | 49| 50.1k|#define IMMER_TRY try ------------------ 1271| 50.1k| auto subs = 1272| 50.1k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 50.1k] ------------------ 1273| 50.1k| : pos.towards_sub_oh( 1274| 50.1k| no_collapse_no_mut_t{}, first, idx, e); 1275| 50.1k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 50.1k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 50.1k| pos.copy_sizes( 1278| 50.1k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 50.1k| std::copy(node->inner() + idx + 1, 1280| 50.1k| node->inner() + count, 1281| 50.1k| newn->inner() + 1); 1282| 50.1k| newn->inner()[0] = get<1>(subs); 1283| 50.1k| newr->d.sizes[0] = new_child_size; 1284| 50.1k| newr->d.count = newcount; 1285| 50.1k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 50.1k, False: 0] ------------------ 1286| 50.1k| if (!mutate) { ------------------ | Branch (1286:21): [True: 50.1k, False: 0] ------------------ 1287| 50.1k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 50.1k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 50.1k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 50.1k| } 1291| 50.1k| return std::make_tuple(pos.shift(), newn); 1292| 50.1k| } 1293| 50.1k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 50.1k| } 1299| 50.1k| } _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.76k| { 1304| 2.76k| auto idx = pos.subindex(first); 1305| 2.76k| auto count = pos.count(); 1306| 2.76k| auto node = pos.node(); 1307| 2.76k| 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.76k| auto left_size = pos.size_before(idx); 1313| 2.76k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.76k| auto dropped_size = first; 1315| 2.76k| auto child_dropped_size = dropped_size - left_size; 1316| 2.76k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.76k, Folded] | Branch (1316:25): [True: 1.89k, False: 876] | Branch (1316:45): [True: 1.11k, False: 779] ------------------ 1317| 1.11k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 1.11k] ------------------ 1318| 1.11k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 1.11k| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 1.11k] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 1.11k| else if (Mutating) ------------------ | Branch (1321:22): [True: 1.11k, Folded] ------------------ 1322| 1.11k| pos.visit(dec_visitor{}); 1323| 1.11k| return r; 1324| 1.65k| } else { 1325| 1.65k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.65k| auto newcount = count - idx; 1330| 1.65k| auto newn = 1331| 1.65k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.65k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.65k| : node_t::make_inner_r_e(e); 1336| 1.65k| auto newr = newn->relaxed(); 1337| 1.65k| IMMER_TRY { ------------------ | | 49| 1.65k|#define IMMER_TRY try ------------------ 1338| 1.65k| auto subs = 1339| 1.65k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.65k] ------------------ 1340| 1.65k| : pos.towards_sub_oh( 1341| 1.65k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.65k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.65k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.65k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.65k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.65k, False: 0] ------------------ 1346| 1.65k| pos.copy_sizes( 1347| 1.65k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.65k| newr->d.count = newcount; 1349| 1.65k| newn->inner()[0] = get<1>(subs); 1350| 1.65k| std::copy(node->inner() + idx + 1, 1351| 1.65k| node->inner() + count, 1352| 1.65k| newn->inner() + 1); 1353| 1.65k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.65k, False: 0] ------------------ 1354| 1.65k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.65k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.65k, Folded] ------------------ 1356| 1.65k| pos.visit(dec_visitor{}); 1357| 1.65k| } 1358| 1.65k| return std::make_tuple(pos.shift(), newn); 1359| 1.65k| } 1360| 1.65k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.65k| } 1373| 2.76k| } _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.3k| { 350| 12.3k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 12.3k, False: 0] ------------------ 351| 12.3k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 11.5k, False: 864] ------------------ 352| 12.3k| ? visit_maybe_relaxed_sub(rootl, 353| 11.5k| shiftl, 354| 11.5k| sizel, 355| 11.5k| this_t{}, 356| 11.5k| posr, 357| 11.5k| first, 358| 11.5k| size_t{}) 359| 12.3k| : posr.first_sub_inner( 360| 864| rrb{}, first, rootl, shiftl, sizel); 361| 12.3k| } _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.1k| { 383| 32.1k| auto nl = posl.node(); 384| 32.1k| auto nr = posr.node(); 385| 32.1k| if (nl == nr) ------------------ | Branch (385:13): [True: 9.99k, False: 22.1k] ------------------ 386| 9.99k| return true; 387| 22.1k| auto cl = posl.count(); 388| 22.1k| auto cr = posr.count(); 389| 22.1k| assert(cr > 0); ------------------ | Branch (389:9): [True: 22.1k, False: 0] ------------------ 390| 22.1k| auto sbr = size_t{}; 391| 22.1k| auto i = count_t{}; 392| 22.1k| auto j = count_t{}; 393| 122k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 109k, False: 13.2k] ------------------ 394| 109k| auto sbl = posl.size_before(i); 395| 194k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 174k, False: 19.5k] | Branch (395:34): [True: 85.1k, False: 89.4k] ------------------ 396| 85.1k| ; 397| 109k| auto res = 398| 109k| sbl == sbr ------------------ | Branch (398:17): [True: 54.0k, False: 54.9k] ------------------ 399| 109k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 109k| : posl.nth_sub(i, 401| 54.9k| for_each_chunk_p_visitor{}, 402| 54.9k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 109k| if (!res) ------------------ | Branch (403:17): [True: 8.88k, False: 100k] ------------------ 404| 8.88k| return false; 405| 109k| } 406| 13.2k| return true; 407| 22.1k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 25.9k| { 337| 25.9k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 25.9k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 26.6k| { 428| 26.6k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 16.4k, False: 10.1k] ------------------ 429| 16.4k| return true; 430| 10.1k| auto cl = posl.count(); 431| 10.1k| auto cr = posr.count(); 432| 10.1k| auto mp = std::min(cl, cr); 433| 10.1k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 8.67k, False: 1.44k] ------------------ 434| 10.1k| posl.node()->leaf() + mp, 435| 10.1k| posr.node()->leaf()) && 436| 8.67k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 8.21k, False: 461] ------------------ 437| 8.67k| posl.node()->leaf() + posl.count(), 438| 8.67k| first + (idx + mp)); 439| 26.6k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 23.6k| { 330| 23.6k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 23.6k| } _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.22k| { 413| 4.22k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.22k| } _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.22k| { 383| 4.22k| auto nl = posl.node(); 384| 4.22k| auto nr = posr.node(); 385| 4.22k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.22k] ------------------ 386| 0| return true; 387| 4.22k| auto cl = posl.count(); 388| 4.22k| auto cr = posr.count(); 389| 4.22k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.22k, False: 0] ------------------ 390| 4.22k| auto sbr = size_t{}; 391| 4.22k| auto i = count_t{}; 392| 4.22k| auto j = count_t{}; 393| 15.5k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 13.5k, False: 2.04k] ------------------ 394| 13.5k| auto sbl = posl.size_before(i); 395| 22.9k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 19.1k, False: 3.79k] | Branch (395:34): [True: 9.40k, False: 9.71k] ------------------ 396| 9.40k| ; 397| 13.5k| auto res = 398| 13.5k| sbl == sbr ------------------ | Branch (398:17): [True: 8.22k, False: 5.28k] ------------------ 399| 13.5k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 13.5k| : posl.nth_sub(i, 401| 5.28k| for_each_chunk_p_visitor{}, 402| 5.28k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 13.5k| if (!res) ------------------ | Branch (403:17): [True: 2.18k, False: 11.3k] ------------------ 404| 2.18k| return false; 405| 13.5k| } 406| 2.04k| return true; 407| 4.22k| } _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.35k| { 337| 5.35k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 5.35k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_12leaf_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 12.4k| { 428| 12.4k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 7.95k, False: 4.44k] ------------------ 429| 7.95k| return true; 430| 4.44k| auto cl = posl.count(); 431| 4.44k| auto cr = posr.count(); 432| 4.44k| auto mp = std::min(cl, cr); 433| 4.44k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 4.10k, False: 338] ------------------ 434| 4.44k| posl.node()->leaf() + mp, 435| 4.44k| posr.node()->leaf()) && 436| 4.10k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 3.82k, False: 282] ------------------ 437| 4.10k| posl.node()->leaf() + posl.count(), 438| 4.10k| first + (idx + mp)); 439| 12.4k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 1.96k| { 330| 1.96k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 1.96k| } _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.21k| { 413| 2.21k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.21k| } _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.21k| { 383| 2.21k| auto nl = posl.node(); 384| 2.21k| auto nr = posr.node(); 385| 2.21k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.21k] ------------------ 386| 0| return true; 387| 2.21k| auto cl = posl.count(); 388| 2.21k| auto cr = posr.count(); 389| 2.21k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.21k, False: 0] ------------------ 390| 2.21k| auto sbr = size_t{}; 391| 2.21k| auto i = count_t{}; 392| 2.21k| auto j = count_t{}; 393| 16.8k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 15.2k, False: 1.60k] ------------------ 394| 15.2k| auto sbl = posl.size_before(i); 395| 27.1k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 23.3k, False: 3.73k] | Branch (395:34): [True: 11.8k, False: 11.4k] ------------------ 396| 11.8k| ; 397| 15.2k| auto res = 398| 15.2k| sbl == sbr ------------------ | Branch (398:17): [True: 9.24k, False: 5.98k] ------------------ 399| 15.2k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 15.2k| : posl.nth_sub(i, 401| 5.98k| for_each_chunk_p_visitor{}, 402| 5.98k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 15.2k| if (!res) ------------------ | Branch (403:17): [True: 614, False: 14.6k] ------------------ 404| 614| return false; 405| 15.2k| } 406| 1.60k| return true; 407| 2.21k| } _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.74k| { 337| 7.74k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 7.74k| } _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| 580| { 330| 580| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 580| } _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| 925| { 330| 925| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 925| } _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.83k| { 420| 1.83k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.83k, False: 0] ------------------ 421| 1.83k| ? this_t::visit_regular(posl, posr.node()) 422| 1.83k| : this_t::visit_regular(posr, posl.node()); 423| 1.83k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 13.8k| { 444| 13.8k| auto node = pos.node(); 445| 13.8k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 9.39k, False: 4.45k] | Branch (445:33): [True: 2.51k, False: 1.93k] ------------------ 446| 13.8k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 29.4k| { 451| 29.4k| auto node = pos.node(); 452| 29.4k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 19.5k, False: 9.88k] | Branch (452:33): [True: 7.31k, False: 2.57k] ------------------ 453| 9.88k| node->leaf() + pos.count(), 454| 9.88k| other->leaf()); 455| 29.4k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 12.6k| { 444| 12.6k| auto node = pos.node(); 445| 12.6k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 7.17k, False: 5.44k] | Branch (445:33): [True: 2.28k, False: 3.15k] ------------------ 446| 12.6k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 2.84k| { 451| 2.84k| auto node = pos.node(); 452| 2.84k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.51k, False: 1.33k] | Branch (452:33): [True: 490, False: 847] ------------------ 453| 1.33k| node->leaf() + pos.count(), 454| 1.33k| other->leaf()); 455| 2.84k| } _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.02k| { 444| 3.02k| auto node = pos.node(); 445| 3.02k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 287, False: 2.73k] | Branch (445:33): [True: 1.59k, False: 1.14k] ------------------ 446| 3.02k| } _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| 254k| { 113| 254k| auto data = as_const(pos.node()->leaf()); 114| 254k| return fn(data, data + pos.count()); 115| 254k| } _ZZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_ENUlSE_T0_E_clIPKiSK_EEDaSE_SG_: 367| 1.20M| return [iter](auto f, auto e) mutable { 368| 1.20M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 85.0k, False: 1.11M] ------------------ 369| 85.0k| iter += e - f; 370| 85.0k| return true; 371| 85.0k| } 372| 9.50M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 8.39M, False: 1.11M] ------------------ 373| 8.39M| if (*f != *iter) ------------------ | Branch (373:21): [True: 4.64k, False: 8.39M] ------------------ 374| 4.64k| return false; 375| 1.11M| return true; 376| 1.11M| }; _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 4.51M| { 54| 4.51M| return pos.towards(this_t{}, idx); 55| 4.51M| } _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| 980k| { 60| 980k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 980k| } _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| 290k| { 54| 290k| return pos.towards(this_t{}, idx); 55| 290k| } _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| 270k| { 60| 270k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 270k| } _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| 288k| { 54| 288k| return pos.towards(this_t{}, idx); 55| 288k| } _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| 20.3k| { 60| 20.3k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 20.3k| } _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| 30.7k| { 54| 30.7k| return pos.towards(this_t{}, idx); 55| 30.7k| } _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| 20.9k| { 107| 20.9k| return pos.each_pred(this_t{}, fn); 108| 20.9k| } _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| 910| { 330| 910| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 910| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSM_OT1_m: 419| 9.99k| { 420| 9.99k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 9.99k, False: 0] ------------------ 421| 9.99k| ? this_t::visit_regular(posl, posr.node()) 422| 9.99k| : this_t::visit_regular(posr, posl.node()); 423| 9.99k| } _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| 931k| { 113| 931k| auto data = as_const(pos.node()->leaf()); 114| 931k| return fn(data, data + pos.count()); 115| 931k| } _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| 17.8k| { 107| 17.8k| return pos.each_pred(this_t{}, fn); 108| 17.8k| } _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| 15.5k| { 113| 15.5k| auto data = as_const(pos.node()->leaf()); 114| 15.5k| return fn(data, data + pos.count()); 115| 15.5k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 3.89k| { 107| 3.89k| return pos.each_pred(this_t{}, fn); 108| 3.89k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 4.98k| { 330| 4.98k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 4.98k| } _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.66k| { 383| 3.66k| auto nl = posl.node(); 384| 3.66k| auto nr = posr.node(); 385| 3.66k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 3.66k] ------------------ 386| 0| return true; 387| 3.66k| auto cl = posl.count(); 388| 3.66k| auto cr = posr.count(); 389| 3.66k| assert(cr > 0); ------------------ | Branch (389:9): [True: 3.66k, False: 0] ------------------ 390| 3.66k| auto sbr = size_t{}; 391| 3.66k| auto i = count_t{}; 392| 3.66k| auto j = count_t{}; 393| 15.7k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 13.9k, False: 1.86k] ------------------ 394| 13.9k| auto sbl = posl.size_before(i); 395| 22.4k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 19.5k, False: 2.89k] | Branch (395:34): [True: 8.52k, False: 11.0k] ------------------ 396| 8.52k| ; 397| 13.9k| auto res = 398| 13.9k| sbl == sbr ------------------ | Branch (398:17): [True: 7.83k, False: 6.07k] ------------------ 399| 13.9k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 13.9k| : posl.nth_sub(i, 401| 6.07k| for_each_chunk_p_visitor{}, 402| 6.07k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 13.9k| if (!res) ------------------ | Branch (403:17): [True: 1.80k, False: 12.1k] ------------------ 404| 1.80k| return false; 405| 13.9k| } 406| 1.86k| return true; 407| 3.66k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 11.8k| { 337| 11.8k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 11.8k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_13full_leaf_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 11.8k| { 428| 11.8k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 9.05k, False: 2.75k] ------------------ 429| 9.05k| return true; 430| 2.75k| auto cl = posl.count(); 431| 2.75k| auto cr = posr.count(); 432| 2.75k| auto mp = std::min(cl, cr); 433| 2.75k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 2.44k, False: 314] ------------------ 434| 2.75k| posl.node()->leaf() + mp, 435| 2.75k| posr.node()->leaf()) && 436| 2.44k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.44k, False: 0] ------------------ 437| 2.44k| posl.node()->leaf() + posl.count(), 438| 2.44k| first + (idx + mp)); 439| 11.8k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 4.55k| { 330| 4.55k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 4.55k| } _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.92k| { 383| 1.92k| auto nl = posl.node(); 384| 1.92k| auto nr = posr.node(); 385| 1.92k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.92k] ------------------ 386| 0| return true; 387| 1.92k| auto cl = posl.count(); 388| 1.92k| auto cr = posr.count(); 389| 1.92k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.92k, False: 0] ------------------ 390| 1.92k| auto sbr = size_t{}; 391| 1.92k| auto i = count_t{}; 392| 1.92k| auto j = count_t{}; 393| 15.8k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 14.2k, False: 1.61k] ------------------ 394| 14.2k| auto sbl = posl.size_before(i); 395| 26.0k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 24.9k, False: 1.07k] | Branch (395:34): [True: 11.7k, False: 13.2k] ------------------ 396| 11.7k| ; 397| 14.2k| auto res = 398| 14.2k| sbl == sbr ------------------ | Branch (398:17): [True: 9.06k, False: 5.21k] ------------------ 399| 14.2k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 14.2k| : posl.nth_sub(i, 401| 5.21k| for_each_chunk_p_visitor{}, 402| 5.21k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 14.2k| if (!res) ------------------ | Branch (403:17): [True: 307, False: 13.9k] ------------------ 404| 307| return false; 405| 14.2k| } 406| 1.61k| return true; 407| 1.92k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 419| 2.62k| { 420| 2.62k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 2.62k, False: 0] ------------------ 421| 2.62k| ? this_t::visit_regular(posl, posr.node()) 422| 2.62k| : this_t::visit_regular(posr, posl.node()); 423| 2.62k| } _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| 141k| { 107| 141k| return pos.each_pred(this_t{}, fn); 108| 141k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 366| 77.5k| { 367| 77.5k| return [iter](auto f, auto e) mutable { 368| 77.5k| if (f == &*iter) { 369| 77.5k| iter += e - f; 370| 77.5k| return true; 371| 77.5k| } 372| 77.5k| for (; f != e; ++f, ++iter) 373| 77.5k| if (*f != *iter) 374| 77.5k| return false; 375| 77.5k| return true; 376| 77.5k| }; 377| 77.5k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 1.13k| { 350| 1.13k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 1.13k, False: 0] ------------------ 351| 1.13k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 864, False: 268] ------------------ 352| 1.13k| ? visit_maybe_relaxed_sub(rootl, 353| 864| shiftl, 354| 864| sizel, 355| 864| this_t{}, 356| 864| posr, 357| 864| first, 358| 864| size_t{}) 359| 1.13k| : posr.first_sub_inner( 360| 268| rrb{}, first, rootl, shiftl, sizel); 361| 1.13k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 8.67k| { 350| 8.67k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 8.67k, False: 0] ------------------ 351| 8.67k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 8.67k, False: 0] ------------------ 352| 8.67k| ? visit_maybe_relaxed_sub(rootl, 353| 8.67k| shiftl, 354| 8.67k| sizel, 355| 8.67k| this_t{}, 356| 8.67k| posr, 357| 8.67k| first, 358| 8.67k| size_t{}) 359| 8.67k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 8.67k| } _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.52k| { 451| 6.52k| auto node = pos.node(); 452| 6.52k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.77k, False: 4.75k] | Branch (452:33): [True: 2.05k, False: 2.70k] ------------------ 453| 4.75k| node->leaf() + pos.count(), 454| 4.75k| other->leaf()); 455| 6.52k| } _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| 152M|{ 1839| 152M| assert(node); ------------------ | Branch (1839:5): [True: 152M, False: 0] ------------------ 1840| 152M| auto relaxed = node->relaxed(); 1841| 152M| if (relaxed) { ------------------ | Branch (1841:9): [True: 137M, False: 14.9M] ------------------ 1842| 137M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 137M, False: 0] ------------------ 1843| 137M| return make_relaxed_pos(node, shift, relaxed) 1844| 137M| .visit(v, std::forward(args)...); 1845| 137M| } else { 1846| 14.9M| return make_regular_sub_pos(node, shift, size) 1847| 14.9M| .visit(v, std::forward(args)...); 1848| 14.9M| } 1849| 152M|} _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| 386M|{ 1829| 386M| assert(node); ------------------ | Branch (1829:5): [True: 386M, False: 0] ------------------ 1830| 386M| assert(relaxed); ------------------ | Branch (1830:5): [True: 386M, False: 0] ------------------ 1831| 386M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 386M, False: 0] ------------------ 1832| 386M| return {node, shift, relaxed}; 1833| 386M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 156M| { 1814| 156M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 156M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1431| 260M| 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| 31.1M| { 1477| 31.1M| each_left(v, relaxed_->d.count, args...); 1478| 31.1M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 31.3M| { 1624| 31.3M| auto p = node_->inner(); 1625| 31.3M| auto s = size_t{}; 1626| 31.3M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 6.48M, False: 24.8M] ------------------ 1627| 52.6M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 46.1M, False: 6.48M] ------------------ 1628| 46.1M| IMMER_PREFETCH(p + i + 1); 1629| 46.1M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 46.1M| .visit(v, args...); 1631| 46.1M| s = relaxed_->d.sizes[i]; 1632| 46.1M| assert(s); ------------------ | Branch (1632:17): [True: 46.1M, False: 0] ------------------ 1633| 46.1M| } 1634| 24.8M| } else { 1635| 24.8M| auto ss = shift_ - B; 1636| 175M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 150M, False: 24.8M] ------------------ 1637| 150M| visit_maybe_relaxed_sub( 1638| 150M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 150M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 150M, False: 0] ------------------ 1641| 150M| } 1642| 24.8M| } 1643| 31.3M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1430| 237M| 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.9M|{ 1045| 24.9M| assert(node); ------------------ | Branch (1045:5): [True: 24.9M, False: 0] ------------------ 1046| 24.9M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 24.9M, False: 0] ------------------ 1047| 24.9M| assert(size > 0); ------------------ | Branch (1047:5): [True: 24.9M, False: 0] ------------------ 1048| 24.9M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 24.9M, False: 0] ------------------ 1049| 24.9M| return {node, shift, size}; 1050| 24.9M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1036| 14.9M| { 1037| 14.9M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 14.9M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 785| 25.0M| node_t* node() const { return node_; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 825| 434k| { 826| 434k| return each_regular(*this, v, args...); 827| 434k| } _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| 434k|{ 344| 434k| constexpr auto B = bits; 345| 434k| constexpr auto BL = bits_leaf; 346| 434k| auto n = p.node()->inner(); 347| 434k| auto last = p.count() - 1; 348| 434k| auto e = n + last; 349| 434k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 91.4k, False: 342k] ------------------ 350| 229k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 138k, False: 91.4k] ------------------ 351| 138k| IMMER_PREFETCH(n + 1); 352| 138k| make_full_leaf_pos(*n).visit(v, args...); 353| 138k| } 354| 91.4k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 342k| } else { 356| 342k| auto ss = p.shift() - B; 357| 1.27M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 934k, False: 342k] ------------------ 358| 934k| make_full_pos(*n, ss).visit(v, args...); 359| 342k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 342k| } 361| 434k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 787| 9.73M| 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| 12.1M|{ 215| 12.1M| assert(node); ------------------ | Branch (215:5): [True: 12.1M, False: 0] ------------------ 216| 12.1M| return {node}; 217| 12.1M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 1.69M| { 208| 1.69M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.69M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 199| 7.41M| 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| 10.9M| 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.48M|{ 120| 1.48M| assert(node); ------------------ | Branch (120:5): [True: 1.48M, False: 0] ------------------ 121| 1.48M| assert(size > 0); ------------------ | Branch (121:5): [True: 1.48M, False: 0] ------------------ 122| 1.48M| return {node, size}; 123| 1.48M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 786| 6.78M| 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| 397k| { 113| 397k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 397k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 104| 1.48M| 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.13M| 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.20M| 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.34M|{ 1413| 4.34M| assert(node); ------------------ | Branch (1413:5): [True: 4.34M, False: 0] ------------------ 1414| 4.34M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 4.34M, False: 0] ------------------ 1415| 4.34M| return {node, shift}; 1416| 4.34M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 2.87M| { 1406| 2.87M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.87M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1159| 3.48M| 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| 94.6k| { 1186| 94.6k| auto p = node_->inner(); 1187| 94.6k| auto e = p + branches; 1188| 94.6k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 82.5k, False: 12.1k] ------------------ 1189| 742k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 660k, False: 82.5k] ------------------ 1190| 660k| IMMER_PREFETCH(p + 1); 1191| 660k| make_full_leaf_pos(*p).visit(v, args...); 1192| 660k| } 1193| 82.5k| } else { 1194| 12.1k| auto ss = shift_ - B; 1195| 109k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 96.8k, False: 12.1k] ------------------ 1196| 96.8k| make_full_pos(*p, ss).visit(v, args...); 1197| 12.1k| } 1198| 94.6k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1158| 1.23M| 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.84M|{ 691| 2.84M| assert(node); ------------------ | Branch (691:5): [True: 2.84M, False: 0] ------------------ 692| 2.84M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 2.84M, False: 0] ------------------ 693| 2.84M| assert(size > 0); ------------------ | Branch (693:5): [True: 2.84M, False: 0] ------------------ 694| 2.84M| return {node, shift, size}; 695| 2.84M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 916k| { 337| 916k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 916k| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 231| 4.99M| 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| 866k| { 244| 866k| return each_regular(*this, v, args...); 245| 866k| } _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| 866k|{ 344| 866k| constexpr auto B = bits; 345| 866k| constexpr auto BL = bits_leaf; 346| 866k| auto n = p.node()->inner(); 347| 866k| auto last = p.count() - 1; 348| 866k| auto e = n + last; 349| 866k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 302k, False: 564k] ------------------ 350| 1.17M| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 872k, False: 302k] ------------------ 351| 872k| IMMER_PREFETCH(n + 1); 352| 872k| make_full_leaf_pos(*n).visit(v, args...); 353| 872k| } 354| 302k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 564k| } else { 356| 564k| auto ss = p.shift() - B; 357| 2.38M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 1.82M, False: 564k] ------------------ 358| 1.82M| make_full_pos(*n, ss).visit(v, args...); 359| 564k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 564k| } 361| 866k|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 233| 4.65M| 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.77M| size_t size() const { return size_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 230| 3.09M| 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.95M| count_t index(size_t idx) const { return (idx >> shift_) & mask; } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 784| 18.2M| count_t count() const { return subindex(size_ - 1) + 1; } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 789| 21.4M| count_t subindex(size_t idx) const { return idx >> shift_; } _ZN5immer6detail4rbts22make_empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_17empty_regular_posIT_EEPSE_: 64| 1.47M|{ 65| 1.47M| return {node}; 66| 1.47M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 1.47M| { 58| 1.47M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 1.47M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 41| 1.47M| node_t* node() const { return node_; } _ZN5immer6detail4rbts17make_leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_12leaf_sub_posIT_EEPSE_j: 151| 69.7M|{ 152| 69.7M| assert(node); ------------------ | Branch (152:5): [True: 69.7M, False: 0] ------------------ 153| 69.7M| assert(count <= branches); ------------------ | Branch (153:5): [True: 69.7M, False: 0] ------------------ 154| 69.7M| return {node, count}; 155| 69.7M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 51.1M| { 145| 51.1M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 51.1M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 136| 62.5M| 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| 19.5M| 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.33M|{ 89| 1.33M| assert(node); ------------------ | Branch (89:5): [True: 1.33M, False: 0] ------------------ 90| 1.33M| return {node}; 91| 1.33M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 1.33M| { 82| 1.33M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 1.33M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 75| 1.33M| 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.26k| 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| 195k| { 1814| 195k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 195k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1433| 24.5M| 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| 11.6M| { 1444| 11.6M| return size_sbh(offset, size_before(offset)); 1445| 11.6M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1448| 12.0M| { 1449| 12.0M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 12.0M, False: 0] ------------------ 1450| 12.0M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 12.0M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 1438| 43.1M| { 1439| 43.1M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 28.3M, False: 14.8M] ------------------ 1440| 43.1M| } _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| 180k| { 1738| 180k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 180k, False: 0] ------------------ 1739| 180k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 180k, False: 0] ------------------ 1740| 180k| auto child = node_->inner()[offset_hint]; 1741| 180k| auto is_leaf = shift_ == BL; 1742| 180k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 180k] ------------------ 1743| 180k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 180k| : visit_maybe_relaxed_sub( 1745| 180k| child, shift_ - B, child_size_hint, v, args...); 1746| 180k| } _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| 180k|{ 1839| 180k| assert(node); ------------------ | Branch (1839:5): [True: 180k, False: 0] ------------------ 1840| 180k| auto relaxed = node->relaxed(); 1841| 180k| if (relaxed) { ------------------ | Branch (1841:9): [True: 140k, False: 39.9k] ------------------ 1842| 140k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 140k, False: 0] ------------------ 1843| 140k| return make_relaxed_pos(node, shift, relaxed) 1844| 140k| .visit(v, std::forward(args)...); 1845| 140k| } else { 1846| 39.9k| return make_regular_sub_pos(node, shift, size) 1847| 39.9k| .visit(v, std::forward(args)...); 1848| 39.9k| } 1849| 180k|} _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.9k| { 1037| 39.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 39.9k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 788| 2.13M| 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| 306k| { 953| 306k| return last_oh_regular(*this, v, offset_hint, args...); 954| 306k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_: 677| 306k|{ 678| 306k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 306k, False: 0] ------------------ 679| 306k| constexpr auto B = bits; 680| 306k| constexpr auto BL = bits_leaf; 681| 306k| auto child = p.node()->inner()[offset_hint]; 682| 306k| auto is_leaf = p.shift() == BL; 683| 306k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 306k] ------------------ 684| 306k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 306k| .visit(v, args...); 686| 306k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 336| 823k| { 337| 823k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 823k| } _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| 517k| { 331| 517k| return last_oh_regular(*this, v, offset_hint, args...); 332| 517k| } _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| 517k|{ 678| 517k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 517k, False: 0] ------------------ 679| 517k| constexpr auto B = bits; 680| 517k| constexpr auto BL = bits_leaf; 681| 517k| auto child = p.node()->inner()[offset_hint]; 682| 517k| auto is_leaf = p.shift() == BL; 683| 517k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 517k] ------------------ 684| 517k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 517k| .visit(v, args...); 686| 517k|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1432| 102M| 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| 297k| { 1037| 297k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 297k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_DpOT0_: 144| 58.5k| { 145| 58.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 58.5k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 139| 1.20M| count_t index(size_t idx) const { return idx & mask; } flex-vector-bo.cpp:_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSJ_E_EEEDcPSJ_jmT0_DpOT1_: 1838| 286k|{ 1839| 286k| assert(node); ------------------ | Branch (1839:5): [True: 286k, False: 0] ------------------ 1840| 286k| auto relaxed = node->relaxed(); 1841| 286k| if (relaxed) { ------------------ | Branch (1841:9): [True: 234k, False: 52.0k] ------------------ 1842| 234k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 234k, False: 0] ------------------ 1843| 234k| return make_relaxed_pos(node, shift, relaxed) 1844| 234k| .visit(v, std::forward(args)...); 1845| 234k| } else { 1846| 52.0k| return make_regular_sub_pos(node, shift, size) 1847| 52.0k| .visit(v, std::forward(args)...); 1848| 52.0k| } 1849| 286k|} 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| 234k| { 1814| 234k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 234k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 1454| 16.1M| { 1455| 16.1M| auto offset = idx >> shift_; 1456| 23.2M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 7.06M, False: 16.1M] ------------------ 1457| 7.06M| ++offset; 1458| 16.1M| return offset; 1459| 16.1M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7relaxedEv: 1435| 234k| 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| 234k| { 1687| 234k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 234k, False: 0] ------------------ 1688| 234k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 59.0k, False: 175k] ------------------ 1689| 234k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 234k| } 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| 234k| { 1699| 234k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 234k| } 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| 234k| { 1718| 234k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 234k, False: 0] ------------------ 1719| 234k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 59.0k, False: 175k] | Branch (1719:9): [True: 234k, False: 0] ------------------ 1720| 234k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 234k| auto child = node_->inner()[offset_hint]; 1722| 234k| auto is_leaf = shift_ == BL; 1723| 234k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 234k| auto next_idx = idx - left_size_hint; 1725| 234k| return is_leaf ------------------ | Branch (1725:16): [True: 61.0k, False: 173k] ------------------ 1726| 234k| ? make_leaf_sub_pos(child, next_size) 1727| 61.0k| .visit(v, next_idx, args...) 1728| 234k| : visit_maybe_relaxed_sub( 1729| 173k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 234k| } 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| 61.0k| { 145| 61.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 61.0k| } 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| 52.0k| { 1037| 52.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 52.0k| } 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| 52.0k| { 939| 52.0k| return towards_oh_ch_regular( 940| 52.0k| *this, v, idx, offset_hint, count(), args...); 941| 52.0k| } 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| 52.0k|{ 633| 52.0k| constexpr auto B = bits; 634| 52.0k| constexpr auto BL = bits_leaf; 635| 52.0k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 52.0k, False: 0] ------------------ 636| 52.0k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 52.0k, False: 0] ------------------ 637| 52.0k| auto is_leaf = p.shift() == BL; 638| 52.0k| auto child = p.node()->inner()[offset_hint]; 639| 52.0k| auto is_full = offset_hint + 1 != count_hint; 640| 52.0k| return is_full ------------------ | Branch (640:12): [True: 9.51k, False: 42.5k] ------------------ 641| 52.0k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.06k, False: 7.44k] ------------------ 642| 9.51k| : make_full_pos(child, p.shift() - B) 643| 7.44k| .visit(v, idx, args...)) 644| 52.0k| : (is_leaf ------------------ | Branch (644:19): [True: 36.0k, False: 6.47k] ------------------ 645| 42.5k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 42.5k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 6.47k| .visit(v, idx, args...)); 648| 52.0k|} 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| 14.5k| { 208| 14.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 14.5k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 202| 330k| 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| 662k| 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.63k, False: 4.12k] ------------------ 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| 37.5k| { 113| 37.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 37.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| 6.91k| { 337| 6.91k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 6.91k| } 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| 6.91k| { 317| 6.91k| return towards_oh_ch_regular( 318| 6.91k| *this, v, idx, offset_hint, count(), args...); 319| 6.91k| } 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| 6.91k|{ 633| 6.91k| constexpr auto B = bits; 634| 6.91k| constexpr auto BL = bits_leaf; 635| 6.91k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.91k, False: 0] ------------------ 636| 6.91k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.91k, False: 0] ------------------ 637| 6.91k| auto is_leaf = p.shift() == BL; 638| 6.91k| auto child = p.node()->inner()[offset_hint]; 639| 6.91k| auto is_full = offset_hint + 1 != count_hint; 640| 6.91k| return is_full ------------------ | Branch (640:12): [True: 5.06k, False: 1.85k] ------------------ 641| 6.91k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 3.87k, False: 1.18k] ------------------ 642| 5.06k| : make_full_pos(child, p.shift() - B) 643| 1.18k| .visit(v, idx, args...)) 644| 6.91k| : (is_leaf ------------------ | Branch (644:19): [True: 1.41k, False: 436] ------------------ 645| 1.85k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.85k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 436| .visit(v, idx, args...)); 648| 6.91k|} _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| 37.4k|{ 1839| 37.4k| assert(node); ------------------ | Branch (1839:5): [True: 37.4k, False: 0] ------------------ 1840| 37.4k| auto relaxed = node->relaxed(); 1841| 37.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 29.4k, False: 8.03k] ------------------ 1842| 29.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 29.4k, False: 0] ------------------ 1843| 29.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 29.4k| .visit(v, std::forward(args)...); 1845| 29.4k| } else { 1846| 8.03k| return make_regular_sub_pos(node, shift, size) 1847| 8.03k| .visit(v, std::forward(args)...); 1848| 8.03k| } 1849| 37.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 29.4k| { 1814| 29.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 29.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1686| 22.3k| { 1687| 22.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 22.3k, False: 0] ------------------ 1688| 22.3k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 22.3k] ------------------ 1689| 22.3k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 22.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1698| 22.3k| { 1699| 22.3k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 22.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 22.3k| { 1718| 22.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 22.3k, False: 0] ------------------ 1719| 22.3k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 22.3k] | Branch (1719:9): [True: 22.3k, False: 0] ------------------ 1720| 22.3k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 22.3k| auto child = node_->inner()[offset_hint]; 1722| 22.3k| auto is_leaf = shift_ == BL; 1723| 22.3k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 22.3k| auto next_idx = idx - left_size_hint; 1725| 22.3k| return is_leaf ------------------ | Branch (1725:16): [True: 1.64k, False: 20.7k] ------------------ 1726| 22.3k| ? make_leaf_sub_pos(child, next_size) 1727| 1.64k| .visit(v, next_idx, args...) 1728| 22.3k| : visit_maybe_relaxed_sub( 1729| 20.7k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 22.3k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 144| 1.64k| { 145| 1.64k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.64k| } _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.7k| { 1687| 10.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 10.7k, False: 0] ------------------ 1688| 10.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.14k, False: 1.59k] ------------------ 1689| 10.7k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 10.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1698| 10.7k| { 1699| 10.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 10.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 10.7k| { 1718| 10.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 10.7k, False: 0] ------------------ 1719| 10.7k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.14k, False: 1.59k] | Branch (1719:9): [True: 10.7k, False: 0] ------------------ 1720| 10.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 10.7k| auto child = node_->inner()[offset_hint]; 1722| 10.7k| auto is_leaf = shift_ == BL; 1723| 10.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 10.7k| auto next_idx = idx - left_size_hint; 1725| 10.7k| return is_leaf ------------------ | Branch (1725:16): [True: 4.16k, False: 6.57k] ------------------ 1726| 10.7k| ? make_leaf_sub_pos(child, next_size) 1727| 4.16k| .visit(v, next_idx, args...) 1728| 10.7k| : visit_maybe_relaxed_sub( 1729| 6.57k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 10.7k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 4.16k| { 145| 4.16k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.16k| } _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.57k|{ 1839| 6.57k| assert(node); ------------------ | Branch (1839:5): [True: 6.57k, False: 0] ------------------ 1840| 6.57k| auto relaxed = node->relaxed(); 1841| 6.57k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.67k, False: 2.90k] ------------------ 1842| 3.67k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.67k, False: 0] ------------------ 1843| 3.67k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.67k| .visit(v, std::forward(args)...); 1845| 3.67k| } else { 1846| 2.90k| return make_regular_sub_pos(node, shift, size) 1847| 2.90k| .visit(v, std::forward(args)...); 1848| 2.90k| } 1849| 6.57k|} _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.67k| { 1814| 3.67k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.67k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 2.90k| { 1037| 2.90k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.90k| } _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.26k| { 928| 5.26k| return towards_oh_ch_regular( 929| 5.26k| *this, v, idx, offset_hint, count(), args...); 930| 5.26k| } _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.26k|{ 633| 5.26k| constexpr auto B = bits; 634| 5.26k| constexpr auto BL = bits_leaf; 635| 5.26k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.26k, False: 0] ------------------ 636| 5.26k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.26k, False: 0] ------------------ 637| 5.26k| auto is_leaf = p.shift() == BL; 638| 5.26k| auto child = p.node()->inner()[offset_hint]; 639| 5.26k| auto is_full = offset_hint + 1 != count_hint; 640| 5.26k| return is_full ------------------ | Branch (640:12): [True: 1.61k, False: 3.64k] ------------------ 641| 5.26k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 830, False: 789] ------------------ 642| 1.61k| : make_full_pos(child, p.shift() - B) 643| 789| .visit(v, idx, args...)) 644| 5.26k| : (is_leaf ------------------ | Branch (644:19): [True: 1.39k, False: 2.25k] ------------------ 645| 3.64k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.64k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.25k| .visit(v, idx, args...)); 648| 5.26k|} _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.87k| { 208| 5.87k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.87k| } _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.18k| { 1406| 2.18k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.18k| } _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.39k| { 1337| 5.39k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 5.39k, False: 0] ------------------ 1338| 5.39k| auto is_leaf = shift_ == BL; 1339| 5.39k| auto child = node_->inner()[offset_hint]; 1340| 5.39k| return is_leaf ------------------ | Branch (1340:16): [True: 4.41k, False: 989] ------------------ 1341| 5.39k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 5.39k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 5.39k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1161| 55.0k| 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.61k| { 113| 2.61k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.61k| } _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.69k| { 337| 2.69k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.69k| } _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.69k| { 306| 2.69k| return towards_oh_ch_regular( 307| 2.69k| *this, v, idx, offset_hint, count(), args...); 308| 2.69k| } _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.69k|{ 633| 2.69k| constexpr auto B = bits; 634| 2.69k| constexpr auto BL = bits_leaf; 635| 2.69k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.69k, False: 0] ------------------ 636| 2.69k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.69k, False: 0] ------------------ 637| 2.69k| auto is_leaf = p.shift() == BL; 638| 2.69k| auto child = p.node()->inner()[offset_hint]; 639| 2.69k| auto is_full = offset_hint + 1 != count_hint; 640| 2.69k| return is_full ------------------ | Branch (640:12): [True: 1.03k, False: 1.65k] ------------------ 641| 2.69k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 630, False: 403] ------------------ 642| 1.03k| : make_full_pos(child, p.shift() - B) 643| 403| .visit(v, idx, args...)) 644| 2.69k| : (is_leaf ------------------ | Branch (644:19): [True: 1.22k, False: 436] ------------------ 645| 1.65k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.65k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 436| .visit(v, idx, args...)); 648| 2.69k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1036| 8.03k| { 1037| 8.03k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.03k| } _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.67k| { 928| 5.67k| return towards_oh_ch_regular( 929| 5.67k| *this, v, idx, offset_hint, count(), args...); 930| 5.67k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb1EEEJEEEDcOT_T0_mjjDpOT1_: 632| 5.67k|{ 633| 5.67k| constexpr auto B = bits; 634| 5.67k| constexpr auto BL = bits_leaf; 635| 5.67k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.67k, False: 0] ------------------ 636| 5.67k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.67k, False: 0] ------------------ 637| 5.67k| auto is_leaf = p.shift() == BL; 638| 5.67k| auto child = p.node()->inner()[offset_hint]; 639| 5.67k| auto is_full = offset_hint + 1 != count_hint; 640| 5.67k| return is_full ------------------ | Branch (640:12): [True: 4.93k, False: 743] ------------------ 641| 5.67k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.08k, False: 3.84k] ------------------ 642| 4.93k| : make_full_pos(child, p.shift() - B) 643| 3.84k| .visit(v, idx, args...)) 644| 5.67k| : (is_leaf ------------------ | Branch (644:19): [True: 743, False: 0] ------------------ 645| 743| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 743| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.67k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 207| 1.71k| { 208| 1.71k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.71k| } _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.41k| { 1406| 5.41k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.41k| } _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.19k| { 1337| 2.19k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.19k, False: 0] ------------------ 1338| 2.19k| auto is_leaf = shift_ == BL; 1339| 2.19k| auto child = node_->inner()[offset_hint]; 1340| 2.19k| return is_leaf ------------------ | Branch (1340:16): [True: 627, False: 1.56k] ------------------ 1341| 2.19k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.19k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.19k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 743| { 113| 743| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 743| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 34.2k|{ 1839| 34.2k| assert(node); ------------------ | Branch (1839:5): [True: 34.2k, False: 0] ------------------ 1840| 34.2k| auto relaxed = node->relaxed(); 1841| 34.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 26.1k, False: 8.15k] ------------------ 1842| 26.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 26.1k, False: 0] ------------------ 1843| 26.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 26.1k| .visit(v, std::forward(args)...); 1845| 26.1k| } else { 1846| 8.15k| return make_regular_sub_pos(node, shift, size) 1847| 8.15k| .visit(v, std::forward(args)...); 1848| 8.15k| } 1849| 34.2k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 26.1k| { 1814| 26.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 26.1k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1434| 4.95M| 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.68k| { 1706| 3.68k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.68k, False: 0] ------------------ 1707| 3.68k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.37k, False: 309] ------------------ 1708| 3.68k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.68k| } _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.68k| { 1718| 3.68k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.68k, False: 0] ------------------ 1719| 3.68k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.37k, False: 309] | Branch (1719:9): [True: 3.68k, False: 0] ------------------ 1720| 3.68k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.68k| auto child = node_->inner()[offset_hint]; 1722| 3.68k| auto is_leaf = shift_ == BL; 1723| 3.68k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.68k| auto next_idx = idx - left_size_hint; 1725| 3.68k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.68k] ------------------ 1726| 3.68k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.68k| : visit_maybe_relaxed_sub( 1729| 3.68k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.68k| } _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| 124k| { 1706| 124k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 124k, False: 0] ------------------ 1707| 124k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 39.3k, False: 84.6k] ------------------ 1708| 124k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 124k| } _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| 124k| { 1718| 124k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 124k, False: 0] ------------------ 1719| 124k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 39.3k, False: 84.6k] | Branch (1719:9): [True: 124k, False: 0] ------------------ 1720| 124k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 124k| auto child = node_->inner()[offset_hint]; 1722| 124k| auto is_leaf = shift_ == BL; 1723| 124k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 124k| auto next_idx = idx - left_size_hint; 1725| 124k| return is_leaf ------------------ | Branch (1725:16): [True: 20.7k, False: 103k] ------------------ 1726| 124k| ? make_leaf_sub_pos(child, next_size) 1727| 20.7k| .visit(v, next_idx, args...) 1728| 124k| : visit_maybe_relaxed_sub( 1729| 103k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 124k| } _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| 20.7k| { 145| 20.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 20.7k| } _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| 103k|{ 1839| 103k| assert(node); ------------------ | Branch (1839:5): [True: 103k, False: 0] ------------------ 1840| 103k| auto relaxed = node->relaxed(); 1841| 103k| if (relaxed) { ------------------ | Branch (1841:9): [True: 101k, False: 1.70k] ------------------ 1842| 101k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 101k, False: 0] ------------------ 1843| 101k| return make_relaxed_pos(node, shift, relaxed) 1844| 101k| .visit(v, std::forward(args)...); 1845| 101k| } else { 1846| 1.70k| return make_regular_sub_pos(node, shift, size) 1847| 1.70k| .visit(v, std::forward(args)...); 1848| 1.70k| } 1849| 103k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 101k| { 1814| 101k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 101k| } _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.70k| { 1037| 1.70k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.70k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 791| 1.66M| { 792| 1.66M| return size_t{offset} << shift_; 793| 1.66M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 803| 20.7k| { 804| 20.7k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 20.7k, False: 0] ------------------ 805| 20.7k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 8.14k, False: 12.6k] ------------------ 806| 20.7k| : size_t{1} << shift_; 807| 20.7k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 946| 9.11k| { 947| 9.11k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 9.11k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_18slice_left_visitorISD_Lb0EEEJEEEDcOT_T0_mjDpOT1_: 653| 9.11k|{ 654| 9.11k| constexpr auto B = bits; 655| 9.11k| constexpr auto BL = bits_leaf; 656| 9.11k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 9.11k, False: 0] ------------------ 657| 9.11k| auto is_leaf = p.shift() == BL; 658| 9.11k| auto child = p.node()->inner()[offset_hint]; 659| 9.11k| auto lsize = offset_hint << p.shift(); 660| 9.11k| auto size = p.this_size(); 661| 9.11k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 9.11k| return is_full ------------------ | Branch (662:12): [True: 9.11k, False: 0] ------------------ 663| 9.11k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.57k, False: 4.54k] ------------------ 664| 9.11k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 9.11k| : make_full_pos(child, p.shift() - B) 666| 4.54k| .visit(v, idx - lsize, args...)) 667| 9.11k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 9.11k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9this_sizeEv: 794| 20.7k| 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.86k| { 208| 9.86k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.86k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 1405| 7.42k| { 1406| 7.42k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 7.42k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1163| 11.1k| count_t subindex(size_t idx) const { return idx >> shift_; } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 1170| 51.3k| { 1171| 51.3k| return size_t{offset} << shift_; 1172| 51.3k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1166| 11.1k| { 1167| 11.1k| return size_t{1} << shift_; 1168| 11.1k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1348| 8.17k| { 1349| 8.17k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 8.17k, False: 0] ------------------ 1350| 8.17k| auto is_leaf = shift_ == BL; 1351| 8.17k| auto child = node_->inner()[offset_hint]; 1352| 8.17k| auto lsize = size_t{offset_hint} << shift_; 1353| 8.17k| return is_leaf ------------------ | Branch (1353:16): [True: 5.29k, False: 2.88k] ------------------ 1354| 8.17k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 8.17k| : make_full_pos(child, shift_ - B) 1356| 2.88k| .visit(v, idx - lsize, args...); 1357| 8.17k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1175| 11.1k| { 1176| 11.1k| auto e = sizes + n; 1177| 63.6k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 52.4k, False: 11.1k] ------------------ 1178| 52.4k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 52.4k, False: 0] ------------------ 1180| 52.4k| } 1181| 11.1k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1160| 545k| 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.16M| { 811| 3.16M| if (n) { ------------------ | Branch (811:13): [True: 3.16M, False: 4.21k] ------------------ 812| 3.16M| auto last = offset + n - 1; 813| 3.16M| auto e = sizes + n - 1; 814| 12.6M| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 9.47M, False: 3.16M] ------------------ 815| 9.47M| init = *sizes = init + (size_t{1} << shift_); 816| 9.47M| assert(init); ------------------ | Branch (816:17): [True: 9.47M, False: 0] ------------------ 817| 9.47M| } 818| 3.16M| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 3.16M, False: 0] ------------------ 820| 3.16M| } 821| 3.16M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEj: 797| 3.18M| { 798| 3.18M| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 1.59M, False: 1.59M] ------------------ 799| 3.18M| : size_t{1} << shift_; 800| 3.18M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1462| 18.7M| { 1463| 18.7M| auto e = sizes + n; 1464| 18.7M| auto prev = size_before(offset); 1465| 18.7M| auto these = relaxed_->d.sizes + offset; 1466| 85.7M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 67.0M, False: 18.7M] ------------------ 1467| 67.0M| auto this_size = *these; 1468| 67.0M| init = *sizes = init + (this_size - prev); 1469| 67.0M| assert(init); ------------------ | Branch (1469:13): [True: 67.0M, False: 0] ------------------ 1470| 67.0M| prev = this_size; 1471| 67.0M| } 1472| 18.7M| } _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.15k| { 1037| 8.15k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.15k| } _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.32k| { 947| 2.32k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.32k| } _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.32k|{ 654| 2.32k| constexpr auto B = bits; 655| 2.32k| constexpr auto BL = bits_leaf; 656| 2.32k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.32k, False: 0] ------------------ 657| 2.32k| auto is_leaf = p.shift() == BL; 658| 2.32k| auto child = p.node()->inner()[offset_hint]; 659| 2.32k| auto lsize = offset_hint << p.shift(); 660| 2.32k| auto size = p.this_size(); 661| 2.32k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.32k| return is_full ------------------ | Branch (662:12): [True: 745, False: 1.58k] ------------------ 663| 2.32k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 745] ------------------ 664| 745| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 745| : make_full_pos(child, p.shift() - B) 666| 745| .visit(v, idx - lsize, args...)) 667| 2.32k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.58k] ------------------ 668| 1.58k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.58k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.58k| .visit(v, idx - lsize, args...)); 672| 2.32k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1405| 745| { 1406| 745| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 745| } _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.58k| { 1037| 1.58k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.58k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaPT_j: 766| 7.26k|{ 767| 7.26k| assert(leaf); ------------------ | Branch (767:5): [True: 7.26k, False: 0] ------------------ 768| 7.26k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 7.26k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 7.26k, False: 0] ------------------ 769| 7.26k| assert(count > 0); ------------------ | Branch (769:5): [True: 7.26k, False: 0] ------------------ 770| 7.26k| return singleton_regular_sub_pos{leaf, count}; 771| 7.26k|} _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.26k| { 760| 7.26k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 7.26k| } _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.26k|{ 1839| 7.26k| assert(node); ------------------ | Branch (1839:5): [True: 7.26k, False: 0] ------------------ 1840| 7.26k| auto relaxed = node->relaxed(); 1841| 7.26k| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.11k, False: 2.15k] ------------------ 1842| 5.11k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.11k, False: 0] ------------------ 1843| 5.11k| return make_relaxed_pos(node, shift, relaxed) 1844| 5.11k| .visit(v, std::forward(args)...); 1845| 5.11k| } else { 1846| 2.15k| return make_regular_sub_pos(node, shift, size) 1847| 2.15k| .visit(v, std::forward(args)...); 1848| 2.15k| } 1849| 7.26k|} _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.11k| { 1814| 5.11k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.11k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 735| 25.1k| 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.26k| { 745| 7.26k| } _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.33M| { 145| 7.33M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.33M| } _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| 102M| { 1814| 102M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 102M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 707| 2.98M| { 708| 2.98M| } _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.26k| { 745| 7.26k| } _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.33M| { 145| 7.33M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.33M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 137| 7.33M| 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| 102M| { 1814| 102M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 102M| } _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| 2.98M| { 708| 2.98M| } _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| 16.9k| { 1763| 16.9k| auto child = node_->inner()[0]; 1764| 16.9k| auto child_size = relaxed_->d.sizes[0]; 1765| 16.9k| auto is_leaf = shift_ == BL; 1766| 16.9k| assert(child_size); ------------------ | Branch (1766:9): [True: 16.9k, False: 0] ------------------ 1767| 16.9k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 16.9k] ------------------ 1768| 16.9k| : visit_maybe_relaxed_sub( 1769| 16.9k| child, shift_ - B, child_size, v, args...); 1770| 16.9k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 76| 7.26k| 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.70M| 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| 16.9k|{ 1839| 16.9k| assert(node); ------------------ | Branch (1839:5): [True: 16.9k, False: 0] ------------------ 1840| 16.9k| auto relaxed = node->relaxed(); 1841| 16.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 16.6k, False: 281] ------------------ 1842| 16.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 16.6k, False: 0] ------------------ 1843| 16.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 16.6k| .visit(v, std::forward(args)...); 1845| 16.6k| } else { 1846| 281| return make_regular_sub_pos(node, shift, size) 1847| 281| .visit(v, std::forward(args)...); 1848| 281| } 1849| 16.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1813| 16.6k| { 1814| 16.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 16.6k| } _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| 281| { 1037| 281| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 281| } _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| 610| { 971| 610| auto is_leaf = shift_ == BL; 972| 610| auto child = node_->inner()[0]; 973| 610| auto is_full = size_ >= (size_t{1} << shift_); 974| 610| return is_full ------------------ | Branch (974:16): [True: 610, False: 0] ------------------ 975| 610| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 610] ------------------ 976| 610| ? make_full_leaf_pos(child).visit(v, args...) 977| 610| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 610| : (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| 610| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 201| 323k| 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| 931| { 1406| 931| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 931| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1361| 321| { 1362| 321| auto is_leaf = shift_ == BL; 1363| 321| auto child = node_->inner()[0]; 1364| 321| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 321] ------------------ 1365| 321| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 321| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 711| 59.4k| { 712| 59.4k| } _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| 23.0k| { 1305| 23.0k| each_i(v, 1, branches, args...); 1306| 23.0k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jjDpOT0_: 1263| 23.0k| { 1264| 23.0k| auto p = node_->inner() + i; 1265| 23.0k| auto e = node_->inner() + n; 1266| 23.0k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 13.4k, False: 9.58k] ------------------ 1267| 107k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 94.3k, False: 13.4k] ------------------ 1268| 94.3k| IMMER_PREFETCH(p + 1); 1269| 94.3k| make_full_leaf_pos(*p).visit(v, args...); 1270| 94.3k| } 1271| 13.4k| } else { 1272| 9.58k| auto ss = shift_ - B; 1273| 76.6k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 67.0k, False: 9.58k] ------------------ 1274| 67.0k| make_full_pos(*p, ss).visit(v, args...); 1275| 9.58k| } 1276| 23.0k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 207| 4.73M| { 208| 4.73M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 4.73M| } _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| 537k| { 1406| 537k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 537k| } _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| 59.4k| { 712| 59.4k| } _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| 23.0k| { 1305| 23.0k| each_i(v, 1, branches, args...); 1306| 23.0k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jjDpOT0_: 1263| 23.0k| { 1264| 23.0k| auto p = node_->inner() + i; 1265| 23.0k| auto e = node_->inner() + n; 1266| 23.0k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 13.4k, False: 9.58k] ------------------ 1267| 107k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 94.3k, False: 13.4k] ------------------ 1268| 94.3k| IMMER_PREFETCH(p + 1); 1269| 94.3k| make_full_leaf_pos(*p).visit(v, args...); 1270| 94.3k| } 1271| 13.4k| } else { 1272| 9.58k| auto ss = shift_ - B; 1273| 76.6k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 67.0k, False: 9.58k] ------------------ 1274| 67.0k| make_full_pos(*p, ss).visit(v, args...); 1275| 9.58k| } 1276| 23.0k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 207| 4.73M| { 208| 4.73M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 4.73M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 200| 4.73M| 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| 537k| { 1406| 537k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 537k| } _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| 610| { 754| 610| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 610| } _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| 610| { 145| 610| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 610| } _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| 610| { 1371| 610| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 610, False: 0] ------------------ 1372| 610| auto child = node_->inner()[0]; 1373| 610| return make_full_leaf_pos(child).visit(v, args...); 1374| 610| } _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.43k| { 208| 2.43k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.43k| } _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| 323k| { 907| 323k| if (count() > 1) ------------------ | Branch (907:13): [True: 313k, False: 9.42k] ------------------ 908| 313k| each_right_sub_(v, 1, args...); 909| 323k| } _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| 313k| { 880| 313k| auto last = count() - 1; 881| 313k| auto lsize = size_ - (last << shift_); 882| 313k| auto n = node()->inner() + i; 883| 313k| auto e = node()->inner() + last; 884| 313k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 300k, False: 13.4k] ------------------ 885| 2.09M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 1.79M, False: 300k] ------------------ 886| 1.79M| IMMER_PREFETCH(n + 1); 887| 1.79M| make_full_leaf_pos(*n).visit(v, args...); 888| 1.79M| } 889| 300k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 300k| } else { 891| 13.4k| auto ss = shift_ - B; 892| 58.5k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 45.0k, False: 13.4k] ------------------ 893| 45.0k| make_full_pos(*n, ss).visit(v, args...); 894| 13.4k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 13.4k| } 896| 313k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 1036| 3.55M| { 1037| 3.55M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.55M| } _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| 323k| { 907| 323k| if (count() > 1) ------------------ | Branch (907:13): [True: 313k, False: 9.42k] ------------------ 908| 313k| each_right_sub_(v, 1, args...); 909| 323k| } _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| 313k| { 880| 313k| auto last = count() - 1; 881| 313k| auto lsize = size_ - (last << shift_); 882| 313k| auto n = node()->inner() + i; 883| 313k| auto e = node()->inner() + last; 884| 313k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 300k, False: 13.4k] ------------------ 885| 2.09M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 1.79M, False: 300k] ------------------ 886| 1.79M| IMMER_PREFETCH(n + 1); 887| 1.79M| make_full_leaf_pos(*n).visit(v, args...); 888| 1.79M| } 889| 300k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 300k| } else { 891| 13.4k| auto ss = shift_ - B; 892| 58.5k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 45.0k, False: 13.4k] ------------------ 893| 45.0k| make_full_pos(*n, ss).visit(v, args...); 894| 13.4k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 13.4k| } 896| 313k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1036| 3.55M| { 1037| 3.55M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.55M| } _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.82k| { 754| 1.82k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 1.82k| } _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.82k| { 145| 1.82k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.82k| } _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.82k| { 987| 1.82k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 1.82k, False: 0] ------------------ 988| 1.82k| auto child = node_->inner()[0]; 989| 1.82k| auto is_full = size_ >= branches; 990| 1.82k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 1.82k, False: 0] ------------------ 991| 1.82k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 1.82k| } _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.83k| { 145| 4.83k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.83k| } _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| 8.88M| { 1648| 8.88M| each_right(v, 1, std::forward(args)...); 1649| 8.88M| } _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| 8.88M| { 1654| 8.88M| assert(start > 0); ------------------ | Branch (1654:9): [True: 8.88M, False: 0] ------------------ 1655| 8.88M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 8.88M, False: 0] ------------------ 1656| 8.88M| auto s = relaxed_->d.sizes[start - 1]; 1657| 8.88M| auto p = node_->inner(); 1658| 8.88M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 683k, False: 8.19M] ------------------ 1659| 3.32M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 2.63M, False: 683k] ------------------ 1660| 2.63M| IMMER_PREFETCH(p + i + 1); 1661| 2.63M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 2.63M| .visit(v, args...); 1663| 2.63M| s = relaxed_->d.sizes[i]; 1664| 2.63M| assert(s); ------------------ | Branch (1664:17): [True: 2.63M, False: 0] ------------------ 1665| 2.63M| } 1666| 8.19M| } else { 1667| 8.19M| auto ss = shift_ - B; 1668| 58.8M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 50.6M, False: 8.19M] ------------------ 1669| 50.6M| visit_maybe_relaxed_sub( 1670| 50.6M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 50.6M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 50.6M, False: 0] ------------------ 1673| 50.6M| } 1674| 8.19M| } 1675| 8.88M| } _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| 86.7M|{ 1839| 86.7M| assert(node); ------------------ | Branch (1839:5): [True: 86.7M, False: 0] ------------------ 1840| 86.7M| auto relaxed = node->relaxed(); 1841| 86.7M| if (relaxed) { ------------------ | Branch (1841:9): [True: 83.1M, False: 3.53M] ------------------ 1842| 83.1M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 83.1M, False: 0] ------------------ 1843| 83.1M| return make_relaxed_pos(node, shift, relaxed) 1844| 83.1M| .visit(v, std::forward(args)...); 1845| 83.1M| } else { 1846| 3.53M| return make_regular_sub_pos(node, shift, size) 1847| 3.53M| .visit(v, std::forward(args)...); 1848| 3.53M| } 1849| 86.7M|} _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| 8.88M| { 1648| 8.88M| each_right(v, 1, std::forward(args)...); 1649| 8.88M| } _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| 8.88M| { 1654| 8.88M| assert(start > 0); ------------------ | Branch (1654:9): [True: 8.88M, False: 0] ------------------ 1655| 8.88M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 8.88M, False: 0] ------------------ 1656| 8.88M| auto s = relaxed_->d.sizes[start - 1]; 1657| 8.88M| auto p = node_->inner(); 1658| 8.88M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 683k, False: 8.19M] ------------------ 1659| 3.32M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 2.63M, False: 683k] ------------------ 1660| 2.63M| IMMER_PREFETCH(p + i + 1); 1661| 2.63M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 2.63M| .visit(v, args...); 1663| 2.63M| s = relaxed_->d.sizes[i]; 1664| 2.63M| assert(s); ------------------ | Branch (1664:17): [True: 2.63M, False: 0] ------------------ 1665| 2.63M| } 1666| 8.19M| } else { 1667| 8.19M| auto ss = shift_ - B; 1668| 58.8M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 50.6M, False: 8.19M] ------------------ 1669| 50.6M| visit_maybe_relaxed_sub( 1670| 50.6M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 50.6M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 50.6M, False: 0] ------------------ 1673| 50.6M| } 1674| 8.19M| } 1675| 8.88M| } _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| 86.7M|{ 1839| 86.7M| assert(node); ------------------ | Branch (1839:5): [True: 86.7M, False: 0] ------------------ 1840| 86.7M| auto relaxed = node->relaxed(); 1841| 86.7M| if (relaxed) { ------------------ | Branch (1841:9): [True: 83.1M, False: 3.53M] ------------------ 1842| 83.1M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 83.1M, False: 0] ------------------ 1843| 83.1M| return make_relaxed_pos(node, shift, relaxed) 1844| 83.1M| .visit(v, std::forward(args)...); 1845| 83.1M| } else { 1846| 3.53M| return make_regular_sub_pos(node, shift, size) 1847| 3.53M| .visit(v, std::forward(args)...); 1848| 3.53M| } 1849| 86.7M|} _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.83k| { 754| 4.83k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 4.83k| } _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.83k| { 145| 4.83k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.83k| } _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.83k| { 1775| 4.83k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 4.83k, False: 0] ------------------ 1776| 4.83k| auto child = node_->inner()[0]; 1777| 4.83k| auto child_size = relaxed_->d.sizes[0]; 1778| 4.83k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 4.83k| } _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.15k| { 1037| 2.15k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.15k| } _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| 999k|{ 1839| 999k| assert(node); ------------------ | Branch (1839:5): [True: 999k, False: 0] ------------------ 1840| 999k| auto relaxed = node->relaxed(); 1841| 999k| if (relaxed) { ------------------ | Branch (1841:9): [True: 982k, False: 16.8k] ------------------ 1842| 982k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 982k, False: 0] ------------------ 1843| 982k| return make_relaxed_pos(node, shift, relaxed) 1844| 982k| .visit(v, std::forward(args)...); 1845| 982k| } else { 1846| 16.8k| return make_regular_sub_pos(node, shift, size) 1847| 16.8k| .visit(v, std::forward(args)...); 1848| 16.8k| } 1849| 999k|} _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| 982k| { 1814| 982k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 982k| } _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| 982k|{ 1839| 982k| assert(node); ------------------ | Branch (1839:5): [True: 982k, False: 0] ------------------ 1840| 982k| auto relaxed = node->relaxed(); 1841| 982k| if (relaxed) { ------------------ | Branch (1841:9): [True: 975k, False: 7.03k] ------------------ 1842| 975k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 975k, False: 0] ------------------ 1843| 975k| return make_relaxed_pos(node, shift, relaxed) 1844| 975k| .visit(v, std::forward(args)...); 1845| 975k| } else { 1846| 7.03k| return make_regular_sub_pos(node, shift, size) 1847| 7.03k| .visit(v, std::forward(args)...); 1848| 7.03k| } 1849| 982k|} _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| 975k| { 1814| 975k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 975k| } _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| 2.96M| { 1751| 2.96M| auto offset = relaxed_->d.count - 1; 1752| 2.96M| auto child = node_->inner()[offset]; 1753| 2.96M| auto child_size = size(offset); 1754| 2.96M| auto is_leaf = shift_ == BL; 1755| 2.96M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 2.96M] ------------------ 1756| 2.96M| : visit_maybe_relaxed_sub( 1757| 2.96M| child, shift_ - B, child_size, v, args...); 1758| 2.96M| } _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| 2.96M|{ 1839| 2.96M| assert(node); ------------------ | Branch (1839:5): [True: 2.96M, False: 0] ------------------ 1840| 2.96M| auto relaxed = node->relaxed(); 1841| 2.96M| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.96M, False: 1.97k] ------------------ 1842| 2.96M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.96M, False: 0] ------------------ 1843| 2.96M| return make_relaxed_pos(node, shift, relaxed) 1844| 2.96M| .visit(v, std::forward(args)...); 1845| 2.96M| } else { 1846| 1.97k| return make_regular_sub_pos(node, shift, size) 1847| 1.97k| .visit(v, std::forward(args)...); 1848| 1.97k| } 1849| 2.96M|} _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| 2.96M| { 1814| 2.96M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.96M| } _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.10k| { 1037| 4.10k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.10k| } _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.13k| { 959| 2.13k| auto offset = count() - 1; 960| 2.13k| auto child = node_->inner()[offset]; 961| 2.13k| auto is_leaf = shift_ == BL; 962| 2.13k| auto lsize = size_ - (size_t{offset} << shift_); 963| 2.13k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 2.13k] ------------------ 964| 2.13k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 2.13k| .visit(v, args...); 966| 2.13k| } _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.47M| { 914| 1.47M| each_left(v, count() - 1, args...); 915| 1.47M| } _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.47M| { 874| 1.47M| return each_left_regular(*this, v, last, args...); 875| 1.47M| } _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.47M|{ 576| 1.47M| constexpr auto B = bits; 577| 1.47M| constexpr auto BL = bits_leaf; 578| 1.47M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.47M, False: 0] ------------------ 579| 1.47M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 760k, False: 718k] ------------------ 580| 760k| auto n = p.node()->inner(); 581| 760k| auto e = n + last; 582| 3.61M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 2.85M, False: 760k] ------------------ 583| 2.85M| IMMER_PREFETCH(n + 1); 584| 2.85M| make_full_leaf_pos(*n).visit(v, args...); 585| 2.85M| } 586| 760k| } else { 587| 718k| auto n = p.node()->inner(); 588| 718k| auto e = n + last; 589| 718k| auto ss = p.shift() - B; 590| 1.14M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 425k, False: 718k] ------------------ 591| 425k| make_full_pos(*n, ss).visit(v, args...); 592| 718k| } 593| 1.47M|} _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.47M| { 914| 1.47M| each_left(v, count() - 1, args...); 915| 1.47M| } _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.47M| { 874| 1.47M| return each_left_regular(*this, v, last, args...); 875| 1.47M| } _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.47M|{ 576| 1.47M| constexpr auto B = bits; 577| 1.47M| constexpr auto BL = bits_leaf; 578| 1.47M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.47M, False: 0] ------------------ 579| 1.47M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 760k, False: 718k] ------------------ 580| 760k| auto n = p.node()->inner(); 581| 760k| auto e = n + last; 582| 3.61M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 2.85M, False: 760k] ------------------ 583| 2.85M| IMMER_PREFETCH(n + 1); 584| 2.85M| make_full_leaf_pos(*n).visit(v, args...); 585| 2.85M| } 586| 760k| } else { 587| 718k| auto n = p.node()->inner(); 588| 718k| auto e = n + last; 589| 718k| auto ss = p.shift() - B; 590| 1.14M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 425k, False: 718k] ------------------ 591| 425k| make_full_pos(*n, ss).visit(v, args...); 592| 718k| } 593| 1.47M|} _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.44M| { 1763| 1.44M| auto child = node_->inner()[0]; 1764| 1.44M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.44M| auto is_leaf = shift_ == BL; 1766| 1.44M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.44M, False: 0] ------------------ 1767| 1.44M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.44M] ------------------ 1768| 1.44M| : visit_maybe_relaxed_sub( 1769| 1.44M| child, shift_ - B, child_size, v, args...); 1770| 1.44M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 106| 999k| 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.44M|{ 1839| 1.44M| assert(node); ------------------ | Branch (1839:5): [True: 1.44M, False: 0] ------------------ 1840| 1.44M| auto relaxed = node->relaxed(); 1841| 1.44M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.14M, False: 302k] ------------------ 1842| 1.14M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.14M, False: 0] ------------------ 1843| 1.14M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.14M| .visit(v, std::forward(args)...); 1845| 1.14M| } else { 1846| 302k| return make_regular_sub_pos(node, shift, size) 1847| 302k| .visit(v, std::forward(args)...); 1848| 302k| } 1849| 1.44M|} _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.14M| { 1814| 1.14M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.14M| } _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| 302k| { 1037| 302k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 302k| } _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| 883| { 959| 883| auto offset = count() - 1; 960| 883| auto child = node_->inner()[offset]; 961| 883| auto is_leaf = shift_ == BL; 962| 883| auto lsize = size_ - (size_t{offset} << shift_); 963| 883| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 883] ------------------ 964| 883| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 883| .visit(v, args...); 966| 883| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1036| 1.28k| { 1037| 1.28k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.28k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 11.0k| { 971| 11.0k| auto is_leaf = shift_ == BL; 972| 11.0k| auto child = node_->inner()[0]; 973| 11.0k| auto is_full = size_ >= (size_t{1} << shift_); 974| 11.0k| return is_full ------------------ | Branch (974:16): [True: 11.0k, False: 0] ------------------ 975| 11.0k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 11.0k] ------------------ 976| 11.0k| ? make_full_leaf_pos(child).visit(v, args...) 977| 11.0k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 11.0k| : (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| 11.0k| } _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| 18.3k| { 1406| 18.3k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 18.3k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 7.33k| { 1362| 7.33k| auto is_leaf = shift_ == BL; 1363| 7.33k| auto child = node_->inner()[0]; 1364| 7.33k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 7.33k] ------------------ 1365| 7.33k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 7.33k| } _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| 18.1k| { 959| 18.1k| auto offset = count() - 1; 960| 18.1k| auto child = node_->inner()[offset]; 961| 18.1k| auto is_leaf = shift_ == BL; 962| 18.1k| auto lsize = size_ - (size_t{offset} << shift_); 963| 18.1k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 11.2k, False: 6.90k] ------------------ 964| 18.1k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 6.90k| .visit(v, args...); 966| 18.1k| } _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| 12.8k| { 145| 12.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 12.8k| } _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| 12.8k| { 1371| 12.8k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 12.8k, False: 0] ------------------ 1372| 12.8k| auto child = node_->inner()[0]; 1373| 12.8k| return make_full_leaf_pos(child).visit(v, args...); 1374| 12.8k| } _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| 320k| { 208| 320k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 320k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1036| 7.12k| { 1037| 7.12k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.12k| } _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| 312k| { 959| 312k| auto offset = count() - 1; 960| 312k| auto child = node_->inner()[offset]; 961| 312k| auto is_leaf = shift_ == BL; 962| 312k| auto lsize = size_ - (size_t{offset} << shift_); 963| 312k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 304k, False: 7.45k] ------------------ 964| 312k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 7.45k| .visit(v, args...); 966| 312k| } _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| 307k| { 145| 307k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 307k| } _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| 307k| { 987| 307k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 307k, False: 0] ------------------ 988| 307k| auto child = node_->inner()[0]; 989| 307k| auto is_full = size_ >= branches; 990| 307k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 307k, False: 0] ------------------ 991| 307k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 307k| } _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| 678k| { 145| 678k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 678k| } _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| 10.7k| { 1037| 10.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.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.14M| { 959| 1.14M| auto offset = count() - 1; 960| 1.14M| auto child = node_->inner()[offset]; 961| 1.14M| auto is_leaf = shift_ == BL; 962| 1.14M| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.14M| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 444k, False: 701k] ------------------ 964| 1.14M| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 701k| .visit(v, args...); 966| 1.14M| } _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| 678k| { 145| 678k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 678k| } _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| 678k| { 1775| 678k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 678k, False: 0] ------------------ 1776| 678k| auto child = node_->inner()[0]; 1777| 678k| auto child_size = relaxed_->d.sizes[0]; 1778| 678k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 678k| } _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.43M| { 1037| 1.43M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.43M| } _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| 10.6M| { 1618| 10.6M| each_left(v, relaxed_->d.count - 1, args...); 1619| 10.6M| } _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| 10.6M| { 1624| 10.6M| auto p = node_->inner(); 1625| 10.6M| auto s = size_t{}; 1626| 10.6M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 238k, False: 10.4M] ------------------ 1627| 1.62M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 1.38M, False: 238k] ------------------ 1628| 1.38M| IMMER_PREFETCH(p + i + 1); 1629| 1.38M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 1.38M| .visit(v, args...); 1631| 1.38M| s = relaxed_->d.sizes[i]; 1632| 1.38M| assert(s); ------------------ | Branch (1632:17): [True: 1.38M, False: 0] ------------------ 1633| 1.38M| } 1634| 10.4M| } else { 1635| 10.4M| auto ss = shift_ - B; 1636| 46.4M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 36.0M, False: 10.4M] ------------------ 1637| 36.0M| visit_maybe_relaxed_sub( 1638| 36.0M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 36.0M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 36.0M, False: 0] ------------------ 1641| 36.0M| } 1642| 10.4M| } 1643| 10.6M| } _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| 10.6M| { 1618| 10.6M| each_left(v, relaxed_->d.count - 1, args...); 1619| 10.6M| } _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| 10.6M| { 1624| 10.6M| auto p = node_->inner(); 1625| 10.6M| auto s = size_t{}; 1626| 10.6M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 238k, False: 10.4M] ------------------ 1627| 1.62M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 1.38M, False: 238k] ------------------ 1628| 1.38M| IMMER_PREFETCH(p + i + 1); 1629| 1.38M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 1.38M| .visit(v, args...); 1631| 1.38M| s = relaxed_->d.sizes[i]; 1632| 1.38M| assert(s); ------------------ | Branch (1632:17): [True: 1.38M, False: 0] ------------------ 1633| 1.38M| } 1634| 10.4M| } else { 1635| 10.4M| auto ss = shift_ - B; 1636| 46.4M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 36.0M, False: 10.4M] ------------------ 1637| 36.0M| visit_maybe_relaxed_sub( 1638| 36.0M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 36.0M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 36.0M, False: 0] ------------------ 1641| 36.0M| } 1642| 10.4M| } 1643| 10.6M| } _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| 6.73M| { 1763| 6.73M| auto child = node_->inner()[0]; 1764| 6.73M| auto child_size = relaxed_->d.sizes[0]; 1765| 6.73M| auto is_leaf = shift_ == BL; 1766| 6.73M| assert(child_size); ------------------ | Branch (1766:9): [True: 6.73M, False: 0] ------------------ 1767| 6.73M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 6.73M] ------------------ 1768| 6.73M| : visit_maybe_relaxed_sub( 1769| 6.73M| child, shift_ - B, child_size, v, args...); 1770| 6.73M| } _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| 6.73M|{ 1839| 6.73M| assert(node); ------------------ | Branch (1839:5): [True: 6.73M, False: 0] ------------------ 1840| 6.73M| auto relaxed = node->relaxed(); 1841| 6.73M| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.73M, False: 1.29k] ------------------ 1842| 6.73M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.73M, False: 0] ------------------ 1843| 6.73M| return make_relaxed_pos(node, shift, relaxed) 1844| 6.73M| .visit(v, std::forward(args)...); 1845| 6.73M| } else { 1846| 1.29k| return make_regular_sub_pos(node, shift, size) 1847| 1.29k| .visit(v, std::forward(args)...); 1848| 1.29k| } 1849| 6.73M|} _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| 6.73M| { 1814| 6.73M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.73M| } _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| 1.29k| { 1037| 1.29k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.29k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1750| 11.8k| { 1751| 11.8k| auto offset = relaxed_->d.count - 1; 1752| 11.8k| auto child = node_->inner()[offset]; 1753| 11.8k| auto child_size = size(offset); 1754| 11.8k| auto is_leaf = shift_ == BL; 1755| 11.8k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 11.8k] ------------------ 1756| 11.8k| : visit_maybe_relaxed_sub( 1757| 11.8k| child, shift_ - B, child_size, v, args...); 1758| 11.8k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 11.8k|{ 1839| 11.8k| assert(node); ------------------ | Branch (1839:5): [True: 11.8k, False: 0] ------------------ 1840| 11.8k| auto relaxed = node->relaxed(); 1841| 11.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.4k, False: 405] ------------------ 1842| 11.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.4k, False: 0] ------------------ 1843| 11.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.4k| .visit(v, std::forward(args)...); 1845| 11.4k| } else { 1846| 405| return make_regular_sub_pos(node, shift, size) 1847| 405| .visit(v, std::forward(args)...); 1848| 405| } 1849| 11.8k|} _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| 11.4k| { 1814| 11.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.4k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 1.82k| { 971| 1.82k| auto is_leaf = shift_ == BL; 972| 1.82k| auto child = node_->inner()[0]; 973| 1.82k| auto is_full = size_ >= (size_t{1} << shift_); 974| 1.82k| return is_full ------------------ | Branch (974:16): [True: 1.82k, False: 0] ------------------ 975| 1.82k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 1.82k] ------------------ 976| 1.82k| ? make_full_leaf_pos(child).visit(v, args...) 977| 1.82k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 1.82k| : (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.82k| } _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| 3.75k| { 1406| 3.75k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.75k| } _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| 1.93k| { 1362| 1.93k| auto is_leaf = shift_ == BL; 1363| 1.93k| auto child = node_->inner()[0]; 1364| 1.93k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 1.93k] ------------------ 1365| 1.93k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 1.93k| } _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| 3.55k| { 1751| 3.55k| auto offset = relaxed_->d.count - 1; 1752| 3.55k| auto child = node_->inner()[offset]; 1753| 3.55k| auto child_size = size(offset); 1754| 3.55k| auto is_leaf = shift_ == BL; 1755| 3.55k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 1.60k, False: 1.95k] ------------------ 1756| 3.55k| : visit_maybe_relaxed_sub( 1757| 1.95k| child, shift_ - B, child_size, v, args...); 1758| 3.55k| } _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| 1.95k|{ 1839| 1.95k| assert(node); ------------------ | Branch (1839:5): [True: 1.95k, False: 0] ------------------ 1840| 1.95k| auto relaxed = node->relaxed(); 1841| 1.95k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.73k, False: 222] ------------------ 1842| 1.73k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.73k, False: 0] ------------------ 1843| 1.73k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.73k| .visit(v, std::forward(args)...); 1845| 1.73k| } else { 1846| 222| return make_regular_sub_pos(node, shift, size) 1847| 222| .visit(v, std::forward(args)...); 1848| 222| } 1849| 1.95k|} _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| 1.73k| { 1814| 1.73k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.73k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1750| 7.28k| { 1751| 7.28k| auto offset = relaxed_->d.count - 1; 1752| 7.28k| auto child = node_->inner()[offset]; 1753| 7.28k| auto child_size = size(offset); 1754| 7.28k| auto is_leaf = shift_ == BL; 1755| 7.28k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 2.84k, False: 4.43k] ------------------ 1756| 7.28k| : visit_maybe_relaxed_sub( 1757| 4.43k| child, shift_ - B, child_size, v, args...); 1758| 7.28k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 4.43k|{ 1839| 4.43k| assert(node); ------------------ | Branch (1839:5): [True: 4.43k, False: 0] ------------------ 1840| 4.43k| auto relaxed = node->relaxed(); 1841| 4.43k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.18k, False: 3.25k] ------------------ 1842| 1.18k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.18k, False: 0] ------------------ 1843| 1.18k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.18k| .visit(v, std::forward(args)...); 1845| 3.25k| } else { 1846| 3.25k| return make_regular_sub_pos(node, shift, size) 1847| 3.25k| .visit(v, std::forward(args)...); 1848| 3.25k| } 1849| 4.43k|} _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| 1.18k| { 1814| 1.18k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.18k| } _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| 7.67M| { 1751| 7.67M| auto offset = relaxed_->d.count - 1; 1752| 7.67M| auto child = node_->inner()[offset]; 1753| 7.67M| auto child_size = size(offset); 1754| 7.67M| auto is_leaf = shift_ == BL; 1755| 7.67M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 234k, False: 7.44M] ------------------ 1756| 7.67M| : visit_maybe_relaxed_sub( 1757| 7.44M| child, shift_ - B, child_size, v, args...); 1758| 7.67M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 7.44M|{ 1839| 7.44M| assert(node); ------------------ | Branch (1839:5): [True: 7.44M, False: 0] ------------------ 1840| 7.44M| auto relaxed = node->relaxed(); 1841| 7.44M| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.70M, False: 737k] ------------------ 1842| 6.70M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.70M, False: 0] ------------------ 1843| 6.70M| return make_relaxed_pos(node, shift, relaxed) 1844| 6.70M| .visit(v, std::forward(args)...); 1845| 6.70M| } else { 1846| 737k| return make_regular_sub_pos(node, shift, size) 1847| 737k| .visit(v, std::forward(args)...); 1848| 737k| } 1849| 7.44M|} _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| 6.70M| { 1814| 6.70M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.70M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 7.03k| { 1037| 7.03k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.03k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 1036| 16.8k| { 1037| 16.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 16.8k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 16.8k|{ 1839| 16.8k| assert(node); ------------------ | Branch (1839:5): [True: 16.8k, False: 0] ------------------ 1840| 16.8k| auto relaxed = node->relaxed(); 1841| 16.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.59k, False: 10.2k] ------------------ 1842| 6.59k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.59k, False: 0] ------------------ 1843| 6.59k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.59k| .visit(v, std::forward(args)...); 1845| 10.2k| } else { 1846| 10.2k| return make_regular_sub_pos(node, shift, size) 1847| 10.2k| .visit(v, std::forward(args)...); 1848| 10.2k| } 1849| 16.8k|} _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.59k| { 1814| 6.59k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.59k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 10.2k| { 1037| 10.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.2k| } _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| 172k| { 1814| 172k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 172k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11last_oh_cshINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_jmDpOT0_: 1737| 166k| { 1738| 166k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 166k, False: 0] ------------------ 1739| 166k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 166k, False: 0] ------------------ 1740| 166k| auto child = node_->inner()[offset_hint]; 1741| 166k| auto is_leaf = shift_ == BL; 1742| 166k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 166k] ------------------ 1743| 166k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 166k| : visit_maybe_relaxed_sub( 1745| 166k| child, shift_ - B, child_size_hint, v, args...); 1746| 166k| } _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| 166k|{ 1839| 166k| assert(node); ------------------ | Branch (1839:5): [True: 166k, False: 0] ------------------ 1840| 166k| auto relaxed = node->relaxed(); 1841| 166k| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.4k, False: 154k] ------------------ 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| 154k| } else { 1846| 154k| return make_regular_sub_pos(node, shift, size) 1847| 154k| .visit(v, std::forward(args)...); 1848| 154k| } 1849| 166k|} _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| 154k| { 1037| 154k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 154k| } _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| 323k| { 953| 323k| return last_oh_regular(*this, v, offset_hint, args...); 954| 323k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21push_tail_mut_visitorISD_Lb1EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 323k|{ 678| 323k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 323k, False: 0] ------------------ 679| 323k| constexpr auto B = bits; 680| 323k| constexpr auto BL = bits_leaf; 681| 323k| auto child = p.node()->inner()[offset_hint]; 682| 323k| auto is_leaf = p.shift() == BL; 683| 323k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 323k] ------------------ 684| 323k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 323k| .visit(v, args...); 686| 323k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 336| 1.05M| { 337| 1.05M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.05M| } _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| 727k| { 331| 727k| return last_oh_regular(*this, v, offset_hint, args...); 332| 727k| } _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| 727k|{ 678| 727k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 727k, False: 0] ------------------ 679| 727k| constexpr auto B = bits; 680| 727k| constexpr auto BL = bits_leaf; 681| 727k| auto child = p.node()->inner()[offset_hint]; 682| 727k| auto is_leaf = p.shift() == BL; 683| 727k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 727k] ------------------ 684| 727k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 727k| .visit(v, args...); 686| 727k|} _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| 3.02k| { 331| 3.02k| return last_oh_regular(*this, v, offset_hint, args...); 332| 3.02k| } _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| 3.02k|{ 678| 3.02k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 3.02k, False: 0] ------------------ 679| 3.02k| constexpr auto B = bits; 680| 3.02k| constexpr auto BL = bits_leaf; 681| 3.02k| auto child = p.node()->inner()[offset_hint]; 682| 3.02k| auto is_leaf = p.shift() == BL; 683| 3.02k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 3.02k] ------------------ 684| 3.02k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 3.02k| .visit(v, args...); 686| 3.02k|} _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.70k| { 337| 4.70k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.70k| } _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.67k| { 953| 1.67k| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.67k| } _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.67k|{ 678| 1.67k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.67k, False: 0] ------------------ 679| 1.67k| constexpr auto B = bits; 680| 1.67k| constexpr auto BL = bits_leaf; 681| 1.67k| auto child = p.node()->inner()[offset_hint]; 682| 1.67k| auto is_leaf = p.shift() == BL; 683| 1.67k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.67k] ------------------ 684| 1.67k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.67k| .visit(v, args...); 686| 1.67k|} _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.54k| { 1738| 8.54k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 8.54k, False: 0] ------------------ 1739| 8.54k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 8.54k, False: 0] ------------------ 1740| 8.54k| auto child = node_->inner()[offset_hint]; 1741| 8.54k| auto is_leaf = shift_ == BL; 1742| 8.54k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 8.54k] ------------------ 1743| 8.54k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 8.54k| : visit_maybe_relaxed_sub( 1745| 8.54k| child, shift_ - B, child_size_hint, v, args...); 1746| 8.54k| } _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.54k|{ 1839| 8.54k| assert(node); ------------------ | Branch (1839:5): [True: 8.54k, False: 0] ------------------ 1840| 8.54k| auto relaxed = node->relaxed(); 1841| 8.54k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.41k, False: 1.12k] ------------------ 1842| 7.41k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.41k, False: 0] ------------------ 1843| 7.41k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.41k| .visit(v, std::forward(args)...); 1845| 7.41k| } else { 1846| 1.12k| return make_regular_sub_pos(node, shift, size) 1847| 1.12k| .visit(v, std::forward(args)...); 1848| 1.12k| } 1849| 8.54k|} _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.41k| { 1814| 7.41k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.41k| } _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.12k| { 1037| 1.12k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.12k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 1036| 181k| { 1037| 181k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 181k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcPT_jmT0_DpOT1_: 1838| 24.3k|{ 1839| 24.3k| assert(node); ------------------ | Branch (1839:5): [True: 24.3k, False: 0] ------------------ 1840| 24.3k| auto relaxed = node->relaxed(); 1841| 24.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 21.1k, False: 3.19k] ------------------ 1842| 21.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 21.1k, False: 0] ------------------ 1843| 21.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 21.1k| .visit(v, std::forward(args)...); 1845| 21.1k| } else { 1846| 3.19k| return make_regular_sub_pos(node, shift, size) 1847| 3.19k| .visit(v, std::forward(args)...); 1848| 3.19k| } 1849| 24.3k|} _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| 21.1k| { 1814| 21.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.1k| } _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| 125k| { 1687| 125k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 125k, False: 0] ------------------ 1688| 125k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 27.8k, False: 97.3k] ------------------ 1689| 125k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 125k| } _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| 125k| { 1699| 125k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 125k| } _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| 125k| { 1718| 125k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 125k, False: 0] ------------------ 1719| 125k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 27.8k, False: 97.3k] | Branch (1719:9): [True: 125k, False: 0] ------------------ 1720| 125k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 125k| auto child = node_->inner()[offset_hint]; 1722| 125k| auto is_leaf = shift_ == BL; 1723| 125k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 125k| auto next_idx = idx - left_size_hint; 1725| 125k| return is_leaf ------------------ | Branch (1725:16): [True: 18.9k, False: 106k] ------------------ 1726| 125k| ? make_leaf_sub_pos(child, next_size) 1727| 18.9k| .visit(v, next_idx, args...) 1728| 125k| : visit_maybe_relaxed_sub( 1729| 106k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 125k| } _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| 18.9k| { 145| 18.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 18.9k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcPT_jmT0_DpOT1_: 1838| 106k|{ 1839| 106k| assert(node); ------------------ | Branch (1839:5): [True: 106k, False: 0] ------------------ 1840| 106k| auto relaxed = node->relaxed(); 1841| 106k| if (relaxed) { ------------------ | Branch (1841:9): [True: 104k, False: 2.22k] ------------------ 1842| 104k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 104k, False: 0] ------------------ 1843| 104k| return make_relaxed_pos(node, shift, relaxed) 1844| 104k| .visit(v, std::forward(args)...); 1845| 104k| } else { 1846| 2.22k| return make_regular_sub_pos(node, shift, size) 1847| 2.22k| .visit(v, std::forward(args)...); 1848| 2.22k| } 1849| 106k|} _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| 104k| { 1814| 104k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 104k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1036| 2.22k| { 1037| 2.22k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.22k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 938| 5.42k| { 939| 5.42k| return towards_oh_ch_regular( 940| 5.42k| *this, v, idx, offset_hint, count(), args...); 941| 5.42k| } _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.42k|{ 633| 5.42k| constexpr auto B = bits; 634| 5.42k| constexpr auto BL = bits_leaf; 635| 5.42k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.42k, False: 0] ------------------ 636| 5.42k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.42k, False: 0] ------------------ 637| 5.42k| auto is_leaf = p.shift() == BL; 638| 5.42k| auto child = p.node()->inner()[offset_hint]; 639| 5.42k| auto is_full = offset_hint + 1 != count_hint; 640| 5.42k| return is_full ------------------ | Branch (640:12): [True: 2.54k, False: 2.88k] ------------------ 641| 5.42k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.30k, False: 1.23k] ------------------ 642| 2.54k| : make_full_pos(child, p.shift() - B) 643| 1.23k| .visit(v, idx, args...)) 644| 5.42k| : (is_leaf ------------------ | Branch (644:19): [True: 1.61k, False: 1.26k] ------------------ 645| 2.88k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.88k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.26k| .visit(v, idx, args...)); 648| 5.42k|} _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| 3.21k| { 208| 3.21k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.21k| } _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.21k| { 1406| 2.21k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.21k| } _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.21k| { 1330| 2.21k| return towards_oh(v, idx, offset_hint, args...); 1331| 2.21k| } _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.21k| { 1337| 2.21k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.21k, False: 0] ------------------ 1338| 2.21k| auto is_leaf = shift_ == BL; 1339| 2.21k| auto child = node_->inner()[offset_hint]; 1340| 2.21k| return is_leaf ------------------ | Branch (1340:16): [True: 1.52k, False: 689] ------------------ 1341| 2.21k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.21k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.21k| } _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.21k| { 113| 2.21k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.21k| } _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.76k| { 337| 1.76k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.76k| } _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.76k| { 317| 1.76k| return towards_oh_ch_regular( 318| 1.76k| *this, v, idx, offset_hint, count(), args...); 319| 1.76k| } _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.76k|{ 633| 1.76k| constexpr auto B = bits; 634| 1.76k| constexpr auto BL = bits_leaf; 635| 1.76k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 1.76k, False: 0] ------------------ 636| 1.76k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 1.76k, False: 0] ------------------ 637| 1.76k| auto is_leaf = p.shift() == BL; 638| 1.76k| auto child = p.node()->inner()[offset_hint]; 639| 1.76k| auto is_full = offset_hint + 1 != count_hint; 640| 1.76k| return is_full ------------------ | Branch (640:12): [True: 668, False: 1.10k] ------------------ 641| 1.76k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 386, False: 282] ------------------ 642| 668| : make_full_pos(child, p.shift() - B) 643| 282| .visit(v, idx, args...)) 644| 1.76k| : (is_leaf ------------------ | Branch (644:19): [True: 599, False: 501] ------------------ 645| 1.10k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.10k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 501| .visit(v, idx, args...)); 648| 1.76k|} _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.19k| { 1037| 3.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.19k| } _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| 42.9k|{ 1839| 42.9k| assert(node); ------------------ | Branch (1839:5): [True: 42.9k, False: 0] ------------------ 1840| 42.9k| auto relaxed = node->relaxed(); 1841| 42.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 30.1k, False: 12.7k] ------------------ 1842| 30.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 30.1k, False: 0] ------------------ 1843| 30.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 30.1k| .visit(v, std::forward(args)...); 1845| 30.1k| } else { 1846| 12.7k| return make_regular_sub_pos(node, shift, size) 1847| 12.7k| .visit(v, std::forward(args)...); 1848| 12.7k| } 1849| 42.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 30.1k| { 1814| 30.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 30.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 14.1k| { 1687| 14.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 14.1k, False: 0] ------------------ 1688| 14.1k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 14.1k] ------------------ 1689| 14.1k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 14.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 14.1k| { 1699| 14.1k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 14.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 14.1k| { 1718| 14.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 14.1k, False: 0] ------------------ 1719| 14.1k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 14.1k] | Branch (1719:9): [True: 14.1k, False: 0] ------------------ 1720| 14.1k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 14.1k| auto child = node_->inner()[offset_hint]; 1722| 14.1k| auto is_leaf = shift_ == BL; 1723| 14.1k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 14.1k| auto next_idx = idx - left_size_hint; 1725| 14.1k| return is_leaf ------------------ | Branch (1725:16): [True: 876, False: 13.2k] ------------------ 1726| 14.1k| ? make_leaf_sub_pos(child, next_size) 1727| 876| .visit(v, next_idx, args...) 1728| 14.1k| : visit_maybe_relaxed_sub( 1729| 13.2k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 14.1k| } _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| 876| { 145| 876| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 876| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 13.0k| { 1687| 13.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 13.0k, False: 0] ------------------ 1688| 13.0k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 13.0k] ------------------ 1689| 13.0k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 13.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 13.0k| { 1699| 13.0k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 13.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 13.0k| { 1718| 13.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 13.0k, False: 0] ------------------ 1719| 13.0k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 13.0k] | Branch (1719:9): [True: 13.0k, False: 0] ------------------ 1720| 13.0k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 13.0k| auto child = node_->inner()[offset_hint]; 1722| 13.0k| auto is_leaf = shift_ == BL; 1723| 13.0k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 13.0k| auto next_idx = idx - left_size_hint; 1725| 13.0k| return is_leaf ------------------ | Branch (1725:16): [True: 729, False: 12.3k] ------------------ 1726| 13.0k| ? make_leaf_sub_pos(child, next_size) 1727| 729| .visit(v, next_idx, args...) 1728| 13.0k| : visit_maybe_relaxed_sub( 1729| 12.3k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 13.0k| } _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| 729| { 145| 729| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 729| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 12.3k|{ 1839| 12.3k| assert(node); ------------------ | Branch (1839:5): [True: 12.3k, False: 0] ------------------ 1840| 12.3k| auto relaxed = node->relaxed(); 1841| 12.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.1k, False: 1.19k] ------------------ 1842| 11.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.1k, False: 0] ------------------ 1843| 11.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.1k| .visit(v, std::forward(args)...); 1845| 11.1k| } else { 1846| 1.19k| return make_regular_sub_pos(node, shift, size) 1847| 1.19k| .visit(v, std::forward(args)...); 1848| 1.19k| } 1849| 12.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 11.1k| { 1814| 11.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.19k| { 1037| 1.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.19k| } _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.46k| { 928| 2.46k| return towards_oh_ch_regular( 929| 2.46k| *this, v, idx, offset_hint, count(), args...); 930| 2.46k| } _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.46k|{ 633| 2.46k| constexpr auto B = bits; 634| 2.46k| constexpr auto BL = bits_leaf; 635| 2.46k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.46k, False: 0] ------------------ 636| 2.46k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.46k, False: 0] ------------------ 637| 2.46k| auto is_leaf = p.shift() == BL; 638| 2.46k| auto child = p.node()->inner()[offset_hint]; 639| 2.46k| auto is_full = offset_hint + 1 != count_hint; 640| 2.46k| return is_full ------------------ | Branch (640:12): [True: 2.04k, False: 418] ------------------ 641| 2.46k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 687, False: 1.35k] ------------------ 642| 2.04k| : make_full_pos(child, p.shift() - B) 643| 1.35k| .visit(v, idx, args...)) 644| 2.46k| : (is_leaf ------------------ | Branch (644:19): [True: 418, False: 0] ------------------ 645| 418| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 418| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.46k|} _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.84k| { 208| 1.84k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.84k| } _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.66k| { 1406| 1.66k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.66k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 1.45k| { 1337| 1.45k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.45k, False: 0] ------------------ 1338| 1.45k| auto is_leaf = shift_ == BL; 1339| 1.45k| auto child = node_->inner()[offset_hint]; 1340| 1.45k| return is_leaf ------------------ | Branch (1340:16): [True: 1.15k, False: 302] ------------------ 1341| 1.45k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.45k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.45k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 2.46k| { 1337| 2.46k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.46k, False: 0] ------------------ 1338| 2.46k| auto is_leaf = shift_ == BL; 1339| 2.46k| auto child = node_->inner()[offset_hint]; 1340| 2.46k| return is_leaf ------------------ | Branch (1340:16): [True: 1.54k, False: 920] ------------------ 1341| 2.46k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.46k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.46k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 3.26k| { 208| 3.26k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.26k| } _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.77k| { 1406| 3.77k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.77k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 3.78k| { 1406| 3.78k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.78k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 9.55k| { 1337| 9.55k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 9.55k, False: 0] ------------------ 1338| 9.55k| auto is_leaf = shift_ == BL; 1339| 9.55k| auto child = node_->inner()[offset_hint]; 1340| 9.55k| return is_leaf ------------------ | Branch (1340:16): [True: 7.23k, False: 2.32k] ------------------ 1341| 9.55k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 9.55k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 9.55k| } _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.84k| { 208| 9.84k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.84k| } _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.31k| { 1406| 5.31k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.31k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 3.63k| { 1311| 3.63k| each_i(v, start, branches, args...); 1312| 3.63k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 3.63k| { 1264| 3.63k| auto p = node_->inner() + i; 1265| 3.63k| auto e = node_->inner() + n; 1266| 3.63k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 2.22k, False: 1.40k] ------------------ 1267| 14.3k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 12.1k, False: 2.22k] ------------------ 1268| 12.1k| IMMER_PREFETCH(p + 1); 1269| 12.1k| make_full_leaf_pos(*p).visit(v, args...); 1270| 12.1k| } 1271| 2.22k| } else { 1272| 1.40k| auto ss = shift_ - B; 1273| 10.7k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 9.36k, False: 1.40k] ------------------ 1274| 9.36k| make_full_pos(*p, ss).visit(v, args...); 1275| 1.40k| } 1276| 3.63k| } _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| 418| { 113| 418| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 418| } _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.50k| { 306| 2.50k| return towards_oh_ch_regular( 307| 2.50k| *this, v, idx, offset_hint, count(), args...); 308| 2.50k| } _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.50k|{ 633| 2.50k| constexpr auto B = bits; 634| 2.50k| constexpr auto BL = bits_leaf; 635| 2.50k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.50k, False: 0] ------------------ 636| 2.50k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.50k, False: 0] ------------------ 637| 2.50k| auto is_leaf = p.shift() == BL; 638| 2.50k| auto child = p.node()->inner()[offset_hint]; 639| 2.50k| auto is_full = offset_hint + 1 != count_hint; 640| 2.50k| return is_full ------------------ | Branch (640:12): [True: 1.63k, False: 869] ------------------ 641| 2.50k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 831, False: 807] ------------------ 642| 1.63k| : make_full_pos(child, p.shift() - B) 643| 807| .visit(v, idx, args...)) 644| 2.50k| : (is_leaf ------------------ | Branch (644:19): [True: 531, False: 338] ------------------ 645| 869| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 869| : make_regular_pos(child, p.shift() - B, p.size()) 647| 338| .visit(v, idx, args...)); 648| 2.50k|} _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.45k| { 113| 1.45k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.45k| } _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.42k| { 337| 3.42k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.42k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 1.14k| { 337| 1.14k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.14k| } _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.29k| { 306| 4.29k| return towards_oh_ch_regular( 307| 4.29k| *this, v, idx, offset_hint, count(), args...); 308| 4.29k| } _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.29k|{ 633| 4.29k| constexpr auto B = bits; 634| 4.29k| constexpr auto BL = bits_leaf; 635| 4.29k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.29k, False: 0] ------------------ 636| 4.29k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.29k, False: 0] ------------------ 637| 4.29k| auto is_leaf = p.shift() == BL; 638| 4.29k| auto child = p.node()->inner()[offset_hint]; 639| 4.29k| auto is_full = offset_hint + 1 != count_hint; 640| 4.29k| return is_full ------------------ | Branch (640:12): [True: 1.89k, False: 2.40k] ------------------ 641| 4.29k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 999, False: 892] ------------------ 642| 1.89k| : make_full_pos(child, p.shift() - B) 643| 892| .visit(v, idx, args...)) 644| 4.29k| : (is_leaf ------------------ | Branch (644:19): [True: 1.66k, False: 739] ------------------ 645| 2.40k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.40k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 739| .visit(v, idx, args...)); 648| 4.29k|} _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.44k| { 113| 2.44k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.44k| } _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.38k| { 337| 3.38k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.38k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 2.50k| { 286| 2.50k| return each_right_regular(*this, v, start, args...); 287| 2.50k| } _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.50k|{ 598| 2.50k| constexpr auto B = bits; 599| 2.50k| constexpr auto BL = bits_leaf; 600| | 601| 2.50k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 1.36k, False: 1.14k] ------------------ 602| 1.36k| auto n = p.node()->inner() + start; 603| 1.36k| auto last = p.count() - 1; 604| 1.36k| auto e = p.node()->inner() + last; 605| 1.36k| if (n <= e) { ------------------ | Branch (605:13): [True: 831, False: 531] ------------------ 606| 3.21k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 2.38k, False: 831] ------------------ 607| 2.38k| IMMER_PREFETCH(n + 1); 608| 2.38k| make_full_leaf_pos(*n).visit(v, args...); 609| 2.38k| } 610| 831| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 831| } 612| 1.36k| } else { 613| 1.14k| auto n = p.node()->inner() + start; 614| 1.14k| auto last = p.count() - 1; 615| 1.14k| auto e = p.node()->inner() + last; 616| 1.14k| auto ss = p.shift() - B; 617| 1.14k| if (n <= e) { ------------------ | Branch (617:13): [True: 807, False: 338] ------------------ 618| 1.84k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.03k, False: 807] ------------------ 619| 1.03k| make_full_pos(*n, ss).visit(v, args...); 620| 807| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 807| } 622| 1.14k| } 623| 2.50k|} _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.94k| { 928| 6.94k| return towards_oh_ch_regular( 929| 6.94k| *this, v, idx, offset_hint, count(), args...); 930| 6.94k| } _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.94k|{ 633| 6.94k| constexpr auto B = bits; 634| 6.94k| constexpr auto BL = bits_leaf; 635| 6.94k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.94k, False: 0] ------------------ 636| 6.94k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.94k, False: 0] ------------------ 637| 6.94k| auto is_leaf = p.shift() == BL; 638| 6.94k| auto child = p.node()->inner()[offset_hint]; 639| 6.94k| auto is_full = offset_hint + 1 != count_hint; 640| 6.94k| return is_full ------------------ | Branch (640:12): [True: 2.94k, False: 4.00k] ------------------ 641| 6.94k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 895, False: 2.04k] ------------------ 642| 2.94k| : make_full_pos(child, p.shift() - B) 643| 2.04k| .visit(v, idx, args...)) 644| 6.94k| : (is_leaf ------------------ | Branch (644:19): [True: 919, False: 3.08k] ------------------ 645| 4.00k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.00k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.08k| .visit(v, idx, args...)); 648| 6.94k|} _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.12k| { 928| 7.12k| return towards_oh_ch_regular( 929| 7.12k| *this, v, idx, offset_hint, count(), args...); 930| 7.12k| } _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.12k|{ 633| 7.12k| constexpr auto B = bits; 634| 7.12k| constexpr auto BL = bits_leaf; 635| 7.12k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.12k, False: 0] ------------------ 636| 7.12k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.12k, False: 0] ------------------ 637| 7.12k| auto is_leaf = p.shift() == BL; 638| 7.12k| auto child = p.node()->inner()[offset_hint]; 639| 7.12k| auto is_full = offset_hint + 1 != count_hint; 640| 7.12k| return is_full ------------------ | Branch (640:12): [True: 3.70k, False: 3.41k] ------------------ 641| 7.12k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.61k, False: 2.09k] ------------------ 642| 3.70k| : make_full_pos(child, p.shift() - B) 643| 2.09k| .visit(v, idx, args...)) 644| 7.12k| : (is_leaf ------------------ | Branch (644:19): [True: 775, False: 2.64k] ------------------ 645| 3.41k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.41k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.64k| .visit(v, idx, args...)); 648| 7.12k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 867| 12.1k| { 868| 12.1k| return each_right_regular(*this, v, start, args...); 869| 12.1k| } _ZN5immer6detail4rbts18each_right_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 597| 12.1k|{ 598| 12.1k| constexpr auto B = bits; 599| 12.1k| constexpr auto BL = bits_leaf; 600| | 601| 12.1k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 3.57k, False: 8.54k] ------------------ 602| 3.57k| auto n = p.node()->inner() + start; 603| 3.57k| auto last = p.count() - 1; 604| 3.57k| auto e = p.node()->inner() + last; 605| 3.57k| if (n <= e) { ------------------ | Branch (605:13): [True: 1.88k, False: 1.69k] ------------------ 606| 3.89k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 2.00k, False: 1.88k] ------------------ 607| 2.00k| IMMER_PREFETCH(n + 1); 608| 2.00k| make_full_leaf_pos(*n).visit(v, args...); 609| 2.00k| } 610| 1.88k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 1.88k| } 612| 8.54k| } else { 613| 8.54k| auto n = p.node()->inner() + start; 614| 8.54k| auto last = p.count() - 1; 615| 8.54k| auto e = p.node()->inner() + last; 616| 8.54k| auto ss = p.shift() - B; 617| 8.54k| if (n <= e) { ------------------ | Branch (617:13): [True: 5.46k, False: 3.08k] ------------------ 618| 6.46k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.00k, False: 5.46k] ------------------ 619| 1.00k| make_full_pos(*n, ss).visit(v, args...); 620| 5.46k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 5.46k| } 622| 8.54k| } 623| 12.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 20.2k| { 1814| 20.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 20.2k| } _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.19k| { 1687| 9.19k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 9.19k, False: 0] ------------------ 1688| 9.19k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 8.71k, False: 479] ------------------ 1689| 9.19k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 9.19k| } _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.19k| { 1699| 9.19k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 9.19k| } _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.19k| { 1718| 9.19k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 9.19k, False: 0] ------------------ 1719| 9.19k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 8.71k, False: 479] | Branch (1719:9): [True: 9.19k, False: 0] ------------------ 1720| 9.19k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 9.19k| auto child = node_->inner()[offset_hint]; 1722| 9.19k| auto is_leaf = shift_ == BL; 1723| 9.19k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 9.19k| auto next_idx = idx - left_size_hint; 1725| 9.19k| return is_leaf ------------------ | Branch (1725:16): [True: 1.80k, False: 7.38k] ------------------ 1726| 9.19k| ? make_leaf_sub_pos(child, next_size) 1727| 1.80k| .visit(v, next_idx, args...) 1728| 9.19k| : visit_maybe_relaxed_sub( 1729| 7.38k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 9.19k| } _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.80k| { 145| 1.80k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.80k| } _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.38k|{ 1839| 7.38k| assert(node); ------------------ | Branch (1839:5): [True: 7.38k, False: 0] ------------------ 1840| 7.38k| auto relaxed = node->relaxed(); 1841| 7.38k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.76k, False: 4.62k] ------------------ 1842| 2.76k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.76k, False: 0] ------------------ 1843| 2.76k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.76k| .visit(v, std::forward(args)...); 1845| 4.62k| } else { 1846| 4.62k| return make_regular_sub_pos(node, shift, size) 1847| 4.62k| .visit(v, std::forward(args)...); 1848| 4.62k| } 1849| 7.38k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 2.76k| { 1814| 2.76k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.76k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 4.62k| { 1037| 4.62k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.62k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1036| 10.4k| { 1037| 10.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 11.6k| { 1687| 11.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 11.6k, False: 0] ------------------ 1688| 11.6k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.79k, False: 1.88k] ------------------ 1689| 11.6k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 11.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 11.6k| { 1699| 11.6k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 11.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 11.6k| { 1718| 11.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 11.6k, False: 0] ------------------ 1719| 11.6k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.79k, False: 1.88k] | Branch (1719:9): [True: 11.6k, False: 0] ------------------ 1720| 11.6k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 11.6k| auto child = node_->inner()[offset_hint]; 1722| 11.6k| auto is_leaf = shift_ == BL; 1723| 11.6k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 11.6k| auto next_idx = idx - left_size_hint; 1725| 11.6k| return is_leaf ------------------ | Branch (1725:16): [True: 4.54k, False: 7.13k] ------------------ 1726| 11.6k| ? make_leaf_sub_pos(child, next_size) 1727| 4.54k| .visit(v, next_idx, args...) 1728| 11.6k| : visit_maybe_relaxed_sub( 1729| 7.13k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 11.6k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 4.54k| { 145| 4.54k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.54k| } _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| 7.13k|{ 1839| 7.13k| assert(node); ------------------ | Branch (1839:5): [True: 7.13k, False: 0] ------------------ 1840| 7.13k| auto relaxed = node->relaxed(); 1841| 7.13k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.96k, False: 3.17k] ------------------ 1842| 3.96k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.96k, False: 0] ------------------ 1843| 3.96k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.96k| .visit(v, std::forward(args)...); 1845| 3.96k| } else { 1846| 3.17k| return make_regular_sub_pos(node, shift, size) 1847| 3.17k| .visit(v, std::forward(args)...); 1848| 3.17k| } 1849| 7.13k|} _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.96k| { 1814| 3.96k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.96k| } _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.17k| { 1037| 3.17k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.17k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 23.3k| { 1654| 23.3k| assert(start > 0); ------------------ | Branch (1654:9): [True: 23.3k, False: 0] ------------------ 1655| 23.3k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 23.3k, False: 0] ------------------ 1656| 23.3k| auto s = relaxed_->d.sizes[start - 1]; 1657| 23.3k| auto p = node_->inner(); 1658| 23.3k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 2.67k, False: 20.6k] ------------------ 1659| 9.01k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 6.33k, False: 2.67k] ------------------ 1660| 6.33k| IMMER_PREFETCH(p + i + 1); 1661| 6.33k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 6.33k| .visit(v, args...); 1663| 6.33k| s = relaxed_->d.sizes[i]; 1664| 6.33k| assert(s); ------------------ | Branch (1664:17): [True: 6.33k, False: 0] ------------------ 1665| 6.33k| } 1666| 20.6k| } else { 1667| 20.6k| auto ss = shift_ - B; 1668| 109k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 88.4k, False: 20.6k] ------------------ 1669| 88.4k| visit_maybe_relaxed_sub( 1670| 88.4k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 88.4k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 88.4k, False: 0] ------------------ 1673| 88.4k| } 1674| 20.6k| } 1675| 23.3k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 12.7k| { 1037| 12.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 12.7k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 5.17k| { 928| 5.17k| return towards_oh_ch_regular( 929| 5.17k| *this, v, idx, offset_hint, count(), args...); 930| 5.17k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 5.17k|{ 633| 5.17k| constexpr auto B = bits; 634| 5.17k| constexpr auto BL = bits_leaf; 635| 5.17k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.17k, False: 0] ------------------ 636| 5.17k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.17k, False: 0] ------------------ 637| 5.17k| auto is_leaf = p.shift() == BL; 638| 5.17k| auto child = p.node()->inner()[offset_hint]; 639| 5.17k| auto is_full = offset_hint + 1 != count_hint; 640| 5.17k| return is_full ------------------ | Branch (640:12): [True: 4.40k, False: 775] ------------------ 641| 5.17k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 990, False: 3.41k] ------------------ 642| 4.40k| : make_full_pos(child, p.shift() - B) 643| 3.41k| .visit(v, idx, args...)) 644| 5.17k| : (is_leaf ------------------ | Branch (644:19): [True: 775, False: 0] ------------------ 645| 775| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 775| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.17k|} _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.67k| { 208| 1.67k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.67k| } _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.89k| { 1406| 3.89k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.89k| } _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: 687, False: 485] ------------------ 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| 775| { 113| 775| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 775| } _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| 947| { 145| 947| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 947| } _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| 60.9k|{ 1839| 60.9k| assert(node); ------------------ | Branch (1839:5): [True: 60.9k, False: 0] ------------------ 1840| 60.9k| auto relaxed = node->relaxed(); 1841| 60.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 58.1k, False: 2.76k] ------------------ 1842| 58.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 58.1k, False: 0] ------------------ 1843| 58.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 58.1k| .visit(v, std::forward(args)...); 1845| 58.1k| } else { 1846| 2.76k| return make_regular_sub_pos(node, shift, size) 1847| 2.76k| .visit(v, std::forward(args)...); 1848| 2.76k| } 1849| 60.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 58.1k| { 1814| 58.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 58.1k| } _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.90k| { 1706| 1.90k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 1.90k, False: 0] ------------------ 1707| 1.90k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 1.47k, False: 437] ------------------ 1708| 1.90k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 1.90k| } _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.90k| { 1718| 1.90k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 1.90k, False: 0] ------------------ 1719| 1.90k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 1.47k, False: 437] | Branch (1719:9): [True: 1.90k, False: 0] ------------------ 1720| 1.90k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 1.90k| auto child = node_->inner()[offset_hint]; 1722| 1.90k| auto is_leaf = shift_ == BL; 1723| 1.90k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 1.90k| auto next_idx = idx - left_size_hint; 1725| 1.90k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 1.90k] ------------------ 1726| 1.90k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 1.90k| : visit_maybe_relaxed_sub( 1729| 1.90k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 1.90k| } _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.32k| { 1706| 3.32k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.32k, False: 0] ------------------ 1707| 3.32k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 2.81k, False: 513] ------------------ 1708| 3.32k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.32k| } _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.32k| { 1718| 3.32k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.32k, False: 0] ------------------ 1719| 3.32k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 2.81k, False: 513] | Branch (1719:9): [True: 3.32k, False: 0] ------------------ 1720| 3.32k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.32k| auto child = node_->inner()[offset_hint]; 1722| 3.32k| auto is_leaf = shift_ == BL; 1723| 3.32k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.32k| auto next_idx = idx - left_size_hint; 1725| 3.32k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.32k] ------------------ 1726| 3.32k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.32k| : visit_maybe_relaxed_sub( 1729| 3.32k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.32k| } _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.32k|{ 1839| 3.32k| assert(node); ------------------ | Branch (1839:5): [True: 3.32k, False: 0] ------------------ 1840| 3.32k| auto relaxed = node->relaxed(); 1841| 3.32k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.20k, False: 1.11k] ------------------ 1842| 2.20k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.20k, False: 0] ------------------ 1843| 2.20k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.20k| .visit(v, std::forward(args)...); 1845| 2.20k| } else { 1846| 1.11k| return make_regular_sub_pos(node, shift, size) 1847| 1.11k| .visit(v, std::forward(args)...); 1848| 1.11k| } 1849| 3.32k|} _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.20k| { 1814| 2.20k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.20k| } _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.11k| { 1037| 1.11k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.11k| } _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.61k| { 947| 1.61k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 1.61k| } _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.61k|{ 654| 1.61k| constexpr auto B = bits; 655| 1.61k| constexpr auto BL = bits_leaf; 656| 1.61k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 1.61k, False: 0] ------------------ 657| 1.61k| auto is_leaf = p.shift() == BL; 658| 1.61k| auto child = p.node()->inner()[offset_hint]; 659| 1.61k| auto lsize = offset_hint << p.shift(); 660| 1.61k| auto size = p.this_size(); 661| 1.61k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 1.61k| return is_full ------------------ | Branch (662:12): [True: 636, False: 974] ------------------ 663| 1.61k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 636] ------------------ 664| 636| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 636| : make_full_pos(child, p.shift() - B) 666| 636| .visit(v, idx - lsize, args...)) 667| 1.61k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 974] ------------------ 668| 974| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 974| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 974| .visit(v, idx - lsize, args...)); 672| 1.61k|} _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| 636| { 1406| 636| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 636| } _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.99k| { 1349| 2.99k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 2.99k, False: 0] ------------------ 1350| 2.99k| auto is_leaf = shift_ == BL; 1351| 2.99k| auto child = node_->inner()[offset_hint]; 1352| 2.99k| auto lsize = size_t{offset_hint} << shift_; 1353| 2.99k| return is_leaf ------------------ | Branch (1353:16): [True: 2.33k, False: 653] ------------------ 1354| 2.99k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 2.99k| : make_full_pos(child, shift_ - B) 1356| 653| .visit(v, idx - lsize, args...); 1357| 2.99k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 8.36k| { 208| 8.36k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 8.36k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 2.35k| { 1406| 2.35k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.35k| } _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| 974| { 1037| 974| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 974| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 7.72k| { 947| 7.72k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 7.72k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_22slice_left_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 7.72k|{ 654| 7.72k| constexpr auto B = bits; 655| 7.72k| constexpr auto BL = bits_leaf; 656| 7.72k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 7.72k, False: 0] ------------------ 657| 7.72k| auto is_leaf = p.shift() == BL; 658| 7.72k| auto child = p.node()->inner()[offset_hint]; 659| 7.72k| auto lsize = offset_hint << p.shift(); 660| 7.72k| auto size = p.this_size(); 661| 7.72k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 7.72k| return is_full ------------------ | Branch (662:12): [True: 7.72k, False: 0] ------------------ 663| 7.72k| ? (is_leaf ------------------ | Branch (663:19): [True: 6.02k, False: 1.70k] ------------------ 664| 7.72k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 7.72k| : make_full_pos(child, p.shift() - B) 666| 1.70k| .visit(v, idx - lsize, args...)) 667| 7.72k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 7.72k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 1.90k| { 1814| 1.90k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.90k| } _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| 207k| { 1706| 207k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 207k, False: 0] ------------------ 1707| 207k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 47.2k, False: 159k] ------------------ 1708| 207k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 207k| } _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| 207k| { 1718| 207k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 207k, False: 0] ------------------ 1719| 207k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 47.2k, False: 159k] | Branch (1719:9): [True: 207k, False: 0] ------------------ 1720| 207k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 207k| auto child = node_->inner()[offset_hint]; 1722| 207k| auto is_leaf = shift_ == BL; 1723| 207k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 207k| auto next_idx = idx - left_size_hint; 1725| 207k| return is_leaf ------------------ | Branch (1725:16): [True: 4.19k, False: 203k] ------------------ 1726| 207k| ? make_leaf_sub_pos(child, next_size) 1727| 4.19k| .visit(v, next_idx, args...) 1728| 207k| : visit_maybe_relaxed_sub( 1729| 203k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 207k| } _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.19k| { 145| 4.19k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.19k| } _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| 203k|{ 1839| 203k| assert(node); ------------------ | Branch (1839:5): [True: 203k, False: 0] ------------------ 1840| 203k| auto relaxed = node->relaxed(); 1841| 203k| if (relaxed) { ------------------ | Branch (1841:9): [True: 200k, False: 2.29k] ------------------ 1842| 200k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 200k, False: 0] ------------------ 1843| 200k| return make_relaxed_pos(node, shift, relaxed) 1844| 200k| .visit(v, std::forward(args)...); 1845| 200k| } else { 1846| 2.29k| return make_regular_sub_pos(node, shift, size) 1847| 2.29k| .visit(v, std::forward(args)...); 1848| 2.29k| } 1849| 203k|} _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| 200k| { 1814| 200k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 200k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 2.29k| { 1037| 2.29k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.29k| } _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| 98.8k| { 1706| 98.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 98.8k, False: 0] ------------------ 1707| 98.8k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 61.8k, False: 36.9k] ------------------ 1708| 98.8k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 98.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 98.8k| { 1718| 98.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 98.8k, False: 0] ------------------ 1719| 98.8k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 61.8k, False: 36.9k] | Branch (1719:9): [True: 98.8k, False: 0] ------------------ 1720| 98.8k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 98.8k| auto child = node_->inner()[offset_hint]; 1722| 98.8k| auto is_leaf = shift_ == BL; 1723| 98.8k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 98.8k| auto next_idx = idx - left_size_hint; 1725| 98.8k| return is_leaf ------------------ | Branch (1725:16): [True: 46.4k, False: 52.3k] ------------------ 1726| 98.8k| ? make_leaf_sub_pos(child, next_size) 1727| 46.4k| .visit(v, next_idx, args...) 1728| 98.8k| : visit_maybe_relaxed_sub( 1729| 52.3k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 98.8k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 46.4k| { 145| 46.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 46.4k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 52.3k|{ 1839| 52.3k| assert(node); ------------------ | Branch (1839:5): [True: 52.3k, False: 0] ------------------ 1840| 52.3k| auto relaxed = node->relaxed(); 1841| 52.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 50.1k, False: 2.18k] ------------------ 1842| 50.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 50.1k, False: 0] ------------------ 1843| 50.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 50.1k| .visit(v, std::forward(args)...); 1845| 50.1k| } else { 1846| 2.18k| return make_regular_sub_pos(node, shift, size) 1847| 2.18k| .visit(v, std::forward(args)...); 1848| 2.18k| } 1849| 52.3k|} _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| 50.1k| { 1814| 50.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 50.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 2.18k| { 1037| 2.18k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.18k| } _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.76k| { 1037| 2.76k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.76k| } _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.0k|{ 1839| 21.0k| assert(node); ------------------ | Branch (1839:5): [True: 21.0k, False: 0] ------------------ 1840| 21.0k| auto relaxed = node->relaxed(); 1841| 21.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.3k, False: 8.67k] ------------------ 1842| 12.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.3k, False: 0] ------------------ 1843| 12.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 12.3k| .visit(v, std::forward(args)...); 1845| 12.3k| } else { 1846| 8.67k| return make_regular_sub_pos(node, shift, size) 1847| 8.67k| .visit(v, std::forward(args)...); 1848| 8.67k| } 1849| 21.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcT_DpOT0_: 1813| 12.3k| { 1814| 12.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 12.3k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcPT_jmT0_DpOT1_: 1838| 12.3k|{ 1839| 12.3k| assert(node); ------------------ | Branch (1839:5): [True: 12.3k, False: 0] ------------------ 1840| 12.3k| auto relaxed = node->relaxed(); 1841| 12.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.37k, False: 3.02k] ------------------ 1842| 9.37k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.37k, False: 0] ------------------ 1843| 9.37k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.37k| .visit(v, std::forward(args)...); 1845| 9.37k| } else { 1846| 3.02k| return make_regular_sub_pos(node, shift, size) 1847| 3.02k| .visit(v, std::forward(args)...); 1848| 3.02k| } 1849| 12.3k|} _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.37k| { 1814| 9.37k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 9.37k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 54.0k| { 1794| 54.0k| auto child = node_->inner()[offset]; 1795| 54.0k| auto child_size = size(offset); 1796| 54.0k| auto is_leaf = shift_ == BL; 1797| 54.0k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 25.3k, False: 28.6k] ------------------ 1798| 54.0k| : visit_maybe_relaxed_sub( 1799| 28.6k| child, shift_ - B, child_size, v, args...); 1800| 54.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 25.9k| { 145| 25.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 25.9k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1804| 25.9k| { 1805| 25.9k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 25.9k, False: 0] ------------------ 1806| 25.9k| auto child = node_->inner()[offset]; 1807| 25.9k| auto child_size = size(offset); 1808| 25.9k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 25.9k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 26.6k| { 145| 26.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 26.6k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 28.6k|{ 1839| 28.6k| assert(node); ------------------ | Branch (1839:5): [True: 28.6k, False: 0] ------------------ 1840| 28.6k| auto relaxed = node->relaxed(); 1841| 28.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 23.6k, False: 4.98k] ------------------ 1842| 23.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 23.6k, False: 0] ------------------ 1843| 23.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 23.6k| .visit(v, std::forward(args)...); 1845| 23.6k| } else { 1846| 4.98k| return make_regular_sub_pos(node, shift, size) 1847| 4.98k| .visit(v, std::forward(args)...); 1848| 4.98k| } 1849| 28.6k|} _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| 23.6k| { 1814| 23.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 23.6k| } _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| 23.6k| { 1794| 23.6k| auto child = node_->inner()[offset]; 1795| 23.6k| auto child_size = size(offset); 1796| 23.6k| auto is_leaf = shift_ == BL; 1797| 23.6k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 23.6k] ------------------ 1798| 23.6k| : visit_maybe_relaxed_sub( 1799| 23.6k| child, shift_ - B, child_size, v, args...); 1800| 23.6k| } _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| 23.6k|{ 1839| 23.6k| assert(node); ------------------ | Branch (1839:5): [True: 23.6k, False: 0] ------------------ 1840| 23.6k| auto relaxed = node->relaxed(); 1841| 23.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 22.7k, False: 881] ------------------ 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| 881| return make_regular_sub_pos(node, shift, size) 1847| 881| .visit(v, std::forward(args)...); 1848| 881| } 1849| 23.6k|} _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| 22.7k| { 1814| 22.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 22.7k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 1.20k| { 1037| 1.20k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.20k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 8.22k| { 1794| 8.22k| auto child = node_->inner()[offset]; 1795| 8.22k| auto child_size = size(offset); 1796| 8.22k| auto is_leaf = shift_ == BL; 1797| 8.22k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 5.35k, False: 2.87k] ------------------ 1798| 8.22k| : visit_maybe_relaxed_sub( 1799| 2.87k| child, shift_ - B, child_size, v, args...); 1800| 8.22k| } _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.35k| { 145| 5.35k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.35k| } _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.35k| { 1026| 5.35k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 5.35k, False: 0] ------------------ 1027| 5.35k| auto child = node_->inner()[idx]; 1028| 5.35k| auto lsize = size(idx); 1029| 5.35k| auto is_full = idx + 1 < count(); 1030| 5.35k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 4.66k, False: 693] ------------------ 1031| 5.35k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 5.35k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 207| 12.4k| { 208| 12.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 12.4k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.87k|{ 1839| 2.87k| assert(node); ------------------ | Branch (1839:5): [True: 2.87k, False: 0] ------------------ 1840| 2.87k| auto relaxed = node->relaxed(); 1841| 2.87k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.96k, False: 910] ------------------ 1842| 1.96k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.96k, False: 0] ------------------ 1843| 1.96k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.96k| .visit(v, std::forward(args)...); 1845| 1.96k| } else { 1846| 910| return make_regular_sub_pos(node, shift, size) 1847| 910| .visit(v, std::forward(args)...); 1848| 910| } 1849| 2.87k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 1.96k| { 1814| 1.96k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.96k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1007| 1.96k| { 1008| 1.96k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 1.96k, False: 0] ------------------ 1009| 1.96k| auto is_leaf = shift_ == BL; 1010| 1.96k| auto child = node_->inner()[idx]; 1011| 1.96k| auto lsize = size(idx); 1012| 1.96k| auto is_full = idx + 1 < count(); 1013| 1.96k| return is_full ------------------ | Branch (1013:16): [True: 1.63k, False: 326] ------------------ 1014| 1.96k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.63k] ------------------ 1015| 1.63k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.63k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 1.96k| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 326] ------------------ 1018| 326| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 326| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 326| .visit(v, args...)); 1021| 1.96k| } _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.21k| { 1406| 2.21k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.21k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 9.24k| { 1794| 9.24k| auto child = node_->inner()[offset]; 1795| 9.24k| auto child_size = size(offset); 1796| 9.24k| auto is_leaf = shift_ == BL; 1797| 9.24k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 7.74k, False: 1.50k] ------------------ 1798| 9.24k| : visit_maybe_relaxed_sub( 1799| 1.50k| child, shift_ - B, child_size, v, args...); 1800| 9.24k| } _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.74k| { 145| 7.74k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.74k| } _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.74k| { 1397| 7.74k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 7.74k, False: 0] ------------------ 1398| 7.74k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 7.74k, False: 0] ------------------ 1399| 7.74k| auto child = node_->inner()[idx]; 1400| 7.74k| return make_full_leaf_pos(child).visit(v, args...); 1401| 7.74k| } _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.50k|{ 1839| 1.50k| assert(node); ------------------ | Branch (1839:5): [True: 1.50k, False: 0] ------------------ 1840| 1.50k| auto relaxed = node->relaxed(); 1841| 1.50k| if (relaxed) { ------------------ | Branch (1841:9): [True: 580, False: 925] ------------------ 1842| 580| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 580, False: 0] ------------------ 1843| 580| return make_relaxed_pos(node, shift, relaxed) 1844| 580| .visit(v, std::forward(args)...); 1845| 925| } else { 1846| 925| return make_regular_sub_pos(node, shift, size) 1847| 925| .visit(v, std::forward(args)...); 1848| 925| } 1849| 1.50k|} _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| 580| { 1814| 580| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 580| } _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| 580| { 1387| 580| assert(idx < count()); ------------------ | Branch (1387:9): [True: 580, False: 0] ------------------ 1388| 580| auto is_leaf = shift_ == BL; 1389| 580| auto child = node_->inner()[idx]; 1390| 580| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 580] ------------------ 1391| 580| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 580| } _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| 925| { 1037| 925| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 925| } _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| 925| { 1387| 925| assert(idx < count()); ------------------ | Branch (1387:9): [True: 925, False: 0] ------------------ 1388| 925| auto is_leaf = shift_ == BL; 1389| 925| auto child = node_->inner()[idx]; 1390| 925| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 925] ------------------ 1391| 925| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 925| } _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.83k| { 1406| 1.83k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.83k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 1222| 4.45k| { 1223| 4.45k| auto p = node_->inner(); 1224| 4.45k| auto p2 = other->inner(); 1225| 4.45k| auto e = p + branches; 1226| 4.45k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 3.40k, False: 1.05k] ------------------ 1227| 23.1k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 21.2k, False: 1.92k] ------------------ 1228| 21.2k| IMMER_PREFETCH(p + 1); 1229| 21.2k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 1.47k, False: 19.7k] ------------------ 1230| 1.47k| return false; 1231| 21.2k| } 1232| 3.40k| } else { 1233| 1.05k| auto ss = shift_ - B; 1234| 6.84k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 6.25k, False: 584] ------------------ 1235| 6.25k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 467, False: 5.79k] ------------------ 1236| 467| return false; 1237| 1.05k| } 1238| 2.51k| return true; 1239| 4.45k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 29.4k| { 208| 29.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 29.4k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 12.0k| { 1406| 12.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 12.0k| } _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.44k| { 838| 5.44k| return each_pred_zip_regular(*this, v, other, args...); 839| 5.44k| } _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.44k|{ 393| 5.44k| constexpr auto B = bits; 394| 5.44k| constexpr auto BL = bits_leaf; 395| | 396| 5.44k| auto n = p.node()->inner(); 397| 5.44k| auto n2 = other->inner(); 398| 5.44k| auto last = p.count() - 1; 399| 5.44k| auto e = n + last; 400| 5.44k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.08k, False: 3.36k] ------------------ 401| 6.50k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 5.29k, False: 1.21k] ------------------ 402| 5.29k| IMMER_PREFETCH(n + 1); 403| 5.29k| IMMER_PREFETCH(n2 + 1); 404| 5.29k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 872, False: 4.42k] ------------------ 405| 872| return false; 406| 5.29k| } 407| 1.21k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 3.36k| } else { 409| 3.36k| auto ss = p.shift() - B; 410| 6.58k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 4.20k, False: 2.38k] ------------------ 411| 4.20k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 980, False: 3.22k] ------------------ 412| 980| return false; 413| 2.38k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 3.36k| } 415| 5.44k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 2.84k| { 113| 2.84k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.84k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 3.02k| { 337| 3.02k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.02k| } _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.73k| { 256| 2.73k| return each_pred_zip_regular(*this, v, other, args...); 257| 2.73k| } _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.73k|{ 393| 2.73k| constexpr auto B = bits; 394| 2.73k| constexpr auto BL = bits_leaf; 395| | 396| 2.73k| auto n = p.node()->inner(); 397| 2.73k| auto n2 = other->inner(); 398| 2.73k| auto last = p.count() - 1; 399| 2.73k| auto e = n + last; 400| 2.73k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.86k, False: 874] ------------------ 401| 4.50k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 2.86k, False: 1.63k] ------------------ 402| 2.86k| IMMER_PREFETCH(n + 1); 403| 2.86k| IMMER_PREFETCH(n2 + 1); 404| 2.86k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 228, False: 2.63k] ------------------ 405| 228| return false; 406| 2.86k| } 407| 1.63k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 1.86k| } else { 409| 874| auto ss = p.shift() - B; 410| 2.18k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 1.54k, False: 642] ------------------ 411| 1.54k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 232, False: 1.31k] ------------------ 412| 232| return false; 413| 642| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 874| } 415| 2.73k|} _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.98k| { 1387| 5.98k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 5.98k, False: 0] ------------------ 1388| 5.98k| auto is_leaf = shift_ == BL; 1389| 5.98k| auto child = node_->inner()[idx]; 1390| 5.98k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 5.04k, False: 943] ------------------ 1391| 5.98k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 5.98k| } _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| 254k| { 208| 254k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 254k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_18region_for_visitorIiEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 4.80M|{ 1839| 4.80M| assert(node); ------------------ | Branch (1839:5): [True: 4.80M, False: 0] ------------------ 1840| 4.80M| auto relaxed = node->relaxed(); 1841| 4.80M| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.51M, False: 290k] ------------------ 1842| 4.51M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.51M, False: 0] ------------------ 1843| 4.51M| return make_relaxed_pos(node, shift, relaxed) 1844| 4.51M| .visit(v, std::forward(args)...); 1845| 4.51M| } else { 1846| 290k| return make_regular_sub_pos(node, shift, size) 1847| 290k| .visit(v, std::forward(args)...); 1848| 290k| } 1849| 4.80M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 4.51M| { 1814| 4.51M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.51M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 4.51M| { 1680| 4.51M| return towards_oh(v, idx, subindex(idx), args...); 1681| 4.51M| } _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.51M| { 1687| 4.51M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 4.51M, False: 0] ------------------ 1688| 4.51M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 3.16M, False: 1.35M] ------------------ 1689| 4.51M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 4.51M| } _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.51M| { 1699| 4.51M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 4.51M| } _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.51M| { 1718| 4.51M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.51M, False: 0] ------------------ 1719| 4.51M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.16M, False: 1.35M] | Branch (1719:9): [True: 4.51M, False: 0] ------------------ 1720| 4.51M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.51M| auto child = node_->inner()[offset_hint]; 1722| 4.51M| auto is_leaf = shift_ == BL; 1723| 4.51M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.51M| auto next_idx = idx - left_size_hint; 1725| 4.51M| return is_leaf ------------------ | Branch (1725:16): [True: 980k, False: 3.53M] ------------------ 1726| 4.51M| ? make_leaf_sub_pos(child, next_size) 1727| 980k| .visit(v, next_idx, args...) 1728| 4.51M| : visit_maybe_relaxed_sub( 1729| 3.53M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.51M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 144| 980k| { 145| 980k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 980k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 290k| { 1037| 290k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 290k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 290k| { 920| 290k| return towards_oh_ch_regular( 921| 290k| *this, v, idx, index(idx), count(), args...); 922| 290k| } _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| 290k|{ 633| 290k| constexpr auto B = bits; 634| 290k| constexpr auto BL = bits_leaf; 635| 290k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 290k, False: 0] ------------------ 636| 290k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 290k, False: 0] ------------------ 637| 290k| auto is_leaf = p.shift() == BL; 638| 290k| auto child = p.node()->inner()[offset_hint]; 639| 290k| auto is_full = offset_hint + 1 != count_hint; 640| 290k| return is_full ------------------ | Branch (640:12): [True: 246k, False: 44.0k] ------------------ 641| 290k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 88.9k, False: 157k] ------------------ 642| 246k| : make_full_pos(child, p.shift() - B) 643| 157k| .visit(v, idx, args...)) 644| 290k| : (is_leaf ------------------ | Branch (644:19): [True: 16.1k, False: 27.8k] ------------------ 645| 44.0k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 44.0k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 27.8k| .visit(v, idx, args...)); 648| 290k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 270k| { 208| 270k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 270k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 288k| { 1406| 288k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 288k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 288k| { 1323| 288k| return towards_oh(v, idx, index(idx), args...); 1324| 288k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 288k| { 1337| 288k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 288k, False: 0] ------------------ 1338| 288k| auto is_leaf = shift_ == BL; 1339| 288k| auto child = node_->inner()[offset_hint]; 1340| 288k| return is_leaf ------------------ | Branch (1340:16): [True: 172k, False: 116k] ------------------ 1341| 288k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 288k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 288k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 20.3k| { 113| 20.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 20.3k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 30.7k| { 337| 30.7k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 30.7k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 30.7k| { 298| 30.7k| return towards_oh_ch_regular( 299| 30.7k| *this, v, idx, index(idx), count(), args...); 300| 30.7k| } _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| 30.7k|{ 633| 30.7k| constexpr auto B = bits; 634| 30.7k| constexpr auto BL = bits_leaf; 635| 30.7k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 30.7k, False: 0] ------------------ 636| 30.7k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 30.7k, False: 0] ------------------ 637| 30.7k| auto is_leaf = p.shift() == BL; 638| 30.7k| auto child = p.node()->inner()[offset_hint]; 639| 30.7k| auto is_full = offset_hint + 1 != count_hint; 640| 30.7k| return is_full ------------------ | Branch (640:12): [True: 23.6k, False: 7.06k] ------------------ 641| 30.7k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 9.08k, False: 14.5k] ------------------ 642| 23.6k| : make_full_pos(child, p.shift() - B) 643| 14.5k| .visit(v, idx, args...)) 644| 30.7k| : (is_leaf ------------------ | Branch (644:19): [True: 4.23k, False: 2.82k] ------------------ 645| 7.06k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 7.06k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.82k| .visit(v, idx, args...)); 648| 30.7k|} _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| 20.9k| { 1406| 20.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 20.9k| } _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| 20.9k| { 1203| 20.9k| auto p = node_->inner(); 1204| 20.9k| auto e = p + branches; 1205| 20.9k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 19.7k, False: 1.21k] ------------------ 1206| 170k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 151k, False: 18.3k] ------------------ 1207| 151k| IMMER_PREFETCH(p + 1); 1208| 151k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 1.32k, False: 150k] ------------------ 1209| 1.32k| return false; 1210| 151k| } 1211| 19.7k| } else { 1212| 1.21k| auto ss = shift_ - B; 1213| 10.0k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 9.11k, False: 977] ------------------ 1214| 9.11k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 241, False: 8.87k] ------------------ 1215| 241| return false; 1216| 1.21k| } 1217| 19.3k| return true; 1218| 20.9k| } _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| 910| { 1037| 910| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 910| } _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| 910| { 1008| 910| assert(idx < count()); ------------------ | Branch (1008:9): [True: 910, False: 0] ------------------ 1009| 910| auto is_leaf = shift_ == BL; 1010| 910| auto child = node_->inner()[idx]; 1011| 910| auto lsize = size(idx); 1012| 910| auto is_full = idx + 1 < count(); 1013| 910| return is_full ------------------ | Branch (1013:16): [True: 910, False: 0] ------------------ 1014| 910| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 910] ------------------ 1015| 910| ? make_full_leaf_pos(child).visit(v, args...) 1016| 910| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 910| : (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| 910| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 4.04k| { 1037| 4.04k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.04k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1007| 5.28k| { 1008| 5.28k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 5.28k, False: 0] ------------------ 1009| 5.28k| auto is_leaf = shift_ == BL; 1010| 5.28k| auto child = node_->inner()[idx]; 1011| 5.28k| auto lsize = size(idx); 1012| 5.28k| auto is_full = idx + 1 < count(); 1013| 5.28k| return is_full ------------------ | Branch (1013:16): [True: 3.29k, False: 1.98k] ------------------ 1014| 5.28k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.83k, False: 466] ------------------ 1015| 3.29k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 3.29k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 5.28k| : (is_leaf ------------------ | Branch (1017:23): [True: 1.19k, False: 793] ------------------ 1018| 1.98k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 1.98k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 793| .visit(v, args...)); 1021| 5.28k| } _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| 931k| { 145| 931k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 931k| } _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| 17.8k| { 1037| 17.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 17.8k| } _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| 17.8k| { 832| 17.8k| return each_pred_regular(*this, v, args...); 833| 17.8k| } _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| 17.8k|{ 366| 17.8k| constexpr auto B = bits; 367| 17.8k| constexpr auto BL = bits_leaf; 368| 17.8k| auto n = p.node()->inner(); 369| 17.8k| auto last = p.count() - 1; 370| 17.8k| auto e = n + last; 371| 17.8k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 14.0k, False: 3.77k] ------------------ 372| 100k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 87.5k, False: 13.1k] ------------------ 373| 87.5k| IMMER_PREFETCH(n + 1); 374| 87.5k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 965, False: 86.6k] ------------------ 375| 965| return false; 376| 87.5k| } 377| 13.1k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 14.0k| } else { 379| 3.77k| auto ss = p.shift() - B; 380| 11.9k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 9.09k, False: 2.88k] ------------------ 381| 9.09k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 884, False: 8.20k] ------------------ 382| 884| return false; 383| 2.88k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 3.77k| } 385| 17.8k|} _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| 15.5k| { 113| 15.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 15.5k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 336| 3.89k| { 337| 3.89k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.89k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 249| 3.89k| { 250| 3.89k| return each_pred_regular(*this, v, args...); 251| 3.89k| } _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.89k|{ 366| 3.89k| constexpr auto B = bits; 367| 3.89k| constexpr auto BL = bits_leaf; 368| 3.89k| auto n = p.node()->inner(); 369| 3.89k| auto last = p.count() - 1; 370| 3.89k| auto e = n + last; 371| 3.89k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 2.68k, False: 1.20k] ------------------ 372| 9.36k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 6.92k, False: 2.43k] ------------------ 373| 6.92k| IMMER_PREFETCH(n + 1); 374| 6.92k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 250, False: 6.67k] ------------------ 375| 250| return false; 376| 6.92k| } 377| 2.43k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 2.68k| } else { 379| 1.20k| auto ss = p.shift() - B; 380| 2.31k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 1.31k, False: 1.00k] ------------------ 381| 1.31k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 200, False: 1.11k] ------------------ 382| 200| return false; 383| 1.00k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 1.20k| } 385| 3.89k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 4.98k| { 1037| 4.98k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.98k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 4.98k| { 1794| 4.98k| auto child = node_->inner()[offset]; 1795| 4.98k| auto child_size = size(offset); 1796| 4.98k| auto is_leaf = shift_ == BL; 1797| 4.98k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 4.98k] ------------------ 1798| 4.98k| : visit_maybe_relaxed_sub( 1799| 4.98k| child, shift_ - B, child_size, v, args...); 1800| 4.98k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 4.98k|{ 1839| 4.98k| assert(node); ------------------ | Branch (1839:5): [True: 4.98k, False: 0] ------------------ 1840| 4.98k| auto relaxed = node->relaxed(); 1841| 4.98k| if (relaxed) { ------------------ | Branch (1841:9): [True: 946, False: 4.04k] ------------------ 1842| 946| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 946, False: 0] ------------------ 1843| 946| return make_relaxed_pos(node, shift, relaxed) 1844| 946| .visit(v, std::forward(args)...); 1845| 4.04k| } else { 1846| 4.04k| return make_regular_sub_pos(node, shift, size) 1847| 4.04k| .visit(v, std::forward(args)...); 1848| 4.04k| } 1849| 4.98k|} _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| 946| { 1814| 946| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 946| } _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.83k| { 1008| 7.83k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 7.83k, False: 0] ------------------ 1009| 7.83k| auto is_leaf = shift_ == BL; 1010| 7.83k| auto child = node_->inner()[idx]; 1011| 7.83k| auto lsize = size(idx); 1012| 7.83k| auto is_full = idx + 1 < count(); 1013| 7.83k| return is_full ------------------ | Branch (1013:16): [True: 7.29k, False: 540] ------------------ 1014| 7.83k| ? (is_leaf ------------------ | Branch (1014:23): [True: 4.61k, False: 2.68k] ------------------ 1015| 7.29k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 7.29k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 7.83k| : (is_leaf ------------------ | Branch (1017:23): [True: 540, False: 0] ------------------ 1018| 540| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 540| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 7.83k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 207| 11.8k| { 208| 11.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 11.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1804| 11.8k| { 1805| 11.8k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 11.8k, False: 0] ------------------ 1806| 11.8k| auto child = node_->inner()[offset]; 1807| 11.8k| auto child_size = size(offset); 1808| 11.8k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 11.8k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 11.8k| { 145| 11.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 11.8k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1405| 4.55k| { 1406| 4.55k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.55k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 4.55k| { 1794| 4.55k| auto child = node_->inner()[offset]; 1795| 4.55k| auto child_size = size(offset); 1796| 4.55k| auto is_leaf = shift_ == BL; 1797| 4.55k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 4.55k] ------------------ 1798| 4.55k| : visit_maybe_relaxed_sub( 1799| 4.55k| child, shift_ - B, child_size, v, args...); 1800| 4.55k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 4.55k|{ 1839| 4.55k| assert(node); ------------------ | Branch (1839:5): [True: 4.55k, False: 0] ------------------ 1840| 4.55k| auto relaxed = node->relaxed(); 1841| 4.55k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.92k, False: 2.62k] ------------------ 1842| 1.92k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.92k, False: 0] ------------------ 1843| 1.92k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.92k| .visit(v, std::forward(args)...); 1845| 2.62k| } else { 1846| 2.62k| return make_regular_sub_pos(node, shift, size) 1847| 2.62k| .visit(v, std::forward(args)...); 1848| 2.62k| } 1849| 4.55k|} _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.92k| { 1814| 1.92k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.92k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1386| 9.06k| { 1387| 9.06k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 9.06k, False: 0] ------------------ 1388| 9.06k| auto is_leaf = shift_ == BL; 1389| 9.06k| auto child = node_->inner()[idx]; 1390| 9.06k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 7.19k, False: 1.87k] ------------------ 1391| 9.06k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 9.06k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 2.62k| { 1037| 2.62k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.62k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1793| 66.2k| { 1794| 66.2k| auto child = node_->inner()[offset]; 1795| 66.2k| auto child_size = size(offset); 1796| 66.2k| auto is_leaf = shift_ == BL; 1797| 66.2k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 29.7k, False: 36.5k] ------------------ 1798| 66.2k| : visit_maybe_relaxed_sub( 1799| 36.5k| child, shift_ - B, child_size, v, args...); 1800| 66.2k| } _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| 158k|{ 1839| 158k| assert(node); ------------------ | Branch (1839:5): [True: 158k, False: 0] ------------------ 1840| 158k| auto relaxed = node->relaxed(); 1841| 158k| if (relaxed) { ------------------ | Branch (1841:9): [True: 141k, False: 17.0k] ------------------ 1842| 141k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 141k, False: 0] ------------------ 1843| 141k| return make_relaxed_pos(node, shift, relaxed) 1844| 141k| .visit(v, std::forward(args)...); 1845| 141k| } else { 1846| 17.0k| return make_regular_sub_pos(node, shift, size) 1847| 17.0k| .visit(v, std::forward(args)...); 1848| 17.0k| } 1849| 158k|} _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| 141k| { 1814| 141k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 141k| } _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| 141k| { 1483| 141k| auto p = node_->inner(); 1484| 141k| auto s = size_t{}; 1485| 141k| auto n = count(); 1486| 141k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 123k, False: 18.2k] ------------------ 1487| 1.02M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 900k, False: 122k] ------------------ 1488| 900k| IMMER_PREFETCH(p + i + 1); 1489| 900k| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 819, False: 899k] ------------------ 1490| 900k| .visit(v, args...)) 1491| 819| return false; 1492| 899k| s = relaxed_->d.sizes[i]; 1493| 899k| } 1494| 123k| } else { 1495| 18.2k| auto ss = shift_ - B; 1496| 140k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 122k, False: 17.7k] ------------------ 1497| 122k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 539, False: 121k] ------------------ 1498| 122k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 539| return false; 1500| 121k| s = relaxed_->d.sizes[i]; 1501| 121k| } 1502| 18.2k| } 1503| 140k| return true; 1504| 141k| } _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.02k| { 1037| 3.02k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.02k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE15first_sub_innerINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERPSC_RjRmEEEDcT_DpOT0_: 1783| 1.13k| { 1784| 1.13k| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 1.13k, False: 0] ------------------ 1785| 1.13k| auto child = node_->inner()[0]; 1786| 1.13k| auto child_size = relaxed_->d.sizes[0]; 1787| 1.13k| return visit_maybe_relaxed_sub( 1788| 1.13k| child, shift_ - B, child_size, v, args...); 1789| 1.13k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERPSC_RjRmEEEDcPT_jmT0_DpOT1_: 1838| 1.13k|{ 1839| 1.13k| assert(node); ------------------ | Branch (1839:5): [True: 1.13k, False: 0] ------------------ 1840| 1.13k| auto relaxed = node->relaxed(); 1841| 1.13k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.13k, False: 0] ------------------ 1842| 1.13k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.13k, False: 0] ------------------ 1843| 1.13k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.13k| .visit(v, std::forward(args)...); 1845| 1.13k| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 1.13k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERPSC_RjRmEEEDcT_DpOT0_: 1813| 1.13k| { 1814| 1.13k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.13k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcPT_jmT0_DpOT1_: 1838| 8.67k|{ 1839| 8.67k| assert(node); ------------------ | Branch (1839:5): [True: 8.67k, False: 0] ------------------ 1840| 8.67k| auto relaxed = node->relaxed(); 1841| 8.67k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.72k, False: 5.95k] ------------------ 1842| 2.72k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.72k, False: 0] ------------------ 1843| 2.72k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.72k| .visit(v, std::forward(args)...); 1845| 5.95k| } else { 1846| 5.95k| return make_regular_sub_pos(node, shift, size) 1847| 5.95k| .visit(v, std::forward(args)...); 1848| 5.95k| } 1849| 8.67k|} _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.72k| { 1814| 2.72k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.72k| } _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.95k| { 1037| 5.95k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.95k| } _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.67k| { 1037| 8.67k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.67k| } _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.52k| { 145| 6.52k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.52k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 114| 1.33M| : size{0} 115| 1.33M| , shift{BL} 116| 1.33M| , root{empty_root()} 117| 1.33M| , tail{empty_tail()} 118| 1.33M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 1.33M, False: 0] ------------------ 120| 1.33M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_rootEv: 61| 1.35M| { 62| 1.35M| static const auto empty_ = [] { 63| 1.35M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1.35M| static std::aligned_storage_t 65| 1.35M| storage; 66| 1.35M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1.35M| }(); 68| 1.35M| return empty_->inc(); 69| 1.35M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_rootEvENKUlvE_clEv: 62| 1| static const auto empty_ = [] { 63| 1| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1| static std::aligned_storage_t 65| 1| storage; 66| 1| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1| }(); _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_tailEv: 72| 1.33M| { 73| 1.33M| static const auto empty_ = [] { 74| 1.33M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1.33M| static std::aligned_storage_t 76| 1.33M| storage; 77| 1.33M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1.33M| }(); 79| 1.33M| return empty_->inc(); 80| 1.33M| } _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.26M| { 1373| 3.26M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 3.26M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.26M] | | ------------------ | | 33| 3.26M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 3.26M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 3.26M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.26M] | | ------------------ | | 33| 3.26M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 3.26M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 3.26M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.26M] | | ------------------ | | 33| 3.26M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 3.26M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 3.26M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.26M] | | ------------------ | | 33| 3.26M| 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.26M| return true; 1382| 3.26M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11tail_offsetEv: 197| 17.6M| { 198| 17.6M| auto r = root->relaxed(); 199| 17.6M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 7.38M, False: 10.2M] | Branch (199:9): [True: 10.2M, False: 0] | Branch (199:9): [True: 17.6M, False: 0] ------------------ 200| 17.6M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 10.2M, False: 7.38M] ------------------ 201| 17.6M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 3.34M, False: 4.03M] ------------------ 202| | /* otherwise */ 203| 7.38M| : 0; 204| 17.6M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9tail_sizeEv: 194| 3.65M| 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.26M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3decEv: 192| 3.26M| 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.26M| { 209| 3.26M| auto tail_off = tail_offset(); 210| 3.26M| auto tail_size = size - tail_off; 211| | 212| 3.26M| if (tail_off) ------------------ | Branch (212:13): [True: 1.78M, False: 1.47M] ------------------ 213| 1.78M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 1.47M| else 215| 1.47M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 3.26M| if (tail_size) ------------------ | Branch (217:13): [True: 1.92M, False: 1.33M] ------------------ 218| 1.92M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 1.33M| else 220| 1.33M| make_empty_leaf_pos(tail).visit(v, args...); 221| 3.26M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 500| 347k| { 501| 347k| auto ts = tail_size(); 502| 347k| if (ts < branches) { ------------------ | Branch (502:13): [True: 295k, False: 52.2k] ------------------ 503| 295k| auto new_tail = 504| 295k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 295k| return {size + 1, shift, root->inc(), new_tail}; 506| 295k| } else { 507| 52.2k| using std::get; 508| 52.2k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 52.2k| auto tail_off = tail_offset(); 510| 52.2k| IMMER_TRY { ------------------ | | 49| 52.2k|#define IMMER_TRY try ------------------ 511| 52.2k| auto new_root = 512| 52.2k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 52.2k| tail->inc(); 514| 52.2k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 52.2k| } 516| 52.2k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 52.2k| } 521| 347k| } _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| 368k| { 370| 368k| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 54.3k, False: 313k] ------------------ 371| 54.3k| auto new_root = 372| 54.3k| make_relaxed_pos(root, shift, r) 373| 54.3k| .visit(push_tail_visitor{}, tail, tail_size); 374| 54.3k| if (new_root) ------------------ | Branch (374:17): [True: 52.3k, False: 1.93k] ------------------ 375| 52.3k| return std::make_tuple(shift, new_root); 376| 1.93k| else { 377| 1.93k| auto new_root = node_t::make_inner_r_n(2); 378| 1.93k| IMMER_TRY { ------------------ | | 49| 1.93k|#define IMMER_TRY try ------------------ 379| 1.93k| auto new_path = node_t::make_path(shift, tail); 380| 1.93k| new_root->inner()[0] = root->inc(); 381| 1.93k| new_root->inner()[1] = new_path; 382| 1.93k| new_root->relaxed()->d.sizes[0] = size; 383| 1.93k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 1.93k| assert(size); ------------------ | Branch (384:21): [True: 1.93k, False: 0] ------------------ 385| 1.93k| assert(tail_size); ------------------ | Branch (385:21): [True: 1.93k, False: 0] ------------------ 386| 1.93k| new_root->relaxed()->d.count = 2u; 387| 1.93k| } 388| 1.93k| 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.93k| return std::make_tuple(shift + B, new_root); 393| 1.93k| } 394| 313k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 3.91k, False: 310k] ------------------ 395| 3.91k| auto new_root = node_t::make_inner_n(2); 396| 3.91k| IMMER_TRY { ------------------ | | 49| 3.91k|#define IMMER_TRY try ------------------ 397| 3.91k| auto new_path = node_t::make_path(shift, tail); 398| 3.91k| new_root->inner()[0] = root->inc(); 399| 3.91k| new_root->inner()[1] = new_path; 400| 3.91k| } 401| 3.91k| 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.91k| return std::make_tuple(shift + B, new_root); 406| 310k| } else if (size) { ------------------ | Branch (406:20): [True: 297k, False: 12.5k] ------------------ 407| 297k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 297k| .visit(push_tail_visitor{}, tail); 409| 297k| return std::make_tuple(shift, new_root); 410| 297k| } else { 411| 12.5k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 12.5k| } 413| 368k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2EOSB_: 157| 1.24M| : rrbtree{} 158| 1.24M| { 159| 1.24M| swap(*this, other); 160| 1.24M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESC_: 176| 4.35M| { 177| 4.35M| using std::swap; 178| 4.35M| swap(x.size, y.size); 179| 4.35M| swap(x.shift, y.shift); 180| 4.35M| swap(x.root, y.root); 181| 4.35M| swap(x.tail, y.tail); 182| 4.35M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEaSEOSB_: 170| 3.10M| { 171| 3.10M| swap(*this, other); 172| 3.10M| return *this; 173| 3.10M| } 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| 171k| { 581| 171k| auto tail_off = tail_offset(); 582| 171k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 58.5k, False: 113k] ------------------ 583| 58.5k| auto tail_size = size - tail_off; 584| 58.5k| auto new_tail = 585| 58.5k| make_leaf_sub_pos(tail, tail_size) 586| 58.5k| .visit(update_visitor{}, idx - tail_off, fn); 587| 58.5k| return {size, shift, root->inc(), new_tail}; 588| 113k| } else { 589| 113k| auto new_root = visit_maybe_relaxed_sub( 590| 113k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 113k| return {size, shift, new_root, tail->inc()}; 592| 113k| } 593| 171k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 647| 23.5k| { 648| 23.5k| auto tail_off = tail_offset(); 649| 23.5k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 3.94k, False: 19.5k] ------------------ 650| 3.94k| return {}; 651| 19.5k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 1.14k, False: 18.4k] ------------------ 652| 1.14k| return *this; 653| 18.4k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 1.66k, False: 16.7k] ------------------ 654| 1.66k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 1.66k| return {new_size, shift, root->inc(), new_tail}; 656| 16.7k| } else { 657| 16.7k| using std::get; 658| 16.7k| auto l = new_size - 1; 659| 16.7k| auto v = slice_right_visitor(); 660| 16.7k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 16.7k| auto new_shift = get<0>(r); 662| 16.7k| auto new_root = get<1>(r); 663| 16.7k| auto new_tail = get<3>(r); 664| 16.7k| if (new_root) { ------------------ | Branch (664:17): [True: 12.6k, False: 4.09k] ------------------ 665| 12.6k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 12.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 12.6k, False: 0] ------------------ 666| 12.6k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 12.6k, False: 0] ------------------ 667| 12.6k| return {new_size, new_shift, new_root, new_tail}; 668| 12.6k| } else { 669| 4.09k| return {new_size, BL, empty_root(), new_tail}; 670| 4.09k| } 671| 16.7k| } 672| 23.5k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKSB_: 151| 9.83k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 9.83k| { 153| 9.83k| inc(); 154| 9.83k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 187| 9.83k| { 188| 9.83k| root->inc(); 189| 9.83k| tail->inc(); 190| 9.83k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 711| 38.5k| { 712| 38.5k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.42k, False: 36.1k] ------------------ 713| 2.42k| return *this; 714| 36.1k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 1.85k, False: 34.2k] ------------------ 715| 1.85k| return {}; 716| 34.2k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 1.83k, False: 32.4k] ------------------ 717| 1.83k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 32.4k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 1.81k, False: 30.6k] ------------------ 719| 1.81k| auto tail_off = tail_offset(); 720| 1.81k| auto new_tail = 721| 1.81k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 1.81k| return {size - elems, BL, empty_root(), new_tail}; 723| 30.6k| } else { 724| 30.6k| using std::get; 725| 30.6k| auto v = slice_left_visitor(); 726| 30.6k| auto r = 727| 30.6k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 30.6k| auto new_root = get<1>(r); 729| 30.6k| auto new_shift = get<0>(r); 730| 30.6k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 30.6k| } 732| 38.5k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8max_sizeEv: 54| 2.33M| { 55| 2.33M| auto S = sizeof(size_t) * 8; 56| 2.33M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 2.33M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 2.33M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6concatERKSB_: 735| 638k| { 736| 638k| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 638k, False: 0] ------------------ 737| 638k| using std::get; 738| 638k| if (size == 0) ------------------ | Branch (738:13): [True: 1.63k, False: 637k] ------------------ 739| 1.63k| return r; 740| 637k| else if (r.size == 0) ------------------ | Branch (740:18): [True: 2.04k, False: 635k] ------------------ 741| 2.04k| return *this; 742| 635k| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 333k, False: 301k] ------------------ 743| | // just concat the tail, similar to push_back 744| 333k| auto tail_offst = tail_offset(); 745| 333k| auto tail_size = size - tail_offst; 746| 333k| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 66.1k, False: 267k] ------------------ 747| 66.1k| auto new_root = 748| 66.1k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 66.1k| tail->inc(); 750| 66.1k| return {size + r.size, 751| 66.1k| get<0>(new_root), 752| 66.1k| get<1>(new_root), 753| 66.1k| r.tail->inc()}; 754| 267k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 18.7k, False: 248k] ------------------ 755| 18.7k| auto new_tail = 756| 18.7k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 18.7k| return {size + r.size, shift, root->inc(), new_tail}; 758| 248k| } else { 759| 248k| auto remaining = branches - tail_size; 760| 248k| auto add_tail = 761| 248k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 248k| IMMER_TRY { ------------------ | | 49| 248k|#define IMMER_TRY try ------------------ 763| 248k| auto new_tail = 764| 248k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 248k| IMMER_TRY { ------------------ | | 49| 248k|#define IMMER_TRY try ------------------ 766| 248k| auto new_root = push_tail( 767| 248k| root, shift, tail_offst, add_tail, branches); 768| 248k| return {size + r.size, 769| 248k| get<0>(new_root), 770| 248k| get<1>(new_root), 771| 248k| new_tail}; 772| 248k| } 773| 248k| 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| 248k| } 778| 248k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 248k| } 783| 333k| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 2.88k, False: 298k] ------------------ 784| 2.88k| auto tail_offst = tail_offset(); 785| 2.88k| auto tail_size = size - tail_offst; 786| 2.88k| auto concated = 787| 2.88k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 2.88k| auto new_shift = concated.shift(); 789| 2.88k| auto new_root = concated.node(); 790| 2.88k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 2.88k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 2.88k, False: 0] ------------------ 791| 2.88k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 2.88k, False: 0] ------------------ 792| 2.88k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 298k| } else { 794| 298k| auto tail_offst = tail_offset(); 795| 298k| auto tail_size = size - tail_offst; 796| 298k| auto concated = concat_trees(root, 797| 298k| shift, 798| 298k| tail_offst, 799| 298k| tail, 800| 298k| tail_size, 801| 298k| r.root, 802| 298k| r.shift, 803| 298k| r.tail_offset()); 804| 298k| auto new_shift = concated.shift(); 805| 298k| auto new_root = concated.node(); 806| 298k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 298k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 298k, False: 0] ------------------ 807| 298k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 298k, False: 0] ------------------ 808| 298k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 298k| } 810| 638k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 39.8k| { 479| 39.8k| auto ts = tail_size(); 480| 39.8k| if (ts < branches) { ------------------ | Branch (480:13): [True: 29.9k, False: 9.92k] ------------------ 481| 29.9k| ensure_mutable_tail(e, ts); 482| 29.9k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 29.9k| } else { 484| 9.92k| using std::get; 485| 9.92k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 9.92k| auto tail_off = tail_offset(); 487| 9.92k| IMMER_TRY { ------------------ | | 49| 9.92k|#define IMMER_TRY try ------------------ 488| 9.92k| push_tail_mut(e, tail_off, tail, ts); 489| 9.92k| tail = new_tail; 490| 9.92k| } 491| 9.92k| 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.92k| } 496| 39.8k| ++size; 497| 39.8k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 335k| { 470| 335k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 8.81k, False: 326k] ------------------ 471| 8.81k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 8.81k| dec_leaf(tail, n); 473| 8.81k| tail = new_tail; 474| 8.81k| } 475| 335k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj3ELj3EEEj: 417| 345k| { 418| 345k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 160k, False: 185k] ------------------ 419| 160k| auto new_root = 420| 160k| make_relaxed_pos(root, shift, r) 421| 160k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 160k| if (new_root) { ------------------ | Branch (422:17): [True: 159k, False: 728] ------------------ 423| 159k| root = new_root; 424| 159k| } 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| 185k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 1.95k, False: 183k] ------------------ 444| 1.95k| auto new_root = node_t::make_inner_e(e); 445| 1.95k| IMMER_TRY { ------------------ | | 49| 1.95k|#define IMMER_TRY try ------------------ 446| 1.95k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 1.95k| new_root->inner()[0] = root; 448| 1.95k| new_root->inner()[1] = new_path; 449| 1.95k| root = new_root; 450| 1.95k| shift += B; 451| 1.95k| } 452| 1.95k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 183k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 181k, False: 2.08k] ------------------ 457| 181k| auto new_root = 458| 181k| make_regular_sub_pos(root, shift, tail_off) 459| 181k| .visit(push_tail_mut_visitor{}, e, tail); 460| 181k| root = new_root; 461| 181k| } else { 462| 2.08k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 2.08k| dec_empty_regular(root); 464| 2.08k| root = new_root; 465| 2.08k| } 466| 345k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10update_mutIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSG_E0_EEvNS9_5applyIS6_E4type4editEmOSG_: 573| 32.2k| { 574| 32.2k| auto& elem = get_mut(e, idx); 575| 32.2k| elem = std::forward(fn)(std::move(elem)); 576| 32.2k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 32.2k| { 540| 32.2k| auto tail_off = tail_offset(); 541| 32.2k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 7.87k, False: 24.3k] ------------------ 542| 7.87k| ensure_mutable_tail(e, size - tail_off); 543| 7.87k| return tail->leaf()[(idx - tail_off) & mask]; 544| 24.3k| } else { 545| 24.3k| return visit_maybe_relaxed_sub(root, 546| 24.3k| shift, 547| 24.3k| tail_off, 548| 24.3k| get_mut_visitor{}, 549| 24.3k| idx, 550| 24.3k| e, 551| 24.3k| &root); 552| 24.3k| } 553| 32.2k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 31.4k| { 607| 31.4k| auto tail_off = tail_offset(); 608| 31.4k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 719, False: 30.6k] ------------------ 609| 719| *this = {}; 610| 30.6k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 448, False: 30.2k] ------------------ 611| 448| return; 612| 30.2k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 587, False: 29.6k] ------------------ 613| 587| auto ts = size - tail_off; 614| 587| auto newts = new_size - tail_off; 615| 587| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 342, False: 245] ------------------ 616| 342| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 342| } else { 618| 245| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 245| dec_leaf(tail, ts); 620| 245| tail = new_tail; 621| 245| } 622| 587| size = new_size; 623| 587| return; 624| 29.6k| } else { 625| 29.6k| using std::get; 626| 29.6k| auto l = new_size - 1; 627| 29.6k| auto v = slice_right_mut_visitor(); 628| 29.6k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 29.6k| auto new_shift = get<0>(r); 630| 29.6k| auto new_root = get<1>(r); 631| 29.6k| auto new_tail = get<3>(r); 632| 29.6k| if (new_root) { ------------------ | Branch (632:17): [True: 23.3k, False: 6.31k] ------------------ 633| 23.3k| root = new_root; 634| 23.3k| shift = new_shift; 635| 23.3k| } else { 636| 6.31k| root = empty_root(); 637| 6.31k| shift = BL; 638| 6.31k| } 639| 29.6k| dec_leaf(tail, size - tail_off); 640| 29.6k| size = new_size; 641| 29.6k| tail = new_tail; 642| 29.6k| return; 643| 29.6k| } 644| 31.4k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 67.6k| { 676| 67.6k| using std::get; 677| 67.6k| auto tail_off = tail_offset(); 678| 67.6k| if (elems == 0) { ------------------ | Branch (678:13): [True: 7.15k, False: 60.4k] ------------------ 679| 7.15k| return; 680| 60.4k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 286, False: 60.1k] ------------------ 681| 286| *this = {}; 682| 60.1k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 204, False: 59.9k] ------------------ 683| 204| dec_inner(root, shift, tail_off); 684| 204| shift = BL; 685| 204| root = empty_root(); 686| 204| size -= elems; 687| 204| return; 688| 59.9k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 947, False: 59.0k] ------------------ 689| 947| auto v = slice_left_mut_visitor(); 690| 947| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 947| .visit(v, elems - tail_off, e)); 692| 947| if (tail_off) { ------------------ | Branch (692:17): [True: 222, False: 725] ------------------ 693| 222| dec_inner(root, shift, tail_off); 694| 222| shift = BL; 695| 222| root = empty_root(); 696| 222| } 697| 947| size -= elems; 698| 947| return; 699| 59.0k| } else { 700| 59.0k| auto v = slice_left_mut_visitor(); 701| 59.0k| auto r = 702| 59.0k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 59.0k| shift = get<0>(r); 704| 59.0k| root = get<1>(r); 705| 59.0k| size -= elems; 706| 59.0k| return; 707| 59.0k| } 708| 67.6k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editERKSB_: 816| 181k| { 817| 181k| assert(&l != &r); ------------------ | Branch (817:9): [True: 181k, False: 0] ------------------ 818| 181k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 181k, False: 0] ------------------ 819| 181k| using std::get; 820| 181k| if (l.size == 0) ------------------ | Branch (820:13): [True: 442, False: 181k] ------------------ 821| 442| l = r; 822| 181k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 493, False: 181k] ------------------ 823| 493| return; 824| 181k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 66.1k, False: 114k] ------------------ 825| | // just concat the tail, similar to push_back 826| 66.1k| auto tail_offst = l.tail_offset(); 827| 66.1k| auto tail_size = l.size - tail_offst; 828| 66.1k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 9.17k, False: 56.9k] ------------------ 829| 9.17k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 9.17k| l.tail = r.tail->inc(); 831| 9.17k| l.size += r.size; 832| 9.17k| return; 833| 56.9k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 969, False: 55.9k] ------------------ 834| 969| l.ensure_mutable_tail(el, tail_size); 835| 969| detail::uninitialized_copy(r.tail->leaf(), 836| 969| r.tail->leaf() + r.size, 837| 969| l.tail->leaf() + tail_size); 838| 969| l.size += r.size; 839| 969| return; 840| 55.9k| } else { 841| 55.9k| auto remaining = branches - tail_size; 842| 55.9k| l.ensure_mutable_tail(el, tail_size); 843| 55.9k| detail::uninitialized_copy(r.tail->leaf(), 844| 55.9k| r.tail->leaf() + remaining, 845| 55.9k| l.tail->leaf() + tail_size); 846| 55.9k| IMMER_TRY { ------------------ | | 49| 55.9k|#define IMMER_TRY try ------------------ 847| 55.9k| auto new_tail = 848| 55.9k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 55.9k| IMMER_TRY { ------------------ | | 49| 55.9k|#define IMMER_TRY try ------------------ 850| 55.9k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 55.9k| l.tail = new_tail; 852| 55.9k| l.size += r.size; 853| 55.9k| return; 854| 55.9k| } 855| 55.9k| IMMER_CATCH (...) { 856| 0| node_t::delete_leaf(new_tail, r.size - remaining); 857| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 858| 0| } 859| 55.9k| } 860| 55.9k| IMMER_CATCH (...) { 861| 0| detail::destroy_n(r.tail->leaf() + tail_size, remaining); 862| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 863| 0| } 864| 55.9k| } 865| 114k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 440, False: 114k] ------------------ 866| 440| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 440] ------------------ 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| 440| } else { 886| 440| auto tail_offst = l.tail_offset(); 887| 440| auto tail_size = l.size - tail_offst; 888| 440| auto concated = concat_trees( 889| 440| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 440| l = {l.size + r.size, 891| 440| concated.shift(), 892| 440| concated.node(), 893| 440| r.tail->inc()}; 894| 440| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 440, False: 0] ------------------ 895| 440| return; 896| 440| } 897| 114k| } else { 898| 114k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 114k] ------------------ 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| 114k| } else { 923| 114k| auto tail_offst = l.tail_offset(); 924| 114k| auto tail_size = l.size - tail_offst; 925| 114k| auto concated = concat_trees(l.root, 926| 114k| l.shift, 927| 114k| tail_offst, 928| 114k| l.tail, 929| 114k| tail_size, 930| 114k| r.root, 931| 114k| r.shift, 932| 114k| r.tail_offset()); 933| 114k| l = {l.size + r.size, 934| 114k| concated.shift(), 935| 114k| concated.node(), 936| 114k| r.tail->inc()}; 937| 114k| } 938| 114k| } 939| 181k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEaSERKSB_: 163| 2.57k| { 164| 2.57k| auto next{other}; 165| 2.57k| swap(*this, next); 166| 2.57k| return *this; 167| 2.57k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERSB_NS9_5applyIS6_E4type4editE: 942| 3.65k| { 943| 3.65k| assert(&l != &r); ------------------ | Branch (943:9): [True: 3.65k, False: 0] ------------------ 944| 3.65k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 3.65k, False: 0] ------------------ 945| 3.65k| using std::get; 946| 3.65k| if (r.size == 0) ------------------ | Branch (946:13): [True: 232, False: 3.42k] ------------------ 947| 232| r = std::move(l); 948| 3.42k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 195, False: 3.22k] ------------------ 949| 195| return; 950| 3.22k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 1.22k, False: 2.00k] ------------------ 951| | // just concat the tail, similar to push_back 952| 1.22k| auto tail_offst = l.tail_offset(); 953| 1.22k| auto tail_size = l.size - tail_offst; 954| 1.22k| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 439, False: 789] ------------------ 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| 439| auto res = 959| 439| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 439| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 439| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 439| return; 965| 789| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 304, False: 485] ------------------ 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| 304| auto new_tail = 974| 304| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 304| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 304| return; 977| 485| } else { 978| | // like the immutable version 979| 485| auto remaining = branches - tail_size; 980| 485| auto add_tail = node_t::copy_leaf_e( 981| 485| er, l.tail, tail_size, r.tail, remaining); 982| 485| IMMER_TRY { ------------------ | | 49| 485|#define IMMER_TRY try ------------------ 983| 485| auto new_tail = 984| 485| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 485| IMMER_TRY { ------------------ | | 49| 485|#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| 485| auto new_root = l.push_tail(l.root, 990| 485| l.shift, 991| 485| tail_offst, 992| 485| add_tail, 993| 485| branches); 994| 485| r = {l.size + r.size, 995| 485| get<0>(new_root), 996| 485| get<1>(new_root), 997| 485| new_tail}; 998| 485| return; 999| 485| } 1000| 485| 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| 485| } 1005| 485| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 485| } 1010| 2.00k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 607, False: 1.39k] ------------------ 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.39k| } else { 1041| 1.39k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.39k] ------------------ 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.39k| } else { 1064| 1.39k| auto tail_offst = l.tail_offset(); 1065| 1.39k| auto tail_size = l.size - tail_offst; 1066| 1.39k| auto concated = concat_trees(l.root, 1067| 1.39k| l.shift, 1068| 1.39k| tail_offst, 1069| 1.39k| l.tail, 1070| 1.39k| tail_size, 1071| 1.39k| r.root, 1072| 1.39k| r.shift, 1073| 1.39k| r.tail_offset()); 1074| 1.39k| r = {l.size + r.size, 1075| 1.39k| concated.shift(), 1076| 1.39k| concated.node(), 1077| 1.39k| r.tail->inc()}; 1078| 1.39k| return; 1079| 1.39k| } 1080| 1.39k| } 1081| 3.65k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 867k| { 1085| 867k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 867k, False: 0] ------------------ 1086| 867k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 867k, False: 0] ------------------ 1087| 867k| using std::get; 1088| 867k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 1.90k, False: 865k] ------------------ 1089| 1.90k| l = r; 1090| 865k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 2.15k, False: 863k] ------------------ 1091| 2.15k| return; 1092| 863k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 274k, False: 588k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 274k| auto tail_offst = l.tail_offset(); 1095| 274k| auto tail_size = l.size - tail_offst; 1096| 274k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 34.4k, False: 240k] ------------------ 1097| 34.4k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 34.4k| l.tail = r.tail->inc(); 1099| 34.4k| l.size += r.size; 1100| 34.4k| return; 1101| 240k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 3.89k, False: 236k] ------------------ 1102| 3.89k| l.ensure_mutable_tail(el, tail_size); 1103| 3.89k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 2.36k, False: 1.53k] ------------------ 1104| 2.36k| detail::uninitialized_move(r.tail->leaf(), 1105| 2.36k| r.tail->leaf() + r.size, 1106| 2.36k| l.tail->leaf() + tail_size); 1107| 1.53k| else 1108| 1.53k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.53k| r.tail->leaf() + r.size, 1110| 1.53k| l.tail->leaf() + tail_size); 1111| 3.89k| l.size += r.size; 1112| 3.89k| return; 1113| 236k| } else { 1114| 236k| auto remaining = branches - tail_size; 1115| 236k| l.ensure_mutable_tail(el, tail_size); 1116| 236k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 106k, False: 130k] ------------------ 1117| 106k| detail::uninitialized_move(r.tail->leaf(), 1118| 106k| r.tail->leaf() + remaining, 1119| 106k| l.tail->leaf() + tail_size); 1120| 130k| else 1121| 130k| detail::uninitialized_copy(r.tail->leaf(), 1122| 130k| r.tail->leaf() + remaining, 1123| 130k| l.tail->leaf() + tail_size); 1124| 236k| IMMER_TRY { ------------------ | | 49| 236k|#define IMMER_TRY try ------------------ 1125| 236k| auto new_tail = 1126| 236k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 236k| IMMER_TRY { ------------------ | | 49| 236k|#define IMMER_TRY try ------------------ 1128| 236k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 236k| l.tail = new_tail; 1130| 236k| l.size += r.size; 1131| 236k| return; 1132| 236k| } 1133| 236k| 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| 236k| } 1138| 236k| 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| 236k| } 1143| 588k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.32k, False: 585k] ------------------ 1144| 3.32k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.32k] ------------------ 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.32k| } else { 1165| 3.32k| auto tail_offst = l.tail_offset(); 1166| 3.32k| auto tail_size = l.size - tail_offst; 1167| 3.32k| auto concated = concat_trees( 1168| 3.32k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.32k| l = {l.size + r.size, 1170| 3.32k| concated.shift(), 1171| 3.32k| concated.node(), 1172| 3.32k| r.tail->inc()}; 1173| 3.32k| return; 1174| 3.32k| } 1175| 585k| } else { 1176| 585k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 585k] ------------------ 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| 585k| } else { 1200| 585k| auto tail_offst = l.tail_offset(); 1201| 585k| auto tail_size = l.size - tail_offst; 1202| 585k| auto concated = concat_trees(l.root, 1203| 585k| l.shift, 1204| 585k| tail_offst, 1205| 585k| l.tail, 1206| 585k| tail_size, 1207| 585k| r.root, 1208| 585k| r.shift, 1209| 585k| r.tail_offset()); 1210| 585k| l = {l.size + r.size, 1211| 585k| concated.shift(), 1212| 585k| concated.node(), 1213| 585k| r.tail->inc()}; 1214| 585k| return; 1215| 585k| } 1216| 585k| } 1217| 867k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6equalsERKSB_: 315| 75.5k| { 316| 75.5k| using iter_t = rrbtree_iterator; 317| 75.5k| if (size != other.size) ------------------ | Branch (317:13): [True: 53.2k, False: 22.3k] ------------------ 318| 53.2k| return false; 319| 22.3k| if (size == 0) ------------------ | Branch (319:13): [True: 198, False: 22.1k] ------------------ 320| 198| return true; 321| 22.1k| auto tail_off = tail_offset(); 322| 22.1k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 22.1k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 21.2k, False: 916] | Branch (324:29): [True: 21.0k, 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.0k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 20.3k, False: 677] ------------------ 329| 20.3k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 10.6k, False: 9.73k] ------------------ 330| 20.3k| other.shift, 331| 20.3k| tail_off_other, 332| 20.3k| equals_visitor::rrb{}, 333| 20.3k| iter_t{other}, 334| 20.3k| root, 335| 20.3k| shift, 336| 20.3k| tail_off)) 337| 10.6k| return false; 338| 20.3k| } else { 339| 677| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 245, False: 432] ------------------ 340| 677| shift, 341| 677| tail_off, 342| 677| equals_visitor::rrb{}, 343| 677| iter_t{*this}, 344| 677| other.root, 345| 677| other.shift, 346| 677| tail_off_other)) 347| 245| return false; 348| 677| } 349| 21.0k| } 350| 11.2k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 6.52k, False: 4.74k] ------------------ 351| 11.2k| ? make_leaf_sub_pos(tail, tail_size()) 352| 6.52k| .visit(equals_visitor{}, other.tail) 353| 11.2k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 2.12k, False: 2.62k] ------------------ 354| 4.74k| ? std::equal(tail->leaf(), 355| 2.12k| tail->leaf() + (size - tail_off), 356| 2.12k| other.tail->leaf() + 357| 2.12k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 4.74k| : std::equal(tail->leaf(), 360| 2.62k| tail->leaf() + (size - tail_off), 361| 2.62k| iter_t{other} + tail_off); 362| 22.1k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10region_forEm: 524| 1.27M| { 525| 1.27M| using std::get; 526| 1.27M| auto tail_off = tail_offset(); 527| 1.27M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 4.45k, False: 1.27M] ------------------ 528| 4.45k| 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.27M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11dereferenceEv: 90| 9.63M| { 91| 9.63M| using std::get; 92| 9.63M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 85.1k, False: 9.54M] | Branch (92:35): [True: 1.19M, False: 8.35M] ------------------ 93| 1.27M| curr_ = v_->region_for(i_); 94| 9.63M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 9.63M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7advanceEl: 74| 180k| { 75| 180k| using std::get; 76| 180k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 296, False: 180k] | Branch (76:9): [True: 180k, False: 0] | Branch (76:9): [True: 180k, False: 0] ------------------ 77| 180k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 180k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 180k, False: 0] ------------------ 78| 180k| i_ += n; 79| 180k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9incrementEv: 60| 8.42M| { 61| 8.42M| using std::get; 62| 8.42M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 8.42M, False: 0] ------------------ 63| 8.42M| ++i_; 64| 8.42M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKNS1_7rrbtreeIiSA_Lj3ELj3EEE: 39| 23.6k| : v_{&v} 40| 23.6k| , i_{0} 41| 23.6k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 23.6k| { 43| 23.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 26.1k| { 32| 26.1k| return Deriv::visit_inner(std::forward(args)...); 33| 26.1k| } _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| 101k| { 32| 101k| return Deriv::visit_inner(std::forward(args)...); 33| 101k| } _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.70k| { 38| 1.70k| return Deriv::visit_inner(std::forward(args)...); 39| 1.70k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EEEE13visit_regularIJRNS1_8full_posISD_EEmEEEDcDpOT_: 37| 7.42k| { 38| 7.42k| return Deriv::visit_inner(std::forward(args)...); 39| 7.42k| } _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.15k| { 38| 8.15k| return Deriv::visit_inner(std::forward(args)...); 39| 8.15k| } _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| 745| { 38| 745| return Deriv::visit_inner(std::forward(args)...); 39| 745| } _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.58k| { 38| 1.58k| return Deriv::visit_inner(std::forward(args)...); 39| 1.58k| } _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.26k| { 38| 7.26k| return Deriv::visit_inner(std::forward(args)...); 39| 7.26k| } _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.26k| { 44| 7.26k| return Deriv::visit_node(std::forward(args)...); 45| 7.26k| } _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.11k| { 32| 5.11k| return Deriv::visit_inner(std::forward(args)...); 33| 5.11k| } _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.11k| { 44| 5.11k| return Deriv::visit_node(std::forward(args)...); 45| 5.11k| } _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.33M| { 50| 7.33M| return Deriv::visit_node(std::forward(args)...); 51| 7.33M| } _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| 102M| { 32| 102M| return Deriv::visit_inner(std::forward(args)...); 33| 102M| } _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| 102M| { 44| 102M| return Deriv::visit_node(std::forward(args)...); 45| 102M| } _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| 102M| { 32| 102M| return Deriv::visit_inner(std::forward(args)...); 33| 102M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 31| 16.6k| { 32| 16.6k| return Deriv::visit_inner(std::forward(args)...); 33| 16.6k| } _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| 281| { 38| 281| return Deriv::visit_inner(std::forward(args)...); 39| 281| } _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| 931| { 38| 931| return Deriv::visit_inner(std::forward(args)...); 39| 931| } _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| 4.73M| { 50| 4.73M| return Deriv::visit_node(std::forward(args)...); 51| 4.73M| } _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| 537k| { 38| 537k| return Deriv::visit_inner(std::forward(args)...); 39| 537k| } _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| 537k| { 44| 537k| return Deriv::visit_node(std::forward(args)...); 45| 537k| } _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| 537k| { 38| 537k| return Deriv::visit_inner(std::forward(args)...); 39| 537k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 37| 3.55M| { 38| 3.55M| return Deriv::visit_inner(std::forward(args)...); 39| 3.55M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 43| 3.55M| { 44| 3.55M| return Deriv::visit_node(std::forward(args)...); 45| 3.55M| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 37| 3.55M| { 38| 3.55M| return Deriv::visit_inner(std::forward(args)...); 39| 3.55M| } _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.15k| { 38| 2.15k| return Deriv::visit_inner(std::forward(args)...); 39| 2.15k| } _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.15k| { 44| 2.15k| return Deriv::visit_node(std::forward(args)...); 45| 2.15k| } _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| 982k| { 32| 982k| return Deriv::visit_inner(std::forward(args)...); 33| 982k| } _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| 982k| { 44| 982k| return Deriv::visit_node(std::forward(args)...); 45| 982k| } _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| 975k| { 32| 975k| return Deriv::visit_inner(std::forward(args)...); 33| 975k| } _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| 975k| { 44| 975k| return Deriv::visit_node(std::forward(args)...); 45| 975k| } _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| 2.96M| { 32| 2.96M| return Deriv::visit_inner(std::forward(args)...); 33| 2.96M| } _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.10k| { 38| 4.10k| return Deriv::visit_inner(std::forward(args)...); 39| 4.10k| } _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.14M| { 32| 1.14M| return Deriv::visit_inner(std::forward(args)...); 33| 1.14M| } _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| 302k| { 38| 302k| return Deriv::visit_inner(std::forward(args)...); 39| 302k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 37| 1.28k| { 38| 1.28k| return Deriv::visit_inner(std::forward(args)...); 39| 1.28k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 18.3k| { 38| 18.3k| return Deriv::visit_inner(std::forward(args)...); 39| 18.3k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_: 37| 7.12k| { 38| 7.12k| return Deriv::visit_inner(std::forward(args)...); 39| 7.12k| } _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| 10.7k| { 38| 10.7k| return Deriv::visit_inner(std::forward(args)...); 39| 10.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.43M| { 38| 1.43M| return Deriv::visit_inner(std::forward(args)...); 39| 1.43M| } _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| 6.73M| { 32| 6.73M| return Deriv::visit_inner(std::forward(args)...); 33| 6.73M| } _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| 1.29k| { 38| 1.29k| return Deriv::visit_inner(std::forward(args)...); 39| 1.29k| } _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| 11.4k| { 32| 11.4k| return Deriv::visit_inner(std::forward(args)...); 33| 11.4k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 3.75k| { 38| 3.75k| return Deriv::visit_inner(std::forward(args)...); 39| 3.75k| } _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| 1.73k| { 32| 1.73k| return Deriv::visit_inner(std::forward(args)...); 33| 1.73k| } _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| 1.18k| { 32| 1.18k| return Deriv::visit_inner(std::forward(args)...); 33| 1.18k| } _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| 6.70M| { 32| 6.70M| return Deriv::visit_inner(std::forward(args)...); 33| 6.70M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 7.03k| { 38| 7.03k| return Deriv::visit_inner(std::forward(args)...); 39| 7.03k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 7.03k| { 44| 7.03k| return Deriv::visit_node(std::forward(args)...); 45| 7.03k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 16.8k| { 38| 16.8k| return Deriv::visit_inner(std::forward(args)...); 39| 16.8k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 16.8k| { 44| 16.8k| return Deriv::visit_node(std::forward(args)...); 45| 16.8k| } _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.59k| { 32| 6.59k| return Deriv::visit_inner(std::forward(args)...); 33| 6.59k| } _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.59k| { 44| 6.59k| return Deriv::visit_node(std::forward(args)...); 45| 6.59k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 10.2k| { 38| 10.2k| return Deriv::visit_inner(std::forward(args)...); 39| 10.2k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 10.2k| { 44| 10.2k| return Deriv::visit_node(std::forward(args)...); 45| 10.2k| } _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.3k| { 32| 12.3k| return Deriv::visit_inner(std::forward(args)...); 33| 12.3k| } _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.3k| { 44| 12.3k| return Deriv::visit_node(std::forward(args)...); 45| 12.3k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 23.6k| { 32| 23.6k| return Deriv::visit_inner(std::forward(args)...); 33| 23.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_15regular_sub_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 1.96k| { 32| 1.96k| return Deriv::visit_inner(std::forward(args)...); 33| 1.96k| } _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| 580| { 32| 580| return Deriv::visit_inner(std::forward(args)...); 33| 580| } _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| 925| { 38| 925| return Deriv::visit_inner(std::forward(args)...); 39| 925| } _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.51M| { 32| 4.51M| return Deriv::visit_inner(std::forward(args)...); 33| 4.51M| } _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| 290k| { 38| 290k| return Deriv::visit_inner(std::forward(args)...); 39| 290k| } _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| 288k| { 38| 288k| return Deriv::visit_inner(std::forward(args)...); 39| 288k| } _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| 30.7k| { 38| 30.7k| return Deriv::visit_inner(std::forward(args)...); 39| 30.7k| } _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| 20.9k| { 38| 20.9k| return Deriv::visit_inner(std::forward(args)...); 39| 20.9k| } _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| 910| { 38| 910| return Deriv::visit_inner(std::forward(args)...); 39| 910| } _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| 17.8k| { 38| 17.8k| return Deriv::visit_inner(std::forward(args)...); 39| 17.8k| } _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.89k| { 38| 3.89k| return Deriv::visit_inner(std::forward(args)...); 39| 3.89k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 4.98k| { 38| 4.98k| return Deriv::visit_inner(std::forward(args)...); 39| 4.98k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 4.55k| { 38| 4.55k| return Deriv::visit_inner(std::forward(args)...); 39| 4.55k| } _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| 141k| { 32| 141k| return Deriv::visit_inner(std::forward(args)...); 33| 141k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERPSH_RjRmEEEDcDpOT_: 31| 1.13k| { 32| 1.13k| return Deriv::visit_inner(std::forward(args)...); 33| 1.13k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERPSH_RjRmEEEDcDpOT_: 43| 1.13k| { 44| 1.13k| return Deriv::visit_node(std::forward(args)...); 45| 1.13k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 37| 8.67k| { 38| 8.67k| return Deriv::visit_inner(std::forward(args)...); 39| 8.67k| } _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.67k| { 44| 8.67k| return Deriv::visit_node(std::forward(args)...); 45| 8.67k| } _ZN5immer6detail15auto_const_castINS_22unsafe_refcount_policyEEERT_RKS3_: 143| 431M|{ 144| 431M| return const_cast(x); 145| 431M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 269M| { 114| 269M| check_base(); 115| 269M| auto* base = static_cast(this); 116| 269M| return reinterpret_cast(base + 1); 117| 269M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 269M| { 135| 269M| static_assert(std::is_standard_layout::value && 136| 269M| !std::is_empty::value, 137| 269M| "Please add 'true' if the derived class is emtpy"); 138| 269M| } _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| 31.1M|{ 335| 31.1M|} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 1.60M|{ 189| 1.60M| return first + n; 190| 1.60M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6leaf_tEiLb1EE15get_storage_ptrEv: 75| 11.3M| { 76| 11.3M| check_base(); 77| 11.3M| return reinterpret_cast(this); 78| 11.3M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6leaf_tEiLb1EE10check_baseEv: 94| 11.3M| { 95| | // is_standard_layout requires that only one class in the hierarchy 96| | // contains non-static data members. Since this class contains one 97| | // member, the static_assert will only hold when the derived class is 98| | // empty. 99| 11.3M| static_assert(std::is_standard_layout::value, 100| 11.3M| "Please remove 'true' if the derived class is non emtpy"); 101| 11.3M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 2.10M|{ 237| 2.10M| return std::copy(first, last, out); 238| 2.10M|} _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| 234k|{ 340| 234k| return std::forward(f1)(empty_t{}); 341| 234k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 48.9M|{ 324| 48.9M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 2.33M, False: 46.6M] ------------------ 325| 48.9M|} _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| 176k|{ 340| 176k| return std::forward(f1)(empty_t{}); 341| 176k|} _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| 165k|{ 335| 165k|} _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| 36.6k|{ 340| 36.6k| return std::forward(f1)(empty_t{}); 341| 36.6k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 342|{ 189| 342| return first + n; 190| 342|} _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| 207k|{ 340| 207k| return std::forward(f1)(empty_t{}); 341| 207k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 108k|{ 211| 108k| return std::copy(first, last, out); 212| 108k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.20M|{ 30| 1.20M| return x; 31| 1.20M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 15.6k|{ 261| 15.6k| auto ptr = Heap::allocate(sizeof(T)); 262| 15.6k| IMMER_TRY { ------------------ | | 49| 15.6k|#define IMMER_TRY try ------------------ 263| 15.6k| return new (ptr) T(std::forward(args)...); 264| 15.6k| } 265| 15.6k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 15.6k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 96| 84.1k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 246| 347k| { 247| 347k| return impl_.push_back(std::move(value)); 248| 347k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj3ELj3EEE: 536| 1.21M| : impl_(std::move(impl)) 537| 1.21M| { 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.21M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4sizeEv: 181| 3.87M| 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| 171k| { 324| 171k| return impl_.update(index, std::forward(fn)); 325| 171k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 350| 23.5k| { 351| 23.5k| return impl_.take(elems); 352| 23.5k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 376| 38.5k| { 377| 38.5k| return impl_.drop(elems); 378| 38.5k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8max_sizeEv: 90| 1.69M| 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| 638k| { 404| 638k| return l.impl_.concat(r.impl_); 405| 638k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 251| 39.8k| { 252| 39.8k| return push_back_move(move_t{}, std::move(value)); 253| 39.8k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 39.8k| { 548| 39.8k| impl_.push_back_mut({}, std::move(value)); 549| 39.8k| return std::move(*this); 550| 39.8k| } flex-vector-bo.cpp:_ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEDcmOSE_: 329| 32.2k| { 330| 32.2k| return update_move(move_t{}, index, std::forward(fn)); 331| 32.2k| } flex-vector-bo.cpp:_ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11update_moveIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEOS9_NSt3__117integral_constantIbLb1EEEmOSE_: 568| 32.2k| { 569| 32.2k| impl_.update_mut({}, index, std::forward(fn)); 570| 32.2k| return std::move(*this); 571| 32.2k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 355| 31.4k| { 356| 31.4k| return take_move(move_t{}, elems); 357| 31.4k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 31.4k| { 580| 31.4k| impl_.take_mut({}, elems); 581| 31.4k| return std::move(*this); 582| 31.4k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 381| 67.6k| { 382| 67.6k| return drop_move(move_t{}, elems); 383| 67.6k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 67.6k| { 590| 67.6k| impl_.drop_mut({}, elems); 591| 67.6k| return std::move(*this); 592| 67.6k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERKS9_: 409| 181k| { 410| 181k| return concat_move(move_t{}, std::move(l), r); 411| 181k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 181k| { 601| 181k| concat_mut_l(l.impl_, {}, r.impl_); 602| 181k| return std::move(l); 603| 181k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEOS9_: 415| 3.65k| { 416| 3.65k| return concat_move(move_t{}, l, std::move(r)); 417| 3.65k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 3.65k| { 607| 3.65k| concat_mut_r(l.impl_, r.impl_, {}); 608| 3.65k| return std::move(r); 609| 3.65k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESA_: 421| 867k| { 422| 867k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 867k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 867k| { 613| 867k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 867k| return std::move(l); 615| 867k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEeqERKS9_: 222| 75.5k| { 223| 75.5k| return impl_.equals(other.impl_); 224| 75.5k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5eraseEm: 480| 5.93k| { 481| 5.93k| return take(pos) + drop(pos + 1); 482| 5.93k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6insertEmi: 442| 15.6k| { 443| 15.6k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 15.6k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 34.1M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 34.1M| { 28| 34.1M| return ::operator new(size); 29| 34.1M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 15.6k| { 50| 15.6k| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 15.6k| new (p) std::size_t{size}; 52| 15.6k| return ((char*) p) + extra_size; 53| 15.6k| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 15.6k| { 58| 15.6k| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 15.6k| assert(*p == size); ------------------ | Branch (59:9): [True: 15.6k, False: 0] ------------------ 60| 15.6k| Base::deallocate(size + extra_size, p, tags...); 61| 15.6k| } _ZN5immer15refcount_policyC2Ev: 28| 15.6k| : refcount{1} {}; _ZN5immer15refcount_policy3decEv: 36| 15.6k| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer22unsafe_refcount_policyC2Ev: 27| 34.1M| : refcount{1} {}; _ZN5immer22unsafe_refcount_policy3incEv: 33| 197M| void inc() { ++refcount; } _ZN5immer22unsafe_refcount_policy3decEv: 34| 231M| bool dec() { return --refcount == 0; } _ZN5immer22unsafe_refcount_policy6uniqueEv: 35| 2.62M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee5ownedEv: 36| 34.1M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee10can_mutateENS6_4editE: 35| 287k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeaSENS6_4editE: 34| 655k| ownee& operator=(edit) { return *this; };